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
3770 Views
See similar Further Mathematics A Level tutorsRelated Further Mathematics A Level answers
All answers ▸Find the set of values of x for which (x+4) > 2/(x+3)
The roots of the equation z^3 + 2z^2 +3z - 4 = 0, are a, b and c . Show that a^2 + b^2 +c^2 = -2
Prove that (AB)^-1 = B^-1 A^-1
Evaluate the following product of two complex numbers: (3+4i)*(2-5i)