query: solve a linear congruence
positive_passages.docid: 978
positive_passages.text: Solving $ax \equiv c \pmod b$ efficiently when $a,b$ are not coprime
negative_passages.docid: 70392
negative_passages.text: System of congruences with variable
negative_passages.docid: 21874
negative_passages.text: Solve $x^3+x \equiv 1 \pmod p$
negative_passages.docid: 95033
negative_passages.text: Find the remainder of a number with a large exponent
negative_passages.docid: 39800
negative_passages.text: Existence of solution for a linear system mod 2
negative_passages.docid: 76716
negative_passages.text: Solve an equation in $\mathbb{R}^+$
negative_passages.docid: 19071
negative_passages.text: solution set for congruence $x^2 \equiv 1 \mod m$
negative_passages.docid: 66785
negative_passages.text: Find $\gcd(p^n-1,p^m+1)$.
negative_passages.docid: 2027
negative_passages.text: How can I solve the folowing Diophantine equation with two unknowns?
negative_passages.docid: 35712
negative_passages.text: Solve for n: $\varphi(2n)=\varphi(3n)$
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: 125057
negative_passages.text: How do I solve a problem with term $a^{n} + b^{n}$?
negative_passages.docid: 25174
negative_passages.text: Solve for $A,B$: $\mathrm{LCM}(A,B)=168$, $\mathrm{HCF(A,B)}=12$
negative_passages.docid: 16700
negative_passages.text: Modular reduction of fractions
negative_passages.docid: 52377
negative_passages.text: Find the linear recurrence of degree at most 2 for the following sequence
negative_passages.docid: 35167
negative_passages.text: Prove congruence using fermat's thm
negative_passages.docid: 94965
negative_passages.text: Solve $x\equiv 1\pmod2$, $x\equiv 2\pmod3$, $x\equiv 3\pmod4$, $x\equiv 4\pmod5$, $x\equiv 5\pmod6$ and $x\equiv 0\pmod7$