query: Compute large powers a^m mod p; p prime
positive_passages.docid: 4972
positive_passages.text: Mod of numbers with large exponents [modular order reduction]
negative_passages.docid: 125330
negative_passages.text: How to find element g order q, given 2 large primes p and q where q|p-1
negative_passages.docid: 360
negative_passages.text: Modular exponentiation by hand ($a^b\bmod c$)
negative_passages.docid: 10266
negative_passages.text: Minimal polynomial reducible modulo every prime $p$
negative_passages.docid: 119433
negative_passages.text: How to find modulo of large numbers like $9801\! \pmod {\!32}$
negative_passages.docid: 43048
negative_passages.text: When is $2^n \pm 1$ a perfect power
negative_passages.docid: 48949
negative_passages.text: Solving a Diophantine equation with a large solution
negative_passages.docid: 49649
negative_passages.text: How can I find out whether a number is a quadratic residue in a large modulo?
negative_passages.docid: 21476
negative_passages.text: Modular Exponentiation 3^5^7
negative_passages.docid: 31184
negative_passages.text: Sums of powers below a prime
negative_passages.docid: 152231
negative_passages.text: Computing the product of p/(p - 2) over the odd primes
negative_passages.docid: 141085
negative_passages.text: Speed of calculating powers (in python)
negative_passages.docid: 47792
negative_passages.text: Integer coefficient polynomial - values as powers of 2
negative_passages.docid: 109490
negative_passages.text: Modular arithmetic problem (mod $13$)
negative_passages.docid: 41925
negative_passages.text: What is the distribution of primes modulo $n$?
negative_passages.docid: 5206
negative_passages.text: Highest power of a prime $p$ dividing $N!$
negative_passages.docid: 41876
negative_passages.text: Finding an asymptotic for the sum $\sum_{p\leq x}p^m$