Thread: Maths Induction

Use Mathematical induction to prove these divisibility results for all positive integers n:

is a multiple of 3

Thanks in advance

Originally Posted by deltaxray

Use Mathematical induction to prove these divisibility results for all positive integers n:

is a multiple of 3

Thanks in advance

is a multiple of 3.

let P(m) be true.







=

=

= , which is divisible by 6.

Thus, P(m+1) is true whenever P(m) is true.

Hence, by the principle of mathematical induction, is a multiple of 3 for all positive integers n.