query: Flawed strong induction of $2^a = 2$.
positive_passages.docid: 154133
positive_passages.text: Flawed proof by induction that $a^{n-1}=1$
negative_passages.docid: 71918
negative_passages.text: Mathematical Induction
negative_passages.docid: 145274
negative_passages.text: Prove by induction $\sum \frac {1}{2^n} < 1$
negative_passages.docid: 135807
negative_passages.text: I'm having trouble with a proof by induction
negative_passages.docid: 12857
negative_passages.text: Induction proof: $S$ contains powers of 2 and predecessors implies $S={\bf N}$
negative_passages.docid: 83778
negative_passages.text: An incorrect proof by exhaustion
negative_passages.docid: 134319
negative_passages.text: When induction proofs need a choice function
negative_passages.docid: 40692
negative_passages.text: Proving by strong induction that $\forall n \ge 2, \;\forall d \ge 2 : d \mid n(n+1)(n+2)...(n+d-1) $
negative_passages.docid: 136274
negative_passages.text: $n! \leq \left( \frac{n+1}{2} \right)^n$ via induction
negative_passages.docid: 143968
negative_passages.text: Proving this inequality by mathematical induction
negative_passages.docid: 44906
negative_passages.text: Use induction to prove that $2^n$ divides $(2n)!$ for any $n\in\mathbb{Z}_{\geq0}.$
negative_passages.docid: 2197
negative_passages.text: Induction principle for $n!<n^n$
negative_passages.docid: 100759
negative_passages.text: Extending exponentiation to reals
negative_passages.docid: 47697
negative_passages.text: Russell's paradox: a set cannot contain its own powerset
negative_passages.docid: 135509
negative_passages.text: Proof writing: how to write a clear induction proof?
negative_passages.docid: 60678
negative_passages.text: Does 'A countable infinite Cartesian product of countable sets is not necessarily countable' violate induction principle?
negative_passages.docid: 68308
negative_passages.text: A (probably trivial) induction problem: $\sum_2^nk^{-2}\lt1$