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

Related Further Mathematics A Level answers

All answers ▸

Solve (z-i)+(z+i)+(z-1)+(z-1)


For a homogeneous second order differential equation, why does a complex conjugate pair solution (m+in and m-in) to the auxiliary equation result in the complementary function y(x)=e^(mx)(Acos(nx)+Bisin(nx)), where i represents √(-1).


What are the conditions required for the poisson distribution?


Find the volume of revolution about the x-axis of the curve y=1/sqrt(x^2+2x+2) for 0<x<1