Putnam 2023 B1
- Session B
Consider an -by- grid of unit squares, indexed by with and . There are coins, which are initially placed in the squares with and . If a coin occupies the square with and and the squares , and are unoccupied, then a legal move is to slide the coin from to . 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.