Prove by induction that f(n) = 2^(k + 2) + 3^(3k + 1) is divisible by 7 for all positive n.

First we establish our base case: f(0) = 22 + 31 = 4 + 3 = 7, so clearly f(0) is divisible by 7.Now. by the inductive hypothesis. we assume that f(k) is divisible by 7, and attempt to show that this implies f(k+1) is also divisible by 7.f(k + 1) = 2k + 3 + 32(k + 1) + 1 = 2k + 3 + 32k + 3 = 2 * 2k + 2 + 9 * 32k + 1 So f(k + 1) mod 7 === 2 * 2k + 2 + 2 * 32k + 1 (since 9 mod 7 === 2). So f(k + 1) mod 7 === 2 * (2k + 2 + 32k + 1) = 2 * f(k).These for f(k + 1) mod 7 === 0, hence f(k + 1) is divisible by 7 if f(k) is divisible by 7, hence f(n) is divisibile by 7 for all n >= 0.

WP
Answered by William P. Further Mathematics tutor

2398 Views

See similar Further Mathematics A Level tutors

Related Further Mathematics A Level answers

All answers ▸

Solve the equation 2(Sinhx)^2 -5Coshx=5, giving your answer in terms of natural logarithm in simplest form


How would go about finding the set of values of x for which x+4 > 4 / (x+1)?


Use de Moivre’s theorem to show that, (sin(x))^5 = A sin(5x) + Bsin(3x) + Csin(x), where A , B and C are constants to be found.


Prove by induction that n^3+5n is divisible by 3 for every natural number.


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