How do you prove this?
Use induction to prove that 3 divides n^3 + 3n^2 + 2n for every nonnegative integer n.
Follow Math Help Forum on Facebook and Google+
Hello, st4rl1ight! Use induction to prove that 3 divides for every is a multiple of 3.
Verify . . . true!
Assume for some integer
Add to both sides: . . . .
We have proved . . . The inductive proof is compete.
View Tag Cloud