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.

GS
Answered by Graeme S. Further Mathematics tutor

8811 Views

See similar Further Mathematics A Level tutors

Related Further Mathematics A Level answers

All answers ▸

Solve the second order differential equation d^2y/dx^2 - 4dy/dx + 5y = 15cos(x), given that when x = 0, y = 1 and when x = 0, dy/dx = 0


Find the modulus and argument of the complex number 1+2i


Given that f(x)=2sinhx+3coshx, solve the equation f(x)=5 giving your answers exactly.


Using graphs, show how the Taylor expansion can be used to approximate a trigonometric function.


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