Consider the sequence a1,a2,a3,… defined by a1=9 and an+1=n+3(n+5)an+22 for n≥1. Find all positive integers n for which an is a perfect square.
Solution
First of all, we will prove by induction on n that an=n2+7n+1. The base case is trivial. Assume that ak=k2+7k+1, so ak+1=k+3(k+5)ak+22=k+3(k+5)(k2+7k+1)+22=(k+1)2+7(k+1)+1 We distinguish two cases regarding the value of n * if n≥9 then (n+3)2<n2+7n+1<(n+4)2, so an is not a perfect square. * if n≤8 then we have
a1=9
a2=31
a5=61
a7=99
a2=19
a4=45
a6=79
a8=121
Hence, an is a perfect square if and only if n=1,8.
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.