How Does Sum of Consecutive Numbers Relate to Cubes of Integers?

  • Thread starter Thread starter EternusVia
  • Start date Start date
  • Tags Tags
    Induction Proof
EternusVia
Messages
92
Reaction score
10

Homework Statement



Consider the table:

1 = 0 + 1
2 + 3 + 4 = 1 + 8
5 + 6 + 7 + 8 + 9 = 8 + 27
10 + 11 + 12 + 13 + 14 + 15 + 16 = 27 + 64

Guess the general law suggested by these examples, express it in suitable mathematical notation, and prove it.

Homework Equations


[/B]
It's clear that if n is "row" number, then the right-hand side is n^3 + (n+1)^3. The left-hand side is in arithmetic procession, and it can be expressed as [(n+1)^2 + 1] + [(n+1)^2 + 2] + ... + (n+1)^2

The Attempt at a Solution


[/B]
From the equations above, my guess at the general solution is [(n+1)^2 + 1] + [(n+1)^2 + 2] + ... + (n+1)^2=n^3 + (n+1)^3 I verified that this is correct from the back of the book, but I'm having trouble proving it. I've been trying to use induction. The base case holds. Then we want to show that
[((n+1)+1)^2 + 1] + [((n+1)+1)^2 + 2] + ... + (n+1)^2=(n+1)^3 + ((n+1)+1)^3 I'm not sure where to go from here. I tried a few algebraic manipulations, but they didn't seem promising.

SOURCE: Mathematics and Plausible Reasoning by George Polya. Chapter 1, question 2.
 
Last edited:
Physics news on Phys.org
EternusVia said:

Homework Statement



Consider the table:

1 = 0 + 1
2 + 3 + 4 = 1 + 8
5 + 6 + 7 + 8 + 9 = 8 + 27
10 + 11 + 12 + 13 + 14 + 15 + 16 = 27 + 64

Guess the general law suggested by these examples, express it in suitable mathematical notation, and prove it.

Homework Equations


[/B]
It's clear that if n is "row" number, then the right-hand side is n^3 + (n+1)^3. The left-hand side is in arithmetic procession, and it can be expressed as [(n+1)^2 + 1] + [(n+1)^2 + 2] + ... + (n+1)^2

The Attempt at a Solution


[/B]
From the equations above, my guess at the general solution is [(n+1)^2 + 1] + [(n+1)^2 + 2] + ... + (n+1)^2=n^3 + (n+1)^3 I verified that this is correct from the back of the book, but I'm having trouble proving it. I've been trying to use induction. The base case holds. Then we want to show that
[((n+1)+1)^2 + 1] + [((n+1)+1)^2 + 2] + ... + (n+1)^2=(n+1)^3 + ((n+1)+1)^3 I'm not sure where to go from here. I tried a few algebraic manipulations, but they didn't seem promising.

Indeed, induction is often used to proof things like this. However, you might want to use the following formula: https://en.wikipedia.org/wiki/Arithmetic_progression#Sum
 
  • Like
Likes EternusVia
Math_QED said:
Indeed, induction is often used to proof things like this. However, you might want to use the following formula: https://en.wikipedia.org/wiki/Arithmetic_progression#Sum

That worked! I would post the process, but it follows almost immediately from applying the formula for the sum of an arithmetic progression.

Thank you
 
  • Like
Likes member 587159
Thread 'Use greedy vertex coloring algorithm to prove the upper bound of χ'
Hi! I am struggling with the exercise I mentioned under "Homework statement". The exercise is about a specific "greedy vertex coloring algorithm". One definition (which matches what my book uses) can be found here: https://people.cs.uchicago.edu/~laci/HANDOUTS/greedycoloring.pdf Here is also a screenshot of the relevant parts of the linked PDF, i.e. the def. of the algorithm: Sadly I don't have much to show as far as a solution attempt goes, as I am stuck on how to proceed. I thought...
Back
Top