A Problem taken from Terence Tao's Book: Solving Mathematical Problems
Suppose four checkerboard pieces are arranged in a square of sidelength one. Now suppose that you are allowed to make an unlimited amount of moves, where in each move one takes one of the checkerboard pieces and jumps over it, so that the new location of that piece is the same distance from the piece jumped over as the original location (but in the opposite direction, of course). There is no limit as to how far two checkerboard pieces can be in order for one to jump over the other. Is it possible to move these pieces so that they are now arranged in a square of sidelength two?
Hint: There is a particularly elegant solution to this problem, if you just think about it the right way.
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
There are no comments in this discussion.