# A Candy Game

A number of students sit in a circle while their teacher gives them candy. Each student initially has an even number of pieces of candy. When the teacher blows a whistle, each student simultaneously gives half of his or her own candy to the neighbor on the right. Any student who ends up with an odd number of pieces of candy gets one more piece from the teacher. Show that no matter how many pieces of candy each student has at the beginning, after a finite number of iterations of this transformation all students have the same number of pieces of candy.

### If you are reading this, your browser is not set to run Java applets. Try IE11 or Safari and declare the site https://www.cut-the-knot.org as trusted in the Java setup.

 What if applet does not run?

(Number of candies can be set either randomly or by modifying each of the circled entries. To modify a number, click a little to the right or left of its centerline. In the symmetric variant, each fellow shares equally between his/her two neighbors.)

There is another version of the game wherein divides his/her candies into two equal piles discharging (or eating up) one candy if such is left over. One and the same reasoning applies to both variants.

• 3-Term Arithmetic Progression
• Aliquot game (An Interactive Gizmo)
• Euclid's Game (An Interactive Gizmo)
• Euclid's Game on a Square Grid
• Sums and Products
• Sums and Products, a Generalization
• Sums, Products, and 1-1 Functions
• Zeros and Nines
• A Candy Game: Integer Iterations
• A Candy Game (Change Discharged)