An algebra problem by Sakanksha Deo

Algebra Level 4

1 + 27 + 125 + 343 + . . . . . . . . . . . . . 1 + 27 + 125 + 343 + .............

Find the sum of the above series upto 50 0 t h 500^{th} term.


The answer is 124999750000.

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.

1 solution

In general, the sum of the cubes of the first n n odd positive integers is

k = 1 n ( 2 k 1 ) 3 = k = 1 n ( 8 k 3 12 k 2 + 6 k 1 ) = \displaystyle\sum_{k=1}^{n} (2k - 1)^{3} = \sum_{k=1}^{n} (8k^{3} - 12k^{2} + 6k - 1) =

8 k = 1 n k 3 12 k = 1 n k 2 + 6 k = 1 n k k = 1 n 1 = \displaystyle 8\sum_{k=1}^{n} k^{3} - 12\sum_{k=1}^{n} k^{2} + 6\sum_{k=1}^{n} k - \sum_{k=1}^{n} 1 =

8 ( n ( n + 1 ) 2 ) 2 12 n ( n + 1 ) ( 2 n + 1 ) 6 + 6 n ( n + 1 ) 2 n = 8*\left(\dfrac{n(n + 1)}{2}\right)^{2} - 12*\dfrac{n(n + 1)(2n + 1)}{6} + 6*\dfrac{n(n + 1)}{2} - n =

2 n 2 ( n + 1 ) 2 2 n ( n + 1 ) ( 2 n + 1 ) + 3 n ( n + 1 ) n = 2n^{2}(n + 1)^{2} - 2n(n + 1)(2n + 1) + 3n(n + 1) - n =

n ( n + 1 ) [ 2 n ( n + 1 ) 2 ( 2 n + 1 ) + 3 ] n = n(n + 1)[2n(n + 1) - 2(2n + 1) + 3] - n =

n ( n + 1 ) ( 2 n 2 2 n + 1 ) n = n ( 2 n 3 n + 1 ) n = n 2 ( 2 n 2 1 ) . n(n + 1)(2n^{2} - 2n + 1) - n = n(2n^{3} - n + 1) - n = n^{2}(2n^{2} - 1).

Plugging in n = 500 n = 500 gives us a solution of

50 0 2 ( 2 50 0 2 1 ) = 124999750000 . 500^{2}(2*500^{2} - 1) = \boxed{124999750000}.

There's actually a relatively simpler way that uses quite less formulas (only the cube-sum formula).

S n = k = 1 n ( 2 k 1 ) 3 = ( k = 1 2 n k 3 ) ( k = 1 n ( 2 k ) 3 ) S n = ( 2 n ( 2 n + 1 ) 2 ) 2 8 ( n ( n + 1 ) 2 ) 2 S n = n 2 ( 2 n + 1 ) 2 2 n 2 ( n + 1 ) 2 S n = n 2 ( 4 n 2 + 4 n + 1 2 n 2 4 n 2 ) S n = n 2 ( 2 n 2 1 ) S_n=\sum_{k=1}^n(2k-1)^3=\left(\sum_{k=1}^{2n}k^3\right)-\left(\sum_{k=1}^n(2k)^3\right)\\ \implies S_n=\left(\frac{2n(2n+1)}{2}\right)^2-8\left(\frac{n(n+1)}{2}\right)^2\\ \implies S_n=n^2(2n+1)^2-2n^2(n+1)^2\\ \implies S_n=n^2(4n^2+4n+1-2n^2-4n-2)\\ \implies \boxed{S_n=n^2(2n^2-1)}

Prasun Biswas - 6 years, 1 month ago

Log in to reply

That's great, Prasun. I had just come back to this problem to write up this second method to find that you had done it already. :)

Brian Charlesworth - 6 years, 1 month ago

How does the sum function of k^3 =((n(n+1))/2)^2?

Reef Kitaeff - 4 years, 9 months ago

Are you mad or what? So tough calculation. Write on your post that calculator allowed.

Md Zuhair - 4 years, 9 months ago

Log in to reply

I don't see any complicated calculation required. As the above formula shows, the answer for n n terms is 2 n 4 n 2 2n^4 - n^2 . For n = 500 n = 500 , it's trivial to see that n 4 = 625 1 0 8 , n 2 = 25 1 0 4 n^4 = 625 \cdot 10^8, n^2 = 25 \cdot 10^4 , so 2 n 4 n 2 = 125 1 0 9 25 1 0 4 2n^4 - n^2 = 125 \cdot 10^9 - 25 \cdot 10^4 .

Ivan Koswara - 4 years, 9 months ago

Log in to reply

Myne way was bit complicated :)

Md Zuhair - 4 years, 9 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...