wiz-icon
MyQuestionIcon
MyQuestionIcon
1
You visited us 1 times! Enjoying our articles? Unlock Full Access!
Question

For every positive integer n, prove that 7n3n is divisible by 4.

Open in App
Solution

Step (1): Assume given statement
Let the given statement be P(n), i.e.
P(n):7n3n is divisible by 4.

Step (2): Checking statement P(n) for n=1
Put n=1 in P(n), we get
=7131=73=4 which is divisible by 4.
Thus, P(n) is true for n=1.

Step (3): P(n) for n=K
Put n=K in P(n), and assume that P(K) is true for some
natural number K i.e.
P(K)=7K3K is divisible by 4.
We can write
7K3K=4d, where dN (1)

Step (4): Checking statement P(n) for n=K+1
Now, we shall prove that P(K+1) is true whenever P(K) is true.We have
7K+13K+1
=7K+173K+73K3K+1
=7(7K3K)+3K(73)
=7(4d)+43K
=4(7d+3K)
From the last line, we can see that
7K+13K+1 is divisible by 4.
Thus, P(K+1) is true when P(K) is true.
Final Answer:
Therefore, by principle of Mathematical Induction, the statement P(n) is true for every positive integer n.

flag
Suggest Corrections
thumbs-up
0
Join BYJU'S Learning Program
Join BYJU'S Learning Program
CrossIcon