Thursday, 11 April 2019

Prove 7 divides $15^n+6$ with mathematical induction



Prove that for all natural numbers statement n, statement is dividable by 7



$$15^n+6$$



Base. We prove the statement for $n = 1$



15 + 6 = 21 it is true




Inductive step.



Induction Hypothesis. We assume the result holds for $k$. That is, we assume that



$15^k+6$



is divisible by 7



To prove: We need to show that the result holds for $k+1$, that is, that




$15^{k+1}+6=15^k\cdot 15+6$



and I don't know what to do


Answer



Observe that $14$ is divisible by 7. Then let $15^k\cdot 15+6=15^k\cdot 14+ 15^k+6$.


No comments:

Post a Comment

real analysis - How to find $lim_{hrightarrow 0}frac{sin(ha)}{h}$

How to find $\lim_{h\rightarrow 0}\frac{\sin(ha)}{h}$ without lhopital rule? I know when I use lhopital I easy get $$ \lim_{h\rightarrow 0}...