query: Find $7^{1\,000\,000\,000\,000\,000} \bmod{107}$
positive_passages.docid: 360
positive_passages.text: Modular exponentiation by hand ($a^b\bmod c$)
negative_passages.docid: 31856
negative_passages.text: Find $a^{2013} + b^{2013} + c^{2013}$
negative_passages.docid: 75489
negative_passages.text: Solve $x^2$ $mod$ $23 = 7^2$
negative_passages.docid: 17609
negative_passages.text: Finding the remainder of $11^{2013}$ divided by $61$
negative_passages.docid: 23153
negative_passages.text: $\bmod p\!:\ x^2\equiv 1\iff x\equiv \pm1\ $ for prime $p$
negative_passages.docid: 107008
negative_passages.text: Find the remainder when $45!$ is divided by $47$?
negative_passages.docid: 22512
negative_passages.text: Find the value of: $\frac{\sqrt{45} + \sqrt{18}} {\sqrt{7+2\sqrt{10}}}$
negative_passages.docid: 139659
negative_passages.text: Find all $n$ with $\!\bmod n\!:\, a\,$ invertible $\Rightarrow a^{-1} \equiv a,\,$ i.e. $a^2\equiv 1$
negative_passages.docid: 58803
negative_passages.text: ${n \choose k} \bmod m$ using Chinese remainder theorem?
negative_passages.docid: 29231
negative_passages.text: Proof of : $x^{n}\equiv x^{\varphi(m)+[n \bmod \varphi(m)]} \mod m$
negative_passages.docid: 35484
negative_passages.text: A question in math mode
negative_passages.docid: 110460
negative_passages.text: find remainder of a number
negative_passages.docid: 151636
negative_passages.text: Fast way to calculate n! mod m where m is prime?
negative_passages.docid: 51826
negative_passages.text: Last digits number theory. $7^{9999}$?
negative_passages.docid: 15436
negative_passages.text: Find p and q s.t. $({p-1})^{q-1}+({q-1})^{p-1} \equiv 101 \pmod {pq}$
negative_passages.docid: 18767
negative_passages.text: How do you find the modular inverse of $5\pmod{\!11}$
negative_passages.docid: 140342
negative_passages.text: $\frac {1}{5}-\frac{1.4}{5.10}+\frac{1.4.7}{5.10.15}-\cdot\cdot\cdot\cdot\cdot\cdot\cdot$