If f ( n ) = ( n + ( n + 1 ) ) 2 − n ( n + 1 ) 1 ,
then find f ( 1 ) 1 + f ( 2 ) 1 + f ( 3 ) 1 + . . . + f ( 9 9 ) 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.
F r o m f ( 1 ) = ( 1 + 2 ) 2 − 2 1 L e t 1 = a a n d 2 = b f ( 1 ) = ( a + b ) 2 − a b 1 = a 2 + a b + b 2 1 C o n j u g a t e ; a 2 + a b + b 2 1 × a − b a − b = a 3 − b 3 a − b f ( 1 ) 1 = a − b a 3 − b 3 = − 1 1 3 − 2 3 = − 1 3 + 2 3 S o f ( 1 ) 1 + f ( 2 ) 1 + f ( 3 ) 1 + . . . + f ( 9 9 ) 1 = − 1 3 + 2 3 − 2 3 + 3 3 − 3 3 + 4 3 − . . . − 9 9 3 + 1 0 0 3 = − 1 3 + 1 0 0 3 = 9 9 9 , 9 9 9
In the question shouldn't the squared be outside of the bracket because I thought the first bit was n+ (n+1)^2 and not (n+(n+1))^2 and from the solution, I think you imply the latter.
Question is wrong
Problem Loading...
Note Loading...
Set Loading...
Let g ( x ) = f ( x ) 1
We are asked to find:
n = 1 ∑ 9 9 f ( n ) 1 = n = 1 ∑ 9 9 g ( n )
g ( x ) = ( x + ( x + 1 ) ) 2 − x ( x + 1 ) = ( 2 x + 1 ) 2 − x 2 − 1
= 4 x 2 + 4 x + 1 − x 2 − 1 = 3 x 2 + 3 x + 1
= [ x 3 + 3 x 2 + 3 x + 1 ] − x 3 = ( x + 1 ) 3 − x 3
I express g ( x ) as ( x + 1 ) 3 − x 3 to create what is called a telescoping sum , where successive terms will "cancel out" each other.
n = 1 ∑ 9 9 g ( n ) = n = 1 ∑ 9 9 ( − n 3 + ( n + 1 ) 3 )
= − 1 3 + 2 3 − 2 3 + 3 3 − 3 3 + 4 3 − 4 3 ± … + 9 9 3 − 9 9 3 + 1 0 0 3
= − 1 + 1 0 0 3 = 1 0 0 0 0 0 0 − 1 = 9 9 9 9 9 9