MathDB
GCD

Source:

June 30, 2012
number theorygreatest common divisor

Problem Statement

The sequence a1,a2,...a_1, a_2, ... of natural numbers satisfies GCD(ai,aj)=GCD(i,j)GCD(a_i, a_j)=GCD(i, j) for all iji \neq j. Prove that ai=ia_i=i for all ii.