0% found this document useful (0 votes)
984 views1 page

Induction Cheat Sheet

The document outlines the steps to prove a statement by mathematical induction, including proving the base case, assuming the statement is true for a number n, and using that to prove it is true for n+1, completing the proof.

Uploaded by

timianey96
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
984 views1 page

Induction Cheat Sheet

The document outlines the steps to prove a statement by mathematical induction, including proving the base case, assuming the statement is true for a number n, and using that to prove it is true for n+1, completing the proof.

Uploaded by

timianey96
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

Induction Cheat Sheet

The method of proof by induction can be used to prove that a given statement 𝑓𝑛 is true
for all positive integers n.

STEP 1

Prove that the statement 𝑓1 is true.


This is known as the basis for the proof by induction.

STEP 2

Assume that the statement 𝑓𝑛 is true for some positive integer n.

STEP 3

Use the assumption made in STEP 2 to prove that the statement 𝑓𝑛+1 is then also true.
This is known as the inductive step.

STEP 4

This completes the proof by induction that the statement 𝑓𝑛 is true for all positive
integers n.

You might also like