Question

Use mathematical induction to prove the statement is true for all positive integers n.

The integer n^3 + 2n is divisible by 3 for every positive integer n.

Answer 1

So have you done the base case?

Answer 2

I don't know what that is, so no.

Answer 3

the base case is the first case
you are suppose to check 3|(n^3+2n) for n equals 1

Answer 4

After that:
Assume for some integer k>=1 that 3|(k^3+2k) .
And show 3|((k+1)^3+2(k+1))

Answer 5

I don't mean to be demanding, but if you could just tell me the answer it would be much appreciated.

Answer 6

The base case:
can you try replacing the n with 1
I promise that part isn't tough