query: Solving a Linear Congruence
positive_passages.docid: 9039
positive_passages.text: What is the best way to solve modular arithmetic equations such as $9x \equiv 33 \pmod{43}$?
negative_passages.docid: 85917
negative_passages.text: Solve $(x+1)^y-x^z=1$
negative_passages.docid: 128107
negative_passages.text: find all $ a \in \mathbb N $ such that $2^a − 1 \equiv 0 \pmod 3$ and $ 4x^2 + 1 \equiv 0 \pmod {\frac{2^a -1}{3}}$ has a solution
negative_passages.docid: 97196
negative_passages.text: $k^{\phi(l)} + l^{\phi(k)} \equiv1\pmod{lk}\,$ if $\,\gcd(l,k)=1$
negative_passages.docid: 139474
negative_passages.text: Solving system of Congruences with Two Variables (x and y)
negative_passages.docid: 22029
negative_passages.text: Solving modular arithmetic questions
negative_passages.docid: 60305
negative_passages.text: Proving the congruence $p^{q-1}+q^{p-1} \equiv 1 \pmod{pq}$
negative_passages.docid: 110408
negative_passages.text: Solving for $A$ in $Ax = b$
negative_passages.docid: 22200
negative_passages.text: When a congruence system can be solved?
negative_passages.docid: 155012
negative_passages.text: Solving quadratic equations in modular arithmetic
negative_passages.docid: 114489
negative_passages.text: Solving $x^p + y^p = p^z$ in positive integers $x,y,z$ and a prime $p$
negative_passages.docid: 40892
negative_passages.text: How to solve a linear congruence $8n+9\equiv 0\pmod{\!1163}$
negative_passages.docid: 84879
negative_passages.text: Solving infinite sums with primes.
negative_passages.docid: 18245
negative_passages.text: How to check if a system of congruence is solvable?
negative_passages.docid: 112390
negative_passages.text: Solutions of $x^2 \equiv 1 \pmod N$
negative_passages.docid: 109461
negative_passages.text: Solving equation involving Euler's totient function
negative_passages.docid: 122832
negative_passages.text: Proof for SSS Congruence?