Prove by induction that 11^n - 6 is divisible by 5 for all positive integer n.

Let P(n) be the statement that 11n - 6 is divisible by 5.

BASE CASE: Let n = 1.  This gives 111 - 6 = 5, obviously divisible by 5, therefore we know that P(1) is true.

HYPOTHOSIS STEP: Assume that P(k) is true for some positive integer k.  We can write this a different way: 11k – 6 = 5m where m is also a positive integer.

INDUCTION STEP: We will now show that P(k+1) is true.

P(k+1) states that 11k+1 – 6 is divisible by 5.

11k+1 – 6 = 11 * (11k) – 6  

                = 11* (6 + 5m) – 6  (now we use our hypothesis step, with rearranged expression 11k = 6 + 5m)

                = 55m + 60   (multiplying out the brackets gives)

                = 5 * (11m + 12)  (now factorising again)

Which shows that this is a factor of 5 and that P(k+1) is true.

CONCLUSION: Since P(k+1) is true given P(k), and we know that P(1) is true, we have proved by induction that P(n) is true for all positive integer n.

SH
Answered by Sally H. Further Mathematics tutor

44736 Views

See similar Further Mathematics A Level tutors

Related Further Mathematics A Level answers

All answers ▸

The quadratic equation x^2-6x+14=0 has roots alpha and beta. a) Write down the value of alpha+beta and the value of alpha*beta. b) Find a quadratic equation, with integer coefficients which has roots alpha/beta and beta/alpha.


Find the eigenvalues and eigenvectors of the matrix M , where M{2,2} = (1/2 2/3 ; 1/2 1/3) Hence express M in the form PDP^-1 where D is a diagonal matrix.


Prove that the sum of squares of the first n natural numbers is n/6(n+1)(2n+1)


Simplify (2x^3+8x^2+17x+18)/(x+2)


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