olymmath

Putnam 2023 B1

  • Session B

Consider an mm-by-nn grid of unit squares, indexed by (i,j)(i,j) with 1≤i≤m1 \leq i \leq m and 1≤j≤n1 \leq j \leq n. There are (m−1)(n−1)(m-1)(n-1) coins, which are initially placed in the squares (i,j)(i,j) with 1≤i≤m−11 \leq i \leq m-1 and 1≤j≤n−11 \leq j \leq n-1. If a coin occupies the square (i,j)(i,j) with i≤m−1i \leq m-1 and j≤n−1j \leq n-1 and the squares (i+1,j),(i,j+1)(i+1,j), (i,j+1), and (i+1,j+1)(i+1,j+1) are unoccupied, then a legal move is to slide the coin from (i,j)(i,j) to (i+1,j+1)(i+1,j+1). How many distinct configurations of coins can be reached starting from the initial configuration by a (possibly empty) sequence of legal moves?

Curated text Kedlaya Putnam archive. Quoted with source.

Solutions

Human solution Solution 1 by Manjul Bhargava, Kiran Kedlaya and Lenny Ng

The terms of the source let olymmath link to this solution but not copy it. Read the solution (Kedlaya Putnam archive).

Similar problems

These problems have the most words in common with this statement.

Locator putnam/2023/b1 · Tag 7RATTYVJFJ · Edit this page on GitHub · Keys: j next, k previous