Don't jump any step
Given a set of points in space, a jump consists of taking two points in the set, P and Q, removing P
from the set, and replacing it with the reflection of P over Q. Find the smallest number n such that for
any set of n lattice points in 10-dimensional-space, it is possible to perform a finite number of jumps
so that some two points coincide.
The answer is 1025.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
0 solutions
No explanations have been posted yet. Check back later!