MathDB
ASU 485 All Soviet Union MO 1988 a_0 = 0, a_n = p(a_n-1), p(x) pos.integer pol

Source:

August 8, 2019
polynomialInteger sequenceSequencegreatest common divisor

Problem Statement

The sequence of integers an is given by a0=0,an=p(an1)a_0 = 0, a_n = p(a_n-1), where p(x)p(x) is a polynomial whose coefficients are all positive integers. Show that for any two positive integers m,km, k with greatest common divisor dd, the greatest common divisor of ama_m and aka_k is ada_d.