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
4050 Views
See similar Further Mathematics A Level tutorsRelated Further Mathematics A Level answers
All answers ▸Prove by mathematical induction that, for all non-negative integers n, 11^(2n) + 25^n + 22 is divisible by 24
f(x) = 9x^3 – 33x^2 –55x – 25. Given that x = 5 is a solution of the equation f(x) = 0, use an algebraic method to solve f(x) = 0 completely.
Understanding differentiation from first principle.
Use induction to prove that for all positive integers n, f(n)=2^(3n+1)+3x5^(2n+1) is divisible by 17.