See what we can offer to your school
"SimpleStudy just makes sense...”
Get the best plan for your school
10 cards from this deck
Prove statements true for all natural numbers
Positive integers: 1,2,3,4,...1, 2, 3, 4, ...1,2,3,4,...
Base case: prove true for n=1n = 1n=1
Assume for n=kn=kn=k, prove for n=k+1n=k+1n=k+1
State true for all n∈Nn \in \mathbb{N}n∈N by induction
Assumption that statement is true for n=kn = kn=k
Three: base case, inductive step, conclusion
∑r=1k+(k+1)\sum_{r=1}^{k} + (k+1)∑r=1k+(k+1)th term
Separate assumed divisible part, show as multiple
Multiple of divisor, e.g. 3A3A3A for integer AAA
Select your subjects, and get access to A+ resources today.