query: Modular Arithmetic with Multiple Exponents
positive_passages.docid: 360
positive_passages.text: Modular exponentiation by hand ($a^b\bmod c$)
negative_passages.docid: 42754
negative_passages.text: Modular arithmetic: division, fractions, solving linear congruences
negative_passages.docid: 41673
negative_passages.text: Solve congruence system $\ x\equiv m_i-1 \pmod{m_i}\,$ for $\,i = 1,\ldots, k$
negative_passages.docid: 117481
negative_passages.text: How to perform the modular reduce of Rijndael's finite field
negative_passages.docid: 151764
negative_passages.text: modular arithmetic, solving $ax + b \equiv c \pmod d$?
negative_passages.docid: 4140
negative_passages.text: Fermat's Last Theorem with negative exponent
negative_passages.docid: 157771
negative_passages.text: Nested exponent modulus, $2^{2^{517}} \pmod {23}$
negative_passages.docid: 380
negative_passages.text: Bijection from modular multiplication?
negative_passages.docid: 129381
negative_passages.text: Modular equation problem
negative_passages.docid: 131941
negative_passages.text: Solve quadratic congruences.
negative_passages.docid: 8784
negative_passages.text: modulo version of the quadratic formula and Euler's criterion
negative_passages.docid: 9039
negative_passages.text: What is the best way to solve modular arithmetic equations such as $9x \equiv 33 \pmod{43}$?
negative_passages.docid: 21108
negative_passages.text: Perfect squares and modularly congruency in mod 5
negative_passages.docid: 43683
negative_passages.text: Finding Inverse of 2 (mod m)
negative_passages.docid: 94585
negative_passages.text: Solving for a variable that's an exponent
negative_passages.docid: 116730
negative_passages.text: An "elementary" approach to complex exponents?
negative_passages.docid: 46144
negative_passages.text: Understanding imaginary exponents