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.
48255 Views
See similar Further Mathematics A Level tutorsRelated Further Mathematics A Level answers
All answers ▸What is a complex number?
The infinite series C and S are defined C = a*cos(x) + a^2*cos(2x) + a^3*cos(3x) + ..., and S = a*sin(x) + a^2*sin(2x) + a^3*sin(3x) + ... where a is a real number and |a| < 1. By considering C+iS, show that S = a*sin(x)/(1 - 2a*cos(x) + a^2), and find C.
prove by induction that, f(n) = 2^(3n+1) + 3(5^(2n+1)) is divisible by 17 for all n>0.
The set of midpoints of the parallel chords of an ellipse with gradient, constant 'm', lie on a straight line: find its equation; equation of ellipse: x^2 + 4y^2 = 4