SOLUTION: Use mathematical induction to prove the statement is true for all positive integers n. The integer n3 + 2n is divisible by 3 for every positive integer n.

Question 1135570: Use mathematical induction to prove the statement is true for all positive integers n.
The integer n3 + 2n is divisible by 3 for every positive integer n.
Answer by ikleyn(52781) (Show Source): You can put this solution on YOUR website!
.

Let’s prove it using principle of mathematical induction (PMI).


    P(n)=n^3+2n.


For n=1,

    P(1)=1+2=3 which is divisible by 3.

so the base of induction is established.


Now for n=k, assume that

    P(k)=k^3+2k

is divisible by 3.


Then for n=k+1,

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

Since we assumed P(k) to be divisible by 3, therefore P(k+1) is also divisible by 3.


Hence by PMI,  n^3+2n  is divisible by  3  for any integer positive n.

The proof is completed.

RELATED QUESTIONS
Use mathematical induction to prove the statement is true for all positive integers n. (answered by Edwin McCravy)

Use mathematical induction to prove the statement is true for all positive integers n. (answered by ikleyn)

Use mathematical induction to prove each statement is true for all positive integers n:... (answered by math_helper)

use mathematical induction to prove that the statement is true for all positive integers. (answered by t0hierry,greenestamps)

Use mathematical induction to prove the statement is true for all positive integers n.... (answered by ikleyn)

Use mathematical induction to prove the statement is true for all positive integers n.... (answered by math_helper)

Prove by mathematical induction that: 2^2n - 1 is divisible by 3 for all positive... (answered by Edwin McCravy)

use mathematical induction to prove that the following statement is true for every... (answered by ikleyn)