Mathematics Sign up Log in

Questions Tags Users Badges Ask

3 Use induction to prove that n3 + (n + 1)

3
+ (n + 2)
3
is divisible by 9
induction

Prove that for all integers n ≥ 0, n

3
+ (n + 1)
3
+ (n + 2)
3
is divisible by 9.

1. If n = 1, 1 + 8 + 27 = 36 = 9 ∗ x

2. Suppose n = k, k
3
+ (k + 1)
3
+ (k + 2)
3
is divisible by 9.

3. Find out n = k + 1, is divisible by 9.

Because 2 is divisible by 9. if 3 is divisible by 9, 3 - 2 will be divisible by 9

and the result of 3 - 2 = 9(k2 + 3k + 3) which is divisible by 9. So, it is proved.

What I found out the answer so far is them. Are they right way?

Share
Follow

Q123
asked
251 ● 1 ● 4 ● 8 Jan 11 '12 at 3:31

Jonas Meyer
edited
48.5k ● 7 ● 182 ● 286 Jan 11 '12 at 3:36

2 Don't you mean to replace x with 4 in 1? Edit: Also, the notation of using a number to represent an expression and doing
arithmetic that way is terribly confusing.
– Alex Becker
Jan 11 '12 at 3:34

2 is divisible by 9 ?
– Mariano Suárez-Álvarez
Jan 11 '12 at 3:37

@MarianoSuárez-Alvarez I believe he means the expression he lists as 2, that is k3 + (k + 1)

3 3
+ (k + 2) .
– Alex Becker
Jan 11 '12 at 3:49

Add a comment

2 Answers order by
votes

The write up is rather confused; it is particularly bad to use "2" and "3-2" as you do, since it seems
7 you are saying that the number 2 is divisible by 9, that 3 − 2 (that is, that 1) is divisible by 9, etc.

Spend the time writing out complete, coherent, self-contained sentences! Confused writing usually
indicates confused thinking.
More specific comments:

1. Bad use of x in your first step. Better to write out explicitly that 36 is equal to 9 × 4 , hence
divisible by 9.

2. Write out explicitly what your assumption is: namely, your assumption is that there exists an
integer q such that

3 3 3
k + (k + 1) + (k + 2) = 9q.

3. Write out explicitly what you need to prove. Namely, you need to prove that

3 3
(k + 1) + (k + 2)

3
+ (k + 3)  is divisible by 9.

Then you make a very bad mistake: you affirm the consequent. You are trying to prove that the
expression in point 3 is divisible by 9. You assume that it is divisible by 9, and then point out that if
it is divisible by 9, then so is

3 3 3
((k + 1) + (k + 2) + (k + 3) )

3 2 3
− (k + (k + 1) + (k + 2) ).

Then you note that this is indeed divisible by 9, and conclude that the assumption must be true.

This is a logical fallacy. You are saying: "If P , then Q ; since Q is true, then P must be true." If I fall
into a pool, I'll get wet. I'm wet. Therefore, I fell into a pool. (Well, no, there are other reasons why I
may be wet).

Don't assume what you are trying to prove. Deduce it.

Instead, what you want to do is to write out the expression you want, and try to use the fact that
k
3
+ (k + 1)
3
+ (k + 2)
3
is divisible by 9 to conclude the expression you want is divisible by 3.
For instance, you can write:
3 3 3 3 3
(k + 1) + (k + 2) + (k + 3) = (k + 1) + (k + 2)

3 2
+ (k + 9k + 27k + 81)

3 3 3
= k + (k + 1) + (k + 2)

2
+ (9k + 27k + 81)

and go from there to conclude that if k3 + (k + 1)3 + (k + 2)3 is divisible by 9, then

(k + 1) + (k + 2) + (k + 3) is also divisible by 9.
3 3 3

This completes the Inductive Step. Together with the Base (step 1), this establishes the desired
result for all integers.
Share
Follow

Arturo Magidin
answered
343k ● 49 ● 713 ● 1050 Jan 11 '12 at 3:44

amWhy
edited
202k ● 138 ● 259 ● 481 Sep 18 '18 at 16:11

HINT If  9 | f (n + 1) − f (n)  then  9 | f (n)  ⇒  9 | f (n + 1)

1
= (f (n + 1) − f (n)) + f (n)

I.e. mod 9 :  if   f (n + 1) ≡ f (n)  then  f (n) ≡ c  ⇒  f (n + 1) ≡ f (n) ≡ so induction

c 
yields

that f is a constant function, so  f (n) ≡ f (0) ≡ 0

3 3
+ 1 + 2
3
≡ 9

≡ 0 .

This is true in your case since  f (n + 1) − f (n) = (n + 3)

3
− n  
3

2
=  9 (n + 3 n + 3) ≡ 0 .

This is a special case of a proof by telescopy. For many further examples see my prior posts.

Share
Follow

Bill Dubuque
answered
251k ● 36 ● 254 ● 812 Jan 11 '12 at 3:51

Community Bot
edited
1 Apr 13 '17 at 12:21

Your Answer

Body

Add picture

Log in
 OR

Name

Email

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Post Your Answer

meta
chat
tour
help
blog
privacy policy
legal
contact us
cookie settings
full site
2021 Stack Exchange, Inc. user contributions under cc by-sa