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
4065 Views
See similar Further Mathematics A Level tutorsRelated Further Mathematics A Level answers
All answers ▸Let E be an ellipse with equation (x/3)^2 + (y/4)^2 = 1. Find the equation of the tangent to E at the point P where x = √3 and y > 0, in the form ax + by = c, where a, b and c are rational.
Given that the equation x^2 - 2x + 2 = 0 has roots A and B, find the values A + B, and A * B.
Convert the general complex number z=x+iy to modulus-argument form.
Find the modulus-argument form of the complex number z=(5√ 3 - 5i)