query: Calculate huge number mod $p$
positive_passages.docid: 4972
positive_passages.text: Mod of numbers with large exponents [modular order reduction]
negative_passages.docid: 13888
negative_passages.text: Large Numbers in Java
negative_passages.docid: 55049
negative_passages.text: How to find the inverse modulo $m$?
negative_passages.docid: 89203
negative_passages.text: What is the fastest (known) algorithm to find the n-th Catalan number mod m?
negative_passages.docid: 48949
negative_passages.text: Solving a Diophantine equation with a large solution
negative_passages.docid: 58803
negative_passages.text: ${n \choose k} \bmod m$ using Chinese remainder theorem?
negative_passages.docid: 108237
negative_passages.text: Show $a^p \equiv b^p \mod p^2$
negative_passages.docid: 71788
negative_passages.text: Prove existence of multiplicative inverse modulo p when p is prime
negative_passages.docid: 57654
negative_passages.text: Congruent Modulo $n$: definition
negative_passages.docid: 96326
negative_passages.text: Number of $q$-th residues modulo $n$
negative_passages.docid: 74898
negative_passages.text: $1^n +2^n + \cdots +(p-1)^n \mod p =$?
negative_passages.docid: 91565
negative_passages.text: How to efficiently compute $\,25^{37}\pmod{55}$?
negative_passages.docid: 156510
negative_passages.text: How to compute $2^{\text{some huge power}}$
negative_passages.docid: 41890
negative_passages.text: How to get all solutions of $x^2 \equiv$ $a$ mod $p$?
negative_passages.docid: 23153
negative_passages.text: $\bmod p\!:\ x^2\equiv 1\iff x\equiv \pm1\ $ for prime $p$
negative_passages.docid: 52530
negative_passages.text: There exists a prime congruent to $m$ mod $p$
negative_passages.docid: 27686
negative_passages.text: How can I generate large prime numbers for RSA?