MathCastle
Algebra 2ChallengeAdvanced Number Theory

Advanced Number Theory · Challenge problem

A sequence is defined by a0=3a_0 = 3 and an+1=an2−2a_{n+1} = a_n^2 - 2 for n≥0n \ge 0, so it begins 3,7,47,2207,…3, 7, 47, 2207, \ldots Find the remainder when the product a0a1a2⋯a9a_0 a_1 a_2 \cdots a_9 is divided by 10001000.