This week's book giveaway is in the OCAJP 8 forum. We're giving away four copies of OCA Java SE 8 Programmer I Study Guide and have Edward Finegan & Robert Liguori on-line! See this thread for details.
I am trying to solve this problem but not able to.(Taken from Mathematical Circles(Russian experience)).
On 8x8 chess board, numbers from 1 to 64 are written . Each number is written exactly once.
Prove that you can always find one pair of adjacent squares(which share common edge) such that difference in their numbers is at least 5.
Consider two squares (not necessarily adjacent) - one at (x1, y1), and the other at (x2, y2). The first point has number N1 and the second has number N2. The shortest path between them has length abs(x2-x1) + abs(y2-y1), if we only use horizontal moves or vertical moves. If we consider how N changes as we move from square to square, we know that average rate of change on a particular path must be avg = (N2 - N1)/(abs(x2-x1) + abs(y2-y1)).
Now, somewhere on the 64 squares there's a 1 and a 64. Let those be N1 and N2. What's the smallest possible value of avg? The numerator is clearly 63. The largest possible value for the denominator is if N1 and N2 are on opposite corners, which are 7 squares apart vertically, and 7 horizontally. So the smallest possible value of avg is 63/14 = 4.57. Since all individual changes in N must be integers, we know that at least one change must be 5 or greater. And at least one must be 4 or less.
Mike Simmons wrote:[minimum average difference between 1 and 64 must be > 4.]
I had worked out a proof that starts with some number in the middle of the board and proves that the in placing the next so many numbers, you are forced to end up with two adjacent numbers that are more than 4 apart. I was dreading typing in all the verbiage for the proof.