olymmath

Putnam 2024 B1

  • Session B

Let nn and kk be positive integers. The square in the iith row and jjth column of an nn-by-nn grid contains the number i+j−ki+j-k. For which nn and kk is it possible to select nn squares from the grid, no two in the same row or column, such that the numbers contained in the selected squares are exactly 1,2,…,n1,2,\dots,n?

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/2024/b1 · Tag JR9GSV8201 · Edit this page on GitHub · Keys: j next, k previous