Methods of Induction and Binomial Theorem — Class 11 Maharashtra HSC Mathematics revision notes
A 4-page visual revision sheet for Methods of Induction and Binomial Theorem, written for Class 11 Maharashtra HSC Mathematics. Formulas, diagrams and the traps that cost marks, laid out to be read the night before rather than the term before. Free, and it opens inside CapCompass.
Page 1 as PDFA preview of page 1 — all 4 pages open full size in the app.
Methods of Induction and Binomial Theorem in one look
prove it for one domino, prove it falls onto the next, and every domino after it is proved too
The four steps of induction
Foundation: prove P(n) is true for n=1 (checking n=2, 3 too is good practice, not required)
Assumption: ASSUME P(n) is true for n=k. Not proved, just the hypothesis the next step uses
Succession: using that assumption, PROVE P(n) is true for n=k+1
Induction: conclude P(n) is true for every positive integer n
Illustration: sum of the first n natural numbers
the statement P(n)1+2+3+…+n=n(n+1)/2
Proving a summation formula by induction
Q. prove 1+2+3+…+n=n(n+1)/2 for all nin N
Foundation, n=1: LHS=1, RHS=1(2)/2=1. Equal, so P(1) is true
These notes are not a standalone PDF. CapCompass plans Mathematics chapter by chapter against your real exam dates and free hours, and when the plan reaches Methods of Induction and Binomial Theorem the sheet opens inside the study block itself — at the page covering the sub-topic that block is on, with the timer still running. Revision arrives at the moment the plan says revise, instead of having to be gone looking for.