# Induction Problem (Polya)

Tags:
1. Jul 3, 2016

### EternusVia

1. The problem statement, all variables and given/known data

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.

2. Relevant equations

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$$
3. The attempt at a solution

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: Jul 3, 2016
2. Jul 3, 2016

### Math_QED

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

3. Jul 3, 2016

### EternusVia

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