⎩ ⎨ ⎧ a n = a n − 1 a n − 2 − b n − 1 b n − 2 b n = b n − 1 a n − 2 + a n − 1 b n − 2
Two sequences a n and b n begin with values a 1 = b 1 = a 2 = b 2 = 1 and satisfy the recursive relations above for n > 2 .
Find a 2 0 1 5 b 2 0 1 5 .
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.
I did not understand
Great problem and explanation!
mention[1195613:Otto Bretscher]
Consider the sequence { c n } formed as c n = a n + b n i (where i is the imaginary unit). Observe that
c n + 2 = a n + 2 + b n + 2 i = ( a n + 1 a n − b n + 1 b n ) + ( b n + 1 a n + a n + 1 b n ) i = a n + 1 a n + ( b n + 1 i ) ( b n i ) + a n ( b n + 1 i ) + a n + 1 ( b n i ) = ( a n + 1 + b n + 1 i ) ( a n + b n i ) = c n + 1 c n
This looks like the Fibonacci recurrence, but in product form (the ( n + 2 ) -th term is the product of the ( n + 1 ) -th term and the n -th term instead of their sum). In fact, since c 1 = c 2 = ( 1 + i ) , we can show by simple induction that c n = ( 1 + i ) F n , where F n is the n -th Fibonacci number. (The base case n = 1 , 2 is trivial; c n + 2 = c n + 1 c n = ( 1 + i ) F n + 1 ( 1 + i ) F n = ( 1 + i ) F n + 1 + F n = ( 1 + i ) F n + 2 .)
All complex numbers can be represented in polar coordinates as r cis θ = r cos θ + r sin θ ⋅ i for suitable r , c . Note that c 2 0 1 5 = a 2 0 1 5 + b 2 0 1 5 i , thus a 2 0 1 5 = r cos θ , b 2 0 1 5 = r sin θ , and so a 2 0 1 5 b 2 0 1 5 = r cos θ r sin θ = tan θ . Thus it suffices to determine the argument θ . Moreover, since we only care about tan θ and tan is periodic modulo π = 1 8 0 ∘ , it suffices to compute θ m o d 1 8 0 ∘ . (Here a m o d b means a real r , 0 ≤ r < b , such that b a − r is an integer. Also, I use degrees instead of radians because it's easier to type. Sheesh.)
For a complex number z = r cis θ , remember that z n = r n cis n θ . In our case, c 2 0 1 5 = ( 1 + i ) F 2 0 1 5 = ( 2 cis 4 5 ∘ ) F 2 0 1 5 , so c 2 0 1 5 = ( 2 ) F 2 0 1 5 cis F 2 0 1 5 ⋅ 4 5 ∘ . Thus θ = F 2 0 1 5 ⋅ 4 5 ∘ .
We need to compute θ m o d 1 8 0 ∘ . However, we know that 4 5 ∘ divides θ , thus we can move it out:
θ m o d 1 8 0 ∘ = ( F 2 0 1 5 ⋅ 4 5 ∘ ) m o d ( 4 ⋅ 4 5 ∘ ) = 4 5 ∘ ⋅ ( F 2 0 1 5 m o d 4 )
Thus it suffices to compute F 2 0 1 5 m o d 4 .
Observe that the Fibonacci sequence modulo 4 is periodic with period 6 : 1 , 1 , 2 , 3 , 1 , 0 , 1 , 1 , … . After 1 , 1 occurs again, the entire sequence is guaranteed to be periodic, since the Fibonacci sequence only depends on the previous two terms. Thus we know that F n + 6 ≡ F n ( m o d 4 ) .
This way, we know that 2 0 1 5 = 3 3 5 ⋅ 6 + 5 , so F 2 0 1 5 ≡ F 5 ≡ 1 ( m o d 4 ) . Thus θ = 4 5 ∘ ⋅ 1 = 4 5 ∘ , and a 2 0 1 5 b 2 0 1 5 = tan θ = tan 4 5 ∘ = 1 .
Great clear explanation! What motivated considering complex numbers?
Challenge Master: I saw that if we have a n = cos θ n , b n = sin θ n , then the equations are conveniently condensed into cos θ n + 2 = cos ( θ n + 1 + θ n ) and sin θ n + 2 = sin ( θ n + 1 + θ n ) . Of course, since cos 2 θ + sin 2 θ = 1 but 1 2 + 1 2 = 2 , I can't just apply this, so I need to tweak it. Initially my idea was along the lines of a n = c x n for suitable c , but it doesn't work either... until I'm reminded that complex numbers also involve cosines and sines.
Exactly! Thank you for the clear and detailed explanation!
Log in to reply
Nice recursion exercise, Sir Otto! I'm surprised it's rated as Level-1?!
Find first 5 or 10 terms of both the sequences. You will get the same terms on 5th and 10th position. Brilliantly made😆 sequence.
Problem Loading...
Note Loading...
Set Loading...
With problems like this we generally look to find a closed form for the sequences a n and b n . However, since we need only find a 2 0 1 5 b 2 0 1 5 it can sometimes be easier to find a closed form for the sequence a n b n . We begin with the recurrence relation: a n b n = a n − 1 a n − 2 − b n − 1 b n − 2 b n − 1 a n − 2 + a n − 1 b n − 2 = 1 − a n − 1 a n − 2 b n − 1 b n − 2 a n − 1 b n − 1 + a n − 2 b n − 2 This has the structure of the angle sum formula for tan . Since the range of tan is R , let a n b n = tan θ n , and then we have: a n b n = tan θ n = 1 − tan θ n − 1 tan θ n − 2 tan θ n − 1 + tan θ n − 2 = tan ( θ n − 1 + θ n − 2 ) That is, the sequence θ n = θ n − 1 + θ n − 2 , and since a 1 b 1 = a 2 b 2 = 1 this sequence starts with θ 1 = θ 2 = 4 π . This satisfies the same recurrence relation as the Fibonacci numbers, and so θ n = F n 4 π , where F n is the nth Fibonacci number.
Thus a 2 0 1 5 b 2 0 1 5 = tan ( F 2 0 1 5 4 π ) . Since tan has a period of π , we need only calculate F 2 0 1 5 m o d 4 . The Fibonacci numbers, modulo 4 are: 1 , 1 , 2 , 3 , 1 , 0 , 1 , 1 , … Since this sequence is periodic with period 6, and 2 0 1 5 ≡ 5 ( m o d 6 ) , we have F 2 0 1 5 m o d 4 = 1 . Thus: a 2 0 1 5 b 2 0 1 5 = tan 4 π = 1