query: Winding number is an integer proof.
positive_passages.docid: 142300
positive_passages.text: Winding number (demonstration)
negative_passages.docid: 31890
negative_passages.text: Prove using induction that from a set of $n+1$ numbers from $\{1,2,..2n\}$, at least one number will evenly divide another.
negative_passages.docid: 127033
negative_passages.text: Prove reversal of a string 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: 68430
negative_passages.text: Proving the countability of algebraic numbers
negative_passages.docid: 68233
negative_passages.text: Fermat's little theorem's proof for a negative integer
negative_passages.docid: 133884
negative_passages.text: A proof using Yoneda lemma
negative_passages.docid: 98514
negative_passages.text: Prove by induction that the number of derangements of length $n$ is $D_n = (n-1)(D_{n-1}+D_{n-2}), n>2$
negative_passages.docid: 35650
negative_passages.text: Number theory in Physics
negative_passages.docid: 137711
negative_passages.text: Alternative proof that $[\Bbb{Q}(\zeta_n) : \Bbb{Q} ]= \varphi(n)$ uses circular reasoning?
negative_passages.docid: 122612
negative_passages.text: An integer is a $n$'th power if that holds true for all moduli.
negative_passages.docid: 153123
negative_passages.text: Proving by induction $4^n  0$
negative_passages.docid: 101899
negative_passages.text: Proof By Induction of a Sum
negative_passages.docid: 17269
negative_passages.text: Strong Induction Proof: Fibonacci number even if and only if 3 divides index
negative_passages.docid: 78359
negative_passages.text: Induction and Recursion Proof using Catalan Numbers
negative_passages.docid: 139230
negative_passages.text: Prove that for every positive integer, this polynomial is divisible by 24.
negative_passages.docid: 119889
negative_passages.text: Pile splitting problem (Proof by induction)