query: Solve a congruence relation
positive_passages.docid: 15897
positive_passages.text: Solve a congruence $1978^{20}\equiv x\pmod{125}$
negative_passages.docid: 152118
negative_passages.text: Solve the recurrent relation
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: 61825
negative_passages.text: Congruence class $[a]$ modulo $m$, $\gcd(x, m) = \gcd(a, m)$
negative_passages.docid: 52530
negative_passages.text: There exists a prime congruent to $m$ mod $p$
negative_passages.docid: 35167
negative_passages.text: Prove congruence using fermat's thm
negative_passages.docid: 57654
negative_passages.text: Congruent Modulo $n$: definition
negative_passages.docid: 94017
negative_passages.text: If p is a prime and a ∈Z. How do we prove that the congruence x^x ≡ a (mod p) is solvable?
negative_passages.docid: 21874
negative_passages.text: Solve $x^3+x \equiv 1 \pmod p$
negative_passages.docid: 48949
negative_passages.text: Solving a Diophantine equation with a large solution
negative_passages.docid: 62455
negative_passages.text: Prove Equivalence Relation in G
negative_passages.docid: 42754
negative_passages.text: Modular arithmetic: division, fractions, solving linear congruences
negative_passages.docid: 14809
negative_passages.text: Existence & uniqueness of solutions of linear congruences $\ cx\equiv b\pmod m$
negative_passages.docid: 70460
negative_passages.text: How can I solve the following sequence
negative_passages.docid: 79485
negative_passages.text: Problem with solving systems of linear congruence of two variables
negative_passages.docid: 92700
negative_passages.text: How can I solve $x^2 \equiv 19 \pmod {59}$.
negative_passages.docid: 40892
negative_passages.text: How to solve a linear congruence $8n+9\equiv 0\pmod{\!1163}$