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
Answered by Salma E. Further Mathematics tutor

3370 Views

See similar Further Mathematics A Level tutors

Related Further Mathematics A Level answers

All answers ▸

Given the equation x^3-12x^2+ax-48=0 has roots p, 2p and 3p, find p and a.


Find a vector that is normal to lines L1 and L2 and passes through their common point of intersection where L1 is the line r = (3,1,1) + u(1,-2,-1) and L2 is the line r = (0,-2,3) + v(-5,1,4) where u and v are scalar values.


By Differentiating from first principles, find the gradient of the curve f(x) = x^2 at the point where x = 2


Why is the integral of 1/sqrt(1-x^2)dx = sin^{-1}(x)?


We're here to help

contact us iconContact ustelephone icon+44 (0) 203 773 6020
Facebook logoInstagram logoLinkedIn logo

MyTutor is part of the IXL family of brands:

© 2026 by IXL Learning