This topic i find to be one of the more tougher chapters of Further Maths.
Mathematical Induction is a maemqtical process used to prove a given mathematical statement as true. Unfortunately, it is hard to write in mathematical terms on a blog (especially if youare posting from an iPad2. heh) but i will just try to gget to the basic idea.
First you take the mathematical statement to be proved given to you, and you
1) Assume it true for n=k. Just substitute k in place of n in that equation.
2) Prove it true for n=k+1. Replace n with k+1 and solve. You may need to substitute stuff from another equation which you may have previously worked out in that question.
3) Show that its true for n=1.
Conclusion: "Hence true for all positive integral values of n."
Although systematic, these questions can be pretty tough and require really good algebraic manipulation skills.
Try the past papers.
No comments:
Post a Comment