Solve Squares & Numbers Homework: Diff > 5

  • Thread starter Thread starter lolerlol
  • Start date Start date
  • Tags Tags
    Numbers Squares
AI Thread Summary
A square divided into 81 smaller squares contains numbers from 1 to 81, and the task is to prove that two adjacent squares will differ by more than 5. The proof begins with a contradiction, assuming that adjacent squares differ by at most 5. This leads to the conclusion that non-adjacent squares, connected through adjacent ones, cannot differ by more than 9. The discussion suggests exploring the maximum distance between squares to strengthen the argument, indicating that it is possible to find adjacent squares with a difference of at least 10. The exploration of connections between squares is crucial in demonstrating the required difference.
lolerlol
Messages
4
Reaction score
0

Homework Statement



A square is divided into 81 smaller squares by lines parallel to its sides. The numbers 1, 2, ..., 81 are entered in an arbitrary fashion, one in each square.

Show that, however the numbers are entered, it is possible to find two small squares with an edge in common whose entries differ by more than 5.

Homework Equations


The Attempt at a Solution



(Proof by contradiction)

Assume the numbers 1 to 81 have been entered so that any two adjacent squares have entries by at most 5.

Some of the non-adjacent squares have a common adjacent square.

Therefore, no squares diagonally opposite from each would have a difference of more than 10. However, all squares have at least two adjacent squares, so the difference of diagonally opposite squares cannot be more than 9

i.e.

1/5
6/11 will not work, but

1/5/9
6/10 will.

That's as far as I've gotten. Do i just continue doing that? Or is there another way?
 
Physics news on Phys.org
You could try to consider the big picture. You can travel from any square to any other square by passing through edges. What's the smallest number K such that you can do this by passing through at most K squares? Now consider what happens when you connect the square containing 1 with the square containing 81.
 
I don't quite understand. Could you explain further?
 
I'm asking what's the maximum distance between any two squares on the grid, where distance measures how many squares you have to pass through (edgewise) to get from one to the other.
 
In fact we can improve this number. We can show there exists two adjacent squares with difference at least 10 (where adjacent means diagnolly also).
 
I picked up this problem from the Schaum's series book titled "College Mathematics" by Ayres/Schmidt. It is a solved problem in the book. But what surprised me was that the solution to this problem was given in one line without any explanation. I could, therefore, not understand how the given one-line solution was reached. The one-line solution in the book says: The equation is ##x \cos{\omega} +y \sin{\omega} - 5 = 0##, ##\omega## being the parameter. From my side, the only thing I could...

Similar threads

Back
Top