How many terms of the arithmetic progression { 3 , 5 , 7 , … } must there be, in order that their sum is 2 6 0 0 ?
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.
If we have N terms in this arithmetic progression, then we need to compute:
2 N ⋅ [ 3 + 3 + 2 ( N − 1 ) ] = 2 6 0 0 ;
or 2 N ⋅ ( 2 N + 4 ) = 2 6 0 0 ;
o r N 2 + 2 N − 2 6 0 0 = 0 ;
or ( N − 5 0 ) ( N + 5 2 ) = 0 ;
or N = 5 0 , − 5 2 . Since we require N > 0 , the answer is just N = 5 0 .
Problem Loading...
Note Loading...
Set Loading...
Let the number of terms of the arithmetic progression be n . Then the AP is { 3 , 5 , 7 , ⋯ 2 n + 1 } and its sum:
k = 1 ∑ n ( 2 k + 1 ) 2 × 2 n ( n + 1 ) + n n 2 + 2 n n 2 + 2 n + 1 ( n + 1 ) 2 ⟹ n = 2 6 0 0 = 2 6 0 0 = 2 6 0 0 = 2 6 0 1 = 2 6 0 1 = 5 1 2 = 5 0