Editing ProofByInduction
You are currently browsing as guest..
To change this, fill in the following fields:
Username
Password
Click here to reset your password
Who can read this page?
The World
Members
Council
Admin
You have been granted an edit lock on this page
until Fri Apr 26 21:41:19 2024.
Press
to finish editing.
Who can edit this page?
World editing disabled
Members
Council
Admin
Proof by induction is a proof made by first assuming that a statement is true for a general case (i.e. when EQN:n=k ), then proving that it still holds true for the next case (i.e. when EQN:n=k+1 ) and then proving that it is true for the first (base) case; if the statement /does/ hold for /both/ the base case /and/ the inductive step ( EQN:n=k+1 ), then, by induction, the statement must be true. !! METHOD To prove that something is true for all integers EQN:n{\ge}r : * assume that it is true for EQN:n=k * prove that it remains true for EQN:n=k+1 * prove that it is true for EQN:n=r. !! Examples It would be nice to have some small, clean examples here. Not too many, not too much.