Your progress
Ticks are kept only in this browser: clearing your browsing data or changing device loses them. · ·

BMO2 2018 Q2

2.

There are \(n\) places set for tea around a circular table, and every place has a small cake on a plate. Alice arrives first, sits at the table, and eats her cake (but it isn’t very nice). Next the Mad Hatter arrives, and tells Alice that she will have a lonely tea party, and that she must keep on changing her seat, and each time she must eat the cake in front of her (if it has not yet been eaten). In fact the Mad Hatter is very bossy, and tells Alice that, for \(i = 1, 2, \ldots, n - 1\), when she moves for the \(i\)-th time, she must move \(a_i\) places and he hands Alice the list of instructions \(a_1, a_2, \ldots, a_{n-1}\). Alice does not like the cakes, and she is free to choose, at every stage, whether to move clockwise or anticlockwise. For which values of \(n\) can the Mad Hatter force Alice to eat all the cakes?

British Mathematical Olympiad Round 2 2018, Question 2. © UK Mathematics Trust. Original paper on ukmt.org.uk