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. [Please see the [same post](https://brilliant.org/discussions/thread/please-solve-the-problem/#comments) where the discussion is happening and a table has been uploaded to illustrate the problem-Peter]
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