Bernice has a long piece of string. She cuts it into two pieces, then cuts each piece into two each again, then cuts each new piece into two each once again a third time, so that she's left with 8 pieces of string. The point at which she cuts a piece of string is never more than 2cm from the exact center of each piece being cut.
What is the greatest possible difference between the longest and shortest pieces of string after she has finished cutting?
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.
Let the original length be 2 l ,
To maximize the difference between the shortest and longest lengths, always cut the leftmost and rightmost pieces 2cm left of center.
The length of the shortest string is then 2 2 l − 2 − 2 − 2 cm while the length of the longest string is 2 2 l + 2 + 2 + 2 cm. The difference in these lengths is 2 2 4 + 4 + 4 = 7 cm .
Thanks for this. I spent quite a while trying to work out how to write another solution in the same place, but you saved me the trouble. Cheers!
Problem Loading...
Note Loading...
Set Loading...
The actual length is irrelevant*, except of course that it must be sufficient to achieve the maximal error. Let the original length be 100cm.
Then, the shortest piece will be made as follows:
Similarly, the longest piece will be made as follows:
Now, 16cm - 9cm = 7cm.
*If you don't believe this, try a different starting length or check an algebraic proof.