query: How to solve $x^5\equiv 3 \pmod{19}$?
positive_passages.docid: 34192
positive_passages.text: Solve $x^{5} \equiv 2$ mod $221\ $ [Taking modular $k$'th roots if unique]
negative_passages.docid: 42032
negative_passages.text: Find all solutions to $x^2\equiv 1\pmod {91},\ 91 = 7\cdot 13$
negative_passages.docid: 144802
negative_passages.text: Prove no solution to $x^2\equiv3\bmod5$
negative_passages.docid: 7085
negative_passages.text: Prove that if the equation $x^{2} \equiv a\pmod{pq}$ has any solutions, then it has four solutions.
negative_passages.docid: 45882
negative_passages.text: Solving a congruence without Fermat's little theorem
negative_passages.docid: 15436
negative_passages.text: Find p and q s.t. $({p-1})^{q-1}+({q-1})^{p-1} \equiv 101 \pmod {pq}$
negative_passages.docid: 26301
negative_passages.text: Prove that $x^3 \equiv x \bmod 6$ for all integers $x$
negative_passages.docid: 22029
negative_passages.text: Solving modular arithmetic questions
negative_passages.docid: 107381
negative_passages.text: Understanding the proof of infinitely many primes $\equiv 3\pmod{\!4}$
negative_passages.docid: 21530
negative_passages.text: How many solutions of $\mod 63$ : $x^2=1 \pmod7 $ and $x^3=1\pmod 9$
negative_passages.docid: 60305
negative_passages.text: Proving the congruence $p^{q-1}+q^{p-1} \equiv 1 \pmod{pq}$
negative_passages.docid: 112575
negative_passages.text: Finding integer solutions of $m^2-n^5 = m - n$
negative_passages.docid: 40892
negative_passages.text: How to solve a linear congruence $8n+9\equiv 0\pmod{\!1163}$
negative_passages.docid: 29640
negative_passages.text: If $x \equiv 1 \pmod 3$ and $x \equiv 0 \pmod 2$, what is $x \pmod 6$?
negative_passages.docid: 123441
negative_passages.text: Quadratic congruences problem $(x^2-a)(x^2-b)(x^2-ab)$ ≡ 0 (mod p)
negative_passages.docid: 80843
negative_passages.text: Find all solutions to $x^9 \equiv 25 \pmod {29}$
negative_passages.docid: 46400
negative_passages.text: how do i prove that $17^n-12^n-24^n+19^n \equiv 0 \pmod{35}$