How do you prove by induction?
First you prove the case n=1 is true. Then you assume that n=k is true, then calculate what n=k+1 is. This should prove true, so that by induction, you have proved that the statement is true for all natural numbers.
PK
Answered by Praveenaa K. • Further Mathematics tutor
4113 Views
See similar Further Mathematics A Level tutorsRelated Further Mathematics A Level answers
All answers ▸Prove by induction that for all positive integers n , f(n) = 2^(3n+1) + 3*5^(2n+1) , is divisible by 17.
A rectangular hyperbola has parametric equations x = 4t, y = 4/t , (z non 0). Points P and Q on this hyperbola have parameters t = 1/4 and t = 2. Find the equation of the line l which passes through the origin and is perpendicular to the line PQ.
Evaluate ∫sin⁴(x) dx by expressing sin⁴(x) in terms of multiple angles
The infinite series C and S are defined C = a*cos(x) + a^2*cos(2x) + a^3*cos(3x) + ..., and S = a*sin(x) + a^2*sin(2x) + a^3*sin(3x) + ... where a is a real number and |a| < 1. By considering C+iS, show that S = a*sin(x)/(1 - 2a*cos(x) + a^2), and find C.