Maths Olympiad Prep

Library / /3 of 4

Combinatorics Difficulty 5.0 AIME Prove it United States

Problem:

Suppose that j(0)j(1)j(n1)j(0) j(1) \cdots j(n-1) is a valid juggling sequence. For i=0,1,,n1i=0,1, \ldots, n-1, let aia_{i} denote the remainder of j(i)+ij(i)+i when divided by nn. Prove that (a0,a1,,an1)(a_{0}, a_{1}, \ldots, a_{n-1}) is a permutation of (0,1,,n1)(0,1, \ldots, n-1).

Solution

Solution:

Suppose that ai=j(i)+ibina_{i}=j(i)+i-b_{i} n, where bib_{i} is an integer. Note that f(ibin)=ibin+j(i)=aif\left(i-b_{i} n\right)=i-b_{i} n+j(i)=a_{i}. Since {ibini=0,1,,n1}\{i-b_{i} n \mid i=0,1, \ldots, n-1\} contains nn distinct integers (as their residue modn\bmod n are all distinct), and ff is a permutation, we see that after applying the map ff, the resulting set {a0,a1,,an1}\{a_{0}, a_{1}, \ldots, a_{n-1}\} is a set of nn distinct integers. Since 0ai<n0 \leq a_{i}<n from definition, we see that (a0,a1,,an1)(a_{0}, a_{1}, \ldots, a_{n-1}) is a permutation of (0,1,,n1)(0,1, \ldots, n-1).

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.