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

2766 Views

See similar Further Mathematics A Level tutors

Related Further Mathematics A Level answers

All answers ▸

Prove by induction that, for all integers n >=1 , ∑(from r=1 to n) r(2r−1)(3r−1)=(n/6)(n+1)(9n^2 -n−2). Assume that 9(k+1)^2 -(k+1)-2=9k^2 +17k+6


Let A, B and C be nxn matrices such that A=BC-CB. Show that the trace of A (denoted Tr(A)) is 0, where the trace of an nxn matrix is defined as the sum of the entries along the leading diagonal.


Sketch the locus of z on an Argand diagram if arg[(z-5)/(z-3)] = π/6


Prove, by induction, that 4^(n+1) + 5^(2n-1) is always divisible by 21


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