query: Proof of a different (Russian peasant) method of multiplication
positive_passages.docid: 146947
positive_passages.text: A multiplication algorithm found in a book by Paul Erdős: how does it work?
negative_passages.docid: 32350
negative_passages.text: Compilation of proofs for the summation of natural squares and cubes
negative_passages.docid: 16548
negative_passages.text: Prove $(x+y) \text{ mod } n = ((x \text{ mod } n)+(y \text{ mod } n)) \text{ mod } n,\,$ and product analog
negative_passages.docid: 94429
negative_passages.text: Alternative methods to prove that $Z_m$ is a field under addition and multiplication $\bmod\ m$ iff $m$ is a prime
negative_passages.docid: 158249
negative_passages.text: Proof of correctness of a homomorphic ElGamal sum
negative_passages.docid: 128540
negative_passages.text: Formal power series coefficient multiplication
negative_passages.docid: 147111
negative_passages.text: Where is the Proof for the Sum-to-Product rule derrived from?
negative_passages.docid: 64545
negative_passages.text: Continuum between addition, multiplication and exponentiation?
negative_passages.docid: 134896
negative_passages.text: Enlightening proof that the algebraic numbers form a field
negative_passages.docid: 137175
negative_passages.text: Fermat's little theorem proof by Euler
negative_passages.docid: 100759
negative_passages.text: Extending exponentiation to reals
negative_passages.docid: 380
negative_passages.text: Bijection from modular multiplication?
negative_passages.docid: 134687
negative_passages.text: Is there a more elegant way of proving $\langle (1,2)(3,4), (1,2,3,4,5) \rangle = A_5$
negative_passages.docid: 83022
negative_passages.text: Proof of this fairly obscure differentiation trick?
negative_passages.docid: 87267
negative_passages.text: Conjecture similar to Fermat's Theorem.
negative_passages.docid: 31555
negative_passages.text: Divisor of $m$ and $n$ divides $m - qn$ (in proof of Euclidean algorithm)
negative_passages.docid: 360
negative_passages.text: Modular exponentiation by hand ($a^b\bmod c$)