Problem:
Let be integers such that . Prove that there exists a positive integer and integers such that for all .
, 2020
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 , the last vector is , and every pair of adjacent vectors has dot product equal to .
We will show that any vector can be sent to . This is sufficient, because given vectors and , we take the sequence from to and then add the reverse of the sequence from to .
First, suppose that some two of are relatively prime. Here we will suppose that and are relatively prime; the other cases are similar. If neither of or is , then by Bezout's identity, there exist such that and , so we can send to . (Finding such numbers can be done using the extended Euclidean algorithm.) Clearly and must also be relatively prime, so we can apply Bezout's identity repeatedly until we eventually have , or . Now, starting from , we can do , and we can do something similar to convert to .
Now suppose that no two of are relatively prime. Let . We claim that we can find such that . Notice that this is the same as . Since , there exists such that . Then by Bezout's identity, there exist such that . Therefore, we can send to . Clearly and 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 , or . The second of these can be converted into by doing , and a similar sequence shows the same for the third. Therefore, can be sent to .