query: A congruence equation
positive_passages.docid: 145617
positive_passages.text: Is there any simple trick to solve the congruence $a^{24}\equiv6a+2\pmod{13}$?
negative_passages.docid: 102204
negative_passages.text: Factoring product of two primes from solutions of congruence
negative_passages.docid: 52530
negative_passages.text: There exists a prime congruent to $m$ mod $p$
negative_passages.docid: 144515
negative_passages.text: Equation with high exponents
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: 51153
negative_passages.text: Number of solutions to $x^2\equiv a\pmod m$
negative_passages.docid: 79485
negative_passages.text: Problem with solving systems of linear congruence of two variables
negative_passages.docid: 73020
negative_passages.text: Every integer is congruent to the sum of its digits mod 9
negative_passages.docid: 14809
negative_passages.text: Existence & uniqueness of solutions of linear congruences $\ cx\equiv b\pmod m$
negative_passages.docid: 103304
negative_passages.text: Finding the number of solutions to a diophantine equation
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: 2904
negative_passages.text: Solving linear congruence (modular inverse or fraction) via gcd Bezout equation
negative_passages.docid: 29204
negative_passages.text: $a\equiv\bar a\!\pmod{\!kn}\Rightarrow a\equiv\bar a\!\pmod{\! n};\ $ $(a\bmod kn)\bmod n=a\bmod n.\ $ Congruences persist mod factors of the modulus
negative_passages.docid: 50772
negative_passages.text: Solving a Linear Diophantine Equation
negative_passages.docid: 107990
negative_passages.text: Does there exist an integer $x$ satisfying the following congruences?
negative_passages.docid: 41534
negative_passages.text: A system of logarithmic equations with parameters
negative_passages.docid: 127945
negative_passages.text: Number of solutions to the congruence $x^q \equiv 1 \mod p$.