log inhelp

 | 

  • If you are citizen of an European Union member nation, you may not use this service unless you are at least 16 years old.

  • You already know Dokkio is an AI-powered assistant to organize & manage your digital files & messages. Very soon, Dokkio will support Outlook as well as One Drive. Check it out today!

View
 

PROOF BY INDUCTION

Page history last edited by Steph Richards 9 years, 8 months ago

When a Mathematical statement is assumed to be true for values of n which are POSITIVE INTEGERS we can use

 

PROOF BY INDUCTION

 

PROOF BY INDUCTION BY TARA

 

 

PROOF BY INDUCTION IS OFTEN DESCRIBED AS A "DOMINO EFFECT"

 

ANY proof by Induction requires the three steps:

 

Step 1: Prove that it is true for n=1.

Step 2: Make the ASSUMPTION that the statement is true for some value of n=k.

Step 3: USING the ASSUMPTION, prove that the statement is also true for n=k+1.

 

PROOF BY INDUCTION can take various different forms.

 

PROOF OF THE SUMMATION OF SERIES FORMULA.

 

Use of Induction to prove DIVISIBILITY.

 

See a mini video on the proof by induction of THE BINOMIAL SERIES

 

NOTES THAT COULD BE USEFUL FROM MATHSHELPER

 LINK TO FP1 WJEC PAST PAPERS

 

INTERACTIVE RESOURCES ON PROOF BY INDUCTION FROM UNIVERSITY OF PLYMOUTH

 

WJEC PAST PAPER QUESTIONS

JAN 2008 FP1  
   

 

Comments (0)

You don't have permission to comment on this page.

Printable version