WOOT 2015-15: Algorithms

1. Let n be a positive integer. We are given a 2n -tuple of numbers, where each number is equal to 1 or 1. A
move consists of replacing the 2n -tuple (a1 , a2 , . . . , a2n ) with the 2n -tuple (a1 a2 , a2 a3 , . . . , a2n a1 ). Prove that
after 2n such moves, each entry is equal to 1. Can the number 2n be replaced by a smaller number, so that
the statement still holds?
2. We play the following game with an equilateral triangle of n(n + 1)/2 pennies (with n pennies on each side).
Initially, all of the pennies are turned heads up. On each turn, we may turn over three pennies that are
mutually adjacent; the goal is to make all of the pennies show tails. For which values of n is this possible?
3. We have an infinite number of red boxes R1 , R2 , R3 , . . . , and a blue box B. 100 balls are distributed among
the red boxes. If box Rn contains exactly n balls, then we may take them out of box Rn , and place one ball
into each of the boxes Rn1 , Rn2 , . . . , R1 , and B. (If n = 1, then we move the one ball in box R1 to box
B.) Prove that there is a unique initial distribution of balls so that all 100 balls may eventually be moved to
the blue box.
4. Each side and diagonal of a regular (2n + 1)-gon is colored red or blue. One may choose a vertex and change
the color of all of the segments emanating from that vertex, from red to blue and vice versa. Prove that no
matter how the edges were colored initially, it is possible to make the number of blue segments at each vertex
even. Prove also that the resulting coloring is uniquely determined by the initial coloring.
5. Prove that for all integers a > 1 and b > 1 there exists a function f from the positive integers to the positive
integers such that f (a f (n)) = b n for all positive integers n.
6. All of the robots then simultaneously try to move in the specified direction. If the edge adjacent to a robot in
that direction is passable, the robot moves across the edge and into the next square. Otherwise, the robot
remains on its current square. You can then give another command of up, down, left, or right, then another,
for as long as you want. Suppose that for any individual robot, and any square on the grid, there is a finite
sequence of commands that will move that robot to that square. Prove that you can also give a finite
sequence of commands such that all of the robots end up on the same square at the same time.
7. An integer is assigned to each vertex of a regular pentagon so that the sum of the five integers is 2011. A turn
of a solitaire game consists of subtracting an integer m from each of the integers at two neighboring vertices
and adding 2m to the opposite vertex, which is not adjacent to either of the first two vertices. (The amount
m and the vertices chosen can vary from turn to turn.) The game is won at a certain vertex if, after some
number of turns, that vertex has the number 2011 and the other four vertices have the number 0. Prove that
for any choice of the initial integers, there is exactly one vertex at which the game can be won.
8. Let n be a positive
integer. Denote by Sn the set of points (x, y) with integer coordinates such that

|x| + y + 12  < n. A path is a sequence of distinct points (x1 , y1 ), (x2 , y2 ), . . . , (x , y ) in Sn such that, for
i = 2, . . . , , the distance between (xi , yi ) and (xi1 , yi1 ) is 1 (in other words, the points (xi , yi ) and
(xi1 , yi1 ) are neighbors in the lattice of points with integer coordinates). Prove that the points in Sn
cannot be partitioned into fewer than n paths (a partition of Sn into m paths is a set P of m nonempty paths
such that each point in Sn appears in exactly one of the m paths in P).
9. Each of the six boxes B1 , B2 , B3 , B4 , B5 , B6 initially contains one coin. The following operations are allowed
Type 1) Choose a non-empty box Bj , 1 j 5, remove one coin from Bj and add two coins to Bj+1 ;
Type 2) Choose a non-empty box Bk , 1 k 4, remove one coin from Bk and swap the contents (maybe
empty) of the boxes Bk+1 and Bk+2 .
Determine if there exists a finite sequence of operations of the allowed types, such that the five boxes B1 , B2 ,
2010
B3 , B4 , B5 become empty, while box B6 contains exactly 20102010
coins.
10. Let n 2 be a positive integer. Initially, there are n fleas on a horizontal line, not all at the same point. For
a positive real number , define a move as follows: choose any two fleas, at points A and B, with A to the left
of B; let the flea at A jump to the point C on the line to the right of B with BC/AB = .
Determine all values of such that, for any point M on the line and any initial positions of the n fleas, there
is a finite sequence of moves that will take all the fleas to positions to the right of M .