olymmath

HMMT 2020 T5

  • Team

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 1≤i≤n,ai−1ai+bi−1bi+ci−1ci=11 \leq i \leq n, a_{i-1} a_{i}+b_{i-1} b_{i}+c_{i-1} c_{i}=1.

Dataset text NuminaMath olympiads. Quoted with source.

Solutions

No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

Add a solution

Similar problems

These problems have the most words in common with this statement.

Locator hmmt/2020/t5 · Tag 3PPZWP4ZCA · Edit this page on GitHub · Keys: j next, k previous