A sequence of 11 positive real numbers, a1,a2,a3,…,a11, satisfies a1=4 and a11=1024 and an+an−1=25an⋅an−1 for every integer n with 2≤n≤11. For example when n=7,a7+a6=25a7⋅a6. There are S such sequences. What are the rightmost two digits of S?
Official solution
Suppose that, for some integer n≥2, we have an=x and an−1=y. The equation an+an−1=25an⋅an−1 can be re-written as x+y=25xy. Since x>0 and y>0, squaring both sides of the equation gives an equivalent equation which is (x+y)2=425xy. Manipulating algebraically, we obtain the following equivalent equations: (x+y)2=425xy, 4(x2+2xy+y2)=25xy, 4x2−17xy+4y2=0, (4x−y)(x−4y)=0. Therefore, the given relationship is equivalent to 4x=y or x=4y. Returning to the sequence notation, we now know that it is the case that 4an=an−1 (that is, an=41an−1 ) or an=4an−1. Putting this another way, each term in the sequence can be obtained from the previous term either by multiplying by 4 or by dividing by 4. We are told that a1=4 and a11=1024. We note a1a11=41024=256=44. We can think of moving along the sequence from a1 to a11 by making 10 "steps", each of which involves either multiplying by 4 or dividing by 4. If there are m steps in which we multiply by 4 and 10−m steps in which we divide by 4, then 410−m4m=44 which gives 42m−10=44 or 2m−10=4 and so m=7. In other words, the sequence involves 7 steps of multiplying by 4 and 3 steps of dividing by 4. These steps completely define the sequence. The number of possible sequences, S, equals the number of ways of arranging these 10 steps, which equals (310). (If combinatorial notation is unfamiliar, we could systematically count the number of arrangements instead.) Therefore, S=3⋅2⋅110⋅9⋅8=5⋅3⋅8=120. The rightmost two digits of S are 20.
Source: Omni-MATH,
licensed Apache-2.0.
Statement and solution reproduced as published; topic, difficulty and ordering added
by this site.