Maths Olympiad Prep

Library / /304 of 377

Algebra Difficulty 5.5 AIME, harder Prove it United States

Problem:

Let {an}\{a_{n}\} and {bn}\{b_{n}\} be sequences defined recursively by a0=2;b0=2a_{0}=2 ; b_{0}=2, and an+1=an1+an2+bn2bna_{n+1}=a_{n} \sqrt{1+a_{n}^{2}+b_{n}^{2}}-b_{n}; bn+1=bn1+an2+bn2+anb_{n+1}=b_{n} \sqrt{1+a_{n}^{2}+b_{n}^{2}}+a_{n}. Find the ternary (base 3) representation of a4a_{4} and b4b_{4}.

Solution

Solution:

Note first that 1+an2+bn2=32n\sqrt{1+a_{n}^{2}+b_{n}^{2}}=3^{2^{n}}. The proof is by induction; the base case follows trivially from what is given. For the inductive step, note that
1+an+12+bn+12=1+an2(1+an2+bn2)+bn22anbn1+an2+bn2+bn2(1+an2+bn2)+an2+2anbn1+an2+bn2=1+(an2+bn2)(1+an2+bn2)+an2+bn2=(1+an2+bn2)2. 1+a_{n+1}^{2}+b_{n+1}^{2}=1+a_{n}^{2}(1+a_{n}^{2}+b_{n}^{2})+b_{n}^{2}-2 a_{n} b_{n} \sqrt{1+a_{n}^{2}+b_{n}^{2}}+b_{n}^{2}(1+a_{n}^{2}+b_{n}^{2})+a_{n}^{2}+2 a_{n} b_{n} \sqrt{1+a_{n}^{2}+b_{n}^{2}}=1+(a_{n}^{2}+b_{n}^{2})(1+a_{n}^{2}+b_{n}^{2})+a_{n}^{2}+b_{n}^{2}=(1+a_{n}^{2}+b_{n}^{2})^{2}.
Invoking the inductive hypothesis, we see that 1+an+12+bn+12=(32n)2=32n+1\sqrt{1+a_{n+1}^{2}+b_{n+1}^{2}}=(3^{2^{n}})^{2}=3^{2^{n+1}}, as desired.

The quickest way to finish from here is to consider a sequence of complex numbers {zn}\{z_{n}\} defined by zn=an+bniz_{n}=a_{n}+b_{n} i for all nonnegative integers nn. It should be clear that z0=2+2iz_{0}=2+2 i and zn+1=zn(32n+i)z_{n+1}=z_{n}(3^{2^{n}}+i). Therefore,
z4=(2+2i)(320+i)(321+i)(322+i)(323+i). z_{4}=(2+2 i)(3^{2^{0}}+i)(3^{2^{1}}+i)(3^{2^{2}}+i)(3^{2^{3}}+i).
This product is difficult to evaluate in the decimal number system, but in ternary the calculation is a cinch! To speed things up, we will use balanced ternary, in which the three digits allowed are 1,0-1,0, and 11 rather than 0,10,1, and 22. Let x+yi=(320+i)(321+i)(322+i)(323+i)x+y i=(3^{2^{0}}+i)(3^{2^{1}}+i)(3^{2^{2}}+i)(3^{2^{3}}+i), and consider the balanced ternary representation of xx and yy. For all 0j150 \leq j \leq 15, let xjx_{j} denote the digit in the 3j3^{j} place of xx, let yjy_{j} denote the digit in the 3j3^{j} place of yy, and let b(j)b(j) denote the number of ones in the binary representation of jj. It should be clear that xj=1x_{j}=-1 if b(j)2(mod4)b(j) \equiv 2\pmod{4}, xj=0x_{j}=0 if b(j)1(mod2)b(j) \equiv 1\pmod{2}, and xj=1x_{j}=1 if b(j)0(mod4)b(j) \equiv 0\pmod{4}. Similarly, yj=1y_{j}=-1 if b(j)1(mod4)b(j) \equiv 1\pmod{4}, yj=0y_{j}=0 if b(j)0(mod2)b(j) \equiv 0\pmod{2}, and yj=1y_{j}=1 if b(j)3(mod4)b(j) \equiv 3\pmod{4}. Converting to ordinary ternary representation, we see that x=2212112211220013x=221211221122001_{3} and y=1100222022121203y=110022202212120_{3}. It remains to note that a4=2x2ya_{4}=2x-2y and b4=2x+2yb_{4}=2x+2y and perform the requisite arithmetic to arrive at the answer above.

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.