MathDB
2004 Algebra #9

Source:

December 26, 2011
number theorygreatest common divisormodular arithmetic

Problem Statement

A sequence of positive integers is defined by a0=1a_0=1 and an+1=an2+1a_{n+1}=a_n^2+1 for each n0n\ge0. Find gcd(a999,a2004)\text{gcd}(a_{999},a_{2004}).