query: Fraction modulo $p$ , modular inverses.
positive_passages.docid: 31162
positive_passages.text: What is the meaning of modular fractions?
negative_passages.docid: 41673
negative_passages.text: Solve congruence system $\ x\equiv m_i-1 \pmod{m_i}\,$ for $\,i = 1,\ldots, k$
negative_passages.docid: 94017
negative_passages.text: If p is a prime and a ∈Z. How do we prove that the congruence x^x ≡ a (mod p) is solvable?
negative_passages.docid: 64453
negative_passages.text: Prove if $(a,p)=1$, then $\{a,2a,3a,...,pa\}$ is a complete residue system modulo $p$.
negative_passages.docid: 115758
negative_passages.text: Remainder of division when $p$ is not prime
negative_passages.docid: 15314
negative_passages.text: Number of solutions to $x^n \equiv 1 \mod p$
negative_passages.docid: 51161
negative_passages.text: Finding the inverse of 84 mod 5
negative_passages.docid: 122741
negative_passages.text: $x^2$ is congruent to $-1 \bmod p$
negative_passages.docid: 20161
negative_passages.text: Prove that the multiplicative inverse of $a$ modulo $m$ exists if and only if $a$ and $m$ are coprime.
negative_passages.docid: 21476
negative_passages.text: Modular Exponentiation 3^5^7
negative_passages.docid: 152231
negative_passages.text: Computing the product of p/(p - 2) over the odd primes
negative_passages.docid: 134450
negative_passages.text: Chinese Remainder Theorem $\ x\equiv m_k-2\pmod{m_k}$
negative_passages.docid: 99037
negative_passages.text: Prove the sum of all numbers that do not have a multiplicative inverse mod $n$
negative_passages.docid: 109490
negative_passages.text: Modular arithmetic problem (mod $13$)
negative_passages.docid: 1576
negative_passages.text: Finding the elements in the group of units of the ring of integers modulo n that are their own inverse.
negative_passages.docid: 73238
negative_passages.text: Show that $a^{q-1} \equiv 1 \pmod{pq}$
negative_passages.docid: 127816
negative_passages.text: Number theory proof mod p