Question
Question: Prove that \({{3}^{2n}}+7\) is multiple of 8 where \(n\in N\).\[\]...
Prove that 32n+7 is multiple of 8 where n∈N.$$$$
Solution
We use the method of induction to prove the given statementPn:8∣32n+7. We prove Pn is true for n=1 that is P1 is true, assume that Pn is true for n=k that is Pk is true and prove that Pn is true for n=k+1 that is Pk+1 is true.$$$$
Complete step-by-step solution:
We know from the induction hypothesis that a statement defined on any natural number n as Pn is true for all values of n if
1\. The statement is true for initial or base value for ex $n=0,1$ or ${{P}_{1}}$ is true.
2. The statement if assumed to be true for n=k(Pk is true) for some natural number k≤n will induct the consecutive statement to be true which means the statement is true for n=k+1(Pk+1 is true)$$$$
So we have to prove P1 is true, assume Pk is true and using Pk have to show Pk+1 is true. So let us denote the given statement asPn. So we havePn: 32n+7 is multiple of 8 or
Pn:8∣32n+7
Now let's check if the statement is true for the initial value n=1 which if P1 is true or not. We have
32(1)+7=32+7=16
We see that 16 is divisible by 8 which means P1 is true. Mathematically, it is true that
P1:8∣32(1)+7
Now let us assume that the statement is true for n=k,k≤n which means it is divisible by 8 or
Pk:8∣32k+7
Now consider for integer p and have,