Question

Prove by the principle of mathematical induction: 

3²ⁿ + 7 is divisible by 8 for all n ϵ N

Answer 1

Suppose P (n): 3²ⁿ + 7 is divisible by 8 

Now let us check for n = 1,

P (1): 3² + 7 = 9 + 7 = 16

P (n) is true for n = 1. Where, P (n) is divisible by 8

Then, let us check for P (n) is true for n = k, and have to prove that P (k + 1) is true.

P (k): 3^2k + 7 is divisible by 8

: 3^2k + 7 = 8λ

: 3^2k = 8λ – 7 … (i)

Now we have to prove,

3^{2(k + 1)} + 7 is divisible by 8

3^{2k + 2} + 7 = 8μ

Therefore,

= 3^{2(k + 1)} + 7

= 3^2k.3² + 7

= 9.3^2k + 7

= 9.(8λ – 7) + 7 by using equation (i)

= 72λ – 63 + 7

= 72λ – 56

= 8(9λ – 7)

= 8μ

P (n) is true for n = k + 1

Thus, P (n) is true for all n ∈ N.

Comments

perfect,the answer was accuret with all steps shown.