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

Firstly when proving something by induction, we always show that the base case works, i.e. we plug in n=1. In this case we get 42 + 51 =21, which is divisible by 21. Next we state what is called the inductive hypothesis, this just means we assume it is true for n=k, i.e. we assume 4k+1 + 52k-1 is divisible by 21. Now we try to use this to show that the case n=k+1 is also true, in this case we consider 4k+2 + 52(k+1)-1 which can be manipulated as shown below4k+2 +52k+1 = 4* 4k+1 + 55 52k-1 = 4* 4k+! + 4* 52k-1 + 21* 52k-1 = 4*( 4k+1 + 52k-1) + 21* 52k-1Now, as we know that 4k+1 + 52k-1 is divisible by 21, we can see that the expression above is also divisible by 21.Lastly we conclude that because the case n=1 is true and if n=k is true then n=k+1 is true, the statement is true for all natural numbers n.

Related Further Mathematics A Level answers

All answers ▸

Show that the square of any odd integer is of the form (8k+1)


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.


What are the conditions required for the poisson distribution?


A curve has equation y=(2-x)(1+x)+3, A line passes through the point (2,3) and the curve at a point with x coordinate 2+h. Find the gradient of the line. Then use that answer to find the gradient of the curve at (2,3), stating the value of the gradient


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