Two sequences, So weird !

Algebra Level 5

Two real sequences { a n } n = 0 \displaystyle {\{a_{n}\}}_{n=0}^{\infty} , { b n } n = 0 \displaystyle {\{b_{n}\}}_{n=0}^{\infty} are defined as follows a 1 = α \displaystyle a_{1}=\alpha and b 1 = β \displaystyle b_{1}=\beta , a n + 1 = α a n β b n \displaystyle a_{n+1}=\alpha a_{n}-\beta b_{n} b n + 1 = β a n + α b n b_{n+1}=\beta a_{n}+\alpha b_{n} For all n 2 n \ge 2 . How many non-zero pairs ( α , β ) (\alpha,\beta) of real numbers are there such that a 1997 = b 1 \displaystyle a_{1997}=b_{1} and b 1997 = a 1 \displaystyle b_{1997}=a_{1} ?


The answer is 1998.

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

2 solutions

Daniel Liu
Jun 28, 2014

That recurrence relation sure looks suspiciously familiar... Familiar to how to rotate a rectangular coordinate! This makes us think of using polar coordinates.

Let α = r cos θ \alpha=r\cos\theta and β = r sin θ \beta = r\sin \theta

We have that { a n + 1 = ( r cos θ ) a n ( r sin θ ) b n b n + 1 = ( r sin θ ) a n + ( r cos θ ) b n \left\{\begin{array}{l} a_{n+1}=(r\cos\theta)a_n-(r\sin\theta)b_n\\ b_{n+1}=(r\sin\theta)a_n+(r\cos\theta)b_n\end{array}\right.

This is exactly the rotation formula for rectangular coordinates. Putting the coordinates on the Argand Diagram, we see that the recurrence relations simply turn into a n + 1 + i b n + 1 = r cis θ ( a n + i b n ) a_{n+1}+ib_{n+1}=r\text{cis}\theta(a_n+ib_n)

Letting a n + i b n = z n a_n+ib_n=z_n , we see z n + 1 = r cis θ ( z n ) z_{n+1}=r\text{cis}\theta(z_n)

Then, since z 1 = r cis θ z_1=r\text{cis}\theta we have

z n = ( r cis θ ) n = z 1 n z_n=(r\text{cis}\theta)^n=z_1^n

Note that because a 1997 = b 1 a_{1997}=b_1 and b 1997 = a 1 b_{1997}=a_1 , we must have z 1997 = z 1 ||z_{1997}||=||z_1|| . Thus, r = 1 r=1 .

Now we just need to find a way to represent a 1997 = b 1 a_{1997}=b_1 and b 1997 = a 1 b_{1997}=a_1 .

Note that z 1 1997 = a 1997 + i b 1997 = b 1 + i a 1 = i z 1 z_1^{1997}=a_{1997}+ib_{1997}=b_1+ia_1=i\overline{z_1}

Where the middle inequality makes sure that a 1997 = b 1 a_{1997}=b_1 and b 1997 = a 1 b_{1997}=a_1 is satisfied.

Thus, we want to solve z 1 1997 = i z 1 z_1^{1997}=i\overline{z_1}

Multiplying both sides by z 1 z_1 gives z 1 1998 = i z 1 z_1^{1998}=i||z_1||

But z 1 = 1 ||z_1||=1 since r = 1 r=1 . Thus, z 1 1998 = i z_1^{1998}=i

This is a polynomial with degree 1998 1998 ; thus, there must be 1998 \boxed{1998} solutions.

Cody Johnson once posted the same problem, but with 2014 instead of 1997.

Bogdan Simeonov - 6 years, 11 months ago

Should it not be 1999 because a1=b1=0 is also a trivial solution

Sushant Vijayan - 6 years, 11 months ago

Log in to reply

You bring up a good point.

EDIT: I was about to ask abhishek to edit it when I just realized I can edit it myself :P

I added the non-zero condition and also the fact that the sequences must be real.

Daniel Liu - 6 years, 11 months ago
Finn Hulse
Jun 29, 2014

This is from the 1997 Turkish MO. I'm one to talk, but please at least give credit. If you're going to take a problem from somewhere else, at least change it a little bit. :O

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...