|
|Store|
|
|
|
|
|
|
|
CTK Exchange
loucasa
Member since Mar-14-02
|
Mar-14-02, 06:29 PM (EST) |
|
"Splitting a square"
|
Hello all, This problem was an exercise at a recent "math night" designed for 3rd graders, and one solution has all of us parents (generally highly-educated and mathematically oriented) stumped. - Start with 9 squares on a sheet of paper (in our case, each was about 2" on a side).
- Number each square from 4 to 12.
- Divide each square into the number of smaller square regions (not necessarily of equal size) beside it.
Two examples were given: 4 (an obvious one to you and me, but remember, this was for 3rd graders):
7:
Notice that a square that is subdivided does not count toward the total. My question here is this:Can #5 be done? We have come up with solutions (in some cases more than one) to all except 5, and the teachers running the program did not have a solution key. At this point, we are convinced that it is impossible to subdivide a square into 5 smaller squares. Thanks in advance, Lou |
|
Alert | IP |
Printer-friendly page | Edit |
Reply |
Reply With Quote | Top |
|
|
alexb
Charter Member
720 posts |
Mar-14-02, 11:08 PM (EST) |
|
1. "RE: Splitting a square"
In response to message #0
|
LAST EDITED ON Mar-14-02 AT 11:10 PM (EST) I am sure I do not understand the problem.> - Start with 9 squares on a sheet of paper (in our
>case, each was about 2" on a side). OK > - Number each square from 4 to 12.
What for? You do not use any numbering in the sequel. > - Divide each square into the number of smaller square
>regions (not necessarily of equal size) beside it. OK >Two examples were given: Got both of them. A question: why do you need 9 squares? In both example, there's always one to start with. To boot, the count does not include any remaining eight. >Notice that a square that is subdivided does not >count toward the total. OK >My question here is this:Can #5 be done? We have come up >with solutions (in some cases more than one) to all except >5, Do you mean to say you can cut a square into 2, 3, 6, 8, 9, ... smaller squares? >At this point, we are convinced that it is >impossible to subdivide a square into 5 smaller squares. > The problem is curious, especially for 3rd grade, but I want to make sure I understand exactly what is it about. |
|
Alert | IP |
Printer-friendly page | Edit |
Reply |
Reply With Quote | Top |
|
|
|
loucasa
Member since Mar-14-02
|
Mar-15-02, 10:13 PM (EST) |
|
2. "RE: Splitting a square"
In response to message #1
|
Alex, My apologies for not being as clear as I thought I was. >Do you mean to say you can cut a square into 2, 3, 6, 8, 9, ... >smaller squares? Essentially, yes, except that the numbers to use are 4, 5, 6, ..., 12, which are the labels on the 9 squares. Here is an image of the solutions that we determined (in some cases there is more than one solution, but I have depicted only one) for all except 5. Now, armed with this information, can you devise a solution for 5? |
|
Alert | IP |
Printer-friendly page | Edit |
Reply |
Reply With Quote | Top |
|
|
|
|
alexb
Charter Member
720 posts |
Mar-15-02, 11:05 PM (EST) |
|
3. "RE: Splitting a square"
In response to message #2
|
LAST EDITED ON Mar-15-02 AT 11:08 PM (EST) Thank you for your clarification. It's a nice problem. There's no solution with 5 squares.Indeed, there must be a side of the original square that is cut into two. For, if every side is cut into more than two pieces there are bound to be more than, say, 6 squares. So, consider a side cut in two. If the pieces are equal, then the problem is reduced to showing that a rectangle 1×2 can't be cut into 3 squares, which is rather obvious. The two pieces, therefore, are unequal. The largest of the two is side of a square. Remove it. What remains looks like letter L with two legs of equal length. Is it possible to cut it into 4 squares? The answer is no. Why? You have to use 2 small squares at the terminal edges of the L. (If more than 1 square abuts a terminal edge, nothing is gained, but more squares are wasted!) When you remove them, a shorter L results. Can this shortened L be cut into two squares. Look at your diagram for 6 squares. This is one possibility for L: it's cut into 3 squares. If the legs of the L are relatively longer, you can remove 2 more squares and still remain with an L. If the legs of the L are relatively shorter, then this is a shape that must be cut into 2 squares. That this is impossible is rather obvious. I hope there's a more elegant solution and will continue looking for one. |
|
Alert | IP |
Printer-friendly page | Edit |
Reply |
Reply With Quote | Top |
|
|
|
|
|
|
alexb
Charter Member
720 posts |
Mar-17-02, 12:29 PM (EST) |
|
5. "RE: Splitting a square"
In response to message #4
|
>I agree that it would be nice to have an elegant solution, >since a negative proof by empirical methods stands up only >until a successful solution is devised.
I do not believe you can proof anything in mathematics by empirical methods. Empirical methods may only influence the degree of your confidence in a certain statement, but neither prove, nor disprove one.
What I offered as a proof is not at all empirical. The right word would be constructive.
I wished for a more elegant proof, because this one is kind of brute force. It would be nice to have something based on, say, Euler's formula. Count the number of vertices, edges, faces, and voilŕ, they do not fit. Working out the cases only worked because 5 is a small number.
|
|
Alert | IP |
Printer-friendly page | Edit |
Reply |
Reply With Quote | Top |
|
|
|
|
Joao
guest
|
Mar-22-02, 05:29 PM (EST) |
|
6. "RE: Splitting a square"
In response to message #5
|
Hi I cannot see the picture that you have presented for the solution for the rest of the numbers, so I'm not sure what is allowed & what isn't. I have found a solution for 5 (in fact, I have found several) but I'm not sure of the rules as you have specified them. Please email me on jfrasco@websoft.co.za and I will show you the solutions. |
|
Alert | IP |
Printer-friendly page | Edit |
Reply |
Reply With Quote | Top |
|
|
|
|
Laocon
Member since Jan-18-02
|
Mar-25-02, 01:55 PM (EST) |
|
7. "RE: Splitting a square"
In response to message #6
|
Hi Joao, I believe you have fallen into the same mistake that I did at first. That is to try to find 5 square numbers that when added produce a 6th square number, eg a^2 + b^2 + c^2 + d^2 + e^2 = f^2 However there is no physical arrangement of this - I believe. Please post your solutions here...
|
|
Alert | IP |
Printer-friendly page | Edit |
Reply |
Reply With Quote | Top |
|
|
|
|
|
a_tattletale
guest
|
Apr-16-02, 01:11 AM (EST) |
|
9. "RE: Splitting a square"
In response to message #0
|
You are correct! It cannot be done. Let me see if I can convince you with an extremely informal (read incomplete) proof by contradiction. Proof: Assume that it is possible to divide a square (say unit length) into exactly 5 smaller squares. Let S be the square of unit length. Let s(1), s(2), ... , s(5) be the smaller squares that accomplish such a feat. (Unproven) Claim 1: Each corner of S must touch a unique smaller square. Then there is an s(i) for some i that does not touch a corner. Then s(i) must either touch exactly one side or it touches no sides. (Unproven) Claim 2: If s(i) touches exactly one side then S must look like this: (Note, none of the sides are necessarily to scale) (Unproven) Claim 3: If s(i) touches no sides then S must look like this:
(Note, none of the sides are necessarily to scale) Now it is easy (by simple algebra) to show that neither results are possible (somewhere, squareness must be violated).
Hence, it is impossible to divide a square into exactly 5 smaller squares. |
|
Alert | IP |
Printer-friendly page | Edit |
Reply |
Reply With Quote | Top |
|
|
|
Apparition
guest
|
May-06-02, 01:14 PM (EST) |
|
10. "RE: Splitting a square"
In response to message #9
|
Let S be the square we wish to divide into n smaller squares s1..sn, where n >= 4. Obviously one of the subsquares must touch the upper left corner of S, let's call this subsquare s1. Since s1 is smaller then S and touches the upper left corner, s1 must bisect S along both the horizontal and vertical. Therefore, no matter how large we choose s1 to be, it will divide S into four pieces. Let LS be the length of the sides of S and ls1 be the length of the sides of s1. So now we have four pieces with the following dimensions: s1: ls1 X ls1 s2: (LS - ls1) X ls1 s3: ls1 X (LS - ls1) s4: (LS - ls1) X (LS - ls1) There are two possibilities here, 1) ls1 = (LS - ls1) and we have four equal squares, or 2) ls1 <> (LS - ls1) and we have two squares and two rectangles. If we are in case 1), it's obvious that you can not divide one square into two squares, hence you can not go from this configuration to one with 5 subsquares. If we are in case 2), we have two pieces here that are not square so would have to divide each of them in order to get to a configuration of all squares, and hence would require at least 6 pieces, so we can not go from this configuration to one with 5 subsquares. Therefore, since all of our cases have been exhausted, it has been proven that you can not divide a square into five sub-squares |
|
Alert | IP |
Printer-friendly page | Edit |
Reply |
Reply With Quote | Top |
|
|
|
You may be curious to visit the old CTK Exchange archive.
|Front page|
|Contents|
|Store|
Copyright © 1996-2018 Alexander Bogomolny
[an error occurred while processing this directive]
|
Advertise
|