olymmath

Putnam 2001 B1

  • Session B

Let nn be an even positive integer. Write the numbers 1,2,…,n21,2,\ldots,n^2 in the squares of an n×nn\times n grid so that the kk-th row, from left to right, is (k−1)n+1,(k−1)n+2,…,(k−1)n+n.(k-1)n+1,(k-1)n+2,\ldots, (k-1)n+n. Color the squares of the grid so that half of the squares in each row and in each column are red and the other half are black (a checkerboard coloring is one possibility). Prove that for each coloring, the sum of the numbers on the red squares is equal to the sum of the numbers on the black squares.

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