- Show that the sum of the first
nsquares isn(n+1)(2n+1)/6. - I know this is often in the textbook for proof by induction, which is why proof by induction is not allowed.
This is a relatively hard one, take your time.
this post was submitted on 10 May 2024
17 points (94.7% liked)
Daily Maths Challenges
189 readers
1 users here now
Share your cool maths problems.
Complete a challenge:
- Post your solution in comments, if it is exactly the same as OP's solution, let us know.
- Have fun.
Post a challenge:
- Doesn't have to be original, as long as it is not a duplicate.
- Challenges not riddles, if the post is longer than 3 paragraphs, reconsider yourself.
- Optionally include solution in comments, let it be clear this is not a homework help forums.
- Tag [unsolved] if you don't have a solution yet.
- Please include images, if your question includes complex symbols, attach a render of the maths.
Feel free to contribute to a series by DMing the OP, or start your own challenge series.
founded 6 months ago
MODERATORS
you are viewing a single comment's thread
view the rest of the comments
view the rest of the comments
i took the second setup cuz thats what i saw when thinking of the problem, i'll read the first approach later
I did see a third setup where you take Σ (i = 1 to n) (Σ (k = 1 to i) 2k-1), which is a valid setup where you count all the blocks on the top of their column, then remove those and count the new top blocks, etc - but it ended up not leading to a proof of the formula because as it turns out, there are always i^2 (from i = n to 1) blocks on the top layer. So it's just a worse way of doing Σi^2 and we get a 0 = 0 situation.