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
Related Further Mathematics A Level answers
All answers ▸Show that cosh^2(x)-sinh^2(x)=1
Prove by induction that f(n) = 2^(k + 2) + 3^(3k + 1) is divisible by 7 for all positive n.
Let E be an ellipse with equation (x/3)^2 + (y/4)^2 = 1. Find the equation of the tangent to E at the point P where x = √3 and y > 0, in the form ax + by = c, where a, b and c are rational.
Differentiate arcsin(2x) using the fact that 2x=sin(y)