query: How to solve a quintic congruence equation?
positive_passages.docid: 156786
positive_passages.text: Show that $15\mid 21n^5 + 10n^3 + 14n$ for all integers $n$.
negative_passages.docid: 133925
negative_passages.text: Find All Solutions to System of Congruence
negative_passages.docid: 22200
negative_passages.text: When a congruence system can be solved?
negative_passages.docid: 35167
negative_passages.text: Prove congruence using fermat's thm
negative_passages.docid: 8481
negative_passages.text: System of congruence relations
negative_passages.docid: 69234
negative_passages.text: Solving Diophantine equation $1/x^2+1/y^2=1/z^2$
negative_passages.docid: 80058
negative_passages.text: Three variable, third degree Diophantine equation
negative_passages.docid: 91881
negative_passages.text: How solve this equation
negative_passages.docid: 42032
negative_passages.text: Find all solutions to $x^2\equiv 1\pmod {91},\ 91 = 7\cdot 13$
negative_passages.docid: 80817
negative_passages.text: Solving equations of the form $ae^x + bx +c =0$
negative_passages.docid: 18903
negative_passages.text: Finding solutions to equation of the form $1+x+x^{2} + \cdots + x^{m} = y^{n}$
negative_passages.docid: 46668
negative_passages.text: How to find integer solutions to $M^2=5N^2+2N+1$?
negative_passages.docid: 66161
negative_passages.text: How to solve the equation $n^2 \equiv 0 \pmod{584}$?
negative_passages.docid: 155012
negative_passages.text: Solving quadratic equations in modular arithmetic
negative_passages.docid: 134654
negative_passages.text: How to apply CRT to a congruence system with moduli not coprime?
negative_passages.docid: 152591
negative_passages.text: For which prime numbers $p$ does the congruence $x^2 + x + 1 \equiv 0 \pmod{p}$ have solutions?
negative_passages.docid: 18245
negative_passages.text: How to check if a system of congruence is solvable?