Two real sequences { a n } n = 0 ∞ , { b n } n = 0 ∞ are defined as follows a 1 = α and b 1 = β , a n + 1 = α a n − β b n b n + 1 = β a n + α b n For all n ≥ 2 . How many non-zero pairs ( α , β ) of real numbers are there such that a 1 9 9 7 = b 1 and b 1 9 9 7 = a 1 ?
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.
Cody Johnson once posted the same problem, but with 2014 instead of 1997.
Should it not be 1999 because a1=b1=0 is also a trivial solution
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.
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
Problem Loading...
Note Loading...
Set Loading...
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 θ and β = r sin θ
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
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 )
Letting a n + i b n = z n , we see z n + 1 = r cis θ ( z n )
Then, since z 1 = r cis θ we have
z n = ( r cis θ ) n = z 1 n
Note that because a 1 9 9 7 = b 1 and b 1 9 9 7 = a 1 , we must have ∣ ∣ z 1 9 9 7 ∣ ∣ = ∣ ∣ z 1 ∣ ∣ . Thus, r = 1 .
Now we just need to find a way to represent a 1 9 9 7 = b 1 and b 1 9 9 7 = a 1 .
Note that z 1 1 9 9 7 = a 1 9 9 7 + i b 1 9 9 7 = b 1 + i a 1 = i z 1
Where the middle inequality makes sure that a 1 9 9 7 = b 1 and b 1 9 9 7 = a 1 is satisfied.
Thus, we want to solve z 1 1 9 9 7 = i z 1
Multiplying both sides by z 1 gives z 1 1 9 9 8 = i ∣ ∣ z 1 ∣ ∣
But ∣ ∣ z 1 ∣ ∣ = 1 since r = 1 . Thus, z 1 1 9 9 8 = i
This is a polynomial with degree 1 9 9 8 ; thus, there must be 1 9 9 8 solutions.