A huge jar of cookies has N whole cookies. A cookie is drawn at random, broken into halves, of which one is eaten, the other tossed back into the jar. Subsequently, if any half cookie is drawn, it is eaten, if any whole cookie is drawn, it is broken into halves, etc. Eventually all the cookies are eaten. For a given large N, what is the maximum number of half cookies will the jar have, before all the cookies are eaten? "Half cookies" don't include whole cookies, but those halves broken from whole cookies.
2007-05-28
17:22:54
·
2 answers
·
asked by
Scythian1950
7
in
Mathematics