See what we can offer to your school
"SimpleStudy just makes sense...”
Get the best plan for your school
9 cards from this deck
A technique to prove statements true for all natural numbers or specified integers
Natural numbers (n∈Nn \in \mathbb{N}n∈N) or subset of integers
Sequences, inequalities, or formulas
3 steps
Verify statement is true for initial value of nnn
Assume P(k)P(k)P(k) is true for some k≥n0k \ge n_0k≥n0
The assumption that P(k)P(k)P(k) is true for some k≥n0k \ge n_0k≥n0
Use inductive hypothesis to prove P(k+1)P(k+1)P(k+1) is true
The inductive hypothesis
Select your subjects, and get access to A+ resources today.