query: Why proof by induction is working.
positive_passages.docid: 16211
positive_passages.text: We all use mathematical induction to prove results, but is there a proof of mathematical induction itself?
negative_passages.docid: 130093
negative_passages.text: Prove by Induction : $n < 2^n$
negative_passages.docid: 72371
negative_passages.text: Proof of Strong Induction Using Well-Ordering Principle
negative_passages.docid: 58481
negative_passages.text: Exclusion Inclusion Principle Induction Proof
negative_passages.docid: 158728
negative_passages.text: Using induction for an easy proof for formal languages
negative_passages.docid: 123757
negative_passages.text: Proving a summation inequality with induction
negative_passages.docid: 145388
negative_passages.text: Structural Induction: Metalogic Proof
negative_passages.docid: 95000
negative_passages.text: Using induction to prove that $2 \mid (n^2 − n)$ for $n\geq 1$
negative_passages.docid: 18301
negative_passages.text: Proof by Induction involving Inequality and Factorials as denominators
negative_passages.docid: 61671
negative_passages.text: Discrete Math: Writing Proofs
negative_passages.docid: 98372
negative_passages.text: Proof of the principle of backwards induction
negative_passages.docid: 118075
negative_passages.text: What does "prove by induction" mean?
negative_passages.docid: 10424
negative_passages.text: Review of a proof for De Moivre's theorem using mathematical induction
negative_passages.docid: 64437
negative_passages.text: Proof by induction (power rule of the derivative)
negative_passages.docid: 153123
negative_passages.text: Proving by induction $4^n  0$
negative_passages.docid: 125220
negative_passages.text: Solving binomial theorem via induction
negative_passages.docid: 61635
negative_passages.text: Proving AM-GM with induction