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

Prove that 41n14n is a multiple of 27 for all natural numbers.

Open in App
Solution

Let the given statement be P(n), i.e.,
P(n): 41n14n is a multiple of 27.
It can be observed that P(n) is true for n = 1 since 411141=27, which is a multiple of 27.
Let P (k) br true for some positive integer k, i.e.,
41k14k is a multiple of 27
41k14k=27m, where m ϵ N . . . . .(1)
We shall now prove that P(k+1) is true whenever P(k) is true.
Consider
41k+114k+1
=41k.4114k.14
=41(41k14k+14k)14k.14
=41(41k14k)+41.14k14k.14
=41.27m+14k(4114)
=41.27m+27.14k
27(41m14k)
=27×r, where r=(41m14k) is a natural number
Therefore, 41k+114k+1 is a multiple of 27 .
Thus, P(k+1) is true whenever P(k) is true.
Hence, by the principle of mathematical induction, statement P(n) is true for all natural numbers i.e., N.

flag
Suggest Corrections
thumbs-up
11
Join BYJU'S Learning Program
similar_icon
Related Videos
thumbnail
lock
Remainder Theorem
MATHEMATICS
Watch in App
Join BYJU'S Learning Program
CrossIcon