I was wondering if someone can show me step by step on how to do this question:

Prove that for all integers n >= 1, 6|n (n^2 + 5)

So far I got the bases step for when n = 1.

I am having troubles with the induction step after n = 1.

Printable View

- Dec 10th 2011, 02:47 PMxboxweeMathematical Induction
I was wondering if someone can show me step by step on how to do this question:

Prove that for all integers n >= 1, 6|n (n^2 + 5)

So far I got the bases step for when n = 1.

I am having troubles with the induction step after n = 1. - Dec 10th 2011, 02:50 PMProve ItRe: Mathematical Induction
- Dec 10th 2011, 02:52 PMxboxweeRe: Mathematical Induction
Yes.

- Dec 10th 2011, 03:05 PMProve ItRe: Mathematical Induction
The base step is obvious.

For the inductive step, assume that 6 divides , in other words, write where is some other positive integer.

Then we need to show that 6 divides

Q.E.D. - Dec 10th 2011, 03:15 PMxboxweeRe: Mathematical Induction
would this be right?

- Dec 10th 2011, 03:17 PMxboxweeRe: Mathematical Induction
Thanks..

- Dec 10th 2011, 03:27 PMProve ItRe: Mathematical Induction
No it's not a complete proof, as you have not shown that your final line is divisible by 6. In fact, you have not used your assumption at all.

Also, the writing of your base step is atrocious.

is a STATEMENT, that 6 divides . It can NOT be used in equations.

You would need to write something like

If then which is divisible by 6.