Spilling the beans
Problem 334
Published on Saturday, 23rd April 2011, 04:00 pm; Solved by 317In Plato's heaven, there exist an infinite number of bowls in a straight line.
Each bowl either contains some or none of a finite number of beans.
A child plays a game, which allows only one kind of move: removing two beans from any bowl, and putting one in each of the two adjacent bowls.
The game ends when each bowl contains either one or no beans.
For example, consider two adjacent bowls containing 2 and 3 beans respectively, all other bowls being empty. The following eight moves will finish the game:
You are given the following sequences:
t_{0} = 123456. |
t_{i} = |
| ||||||||||||||||
where ⌊x⌋ is the floor function | |||||||||||||||||
and is the bitwise XOR operator. |
b_{i} = ( t_{i} mod 2^{11}) + 1. |
The first two terms of the last sequence are b_{1} = 289 and b_{2} = 145.
If we start with b_{1} and b_{2} beans in two adjacent bowls, 3419100 moves would be required to finish the game.
Consider now 1500 adjacent bowls containing b_{1}, b_{2},..., b_{1500} beans respectively, all other bowls being empty. Find how many moves it takes before the game ends.