1.
Consider the following puzzle:
You have a rectangular chocolate bar, made up of identical squares of chocolate. You can take such a bar and break it along any row or column. How many times will you have to break the bar to reduce it to single chocolate squares?
At first, this question might seem impossible. Perhaps we meant to ask for the smallest number of breaks needed. Letβs investigate.
(a)
Suppose you started with a bar. How many breaks would you need to reduce it to single squares?
(b)
If you had a bar, how many breaks are required?
If you had 4 squares arranged in a square, your first break would require you to break the chocolate into two bars. Then each of these would require more break(s), for a total of breaks to go from the to single squares.
(c)
There are two ways to proceed now.
-
Break the bar into two
bars, each requiring more breaks, for a total of breaks. -
Break the bar into a
bar and a bar. The bar takes more break(s) and the bar takes more break(s), for a total of breaks.
(d)
Based on the above data, what should our conjecture be for the number of breaks to reduce an -square bar to single squares, in terms of
It will take breaks to reduce an -square bar to single squares.
(e)
Do we believe this? Suppose you used one break to reduce the bar into two smaller bars, with and squares respectively. If the conjecture is correct, how many more breaks will it take to reduce the size bar?
How many more breaks will it take to reduce the size bar?
But what is We got and by breaking the squares in two pieces, so . This gives us a total number of breaks as .