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

3278 Views

See similar Further Mathematics A Level tutors

Related Further Mathematics A Level answers

All answers ▸

Find the general solution of the differential equation d^2y/dx^2 - 5*dy/dx + 4y = 2x


Let I(n) = integral from 1 to e of (ln(x)^n)/(x^2) dx where n is a natural number. Firstly find I(0). Show that I(n) = -(1/e) + n*I(n-1). Using this formula find I(1).


explain the eigenvalue problem


A spring with a spring constant k is connected to the ceiling. First a weight of mass m is connected to the spring. Deduce the new equilibrium position of the spring, find its equation of motion and hence deduce its frequency f.


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