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 ▸

Prove that 27(23^n)+17(10^2n)+22n is divisible by 11 for n belongs to the natural numbers


Show that the set of real diagonal (n by n) matrices (with non-zero diagonal elements) represent a group under matrix multiplication


A child weighing 50kg is pushed down a 2m long slide (u=0.1), angled at 45 degrees from the horizontal, at 5m/s. At what speed does the child reach the bottom of the slide?


Integrate (4x+3)^1/2 with respect to x.