# Math

Use mathematical induction to prove the property for all positive integers n.

A factor of (n^3+3n^2+2n) is 3.

1. 1^3+3*1^2+2*1 = 1+3+2 = 6 = 3*2
so, true for n=1

so, assuming it's true for n=k, work with n=k+1:

(k+1)^3 + 3(k+1)^2 + 2(k+1)
= k^3+3k^2+3k+1 + 3k^2+6k+3 + 2k+2
= k^3+3k^2+2k + 3k+1 + 3k^2+6k+3 + 2
we know that k^3+3k^2+2k is a multiple of 3, so check out the rest. Rearranging things, we have

3k^2+9k+3

This is clearly also a multiple of 3.

So,
P(1)
P(k) => P(k+1)
so P is true for all k.

posted by Steve

## Similar Questions

1. ### Calculus

Use mathematical induction to prove that the statement holds for all positive integers. Also, label the basis, hypothesis, and induction step. 1 + 5 + 9 + … + (4n -3)= n(2n-1)
2. ### AP Calc

Use mathematical induction to prove that the statement holds for all positive integers. Also, can you label the basis, hypothesis, and induction step in each problem. Thanks 1. 2+4+6+...+2n=n^2+n 2. 8+10+12+...+(2n+6)=n^2+7n
3. ### Math

Use mathematical induction to prove that 2^(3n) - 3^n is divisible by 5 for all positive integers. ThankS!
4. ### pre calc

Use mathematical induction to prove that the statement is true for every positive integer n. Show your work. 2 is a factor of n2 - n + 2
5. ### pre-calc

Use mathematical induction to prove that the statement is true for every positive integer n. Show your work. 2 is a factor of n2 -n+2
6. ### pre calc

Use mathematical induction to prove that the statement is true for every positive integer n. Show your work. 2 is a factor of n2 - n + 2
7. ### math

Use mathematical induction to prove that for all integers n ≥ 5, 1 + 4n < 2n
8. ### Math - Mathematical Induction

3. Prove by induction that∑_(r=1)^n▒〖r(r+4)=1/6 n(n+1)(2n+13)〗. 5. It is given that u_1=1 and u_(n+1)=3u_n+2n-2 where n is a positive integer. Prove, by induction, that u_n=3^n/2-n+1/2. 14. The rth term
9. ### Mathematical induction. I'm stuck. So far I have..

For all integers n ≥ 1, prove the following statement using mathematical induction. 1+2^1 +2^2 +...+2^n = 2^(n+1) −1 Here's what I have so far 1. Prove the base step let n=1 2^1=2^(1+1)-1 False. Someone else suggested
10. ### PreCalculus

I tried to do these questions, however I can't seem to get the answer. Can someone help me? I would really appreciate it. _____________________________________ Mathematical Induction Prove that the statement in true for every

More Similar Questions