The sequence a=(a0,a1,a2,…) is defined by a0=0, a1=2 and an+2=2an+1+41anfor all n≥0. Prove that a2016 is divisible by 2017.
Solutions — 4
Solution 1
The equation x2−2x−41=0 has roots α=1+42 and β=1−42. Using a0=0 and a1=2, we obtain an=42αn−βnfor all n≥0.(2) Note that if h and k are positive integers, then αh(k−1)+αh(k−2)βh+αh(k−3)β2h+⋯+β(k−1)h is an integer. Since αβ=−41, this result follows once we show that αm+βm is an integer for every positive integer m. Now α+β=2 and αh+1+βh+1=(α+β)(αh+βh)−αβ(αh−1+βh−1), so the integrality of αm+βm follows using induction. Next α8−β8=(α−β)(α+β)(α2+β2)(α4+β4)=242⋅2⋅2⋅43⋅2⋅2017. Now 2016=8⋅252 and a2016=42α8⋅252−β8⋅252=42α8−β8⋅α8−β8α8⋅252−β8⋅252 The second factor is an integer, on applying the result above with k=252, h=8, and the first factor is an integral multiple of 2017. Hence 2017 divides a2016, as claimed.
Solution 2
We start in a similar manner to Solution 1 to obtain the formula (2). The binomial theorem then gives a2016=421((1+42)2016−(1−42)2016)=2k=0∑1007(2k+12016)42k The key observation is that for any prime number p and 1≤m<p we have (p−1)(p−2)⋯(p−m)≡(−1)mm!(modp) and because gcd(p,m)=1 this implies that (mp−1)=m!(p−1)(p−2)⋯(p−m)≡(−1)m(modp). Because 2017 is a prime number, we see now that (2k+12016)≡−1(mod2017) for all 0≤k≤1007. Hence, a2016≡−2k=0∑100742k≡−412(421008−1)(mod2017) and so a2016 is divisible by 2017 iff 421008≡1(mod2017). This could be checked by a tedious calculation, but can also be seen with the aid of Legendre symbols and quadratic reciprocity as follows. By Euler's criterion, we have 421008≡(201742)(mod2017). Next, we compute the Legendre symbol (201742) via (201742)=(20172)(20173)(20177)=(20173)(20177)=(32017)(72017)=(31)(71)=1, where in the second line we have used the fact that (20172)=1 since 2017≡1(mod8), and the third line follows from the fact that 2017≡1(mod4). This gives the desired result that 421008≡1(mod2017).
Solution 3
We start in a similar manner to Solution 1 to obtain the formula (2). Note that p=2017 is prime. Next we show that 42 is a quadratic residue mod 2017 (either by observing that 1192≡42(mod2017), by using the argument in Solution 2, or otherwise). Finally, letting r2≡42(mod2017), we interpret the formula (2) over the field of integers mod 2017 to obtain ap−1≡r(1+r)p−1−(1−r)p−1(mod2017). By Fermat's little theorem, p divides ((1+r)p−1−1)−((1−r)p−1−1), and so p divides rp−1. Thus p divides ap−1, i.e., 2017 divides a2016.
Solution 4
Consider the recursion modulo 2017 and go back eight steps a8k+8=2a8k+7+41a8k+6=45a8k+6+82a8k+5=172a8k+5+1845a8k+4≡172a8k+4+1001a8k+3(mod2017)≡1345a8k+3+1001a8k+2(mod2017)≡1674a8k+2+686a8k+1(mod2017)≡56a8k(mod2017). Because a0=0 it now follows by induction that 2017 divides a8k for every non-negative integer k. As 2016 is divisible by 8, the result follows.
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 and solution reproduced as published; topic and difficulty added by this site.