query: How to solve such a modular equation?
positive_passages.docid: 151764
positive_passages.text: modular arithmetic, solving $ax + b \equiv c \pmod d$?
negative_passages.docid: 102204
negative_passages.text: Factoring product of two primes from solutions of congruence
negative_passages.docid: 19071
negative_passages.text: solution set for congruence $x^2 \equiv 1 \mod m$
negative_passages.docid: 18903
negative_passages.text: Finding solutions to equation of the form $1+x+x^{2} + \cdots + x^{m} = y^{n}$
negative_passages.docid: 87976
negative_passages.text: How to solve these series?
negative_passages.docid: 66161
negative_passages.text: How to solve the equation $n^2 \equiv 0 \pmod{584}$?
negative_passages.docid: 143754
negative_passages.text: Finding the solution of the congruence $4x\equiv16\pmod{26}$
negative_passages.docid: 47001
negative_passages.text: Cubic diophantine equation
negative_passages.docid: 15897
negative_passages.text: Solve a congruence $1978^{20}\equiv x\pmod{125}$
negative_passages.docid: 92700
negative_passages.text: How can I solve $x^2 \equiv 19 \pmod {59}$.
negative_passages.docid: 74682
negative_passages.text: How should I solve combination addition like this?
negative_passages.docid: 2027
negative_passages.text: How can I solve the folowing Diophantine equation with two unknowns?
negative_passages.docid: 4972
negative_passages.text: Mod of numbers with large exponents [modular order reduction]
negative_passages.docid: 36611
negative_passages.text: Algorithms for solving the discrete logarithm $a^x \equiv b\pmod{n}$ when $\gcd(a,n) \neq 1$
negative_passages.docid: 102860
negative_passages.text: solve $3x^2 + 6x +1 \equiv 0 \pmod {19}$
negative_passages.docid: 77533
negative_passages.text: What solutions does the equation 4x≡2mod10 have? (Hint, it will have more that one.) What about solutions to an equation ax≡dmodn, where d=gcd(a,n)?
negative_passages.docid: 69858
negative_passages.text: Congruence Equation $3n^3+12n^2+13n+2\equiv0,\pmod{2\times3\times5}$