How many ways can you split a square into squares?

Math 215
Proof Project
Rebecca Winzer






Winzer 1
QUESTION:
For n in N, can one split a square into consecutive n numbers of squares?
CLAIM:
For n in N and n>5, it is possible to divide a square into n squares where all n
are consecutive numbers.

An appropriate approach is to prove that it is possible for both even and odd
number squares.
PROOF:
Let n be an even number greater than 4. One side of the total square will have
n/2 squares and the bottom edge will add n/2-1 squares, and then it will also have one large
square.
One can continue adding squares along those sides two at a time by simply
changing the dimensions of the squares. For example, 6 squares and 8 squares.
Let n be an odd number greater than 5. It will follow the same pattern as the
even square except one can split the large square into 4 squares which will add a total of three
squares. So one can use even squares 4, 6, 8, etc. to get 7, 9, 11, etc. It will be n+3, for each n in
N. For example, 7 and 9 squares:
The proof holds for both even and odd number squares, where n in N is greater
than 5, thus for n in N one can split a square into n squares where all n are consecutive numbers
and greater than 5.