Prove by induction that for all positive integers n , f(n) = 2^(3n+1) + 3*5^(2n+1) , is divisible by 17.

  1. Prove the base caseFor n=0, f(0)= 2 + 15 = 17Therefore, when n=0, f(n) is divisible by 17, base case is true2. Assume true for any integerAssume for n=k, f(k) is divisible by 17f(k)= 23k+1 + 3(52k+1) ;3. Work out function for the next integerf(k+1) = 23k+4 + 3(52k+3) = 8(23k+1 + 3(52k+1)) + 25552k255 = 1517, therefore the second term is divisible by 1723k+1 + 3(52k+1) = f(k), so if f(k) is divisible by 17, f(k+1) is divisible by 17.Since f(0) is divisible by 17, and if f(k) is divisible by 17, then f(k+1) is divisible by 17, then f(n) is divisible by 17 for all positive integers.
SE

Related Further Mathematics A Level answers

All answers ▸

find all the roots to the equation: z^3 = 1 + i in polar form


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


A particle is launched from the top of a cliff of height 87.5m at time t=0 with initial velocity 14m/s at 30 deg above the horizontal, Calculate: a) maximum height reached above bottom of cliff; b)horizontal distance travelled before hitting the ground.


3 points lie in a plane; P1=i+2j+3k, P2=-3i+5j+2k, P3=i+2j+k. Find the Cartesian equation of the plane