( 1 + 1 0 0 ) + ( 2 + 9 9 ) + ( 3 + 9 8 ) + ( 4 + 9 7 ) + ⋯ + ( 5 0 + 5 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.
I think chew swing method is very interesting
Good solution
S n = 2 n times ( 1 + n ) + ( 2 + n − 1 ) + ( 3 + n − 2 ) + ⋯ + ( 2 n + 2 n + 1 ) For an even ’n’ S n = 2 n times ( 1 + n ) + ( 1 + n ) + ( 1 + n ) + ⋯ + ( 1 + n ) = 2 n ( n + 1 ) S 1 0 0 = 5 0 × 1 0 1 = 5 0 5 0
It is clearly seen that all the terms are 1 0 1 . Since the number of terms is 5 0 , the sum is 1 0 1 ( 5 0 ) = 5 0 5 0
This is equal to the 1 0 0 th triangular number.
The formula for the n th triangular number is 2 n ( n + 1 ) .
So the answer is 2 1 0 0 ∗ 1 0 1 = 5 0 5 0 .
Problem Loading...
Note Loading...
Set Loading...
S = ( 1 + 1 0 0 ) + ( 2 + 9 9 ) + ( 3 + 9 8 ) + ( 4 + 9 7 ) + ⋯ + ( 5 0 + 5 1 ) = 5 0 × 1 0 1 1 0 1 + 1 0 1 + 1 0 1 + 1 0 1 + ⋯ + 1 0 1 = 5 0 5 0