MathDB
Easy number theory: 3 coprime pairs yield infinitely many

Source: 5th QEDMO problem 1, proposed by me

November 10, 2007
modular arithmetic

Problem Statement

Let a a, b b and k k be three positive integers. We define two sequences (an) \left( a_{n}\right) and (bn) \left( b_{n}\right) by the starting values a_{1}\equal{}a and b_{1}\equal{}b and the recurrent equations a_{n\plus{}1}\equal{}ka_{n}\plus{}b_{n} and b_{n\plus{}1}\equal{}kb_{n}\plus{}a_{n} for each positive integer n n. Prove that if a1b1 a_{1}\perp b_{1}, a2b2 a_{2}\perp b_{2} and a3b3 a_{3}\perp b_{3} hold, then anbn a_{n}\perp b_{n} holds for every positive integer n n. Here, the abbreviation xy x\perp y stands for "the numbers x x and y y are coprime".