You and some friends journey to the convenience store to buy some Slurpees. While you are enjoying your delicious treat you suddenly realize that the total bill for all of the Slurpees comes out to be a whopping $1,000. Being the clever mathematician you are, you suggest that rather than splitting the bill evenly, you guys will play a game to decide who pay for the entire bill. The rules are:
Since your mother would get very angry if she found out that you had to pay the $1,000 bill, you decide to choose the unique integer from to that lasts the highest number of rounds. What integer do you choose?
Details and assumptions
As an explicit example, f you chose the number , on the first round you would replace with , on the second round you would replace with , and on the third round you would replace with , so would last rounds.
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.
Done by Sreejato Bhattacharya and I: