Answer:
Below.
Explanation:
To prove this for mathematical induction, we will need to prove:
Part 1) That
is a multiple of 6 for n=1.
Part 2) That, if by assuming
is a multiple of 6, then showing
is a multiple of 6.
----------------------------------------------------------------------------------------------
Part 1) If n=1, we have
where 6 is a multiple of 6 since 6 times 1 is 6.
Part 2) A multiple of 6 is the product of 6 and k where k is an integer. So let's assume that there is a value k such that
for some number natural number
.
We want to show that
is a multiple of 6.
![7^(n+1)-1](https://img.qammunity.org/2020/formulas/mathematics/college/9ytc31oa7w749zdekir21sgoftte1qidho.png)
![7^n7^1-1](https://img.qammunity.org/2020/formulas/mathematics/college/3akcx6dzbdyba7etefcav15hmir7nukmp8.png)
![(7)7^n-1](https://img.qammunity.org/2020/formulas/mathematics/college/fcss0zie3wpakecyqj4kzww2coakt8oipp.png)
![(7)7^(n)-7+6](https://img.qammunity.org/2020/formulas/mathematics/college/axlj1w3u7qsrneb4d1hsvdnl954072y0cu.png)
(this is where I applied my assumption)
(factoring with the distributive property)
Since 7k+1 is an integer then 6(7k+1) means that
is a multiple of 6.
This proves that
is a multiple of 6 for all natural n.