Consider the squares of an 8 *8 chessboard filled with the numbers 1 to 64 as in the fi gure below. If we choose 8 squares with the property that there is exactly one from each row and exactly one from each column, and add up the numbers in the chosen squares, show that the sum obtained is always 260.
Easy Math Editor
This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.
When posting on Brilliant:
*italics*
or_italics_
**bold**
or__bold__
paragraph 1
paragraph 2
[example link](https://brilliant.org)
> This is a quote
\(
...\)
or\[
...\]
to ensure proper formatting.2 \times 3
2^{34}
a_{i-1}
\frac{2}{3}
\sqrt{2}
\sum_{i=1}^3
\sin \theta
\boxed{123}
Comments
Turn each number into 8⋅x+y where 0≤y<8. x turns out to be the row number, starting from 0, and y is the column number, starting from 1. Since each row and column is picked exactly once, then ANY configuration's sum would be 8⋅i=0∑7i+i=1∑8i=8⋅28+36=260.
cmiiw.
Log in to reply
i think u r right,hats off
Nice invariant problem. I think of some variants for this problem. a) instead of 8×8, find a formula for an n×n table. b) instead of 1 to n2, try to find a formula for n2 consecutive integers. c)instead of consecutive integers, try to find a formula for an arithmetic progression with n2 terms. :)
Log in to reply
the problem turns out 2 B more spiral,for me that would be very difficult 2 solve
Log in to reply
its not spiral, its leftmost cell to rightmost cell of each row then going to next row from top to bottom. actually b is the most similar to the original problem.
The only way of choosing the 8 numbers is by taking the diagonals. The sum of numbers on the diagonals is 260.
Log in to reply
no, thats wrong
Log in to reply
Ah yes, found some more ways, sorry!