query: Modular Arithmathics
positive_passages.docid: 16548
positive_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: 47148
negative_passages.text: Complete balanced (signed) residue System of an odd modulo m
negative_passages.docid: 99815
negative_passages.text: Dividing versus multiplying by inverse in modular arithmetic
negative_passages.docid: 79349
negative_passages.text: The Aleph numbers and infinity in calculus.
negative_passages.docid: 60268
negative_passages.text: $\textit{Why}$ the cases in 4 $\nmid n^2 - 3?$ (bases cases in modular induction)
negative_passages.docid: 122698
negative_passages.text: Construction of multiplicative group of complex numbers
negative_passages.docid: 76892
negative_passages.text: Factoring inequalities on Double Summation (Donald Knuth's Concrete Mathematics)
negative_passages.docid: 31162
negative_passages.text: What is the meaning of modular fractions?
negative_passages.docid: 70392
negative_passages.text: System of congruences with variable
negative_passages.docid: 143541
negative_passages.text: Decomposition of an algebraic number into a sum or product of algebraic numbers with smaller degree
negative_passages.docid: 42923
negative_passages.text: A Book for abstract Algebra
negative_passages.docid: 155812
negative_passages.text: A Fermat's FLT look-like for matrices.
negative_passages.docid: 141704
negative_passages.text: Fractional exponentiation in modular arithmetic
negative_passages.docid: 380
negative_passages.text: Bijection from modular multiplication?
negative_passages.docid: 29231
negative_passages.text: Proof of : $x^{n}\equiv x^{\varphi(m)+[n \bmod \varphi(m)]} \mod m$
negative_passages.docid: 360
negative_passages.text: Modular exponentiation by hand ($a^b\bmod c$)
negative_passages.docid: 58368
negative_passages.text: Proof of Unique Solution for Modular Exponentiation In Cryptography