Solve Squares & Numbers Homework: Diff > 5

  • Thread starter Thread starter lolerlol
  • Start date Start date
  • Tags Tags
    Numbers Squares
Click For Summary

Homework Help Overview

The problem involves a square divided into 81 smaller squares, each containing a number from 1 to 81. The task is to demonstrate that there are at least two adjacent squares with entries differing by more than 5, regardless of how the numbers are arranged.

Discussion Character

  • Exploratory, Assumption checking, Problem interpretation

Approaches and Questions Raised

  • The original poster attempts a proof by contradiction, considering the implications of adjacent squares having entries differing by at most 5. Some participants suggest exploring the connectivity of squares and the maximum distance between them in terms of edges traversed.

Discussion Status

The discussion is ongoing, with participants exploring different angles of the problem. Some guidance has been offered regarding the connectivity of squares and the implications of the arrangement of numbers, but no consensus has been reached on a specific approach or solution.

Contextual Notes

Participants are considering the implications of adjacency and the arrangement of numbers, with some questioning the assumptions made in the original proof attempt. There is a focus on the relationships between squares and their entries.

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).
 

Similar threads

  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 21 ·
Replies
21
Views
2K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 23 ·
Replies
23
Views
4K
Replies
1
Views
2K
Replies
6
Views
2K
  • · Replies 4 ·
Replies
4
Views
5K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 7 ·
Replies
7
Views
3K
Replies
2
Views
2K