During a break, n children at school sit in a circle around their teacher to play a game. The teacher walks clockwise close to the children and hands out candies to some of them according to the following rule. He selects one child and gives him a candy, then he skips the next child and gives a candy to the next one, then he skips 2 and gives a candy to the next one, then he skips 3, and so on. Determine the values of n for which eventually, perhaps after many rounds, all children will have at least one candy each.
[APMO 1991 Q4]
This space is here to avoid seeing the answers before trying the problem!
If you enjoy using this website then please consider making a donation - every little helps :-)
You can receive these questions directly to your email box or read them in an RSS reader. Subscribe using the links on the right.
Don’t forget to follow Gifted Mathematics on Google+, Facebook or Twitter. You may add your own interesting questions on our Google+ Community and Facebook..
You can also subscribe to our Bookmarks on StumbleUpon and Pinterest. Many resources never make it onto the pages of Gifted Mathematics but are stored in these bookmarking websites to share with you.