Conceptual
Browse Instruct Curate
Login

Proof by Mathematical Induction in Discrete Mathematics

Establishing a statement indexed by the positive integers by proving a base case and an implication from each index to the next, including the strong form that assumes the statement for all smaller indices. Typical use is verifying an algebraic identity whose shape depends on an integer parameter, where the inductive step consists of substituting the identity already proved for smaller parameters and simplifying.