query: Determine the solution of congruence equations
positive_passages.docid: 30045
positive_passages.text: Solving linear congruences by hand: modular fractions and inverses
negative_passages.docid: 42032
negative_passages.text: Find all solutions to $x^2\equiv 1\pmod {91},\ 91 = 7\cdot 13$
negative_passages.docid: 105302
negative_passages.text: Solutions of bivariate cubic Diophantine equation
negative_passages.docid: 48949
negative_passages.text: Solving a Diophantine equation with a large solution
negative_passages.docid: 60305
negative_passages.text: Proving the congruence $p^{q-1}+q^{p-1} \equiv 1 \pmod{pq}$
negative_passages.docid: 41673
negative_passages.text: Solve congruence system $\ x\equiv m_i-1 \pmod{m_i}\,$ for $\,i = 1,\ldots, k$
negative_passages.docid: 72023
negative_passages.text: Integer solutions of the equation $x^2+y^2+z^2 = 2xyz$
negative_passages.docid: 108035
negative_passages.text: solving diophantine equations using congruences
negative_passages.docid: 51153
negative_passages.text: Number of solutions to $x^2\equiv a\pmod m$
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: 40892
negative_passages.text: How to solve a linear congruence $8n+9\equiv 0\pmod{\!1163}$
negative_passages.docid: 8481
negative_passages.text: System of congruence relations
negative_passages.docid: 2904
negative_passages.text: Solving linear congruence (modular inverse or fraction) via gcd Bezout equation
negative_passages.docid: 155012
negative_passages.text: Solving quadratic equations in modular arithmetic
negative_passages.docid: 61825
negative_passages.text: Congruence class $[a]$ modulo $m$, $\gcd(x, m) = \gcd(a, m)$
negative_passages.docid: 106271
negative_passages.text: Solutions of Diophantine equations in Natural numbers
negative_passages.docid: 153170
negative_passages.text: Find the number of solutions of the equation $e^{4x}+e^{3x}-4e^{2x}+e^x+1=0$