query: Modulo exponentiation invertibility
positive_passages.docid: 20397
positive_passages.text: In RSA, why is it important to choose e so that it is coprime to φ(n)?
negative_passages.docid: 132165
negative_passages.text: "Polynomials" with non-integer exponents
negative_passages.docid: 127664
negative_passages.text: Inverse elements in the absence of identities/associativity.
negative_passages.docid: 21476
negative_passages.text: Modular Exponentiation 3^5^7
negative_passages.docid: 141704
negative_passages.text: Fractional exponentiation in modular arithmetic
negative_passages.docid: 128540
negative_passages.text: Formal power series coefficient multiplication
negative_passages.docid: 56528
negative_passages.text: On the proof of existence and uniqueness of radix representation
negative_passages.docid: 87289
negative_passages.text: Find the multiplicative inverses of all the elements in $\Bbb Z_{16}^\times$
negative_passages.docid: 100759
negative_passages.text: Extending exponentiation to reals
negative_passages.docid: 59398
negative_passages.text: Inverting logarithmic output from VAR model
negative_passages.docid: 20161
negative_passages.text: Prove that the multiplicative inverse of $a$ modulo $m$ exists if and only if $a$ and $m$ are coprime.
negative_passages.docid: 71788
negative_passages.text: Prove existence of multiplicative inverse modulo p when p is prime
negative_passages.docid: 29231
negative_passages.text: Proof of : $x^{n}\equiv x^{\varphi(m)+[n \bmod \varphi(m)]} \mod m$
negative_passages.docid: 134700
negative_passages.text: Fastest way to get a positive modulo in C/C++
negative_passages.docid: 45014
negative_passages.text: Modular exponentiation by repeated squaring
negative_passages.docid: 120627
negative_passages.text: Reducibility of polynomials modulo p
negative_passages.docid: 57846
negative_passages.text: Multiplicative inverse in $\operatorname{GF}(2^8)$?