Solveeit Logo

Question

Question: Prove that \({{3}^{2n}}+7\) is multiple of 8 where \(n\in N\).\[\]...

Prove that 32n+7{{3}^{2n}}+7 is multiple of 8 where nNn\in N.$$$$

Explanation

Solution

We use the method of induction to prove the given statementPn:832n+7{{P}_{n}}:8|{{3}^{2n}}+7. We prove Pn{{P}_{n}} is true for n=1n=1 that is P1{{P}_{1}} is true, assume that Pn{{P}_{n}} is true for n=kn=k that is Pk{{P}_{k}} is true and prove that Pn{{P}_{n}} is true for n=k+1n=k+1 that is Pk+1{{P}_{k+1}} is true.$$$$

Complete step-by-step solution:
We know from the induction hypothesis that a statement defined on any natural number nn as Pn{{P}_{n}} is true for all values of nn 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=kn=k(Pk{{P}_{k}} is true) for some natural number knk\le n will induct the consecutive statement to be true which means the statement is true for n=k+1n=k+1(Pk+1{{P}_{k+1}} is true)$$$$
So we have to prove P1{{P}_{1}} is true, assume Pk{{P}_{k}} is true and using Pk{{P}_{k}} have to show Pk+1{{P}_{k+1}} is true. So let us denote the given statement asPn{{P}_{n}}. So we havePn:{{P}_{n}}: 32n+7{{3}^{2n}}+7 is multiple of 8 or
Pn:832n+7{{P}_{n}}:8|{{3}^{2n}}+7
Now let's check if the statement is true for the initial value n=1n=1 which if P1{{P}_{1}} is true or not. We have
32(1)+7=32+7=16{{3}^{2\left( 1 \right)}}+7={{3}^{2}}+7=16
We see that 16 is divisible by 8 which means P1{{P}_{1}} is true. Mathematically, it is true that
P1:832(1)+7{{P}_{1}}:8|{{3}^{2\left( 1 \right)}}+7
Now let us assume that the statement is true for n=k,knn=k,k\le n which means it is divisible by 8 or
Pk:832k+7{{P}_{k}}:8|{{3}^{2k}}+7
Now consider for integer pp and have,

& {{3}^{2k}}+7=8p \\\ & \Rightarrow {{3}^{2k}}=8p-7.....\left( 1 \right) \\\ \end{aligned}$$ Now we have to prove ${{P}_{k+1}}$ is true which means ${{3}^{2\left( k+1 \right)}}+7$ is divisible by 8 which means ${{3}^{2\left( k+1 \right)}}+7=8q$ for some integer $q$. We have $$\begin{aligned} & {{3}^{2\left( k+1 \right)}}+7={{3}^{2k+2}}+7 \\\ & ={{3}^{2}}\cdot {{3}^{2k}}+7 \\\ \end{aligned}$$ Lets us substitute the value of ${{3}^{2k}}$ obtained in equation (1) and have, $$\begin{aligned} & =9\left( 8p-7 \right)+7 \\\ & =72p-63+7 \\\ & =72p-56 \\\ & =8\left( 9p-7 \right) \\\ \end{aligned}$$ Let us choose $9p-7=q$ and have $$\therefore {{3}^{2\left( k+1 \right)}}+7=8q$$ Hence ${{P}_{k+1}}$ is true which means the stamen is true for all $n\in N$.$$$$ **Note:** We could choose $9p-7=q$ because by closure law subtraction is closed within the set of integers. We can alternatively prove using binomial expression taking ${{3}^{2n}}+7={{\left( 8+1 \right)}^{n}}+7$ and expanding with $x=8,y=1$ as ${{\left( x+y \right)}^{n}}={}^{n}{{C}_{0}}{{x}^{n}}{{y}^{0}}+{}^{n}{{C}_{1}}{{x}^{n-1}}{{y}^{1}}+...+{}^{n}{{C}_{n}}{{x}^{0}}{{y}^{n}}$ . We simplify to express ${{3}^{2n}}+7$ as a multiple of 8.