The sequence {an} is defined by a0=1,a1=1, and an=an−1+an−2an−12 for n≥2.The sequence {bn} is defined by b0=1,b1=3, and bn=bn−1+bn−2bn−12 for n≥2.Find a32b32.
Solution — click to reveal
Dividing the recurrence relation for {an} by an−1, we get an−1an=1+an−2an−1.Then, since a1/a0=1, we have a2/a1=1+(a1/a0)=2, a3/a2=1+(a2/a1)=3, and so on. In general, an/an−1=n for all n. Then a32=32a31=32⋅31a30=⋯=32!a0=32!.For {bn}, we also have bn/bn−1=1+(bn−1/bn−2), but here b1/b0=3. Therefore, in general, bn/bn−1=n+2 for all n. Then b32=34b31=34⋅33b30=⋯=(34⋅33⋯3)b0=234!.Thus, a32b32=32!34!/2=234⋅33=561.