query: Then there exists a unique natural number $b$ less than $p$ such that $ab \equiv 1 \pmod{p}$.
positive_passages.docid: 18108
positive_passages.text: Show if $(a,p)=1$ there is a unique inverse of $a$ modulo $p$
negative_passages.docid: 66851
negative_passages.text: If $p,q$ are primes $(pq,a)=1$ and $p-1|q-1$ then prove $a^{q-1}\equiv 1\pmod{pq}$
negative_passages.docid: 87267
negative_passages.text: Conjecture similar to Fermat's Theorem.
negative_passages.docid: 59442
negative_passages.text: Are there $a,b>1$ with $a^4\equiv 1 \pmod{b^2}$ and $b^4\equiv1 \pmod{a^2}$?
negative_passages.docid: 63182
negative_passages.text: For every $n \ge 1$ there exist uniquely determined integers $a \gt 0$ and $b \gt 0$ such that $n = a^2b$ where $b$ is square-free.
negative_passages.docid: 127901
negative_passages.text: If $x^2+y^2 \equiv 0\pmod{p}$, then $p \equiv 1 \pmod{4}$
negative_passages.docid: 36043
negative_passages.text: If $ab \equiv r \pmod{p}$, and $x^2 \equiv a \pmod{p}$ then $y^2 \equiv b \pmod{p}$ for which condition of $r$?
negative_passages.docid: 73238
negative_passages.text: Show that $a^{q-1} \equiv 1 \pmod{pq}$
negative_passages.docid: 110383
negative_passages.text: How many numbers less than $m$ and relatively prime to $n$, where $m>n$?
negative_passages.docid: 124333
negative_passages.text: A bijection between $\mathbb{N}$ and $\mathbb{P}(\mathbb{N})$?
negative_passages.docid: 30725
negative_passages.text: Why are naturals < modulus equal if congruent? [uniqueness of remainder]
negative_passages.docid: 145752
negative_passages.text: Aut $\mathbb Z_p\simeq \mathbb Z_{p-1}$
negative_passages.docid: 30630
negative_passages.text: Proving ${n \choose p} \equiv \Bigl[\frac{n}{p}\Bigr] \ (\text{mod} \ p)$
negative_passages.docid: 125868
negative_passages.text: Prove $a \equiv b \pmod{c} \implies a^n \equiv b^n \pmod{c}$.
negative_passages.docid: 111505
negative_passages.text: Proof $\binom{p-1}{k}\equiv (-1)^k \mod{p}$
negative_passages.docid: 59261
negative_passages.text: If $n\in\Bbb Z^+$ is not a square, prove exist infinitely many primes $p$ such that $\left(\frac{n}{p}\right)=-1$.
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