Prove, by contradiction, that, if $n − 1$, $n$, and $n + 1$ are consecutive positive integers, then the cube of the largest cannot be equal to the sum of the cubes of the other two.
Proposition: If $n − 1$, $n$, and $n + 1$ are consecutive positive integers, then the cube of the largest cannot be equal to the sum of the cubes of the other two.
Hypothesis: $n − 1$, $n$, and $n + 1$ are consecutive positive integers.
Conclusion: The cube of the largest cannot be equal to the sum of the cubes of the other two.
My workings
A (Hypothesis): $n − 1$, $n$, and $n + 1$ are consecutive positive integers.
A1 ($\neg B$): The cube of the largest is equal to the sum of the cubes of the other two.
A2: There exists $n \in \mathbb{Z} > 1$ such that $(n + 1)^3 = (n - 1)^3 + n^3$.
A3: $(n+1)^3 = (n - 1)^3 + n^3 $
$\implies (n + 1)(n^2 + 2n + 1) = (n-1)(n^2 - 2n + 1) + n^3$
$\implies n^3 + 2n^2 + n + n^2 + 2n + 1 = n^3 - 2n^2 + n - n^2 + 2n - 1 + n^3$
$\implies n^3 + 3n^2 + 3n + 1 = 2n^3 - 3n^2 + 3n - 1$
$\implies n^3 - 6n^2 - 2 = 0$
A4: $n^3 - 6n^2 - 2 = 0$ where $n \in \mathbb{Z} > 1$.
$\implies 1 - \dfrac{6}{n} - \dfrac{2}{n^3} = 0$
$\implies 1 - \dfrac{6}{n} = \dfrac{2}{n^3}$ where $n \in \mathbb{Z} > 1$.
But there is no $n \in \mathbb{Z} > 1$ such that $1 - \dfrac{6}{n} = \dfrac{2}{n^3}$. Contradiction.
$Q.E.D.$
EDIT: My workings #2
A (Hypothesis): $n − 1$, $n$, and $n + 1$ are consecutive positive integers.
A1 ($\neg B$): The cube of the largest is equal to the sum of the cubes of the other two.
A2: There exists $n \in \mathbb{Z} > 1$ such that $(n + 1)^3 = (n - 1)^3 + n^3$.
A3: $(n+1)^3 = (n - 1)^3 + n^3 $
$\implies (n + 1)(n^2 + 2n + 1) = (n-1)(n^2 - 2n + 1) + n^3$
$\implies n^3 + 2n^2 + n + n^2 + 2n + 1 = n^3 - 2n^2 + n - n^2 + 2n - 1 + n^3$
$\implies n^3 + 3n^2 + 3n + 1 = 2n^3 - 3n^2 + 3n - 1$
$\implies n^3 - 6n^2 - 2 = 0$
A4: $n^3 - 6n^2 - 2 = 0$ where $n \in \mathbb{Z} > 1$.
$\implies n^2(n - 6) - 2 = 0$
$\implies n^2(n - 6) = 2$
A5: $n^2(n - 6) = 2$
$n^2(n - 6) \le 0$ when $6 \ge n > 1$.
$n^2(n - 6) \ge 0$ when $n > 6$
$\therefore$ When $6 \ge n > 1$, $n^2(n - 6) \not = 2$.
A6: $n^2(n - 6) = 2 > 0$
$n^2(n - 6) > 0$
$\implies n - 6 > 0$
$\implies n > 6$
$\therefore \inf(n - 6) = 1$ where $n = 7 > 6$
But $\inf(n^2) = 7^2$ where $n = 7 > 6$
$= 49$
The function $f(n) = n^2(n - 6)$ is continuous, positive, and increasing on the interval $[7, \infty)$.
$\therefore \inf[n^2(n - 6)] = 49(1)$
$= 49 \not = 2$ Contradiction.
$Q.E.D.$
I would greatly appreciate it if people could please take the time to review my proof and provide feedback on its correctness.