query: Question Concerning Solutions of a Congruence that is Unique Modulo m
positive_passages.docid: 156966
positive_passages.text: Prove that if $b = dk$ where $gcd(m, a) = d$, there are $d$ solutions to $ax \equiv b \mod m$
negative_passages.docid: 74452
negative_passages.text: On a uniqueness proof for solutions of $\ a + x = b\,$ in a group
negative_passages.docid: 96398
negative_passages.text: An integer $a \pmod m$ has inverse if and only if $\gcd(a,m)=1$?
negative_passages.docid: 52530
negative_passages.text: There exists a prime congruent to $m$ mod $p$
negative_passages.docid: 40892
negative_passages.text: How to solve a linear congruence $8n+9\equiv 0\pmod{\!1163}$
negative_passages.docid: 107990
negative_passages.text: Does there exist an integer $x$ satisfying the following congruences?
negative_passages.docid: 78638
negative_passages.text: Find out all solutions of the congruence $x^2 \equiv29 \mod 5$.
negative_passages.docid: 131395
negative_passages.text: Solving linear congruence $2x + 11 \equiv 7 \pmod 3$
negative_passages.docid: 109490
negative_passages.text: Modular arithmetic problem (mod $13$)
negative_passages.docid: 39800
negative_passages.text: Existence of solution for a linear system mod 2
negative_passages.docid: 103304
negative_passages.text: Finding the number of solutions to a diophantine equation
negative_passages.docid: 6332
negative_passages.text: If $p\equiv1\mod{4}$, then $p=a^{2}+b^{2}$ where a and b are uniquely determined
negative_passages.docid: 51153
negative_passages.text: Number of solutions to $x^2\equiv a\pmod m$
negative_passages.docid: 132931
negative_passages.text: Determining the parity of the coefficients of a quadratic given that there is a rational solution
negative_passages.docid: 68252
negative_passages.text: Chinese Remainder Theorem solvability for non-coprime moduli
negative_passages.docid: 35874
negative_passages.text: Show that when $BA = I$, the solution of $Ax=b$ is unique
negative_passages.docid: 4129
negative_passages.text: Solvability of $a \equiv x^2 \mod b$