# please solve the problem

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.

Note by Sayan Chaudhuri
5 years, 7 months ago

MarkdownAppears as
*italics* or _italics_ italics
**bold** or __bold__ bold
- bulleted- list
• bulleted
• list
1. numbered2. list
1. numbered
2. list
Note: you must add a full line of space before and after lists for them to show up correctly
paragraph 1paragraph 2

paragraph 1

paragraph 2

[example link](https://brilliant.org)example link
> This is a quote
This is a quote
    # I indented these lines
# 4 spaces, and now they show
# up as a code block.

print "hello world"
# I indented these lines
# 4 spaces, and now they show
# up as a code block.

print "hello world"
MathAppears as
Remember to wrap math in $$...$$ or $...$ to ensure proper formatting.
2 \times 3 $$2 \times 3$$
2^{34} $$2^{34}$$
a_{i-1} $$a_{i-1}$$
\frac{2}{3} $$\frac{2}{3}$$
\sqrt{2} $$\sqrt{2}$$
\sum_{i=1}^3 $$\sum_{i=1}^3$$
\sin \theta $$\sin \theta$$
\boxed{123} $$\boxed{123}$$

## Comments

Sort by:

Top Newest

Turn each number into $$8 \cdot x + y$$ where $$0 \leq 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 \cdot \displaystyle \sum_{i=0}^7 i + \displaystyle \sum_{i=1}^8 i = 8 \cdot 28 + 36 = 260$$.

cmiiw.

- 5 years, 7 months ago

Log in to reply

i think u r right,hats off

- 5 years, 7 months ago

Log in to reply

Nice invariant problem. I think of some variants for this problem. a) instead of $$8\times 8$$, find a formula for an $$n\times n$$ table. b) instead of $$1$$ to $$n^2$$, try to find a formula for $$n^2$$ consecutive integers. c)instead of consecutive integers, try to find a formula for an arithmetic progression with $$n^2$$ terms. :)

- 5 years, 7 months ago

Log in to reply

the problem turns out 2 B more spiral,for me that would be very difficult 2 solve

- 5 years, 7 months ago

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.

- 5 years, 7 months ago

Log in to reply

The only way of choosing the 8 numbers is by taking the diagonals. The sum of numbers on the diagonals is 260.

- 5 years, 7 months ago

Log in to reply

no, thats wrong

- 5 years, 7 months ago

Log in to reply

Ah yes, found some more ways, sorry!

- 5 years, 7 months ago

Log in to reply

×

Problem Loading...

Note Loading...

Set Loading...