Q.

Show that4n3n1 is divisible by “9”.

see full answer

Start JEE / NEET / Foundation preparation at rupees 99/day !!

21% of IItians & 23% of AIIMS delhi doctors are from Sri Chaitanya institute !!
An Intiative by Sri Chaitanya

(Unlock A.I Detailed Solution for FREE)

Ready to Test Your Skills?

Check your Performance Today with our Free Mock Test used by Toppers!

Take Free Test

Detailed Solution

Let s(n) be a statement 4n3n1is divisible by 9

step-1: If n=1

since 413(1)1=0=9×0 is divisble by 9

s(n) is true for n=1

step-2: Assume that the statement s(n) is true for n=k

i.e 4k3k1 is divisible by 9

then 4k3k1=9m (m is an integer)

4k=9m+3k+1(1)

step-3: We show that the statement s(n) is true
for n=k+1

from (1) we have 4k3k1=9m

4k=9m+3k+14k+13(k+1)1=4k43k31

=(9m+3k+1)43k4

=4×9m+3×3k

=4×9m+9k=9[4m+k]

=9n [N is an integer]

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

by the principle of mathematical induction s(n)
is true for all nN

Watch 3-min video & get full concept clarity

tricks from toppers of Infinity Learn

score_test_img

Get Expert Academic Guidance – Connect with a Counselor Today!

whats app icon