Prove by induction that 6^n + 4 is divisible by 5 for all integers n >= 1

As is the case with all induction questions, we first need to show that the result is true for the base case, in this case n = 1.If n = 1, we have that the LHS = 61 + 4 = 10, which is indeed divisible by 5, so the result holds for n = 1.The next step is to assume the result to be true for some n = k, where k is an integer >= 1. In other words, we assume that6k + 4 is divisible by 5 for some k.Next we let n = k+1. In this step we show that if it is true for n = k, then the result also holds for n = k+1.If n = k+1, we have that th LHS = 6k+1 + 4 = 6 * 6k + 4 = 6*(6k+ 4) - 20. We know that the first term is divisible by 5 by assumption, since we assumed 6k + 4 was divisible by 5. We also know that 20 is a multiple of 5, so the RHS can be written as the sum of 2 multiples of 5, which is divisible by 5.So if true for n = k, the result is also true for n = k+1. Hence, by induction, since true for n=1, the result must be true for n = 2, n =3, ... so true for all integers n >= 1.

AB
Answered by Adam B. Further Mathematics tutor

10883 Views

See similar Further Mathematics A Level tutors

Related Further Mathematics A Level answers

All answers ▸

How to multiply and divide by complex numbers


The roots of the equation z^3 + 2z^2 +3z - 4 = 0, are a, b and c . Show that a^2 + b^2 +c^2 = -2


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 (n^3)-n is divisible by 3 for all integers n>0 (typical fp1 problem)


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