query: Efficient way to calculate A^B mod C, where B is high number
positive_passages.docid: 360
positive_passages.text: Modular exponentiation by hand ($a^b\bmod c$)
negative_passages.docid: 139077
negative_passages.text: How to calculate $5^{3^{1000}}\bmod 101$?
negative_passages.docid: 87304
negative_passages.text: Solving for $x$ : $a^x+b^x=c$
negative_passages.docid: 29974
negative_passages.text: is there a way to generate identity or sequence that increments in power of 2?
negative_passages.docid: 125115
negative_passages.text: Simplifying Large Bases with large Exponents
negative_passages.docid: 93094
negative_passages.text: How do I solve this problem on maximizing sum modulo a given number?
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: 51161
negative_passages.text: Finding the inverse of 84 mod 5
negative_passages.docid: 119433
negative_passages.text: How to find modulo of large numbers like $9801\! \pmod {\!32}$
negative_passages.docid: 108237
negative_passages.text: Show $a^p \equiv b^p \mod p^2$
negative_passages.docid: 110703
negative_passages.text: How Can I prove (a+b) mod m = (a mod m) + (b mod m)) mod m?
negative_passages.docid: 20908
negative_passages.text: How to compute $k$'th roots $\!\bmod n$?
negative_passages.docid: 32381
negative_passages.text: How to calculate $276^{246} \mod 323$ without a calculator?
negative_passages.docid: 69136
negative_passages.text: factorization of a^n+1?
negative_passages.docid: 31173
negative_passages.text: How to show $(a^b)^c=a^{bc}$ for arbitrary cardinal numbers?
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: 147600
negative_passages.text: Calculating large Bell number modulo a composite number