You were having a party and had made 11 congruent pancakes for 11 people before an unexpected guest showed up, and there was no flour left to make another pancake.
As a result, for an even distribution to the 12 people, you decided to cut the pancakes under the condition that each cut would be along a pancake's diameter only. For instance, to divide a pancake into 12 equal slices, 6 cuts would be made, as shown above right.
What would be the least number of cuts you need to make to achieve equal shares for everyone?
Details and Assumptions:
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.
Relevant wiki: Egyptian Fractions
From the question, to divide 1 1 pancakes among 1 2 people, each person would get 1 2 1 1 of the whole pancake.
Intuitively, one could divide each pancake into 1 2 parts, and each person would take 1 1 slices as an equal share. However, that would require too much time and too many cuts, which wouldn't be our desired solution.
By limiting the cuts along diameters only, that means each slice would have an even denominator, and such denominator would need to be as least as possible to avoid too many cuts. As such, the fraction would need to be in its reduced lowest terms (reduced denominator as possible), and by approximation with the small integer (preferably 2 ), we are approaching the desired fraction with the highest possible value as called Greedy Algorithm .
In order to perform fewest cuts, we could adopt a primitive method used by the Egyptians, the Egyptian Fractions , or fractions with numerator 1 as shown:
1 2 1 1 = 2 1 + 4 1 + 6 1
Thereby, after starting with even denominator of 2 , the next least possible one is 4 , according to Greedy Algorithm , resulting in the summation above. Note that by skipping 4 to 6 , other variation is possible, such as:
1 2 1 1 = 2 1 + 6 2 + 1 2 1
But note that the sum of the three denominators in the latter case is higher, resulting in more cuts. Thus, the optimal summation is:
1 2 1 1 = 2 1 + 4 1 + 6 1
In other words, we wouldn't need to divide any pancake into 1 2 pieces. Instead, each person would get a share of one-half plus one-fourth and one-sixth.
That is, first, we would take 6 pancakes and divide each in halves (one cut each). That would result in 1 2 one-half slices, and so each person would get that one-half. (Totally 6 cuts)
Then we would take 3 pancakes and divide each in quarters (2 cuts each). That would result in 1 2 one-fourth slices, and so each person would get that one-fourth. (Totally 3 × 2 = 6 cuts)
Finally, we would take the remaining 2 pancakes and divide each in six portions (3 cuts each). That would result in 1 2 one-sixth slices, and so each person would get that one-sixth. (Totally 2 × 3 = 6 cuts)
Overall, we could divide 1 1 pancakes among 1 2 people by cutting only 1 8 times.