Consider the recurrence relation f ( 1 ) + f ( 2 ) + ⋯ + f ( n ) = n 2 × f ( n ) for n = 2 , 3 , … with f ( 1 ) = 2 0 1 6 .
If the value of f ( 2 0 1 6 ) 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.
Om telolet ommmm
Did the same way haha
f ( 1 ) + f ( 2 ) + ⋯ + f ( n − 1 ) = ( n − 1 ) 2 × f ( n − 1 )
f ( 1 ) + f ( 2 ) + ⋯ + f ( n − 1 ) + f ( n ) ( n − 1 ) 2 × f ( n − 1 ) + f ( n ) ( n − 1 ) 2 × f ( n − 1 ) ( n − 1 ) × f ( n − 1 ) f ( n ) f ( n ) f ( n ) = n 2 × f ( n ) = n 2 × f ( n ) = ( n 2 − 1 ) × f ( n ) = ( n + 1 ) × f ( n ) = n + 1 n − 1 × f ( n − 1 ) = n + 1 n − 1 × n n − 2 × n − 1 n − 3 × ⋯ × 5 3 × 4 2 × 3 1 × 2 0 1 6 = n ( n + 1 ) 2 × 2 0 1 6
Putting n = 2 0 1 7
f ( 2 0 1 6 ) f ( 2 0 1 6 ) = 2 0 1 6 ( 2 0 1 6 + 1 ) 2 × 2 0 1 6 = 2 0 1 7 2
a = 2 , b = 2 0 1 7 . a + b = 2 + 2 0 1 7 = 1 9
Problem Loading...
Note Loading...
Set Loading...
The value of f ( 2 ) is
f ( 1 ) + f ( 2 ) = 4 × f ( 2 )
2 0 1 6 + f ( 2 ) = 4 × f ( 2 )
3 × f ( 2 ) = 2 0 1 6
f ( 2 ) = 3 2 0 1 6 = 1 + 2 2 0 1 6
The value of f ( 3 ) is
f ( 1 ) + f ( 2 ) + f ( 3 ) = 9 × f ( 3 )
2 0 1 6 + f ( 2 ) + f ( 3 ) = 9 × f ( 3 )
8 × f ( 2 ) = 2 0 1 6 + 3 2 0 1 6
f ( 3 ) = 6 2 0 1 6 = 1 + 2 + 3 2 0 1 6
So,
f ( x ) = 1 + 2 + . . . + n 2 0 1 6
Then given
f ( 2 0 1 6 ) = 2 0 1 6 × 2 0 1 7 2 0 1 6 × 2
f ( 2 0 1 6 ) = 2 0 1 7 2
Then given
a + b = 2 + 2 0 1 7 = 2 0 1 9