For any positive integer n, the expression 6n−1 is divisible by
If we check the options we find that only 5 can divide the expression for n=1. To be sure if the expression is divisible by 5 for any value of n we will have to use the principle of mathematical induction.
So, let for any n≥1, let Pn be the statement that 6n−1 is divisible by 5.
Base Case––––––––––––. The statement P1 says that
61 − 1 = 6 − 1 = 5
is divisible by 5, which is true.
Inductive Step–––––––––––––––––. Fix k≥1, and suppose that Pk holds, that is, 6k−1 is divisible by 5.
It remains to show that Pk+1 holds, that is, that 6k+1−1 is divisible by 5.
6k+1−1=6(6k)−1
= 6(6k−1)−1+6
= 6(6k−1)+5.
By Pk, the first term 6(6k−1) is divisible by 5, the second term is clearly divisible by 5. Therefore the left hand side is also divisible by 5. Therefore Pk+1 holds.
Thus by the principle of mathematical induction, for all n≥1, Pn holds.