query: Modular Exponentiation 8^5^4
positive_passages.docid: 21476
positive_passages.text: Modular Exponentiation 3^5^7
negative_passages.docid: 141704
negative_passages.text: Fractional exponentiation in modular arithmetic
negative_passages.docid: 121122
negative_passages.text: Calculate $2^{5104} \bmod 10$ using mental arithmetic
negative_passages.docid: 36611
negative_passages.text: Algorithms for solving the discrete logarithm $a^x \equiv b\pmod{n}$ when $\gcd(a,n) \neq 1$
negative_passages.docid: 16700
negative_passages.text: Modular reduction of fractions
negative_passages.docid: 36031
negative_passages.text: Finding modular of a fraction
negative_passages.docid: 58368
negative_passages.text: Proof of Unique Solution for Modular Exponentiation In Cryptography
negative_passages.docid: 45882
negative_passages.text: Solving a congruence without Fermat's little theorem
negative_passages.docid: 92197
negative_passages.text: Calculating Non-Integer Exponent
negative_passages.docid: 4140
negative_passages.text: Fermat's Last Theorem with negative exponent
negative_passages.docid: 57846
negative_passages.text: Multiplicative inverse in $\operatorname{GF}(2^8)$?
negative_passages.docid: 82808
negative_passages.text: Do there exist any odd prime powers that can be represented as $n^4+4^n$?
negative_passages.docid: 129381
negative_passages.text: Modular equation problem
negative_passages.docid: 144067
negative_passages.text: calculating $a^b \!\mod c$
negative_passages.docid: 151764
negative_passages.text: modular arithmetic, solving $ax + b \equiv c \pmod d$?
negative_passages.docid: 34192
negative_passages.text: Solve $x^{5} \equiv 2$ mod $221\ $ [Taking modular $k$'th roots if unique]
negative_passages.docid: 109532
negative_passages.text: Proving $5^n \equiv 1 \pmod {2^r}$ when $n=2^{r-2}$