Maths Olympiad Prep

Library / /315 of 377

Number theory Difficulty 5.6 AIME, harder Prove it United States

Problem:

For any positive integer nn, let N=φ(1)+φ(2)++φ(n)N=\varphi(1)+\varphi(2)+\ldots+\varphi(n). Show that there exists a sequence
a1,a2,,aN a_{1}, a_{2}, \ldots, a_{N}
containing exactly φ(k)\varphi(k) instances of kk for all positive integers knk \leq n such that
1a1a2+1a2a3++1aNa1=1. \frac{1}{a_{1} a_{2}}+\frac{1}{a_{2} a_{3}}+\cdots+\frac{1}{a_{N} a_{1}}=1 .

Solution

Solution:

We write all fractions of the form b/ab / a, where aa and bb are relatively prime, and 0ban0 \leq b \leq a \leq n, in ascending order. For instance, for n=5n=5, this is the sequence
01,15,14,13,25,12,35,23,34,45,11 \frac{0}{1}, \frac{1}{5}, \frac{1}{4}, \frac{1}{3}, \frac{2}{5}, \frac{1}{2}, \frac{3}{5}, \frac{2}{3}, \frac{3}{4}, \frac{4}{5}, \frac{1}{1}

This sequence is known as the Farey sequence.
Now, if we look at the the sequence of the denominators of the fractions, we see that kk appears φ(k)\varphi(k) times when k>1k>1, although 1 appears twice. Thus, there are N+1N+1 elements in the Farey sequence. Let the Farey sequence be

b1a1,b2a2,,bN+1aN+1 \frac{b_{1}}{a_{1}}, \frac{b_{2}}{a_{2}}, \ldots, \frac{b_{N+1}}{a_{N+1}}

Now, aN+1=1a_{N+1}=1, so the sequence a1,a2,,aNa_{1}, a_{2}, \ldots, a_{N} contains φ(k)\varphi(k) instances of kk for every 1kn1 \leq k \leq n. We claim that this sequence also satisfies
1a1a2+1a2a3++1aNa1=1. \frac{1}{a_{1} a_{2}}+\frac{1}{a_{2} a_{3}}+\cdots+\frac{1}{a_{N} a_{1}}=1 .

Since a1=aN+1=1a_{1}=a_{N+1}=1, we have
1a1a2+1a2a3++1aNa1=1a1a2+1a2a3++1aNaN+1. \frac{1}{a_{1} a_{2}}+\frac{1}{a_{2} a_{3}}+\cdots+\frac{1}{a_{N} a_{1}}=\frac{1}{a_{1} a_{2}}+\frac{1}{a_{2} a_{3}}+\cdots+\frac{1}{a_{N} a_{N+1}} .

Now, it will suffice to show that 1aiai+1=bi+1ai+1biai\frac{1}{a_{i} a_{i+1}}=\frac{b_{i+1}}{a_{i+1}}-\frac{b_{i}}{a_{i}}. Once we have shown this, the above sum will telescope to bN+1aN+1b1a1=10=1\frac{b_{N+1}}{a_{N+1}}-\frac{b_{1}}{a_{1}}=1-0=1.
To see why 1aiai+1=bi+1ai+1biai\frac{1}{a_{i} a_{i+1}}=\frac{b_{i+1}}{a_{i+1}}-\frac{b_{i}}{a_{i}} holds, we note that this is equivalent to 1=bi+1aibiai+11=b_{i+1} a_{i}-b_{i} a_{i+1}. We can prove this fact geometrically: consider the triangle in the plane with vertices (0,0),(ai,bi)(0,0),\left(a_{i}, b_{i}\right), and
(ai+1,bi+1)\left(a_{i+1}, b_{i+1}\right). This triangle contains these three boundary points, but it contains no other boundary or interior points since aia_{i} and ai+1a_{i+1} are relatively prime to bib_{i} and bi+1b_{i+1}, respectively, and since no other fraction with denominator at most nn lies between biai\frac{b_{i}}{a_{i}} and bi+1ai+1\frac{b_{i+1}}{a_{i+1}}. Thus, by Pick's theorem, this triangle has area 1/21 / 2. But the area of the triangle can also be computed as the cross product 12(bi+1aibiai+1)\frac{1}{2}\left(b_{i+1} a_{i}-b_{i} a_{i+1}\right); hence bi+1aibiai+1=1b_{i+1} a_{i}-b_{i} a_{i+1}=1 and we are done.

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.