Prove by induction that for all positive integers n , f(n) = 2^(3n+1) + 3*5^(2n+1) , is divisible by 17.
- 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
3813 Views
See similar Further Mathematics A Level tutorsRelated Further Mathematics A Level answers
All answers ▸How do you deal with 3 simultaneous equations? (Struggling with Q7 of AQA specimen paper 1)
What is the value of x from (x+2)^2=4
a) Find the general solution to the differential equation: f(x)=y''-12y'-13y=8. b) Given that when x=0, y=0 and y'=1, find the particular solution to f(x).
Given a curve with parametric equations, x=acos^3(t) and y=asin^3(t), find the length of the curve between points A and B, where t=0 and t=2pi respectively.