Let (an)n≥0 and (bn)n≥0 be sequences defined by an+2=an+1+an, n=0,1,…, a0=1, a1=2, and bn+2=bn+1+bn, n=0,1,…, b0=2, b1=1. How many integers do the sequences have in common?
Solution
We have a2=3, a3=5, a4=8, … and b2=3, b3=4, b4=7, … It follows a0=b0, a1=b1, a2=b2, and b3<a3<b4<a4<b5. We prove by induction of step 2 that for m≥3 we have bm<am<bm+1. The basis cases m=3, m=4 are verified above. Assume that bk<ak<bk+1 and bk+1<ak+1<bk+2 Adding these inequalities we get bk+bk+1<ak+ak+1<bk+1+bk+2, that is bk+2<ak+2<bk+3. The sequences have in common only three integers: 1,2,3.
Want a route through all this instead of an archive? The track
puts 2,604 problems in a working order, from Junior Challenge level to the IMO shortlist.
Source: MathNet,
licensed CC-BY-4.0.
Statement reproduced verbatim; metadata (topic, difficulty) added by this project.