Olympiad Maths Prep

Library / /1 of 5

Algebra Difficulty 5.0 AIME Prove it Turkey

Let an+1=an32an2+2a_{n+1} = a_n^3 - 2a_n^2 + 2 for all n1n \ge 1 and a1=5a_1 = 5. Prove that if p3(mod4)p \equiv 3 \pmod 4 is a prime divisor of a2011+1a_{2011} + 1, then p=3p = 3.

Solution

Observe that an+12=an2(an2)a_{n+1} - 2 = a_n^2(a_n - 2) for all n1n \ge 1. By induction on nn we obtain an+12=3an2an12a12a_{n+1} - 2 = 3a_n^2a_{n-1}^2 \cdots a_1^2 for all n1n \ge 1. Therefore a2011+1=3(a20102a20092a12+1)=(a2010a2009a1)2+1a_{2011} + 1 = 3(a_{2010}^2a_{2009}^2 \cdots a_1^2 + 1) = (a_{2010}a_{2009} \cdots a_1)^2 + 1.

Let p3(mod4)p \equiv 3 \pmod 4 be a prime divisor of a2011+1a_{2011} + 1. It is well known that if qq is a prime divisor of (a2010a2009a1)2+1(a_{2010}a_{2009} \cdots a_1)^2 + 1, then q1(mod4)q \equiv 1 \pmod 4 or q=2q = 2. Thus p3p|3. That is p=3p = 3.

Looking for a route rather than an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement and solution reproduced as published; topic and difficulty added by this site.