Prove:
Using mathemetical induction:
P(n) =
for n=1
P(n) = = 6
It is divisible by 2 and 3
Now, for n=k,
P(k) =
Assuming P(k) is divisible by 2 and 3:
Now, for n=k+1:
P(k+1) =
P(k+1) =
P(k+1) =
Since, we assumed that P(k) is divisible by 2 and 3, therefore, P(k+1) is also
divisible by 2 and 3.
Hence, by mathematical induction, P(n) = is divisible by 2 and 3 for all positive integer n.