Browse · MathNet
PrintXXIII OBM
Brazil counting and probability
Problem
One has a long row of glasses and stones in the central glass (glass ). The following movements are allowed:
• Movement
If there is at least one stone in glass and at least one in glass , one may make one stone in glass jump to glass , eliminating one stone in glass .
• Movement B
If there are at least two stones in glass i one may make a stone in glass i jump to glass i + 2 and make another stone jump to glass i - 1.
Prove the following: performing movements A and B for a sufficiently long time, one shall always obtain a configuration from which neither movements are allowed anymore. Besides this final configuration does not depend on the choices of movements during the process.
• Movement
• Movement B
Prove the following: performing movements A and B for a sufficiently long time, one shall always obtain a configuration from which neither movements are allowed anymore. Besides this final configuration does not depend on the choices of movements during the process.
Solution
Assign to a stone in the th glass. Let's consider what happens to the sum of the number assigned to all stones with each movement.
Movement A replaces with ; movement B replaces with . So the difference in the sum is either or .
Choose so that , say . Then the sum of the numbers assigned to the stones always stays the same. There is a number such that , so there is a limit to the leftmost stone, so it won't move after a while. Now consider the sum without this stone; the leftmost stone (that is, the second leftmost stone overall) won't move after a while and so on. So the configuration will remain constant at some time, that is, there won't be any two stones in the same glass nor two stones in two consecutive glasses.
Now notice that the representation of in base (all digits equal to one, no two consecutive ones) is unique: suppose on the contrary that there are two such representations and let be the first position from left to right in which those representations differ. This means that is equal to the sum of some numbers of the form for . But , so this isn't possible. So the final configuration is unique.
Movement A replaces with ; movement B replaces with . So the difference in the sum is either or .
Choose so that , say . Then the sum of the numbers assigned to the stones always stays the same. There is a number such that , so there is a limit to the leftmost stone, so it won't move after a while. Now consider the sum without this stone; the leftmost stone (that is, the second leftmost stone overall) won't move after a while and so on. So the configuration will remain constant at some time, that is, there won't be any two stones in the same glass nor two stones in two consecutive glasses.
Now notice that the representation of in base (all digits equal to one, no two consecutive ones) is unique: suppose on the contrary that there are two such representations and let be the first position from left to right in which those representations differ. This means that is equal to the sum of some numbers of the form for . But , so this isn't possible. So the final configuration is unique.
Techniques
Invariants / monovariantsSums and products