SOLUTION: Prove that n^3 + (n+1)^3 + (n+2)^3 is divisible by 9 for all n in Natural numbers. I have tried, let mathematical induction, let P(n) be the statement, then then n^9

SOLUTION: Prove that n^3 + (n+1)^3 + (n+2)^3 is divisible by 9 for all n in Natural numbers. I have tried, let mathematical induction, let P(n) be the statement, then then n^9 - n is divisi

Question 97923This question is from textbook Intro to Real Analysis
: Prove that n^3 + (n+1)^3 + (n+2)^3 is divisible by 9 for all n in Natural numbers. I have tried, let mathematical induction, let P(n) be the statement, then then n^9 - n is divisible by 9. I'm stuck...
Thanks This question is from textbook Intro to Real Analysis

Found 2 solutions by aaaaaaaa, mathslover:
Answer by aaaaaaaa(138) (Show Source): You can put this solution on YOUR website!
"x mod y" is short for "remainder of the division of x by y". Iff "x mod y" is 0, x is divisible by y. In our case, y = 9.

(mod 9) =
(mod 9)=
(mod 9) =
(mod 9)
9n^2 is always divisible by 9, so we shouldn't worry about that term. The same goes for the "+9" at the end, and the "+9n" at the middle.
(mod 9) =
(mod 9)

Therefore,
P(x) = (mod 9) = 0
is equivalent to
S(x) = (mod 9) = 0

Now suppose S(n) is true. I'll try to prove that S(n+1) is also true.
(mod 9) =
(mod 9) =
(mod 9) =
(mod 9) =
(mod 9)
But wait, if S(n) is true, then
(mod 9) = (mod 9)

The inductive step is done. Now we need to check the base case of natural numbers (which is 0)
(mod 9) =
(mod 9)
S(x) is therefore true for all naturals.

Answer by mathslover(157) (Show Source): You can put this solution on YOUR website!
We prove it through mathematical induction
for n =1
P(n)= 1^3 + 2^3 + 3^3
= 36 which is divisble by 9
hence P(1) is true
Let it be true for n=m
P(m) is true
We have to now prove that it is true for n=m+1

given P(m+1) = (m+1)^3 + (m+2)^3 + (m+3)^3
= (m+1)^3 + (m+2)^3 + m^3 + 9m^2 + 27m + 27 Expanding the last term
= [ m^3 + (m+1)^3 + (m+2)^3 ] + 9m^2 + 27m + 27 Rearranging and grouping
= P(m) + 9(m^2+ 3m +3)
the expression above is also divisible by 9 as P(m) is divisble by 9 and
9(m^2+ 3m +3) is divisble by 9.
Hence it is true for all n . Proof by induction complete

RELATED QUESTIONS
Pls help USE MATHEMATICAL INDUCTION TO PROVE THAT (n+1)^n < 2n^2 for all natural... (answered by ikleyn)
Prove by mathematical induction that: 2^2n - 1 is divisible by 3 for all positive... (answered by Edwin McCravy)
Prove that 8^n - 3^n is divisiible by 5 for all natural numbers n. Do i use... (answered by sdmmadam@yahoo.com)
How to prove {{{n^2-n+14}}} is divisible by 2 using mathematical induction given it's... (answered by Edwin McCravy)
prove that the sum of all natural numbers divisible by 5 is equal to 5n(n+1)/2 using... (answered by Edwin McCravy)
Hello, could I please have some help with this question, Prove by mathematical... (answered by KMST)
Prove by mathematical induction: ∑_(i=1)^n (3^i= 3(3^n-1)/2) (answered by Edwin McCravy)
Use Mathematical Induction to show that the following statement is true for all natural... (answered by stanbon,math_helper,ikleyn)
Use mathematical induction to prove each statement is true for all positive integers n:... (answered by math_helper)