query: What is the fastest way to calculate (2^n) mod (10^9 + 7)?
positive_passages.docid: 156510
positive_passages.text: How to compute $2^{\text{some huge power}}$
negative_passages.docid: 18767
negative_passages.text: How do you find the modular inverse of $5\pmod{\!11}$
negative_passages.docid: 32381
negative_passages.text: How to calculate $276^{246} \mod 323$ without a calculator?
negative_passages.docid: 61582
negative_passages.text: Find the remainder of $\frac{2^{2014}}{7}$
negative_passages.docid: 143392
negative_passages.text: How to calculate the division and remainder of a big number manually
negative_passages.docid: 145617
negative_passages.text: Is there any simple trick to solve the congruence $a^{24}\equiv6a+2\pmod{13}$?
negative_passages.docid: 72406
negative_passages.text: Last two digits of $2^{1000}$ via Chinese Remainder Theorem?
negative_passages.docid: 79343
negative_passages.text: How to compute the nth root of a very big integer
negative_passages.docid: 68960
negative_passages.text: How to solve $ 13x \equiv 1 ~ (\text{mod} ~ 17) $?
negative_passages.docid: 43683
negative_passages.text: Finding Inverse of 2 (mod m)
negative_passages.docid: 20908
negative_passages.text: How to compute $k$'th roots $\!\bmod n$?
negative_passages.docid: 140172
negative_passages.text: How to compute the Riemann sum of $x^n$ for any positive integer $n$?
negative_passages.docid: 123698
negative_passages.text: Can $2^k + 2^j$ be expressed as $2^n$?
negative_passages.docid: 146066
negative_passages.text: Fastest way to find if a given number is prime
negative_passages.docid: 146274
negative_passages.text: Fastest way to do this double summation?
negative_passages.docid: 75489
negative_passages.text: Solve $x^2$ $mod$ $23 = 7^2$
negative_passages.docid: 72079
negative_passages.text: What are $2222^{5555}+5555^{2222} \pmod 7$ and $9^{2n+1}+8^{n+2} \pmod{73}$?