Maths Olympiad Prep

Library / /56 of 69

, 2011

Algebra Difficulty 6.3 National Olympiad Prove it South Africa

Let the sequence (un)(u_n) be defined recursively by
u0=0, u1=1, un=2011un1un2for n2. u_0 = 0,\ u_1 = 1,\ u_n = 2011u_{n-1} - u_{n-2} \quad \text{for } n \ge 2.
Find all the values of nn for which unu_n is prime.

Solution

For generality, let x=2011x = 2011. Expanding the first few terms of the sequence with the recurrence un=xun1un2u_n = x u_{n-1} - u_{n-2} we find
u0=0,u1=1,u2=xu3=x21=u22u12u4=x32x=2u3u2xu22u5=x43x2+1=u32u22u6=x54x3+2x=2u4u3xu32. \begin{aligned} u_0 &= 0, \quad u_1 = 1, \quad u_2 = x \\ u_3 &= x^2 - 1 = u_2^2 - u_1^2 \\ u_4 &= x^3 - 2x = 2u_3u_2 - x u_2^2 \\ u_5 &= x^4 - 3x^2 + 1 = u_3^2 - u_2^2 \\ u_6 &= x^5 - 4x^3 + 2x = 2u_4u_3 - x u_3^2. \end{aligned}
From this we can conjecture that u2n=2unun+1xun2u_{2n} = 2u_n u_{n+1} - x u_n^2 and u2n+1=un+12un2u_{2n+1} = u_{n+1}^2 - u_n^2 for n>0n > 0. We now prove this by induction. Firstly note that it holds for n=1n = 1. Now assume it holds up to nn, and we will show that it holds for n+1n + 1.
u2n+2=xu2n+1u2n=x(un+12un2)(2unun+1xun2)=xun+122unun+1+xun2=2un+1(xun+1un)xun+12=2un+1un+2xun+12 \begin{aligned} u_{2n+2} &= x u_{2n+1} - u_{2n} \\ &= x(u_{n+1}^2 - u_n^2) - (2u_n u_{n+1} - x u_n^2) \\ &= x u_{n+1}^2 - 2u_n u_{n+1} + x u_n^2 \\ &= 2u_{n+1}(x u_{n+1} - u_n) - x u_{n+1}^2 \\ &= 2u_{n+1}u_{n+2} - x u_{n+1}^2 \end{aligned}
and
u2n+3=xu2n+2u2n+1 u_{2n+3} = x u_{2n+2} - u_{2n+1}
=x(2un+1un+2xun+12)(un+12un2)=x2un+12+x(2un+1un+2)+un2un+12=x2un+122xun+1un+un2un+12=(xun+1un)2un+12=un+22un+12. \begin{align*} &= x(2u_{n+1}u_{n+2} - x u_{n+1}^2) - (u_{n+1}^2 - u_n^2) \\ &= -x^2 u_{n+1}^2 + x(2u_{n+1}u_{n+2}) + u_n^2 - u_{n+1}^2 \\ &= x^2 u_{n+1}^2 - 2x u_{n+1}u_n + u_n^2 - u_{n+1}^2 \\ &= (x u_{n+1} - u_n)^2 - u_{n+1}^2 \\ &= u_{n+2}^2 - u_{n+1}^2. \end{align*}
The result thus follows by induction.

The above identities suggest that we may be able to find explicit factorisations, but for a factorisation to prove that a number is not prime it is necessary for the factors to be greater than 1. So let us show that uiui12u_i - u_{i-1} \ge 2 for all i2i \ge 2. For i=2i = 2 the result holds by inspection. Suppose it holds for some ii. Then ui+1ui=2011uiui1ui=2010uiui1uiui12u_{i+1} - u_i = 2011u_i - u_{i-1} - u_i = 2010u_i - u_{i-1} \ge u_i - u_{i-1} \ge 2. The result again follows by induction.

Inspecting the first few terms, we see that u2=2011u_2 = 2011 is prime. Let us show that there are no other primes. u0u_0 and u1u_1 are non-prime by inspection. For n1n \ge 1, u2n+1=un+12un2=(un+1un)(un+1+un)u_{2n+1} = u_{n+1}^2 - u_n^2 = (u_{n+1} - u_n)(u_{n+1} + u_n). By the inequality above, both factors are at least 2 and so u2n+1u_{2n+1} is not prime. For n>1n > 1, u2n=un(2un+12011un)u_{2n} = u_n(2u_{n+1} - 2011u_n). The first term is clearly greater than 1, and the second equals un+1un1un+1un2u_{n+1} - u_{n-1} \ge u_{n+1} - u_n \ge 2.

Thus, u2=2011u_2 = 2011 is the only prime in the sequence.

Want a route through all this instead of 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 reproduced verbatim; metadata (topic, difficulty) added by this project.