Can't... Resist... Bashing...

Let the sequence of real numbers { a n } n = 1 k \{a_n\}_{n=1}^{k} be defined as a 1 = 3 a_1 = \sqrt3 , a 2 = 1 a_2 = 1 , and a n + 2 a n a n + 1 a n + 2 = a n + a n + 1 a_{n+2} - a_na_{n+1}a_{n+2} = a_n + a_{n+1} for positive integers 1 n k 2 1 \le n \le k-2 . Find the largest possible positive integer value of k k .


The answer is 9.

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.

3 solutions

Pranshu Gaba
Dec 24, 2013

By rearranging the expression, we get

a n + 2 = a n + a n + 1 1 a n a n + 1 a_{n+2} = \frac{a_{n} + a_{n+1}}{1 - a_{n}a_{n+1}}

This looks like the formula

tan (A + B) = tan A + tan B 1- tan A tanB \textrm{tan (A + B)} = \frac{\textrm{tan A + tan B}}{\textrm{1- tan A tanB}}

Since a 1 = 3 a_{1} = \sqrt{3} , which is tan 6 0 \textrm{tan } 60^{\circ}

and a 2 = 1 a_{2} = 1 , which is tan 4 5 \textrm{tan } 45^{\circ}

Therefore, a 3 = tan ( 6 0 + 4 5 ) = tan 10 5 a_{3} = \textrm{tan } (60^{\circ} + 45^{\circ}) = \textrm{tan } 105^{\circ}

Similarly, a 4 = tan ( 4 5 + 10 5 ) = tan 15 0 a_{4} = \textrm{tan } (45^{\circ} + 105^{\circ}) = \textrm{tan } 150^{\circ}

a 5 = tan ( 10 5 + 15 0 ) = tan 25 5 a_{5} = \textrm{tan } (105^{\circ} + 150^{\circ}) = \textrm{tan } 255^{\circ}

a 6 = tan ( 15 0 + 25 5 ) = tan 40 5 a_{6} = \textrm{tan } (150^{\circ} + 255^{\circ}) = \textrm{tan } 405^{\circ}

a 7 = tan ( 25 5 + 40 5 ) = tan 66 0 a_{7} = \textrm{tan } (255^{\circ} + 405^{\circ}) = \textrm{tan } 660^{\circ}

a 8 = tan ( 40 5 + 66 0 ) = tan 106 5 a_{8} = \textrm{tan } (405^{\circ} + 660^{\circ}) = \textrm{tan } 1065^{\circ}

a 9 = tan ( 66 0 + 106 5 ) = tan 172 5 a_{9} = \textrm{tan } (660^{\circ} + 1065^{\circ}) = \textrm{tan } 1725^{\circ}

a 10 = tan ( 106 5 + 172 5 ) = tan 279 0 a_{10} = \textrm{tan } (1065^{\circ} + 1725^{\circ}) = \textrm{tan } 2790^{\circ}

However, tan \textrm{tan} of odd multiples of 9 0 90^{\circ} is not defined, and 279 0 2790^{\circ} is an odd multiple of 9 0 90^{\circ} , so { a n } n = 1 k \{a_{n}\}^{k}_{n=1} is defined only for 1 n 9 1\leq n \leq 9

Therefore, k = 9 \boxed{k = 9}

Goddammit I got all these but I thought the question was asking for the greatest possible a_n

Liu Tianyi - 7 years, 3 months ago

Log in to reply

Okay...

Finn Hulse - 7 years, 2 months ago
Lee Gao
Dec 31, 2013

