query: Identifying a Modular Exponent
positive_passages.docid: 28330
positive_passages.text: Finding x in $a^{x} \bmod  b = c$ when values a,b, and c are known?
negative_passages.docid: 24202
negative_passages.text: The value of the trilogarithm at $\frac{1}{2}$
negative_passages.docid: 36031
negative_passages.text: Finding modular of a fraction
negative_passages.docid: 143754
negative_passages.text: Finding the solution of the congruence $4x\equiv16\pmod{26}$
negative_passages.docid: 144515
negative_passages.text: Equation with high exponents
negative_passages.docid: 151636
negative_passages.text: Fast way to calculate n! mod m where m is prime?
negative_passages.docid: 77878
negative_passages.text: What comes after exponents?
negative_passages.docid: 18767
negative_passages.text: How do you find the modular inverse of $5\pmod{\!11}$
negative_passages.docid: 118778
negative_passages.text: What's the inverse operation of exponents?
negative_passages.docid: 112080
negative_passages.text: Proving the Product Rule for exponents with the same base
negative_passages.docid: 95033
negative_passages.text: Find the remainder of a number with a large exponent
negative_passages.docid: 43683
negative_passages.text: Finding Inverse of 2 (mod m)
negative_passages.docid: 30045
negative_passages.text: Solving linear congruences by hand: modular fractions and inverses
negative_passages.docid: 39969
negative_passages.text: Algorithms for computing multiplicative order modulo $n$
negative_passages.docid: 12280
negative_passages.text: A dilogarithm identity?
negative_passages.docid: 4972
negative_passages.text: Mod of numbers with large exponents [modular order reduction]
negative_passages.docid: 110331
negative_passages.text: How to match exponent that might be 1?