Problem 44797. Cannibal eating odd and even numbered men

  • Created by PE

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

Solution Stats

76.09% Correct | 23.91% Incorrect
Last Solution submitted on Oct 30, 2022

Problem Comments

Solution Comments

Show comments

Problem Recent Solvers27

Suggested Problems

More from this Author1

Problem Tags

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!