query: Solution of the congruence $103a\equiv 1\mod 101$?
positive_passages.docid: 40892
positive_passages.text: How to solve a linear congruence $8n+9\equiv 0\pmod{\!1163}$
negative_passages.docid: 60305
negative_passages.text: Proving the congruence $p^{q-1}+q^{p-1} \equiv 1 \pmod{pq}$
negative_passages.docid: 129381
negative_passages.text: Modular equation problem
negative_passages.docid: 144067
negative_passages.text: calculating $a^b \!\mod c$
negative_passages.docid: 42754
negative_passages.text: Modular arithmetic: division, fractions, solving linear congruences
negative_passages.docid: 146053
negative_passages.text: Proving identities (mod $pq$) using Fermat's little theorem?
negative_passages.docid: 61825
negative_passages.text: Congruence class $[a]$ modulo $m$, $\gcd(x, m) = \gcd(a, m)$
negative_passages.docid: 12210
negative_passages.text: Show that $a^{61} \equiv a\pmod{1001}$ for every $a \in \mathbb{N}$
negative_passages.docid: 152591
negative_passages.text: For which prime numbers $p$ does the congruence $x^2 + x + 1 \equiv 0 \pmod{p}$ have solutions?
negative_passages.docid: 73238
negative_passages.text: Show that $a^{q-1} \equiv 1 \pmod{pq}$
negative_passages.docid: 43567
negative_passages.text: Some hints for "If a prime $p = n^2+5$, then $p\equiv 1\mod 10$ or $p\equiv 9\mod 10$"
negative_passages.docid: 80843
negative_passages.text: Find all solutions to $x^9 \equiv 25 \pmod {29}$
negative_passages.docid: 6837
negative_passages.text: How to quotient $\mathbb Z [\sqrt{-11}] / (1+\sqrt{-11})$?
negative_passages.docid: 22200
negative_passages.text: When a congruence system can be solved?
negative_passages.docid: 11989
negative_passages.text: $ac\equiv bc \pmod{\!m}\!\!\iff\!\! a\equiv b \pmod{\!\!\frac{m}{(c,m)}}$ [Euclid's Lemma, congruence form]
negative_passages.docid: 154944
negative_passages.text: Quadratic congruence in $ \mathbb{Z}/187\mathbb{Z},\ 187 =11\cdot 17 $
negative_passages.docid: 36713
negative_passages.text: Solving multiple congruences by CRT = Chinese Remainder Theorem