Suppose you have a 20 × 16 bar of chocolate squares. You want to break the bar into smaller chunks, so that after some sequence of breaks, no piece has an area of more than 5. What is the minimum possible number of times that you must break the bar?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
First, we will prove that it is not possible to use fewer than 6 3 cuts. Notice that in order to satisfy the conditions, we will need at least 5 2 0 ∗ 1 6 = 6 4 pieces. Each cut will create exactly 1 more piece. Therefore, we need at least 6 3 cuts. In order to see that it can be done in 6 3 cuts, first, make 1 5 cuts, each one parallel with the side of length 2 0 , so that we have 1 6 strips of length 2 0 . Cutting each of these strips into 4 equal parts will give us only chunks of area 5 , and will take 3 cuts per chunk. We make 1 5 + 3 ( 1 6 ) → 6 3 cuts total in order to do this.
Problem is Courtesy of The BMT (Berkeley Math Tournament)