This one is tricky. Rearranging the recurrence, I found a computable form: a n + 2 = a n + a n + 1 1 a n a n + 1 a_{n+2} = \frac{a_n + a_{n+1}}{1 - a_na_{n+1}} so clearly we're looking for k k such that a k 1 a k 2 = 1 a_{k-1}a_{k-2} = 1 . I wasn't sure how to proceed with this problem (since there doesn't seem to be a nice way to get the closed form solution of this sequence, so I just computed out a couple of sequences by hand. After a while, I started searching for common functions that produces 3 \sqrt{3} , and a quick google search took me to the trigonometric section. I tried the inverse sin \sin function to no avail, but when I tried the inverse tan \tan function: Bingo, all of the terms were some rational multiple of π \pi !

This got me excited, and a quick search on trigonometric identities gave the following: tan ( b n + b n + 1 ) = tan ( b n ) + tan ( b n + 1 ) 1 tan ( b n ) tan ( b n + 1 ) \tan(b_n + b_{n+1}) = \frac{\tan(b_n) + \tan(b_{n+1})}{1 - \tan(b_n)\tan(b_{n+1})} which has the same structure as our recurrence! This means that the sequence a n a_n can be thought of as the injection of some sequence b n b_n via the tan \tan function! That is, let a n = tan ( b n ) a_n = \tan(b_n) , then a n + 2 = tan ( b n + 2 ) = tan ( b n ) + tan ( b n + 1 ) 1 tan ( b n ) tan ( b n + 1 ) = tan ( b n + b n + 1 ) a_{n+2} = \tan(b_{n+2}) = \frac{\tan(b_n) + \tan(b_{n+1})}{1 - \tan(b_n)\tan(b_{n+1})} = \tan(b_n + b_{n+1}) then, it's easy to see that letting b 1 = arctan ( 3 ) = π 3 b_1 = \arctan(\sqrt{3}) = \frac{\pi}{3} and b 2 = arctan ( 1 ) = π 4 b_2 = \arctan(1) = \frac{\pi}{4} , the sequence b n + 2 = b n + 1 + b n b_{n+2} = b_{n+1} + b_n can be transformed into a n a_n via a n = tan ( b n ) a_n = \tan(b_n) .

But then b n b_n is just the fibonacci sequence, so we can expression b n = f n 2 b 1 + f n 1 b 2 b_n = f_{n-2}b_1 + f_{n-1}b_2 (it would be n-1 and n, but we started our index at one instead of zero). Now, this sequence terminates immediately π 2 b n \frac{\pi}{2}\mid b_n , which occurs at k + 1 = 10 k+1 = 10 because b 10 = 31 π 2 b_{10} = \frac{31\pi}{2} , so k = 9 \boxed{k = 9} .

Akshaj Kadaveru
Dec 25, 2013

Rearranging the given equation gives a n + 2 = a n + a n + 1 1 a n a n + 1 a_{n+2} = \dfrac{a_n + a_{n+1}}{1 - a_n a_{n+1}} . This is exactly the recurrence satisfied by tan ( x ) \tan(x) . We know a 1 = tan ( 60 ) a_1 = \tan(60) , a 2 = tan ( 45 ) a_2 = \tan(45) , so a 3 = tan ( 60 + 45 ) = tan ( 105 ) a 4 = tan ( 45 + 105 ) = tan ( 150 ) a 5 = tan ( 105 + 150 ) = tan ( 255 ) = tan ( 75 ) a 6 = tan ( 150 + 75 ) = tan ( 225 ) = tan ( 45 ) a 7 = tan ( 75 + 45 ) = tan ( 120 ) a 8 = tan ( 45 + 120 ) = tan ( 165 ) a 9 = tan ( 120 + 165 ) = tan ( 105 ) \begin{aligned} a_3 &=& \tan(60 + 45) = \tan(105) \\ a_4 &=& \tan(45 + 105) = \tan(150) \\ a_5 &=& \tan(105 + 150) = \tan(255) = \tan(75) \\ a_6 &=& \tan(150 + 75) = \tan(225) = \tan(45) \\ a_7 &=& \tan(75 + 45) = \tan(120) \\ a_8 &=& \tan(45 + 120) = \tan(165) \\ a_9 &=& \tan(120 + 165) = \tan(105) \end{aligned} However, if a n a_n is defined for n = 10 n=10 , we would have a 10 = tan ( 165 + 105 ) = tan ( 270 ) a_{10} = \tan(165 + 105) = \tan(270) which is undefined. Therefore, a n a_n can only defined up until k = 9 k=9 .

it's a bit confusing that the question states " 1 n k 2 1 \le n \le k-2 " . I got n = 9 n=9 but I entered 11 as the question is asking about largest possible k k

Ali Enteshari - 5 years, 8 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...