Maths Olympiad Prep

Library / /1134 of 1394

, 2020

Number theory Difficulty 5.6 AIME, harder Prove it United States

Problem:
Let a0,b0,c0,a,b,ca_{0}, b_{0}, c_{0}, a, b, c be integers such that gcd(a0,b0,c0)=gcd(a,b,c)=1\operatorname{gcd}\left(a_{0}, b_{0}, c_{0}\right)=\operatorname{gcd}(a, b, c)=1. Prove that there exists a positive integer nn and integers a1,a2,,an=a,b1,b2,,bn=b,c1,c2,,cn=ca_{1}, a_{2}, \ldots, a_{n}=a, b_{1}, b_{2}, \ldots, b_{n}=b, c_{1}, c_{2}, \ldots, c_{n}=c such that for all 1in,ai1ai+bi1bi+ci1ci=11 \leq i \leq n, a_{i-1} a_{i}+b_{i-1} b_{i}+c_{i-1} c_{i}=1.

Solution

Solution:
The problem statement is equivalent to showing that we can find a sequence of vectors, each with 3 integer components, such that the first vector is (a0,b0,c0)\left(a_{0}, b_{0}, c_{0}\right), the last vector is (a,b,c)(a, b, c), and every pair of adjacent vectors has dot product equal to 11.

We will show that any vector (a,b,c)(a, b, c) can be sent to (1,0,0)(1,0,0). This is sufficient, because given vectors (a0,b0,c0)\left(a_{0}, b_{0}, c_{0}\right) and (a,b,c)(a, b, c), we take the sequence from (a0,b0,c0)\left(a_{0}, b_{0}, c_{0}\right) to (1,0,0)(1,0,0) and then add the reverse of the sequence from (a,b,c)(a, b, c) to (1,0,0)(1,0,0).

First, suppose that some two of a,b,ca, b, c are relatively prime. Here we will suppose that aa and bb are relatively prime; the other cases are similar. If neither of aa or bb is 00, then by Bezout's identity, there exist p,qp, q such that p+q<a+b|p|+|q|<|a|+|b| and ap+bq=1a p+b q=1, so we can send (a,b,c)(a, b, c) to (p,q,0)(p, q, 0). (Finding such numbers can be done using the extended Euclidean algorithm.) Clearly pp and qq must also be relatively prime, so we can apply Bezout's identity repeatedly until we eventually have (1,0,0),(1,0,0),(0,1,0)(1,0,0),(-1,0,0),(0,1,0), or (0,1,0)(0,-1,0). Now, starting from (0,1,0)(0,-1,0), we can do (0,1,0)(1,1,0)(1,0,0)(0,-1,0) \rightarrow (1,-1,0) \rightarrow (1,0,0), and we can do something similar to convert (1,0,0)(-1,0,0) to (0,1,0)(0,1,0).

Now suppose that no two of a,b,ca, b, c are relatively prime. Let f=gcd(a,b)f=\operatorname{gcd}(a, b). We claim that we can find x,y,zx, y, z such that axy+bx+cz=1a x y+b x+c z=1. Notice that this is the same as (ay+b)x+cz=1(a y+b) x+c z=1. Since gcd(a,b,c)=1\operatorname{gcd}(a, b, c)=1, there exists yy such that gcd(ay+b,c)=1\operatorname{gcd}(a y+b, c)=1. Then by Bezout's identity, there exist x,zx, z such that (ay+b)x+cz=1(a y+b) x+c z=1. Therefore, we can send (a,b,c)(a, b, c) to (xy,x,z)(x y, x, z). Clearly xx and zz must be relatively prime, so we have reduced to the case above, and we can apply the process described above for that case.

At the end of this process, we will have (1,0,0),(0,1,0)(1,0,0),(0,1,0), or (0,0,1)(0,0,1). The second of these can be converted into (1,0,0)(1,0,0) by doing (0,1,0)(1,1,0)(1,0,0)(0,1,0) \rightarrow (1,1,0) \rightarrow (1,0,0), and a similar sequence shows the same for the third. Therefore, (a,b,c)(a, b, c) can be sent to (1,0,0)(1,0,0).

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.