There are N men in a queue. A cannibal eats either all odd-numbered or all even-numbered men in the queue at a time. In the first round he eats all the odd-numbered. In the next round he eats all even-numbered. This goes on repeating (with odd or even toggling after every round) till there is only 1 man in the queue. What would be the original number of this man in the queue? e.g. If N = 6,
Men remaining after round 1: 2, 4, 6
Men remaining after round 2: 2, 6
Men remaining after round 3: 6
Hence answer = 6
Find the two most distant points
1233 Solvers
73 Solvers
the fly, the train, the second train, and their Zeno's paradox
55 Solvers
135 Solvers
45 Solvers
Solution 1684038
OK. I'll bite. Where did this formula come from?
Just from calculating a number of values and figuring out the pattern.
That's quite the pattern to figure out...