Prove by mathematical induction that 11^n-6 is divisible by 5 for all natural numbers n

First I would do the base case (the first value):Test n=1,111-6=5. 5 is divisible by 5 therefore true for n=1.
Now we assume true for n=k,11k-6 is divisible by 5.Next we test n=k+1,11k+1-6We can rearrange this into 1111k-6= 1011k+11k-6We know that for n=k the result is 11k-6 which we assume to be true so that part can be assumed to be true.The first part can be factorised into 5(2*11k) which is divisible by 5. Therefore we have shown that if true for n=k, true for n=k+1 and as we shown true for n=1 it must also be true for all natural numbers. So we have proved this through induction

Answered by Further Mathematics tutor

2752 Views

See similar Further Mathematics A Level tutors

Related Further Mathematics A Level answers

All answers ▸

Find the solution the the differential equation d^2y/dx^2 + (3/2)dy/dx + y = 22e^(-4x)


Solve the differential equations dx/dt=2x+y+1 and dy/dt=4x-y+1 given that when t=0 x=20 and y=60. (A2 Further pure)


Prove by induction that f(n) = 2^(k + 2) + 3^(3k + 1) is divisible by 7 for all positive n.


How to determine the rank of a matrix?


We're here to help

contact us iconContact usWhatsapp logoMessage us on Whatsapptelephone icon+44 (0) 203 773 6020
Facebook logoInstagram logoLinkedIn logo

© MyTutorWeb Ltd 2013–2025

Terms & Conditions|Privacy Policy
Cookie Preferences