5 0 3 1 , 5 2 4 4 , 5 8 1 9 , 6 9 2 1 6 , …
The above is the sequence { u n = 5 0 0 + 3 n 3 n 2 } with n = 1 , 2 , 3 , 4 , … .
If the largest term of this sequence can be expressed as b a , where a and b are coprime positive integers, find a + b .
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.
Good one there, Anupam!
Why is this level 5? Should be level 1 or 2.
The general term is a n = 3 n 3 + 5 0 0 n 2 . Since a n > 0 , maximum a n occurs when a n 1 is minimum. And the minimum occurs when
d n d ( a n 1 ) d n d ( n 2 3 n 3 + 5 0 0 ) d n d ( 3 n + n 2 5 0 0 ) 3 − n 3 1 0 0 0 3 n 3 ⟹ n = 0 = 0 = 0 = 0 = 1 0 0 0 ≈ 6 . 9 3 4 = 7 the nearest integer.
We check that d n 2 d 2 ( a n 1 ) ∣ ∣ ∣ ∣ n = 3 3 1 0 0 0 > 0 ⟹ a 7 1 is minimum and hence a 7 = 3 ( 7 3 ) + 5 0 0 7 2 = 1 5 2 9 4 9 is maximum.
⟹ a + b = 4 9 + 1 5 2 9 = 1 5 7 8
Note that it is easier to evaluate d n d ( a n 1 ) than d n d a n .
Problem Loading...
Note Loading...
Set Loading...
T h e g e n e r a l t e r m c a n b e w r i t t e n a s T n = 5 0 0 + 3 n 3 n 2 D i f f e r e n t i a t i n g i t w i t h r e s p e c t t o ′ n ′ a n d p u t t i n g d e r i v a t i v e = 0 w e g e t m a x i m a a t n = 7 S i n c e T 7 = 1 5 2 9 4 9 w e g e t a + b = 1 5 7 8