1 1 3 + + 2 2 3 + + 3 3 3 + + … … + + n n 3 = = 3 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.
Nicely done. One must always verify that there is an integer solution first before jumping to the step 3 0 0 2 = 9 0 0 0 0 .
Can't I use this? Sn=n/2(a1+an)
we already have n=24
a1=1^3 and a24=24^3 S24=(24/2)(1+24^3)=165900
Log in to reply
That formula applies to arithmetic progressions only. First one is, but not the second.
( 1 + 2 + 3 +... + n) = k for any positive integer n and k, so ( 1^3 + 2^3 + 3^3 +... +n^3) = k^2.
Can you explain why it works? Are you sure there's a solution? If I changed 3 0 0 to 2 9 9 , would there still exist a solution? Why or why not?
Lets not complicate it... Lets just take the first 3 terms... 1+2+3=6 ; 1^3+2^3+3^3=36 now to verify the same squared relationship consider first 2 terms... 1+2=3 and 1^3+2^3=9 Yay ! that means answer is getting squared...so square of 30 gives us 90000 ! Peace out !
Great cool very great
1+2+3+......n = n(n+1)/2 ,
1^3 + ........ n^3 = { n(n+1)/2 }^2 ,
given n(n+1)/2 = 300 ,
therefore 1^3+ .........+n^3 = 300^2 ,
which is equal to 90000 ,
in this way they are related
I really don't have a solution, I just input all the terms in the calculator and found 90000. first, I tried 1+2+3+. . . +n, trial and error until I got the 300, where n = 24. then I cube all those terms, from 1 to 24 using my calculator (and the computer's calculator to arrive at the that value)until I got the 90000 and answered the problem. After answering it, I revealed those three solutions and amazed in their solutions. I tried it in my calculator and it really worked. thank you for those, I've learned.
what had I learned? It is not stopping to solve any problems. be it a mathematics or real life one. Maybe they had their easy way, that theirs are so quick and simple as that, but the Important thing is I tried my own and learned from it. (:
*good thing the sum of the terms is only small-- 300. if it's that large like for example, 3,000,000 or that of the avogadro's number, 6.022x10^23 I think, all my life I can't find the answer. hehehe. But I tried.!
Try not to post a comment as a solution. Note that there's only one correct solution (so far). Do you understand the title of this question: "Are they related"?
The way i looked at it is like this1^3+ 2^3 +3^3.....+n^3 is the same as (1+2+3....+n)^3. Because of this, we only need to cube the solution to this huge sequence, 300. 300^3=90000
Why must "1^3+ 2^3 +3^3.....+n^3 is the same as (1+2+3....+n)^3"?
If I changed 3 0 0 to 2 9 9 , would there still exist a solution? Why or why not?
Are you sure that 3 0 0 3 = 9 0 0 0 0 ?
Problem Loading...
Note Loading...
Set Loading...
Reply to Chung Kevin on the remarks/questions to Evan Harahap.
First we will proof:
∑ k = 1 n k = 2 1 n ⋅ ( n + 1 )
∑ k = 1 n k 3 = ( 2 1 n ⋅ ( n + 1 ) ) 2 = ( ∑ k = 1 n k ) 2
Proof of (1)
Let S = ∑ k = 1 n k = 1 + 2 + 3 + … + ( n − 1 ) + n
and writing the terms backwards we get:
S = ∑ k = 1 n k = n + ( n − 1 ) + ( n − 2 ) + … + 2 + 1
Summing both identities of S term by term results in:
2 S = ( 1 + n ) + ( 2 + ( n − 1 ) ) + ( 3 + ( n − 2 ) ) + … + ( n + 1 )
= ( n + 1 ) + ( n + 1 ) + … + ( n + 1 )
Because we have n terms (each one being ( n + 1 ) ) on the righthand side, we have:
2 S = n ⋅ ( n + 1 ) ⇔ S = 2 1 n ⋅ ( n + 1 )
N.B. We could also proof (1) by induction.
Proof of (2)
Let P ( n ) : ∑ k = 1 n k 3 = ( ∑ k = 1 n k ) 2
n = 1 ⇒ ∑ k = 1 1 k 3 = 1 3 = 1 and ( ∑ k = 1 1 k ) 2 = ( 1 ) 2 = 1
Assume P ( n ) is true. Then:
∑ k = 1 n + 1 k 3 = ( ∑ k = 1 n k 3 ) + ( n + 1 ) 3 =
( ∑ k = 1 n k ) 2 + ( n + 1 ) 3 =
( 2 1 n ⋅ ( n + 1 ) ) 2 + ( n + 1 ) 3 =
( 2 1 ) 2 ⋅ n 2 ⋅ ( n + 1 ) 2 + ( n + 1 ) 3 =
( 2 1 ) 2 ⋅ n 2 ⋅ ( n + 1 ) 2 + ( 2 1 ) 2 ⋅ 4 ⋅ ( n + 1 ) 3 =
( 2 1 ) 2 ⋅ ( n + 1 ) 2 ⋅ ( n 2 + 4 ( n + 1 ) ) =
( 2 1 ) 2 ⋅ ( n + 1 ) 2 ⋅ ( n + 2 ) 2 =
( 2 1 ( n + 1 ) ( n + 2 ) ) 2 = P ( n + 1 )
Now for the stated problem:
1 + 2 + … + n = 3 0 0 ⇔
2 1 n ( n + 1 ) = 3 0 0 ⇔
n ( n + 1 ) − 6 0 0 = 0 ⇔
n 2 + n − 6 0 0 = 0 ⇔
( n + 2 5 ) ( n − 2 4 ) = 0 ⇔
n = 2 4 (because n > 0 )
So a solution exists and n = 2 4 gives:
1 3 + 2 3 + 3 3 + … + 2 4 3 =
∑ k = 1 2 4 k 3 =
( ∑ k = 1 2 4 k ) 2 =
( 2 1 ⋅ 2 4 ⋅ ( 2 4 + 1 ) ) 2 = 3 0 0 2 = 9 0 0 0 0