query: Number theoretic olympiad question involving a diophantine equation
positive_passages.docid: 144863
positive_passages.text: Finding integer solutions to $y^2=x^3-2$
negative_passages.docid: 51153
negative_passages.text: Number of solutions to $x^2\equiv a\pmod m$
negative_passages.docid: 21679
negative_passages.text: Solving $x^3-y^3=xy+61$ in integers
negative_passages.docid: 73512
negative_passages.text: Trigonometry Olympiad Question
negative_passages.docid: 82931
negative_passages.text: How do I solve a linear Diophantine equation with three unknowns?
negative_passages.docid: 143194
negative_passages.text: How would you solve the diophantine $x^4+y^4=2z^2$
negative_passages.docid: 124241
negative_passages.text: Finding all integers $k \geq 2$ such that $k^2 \equiv 5k \pmod{15}$. What is going on here?
negative_passages.docid: 61022
negative_passages.text: Diophantine Equations : Solving $a^2+ b^2=2c^2$
negative_passages.docid: 144571
negative_passages.text: A conjecture including binomial coefficients
negative_passages.docid: 28594
negative_passages.text: Number of integer solutions of the following equation
negative_passages.docid: 22029
negative_passages.text: Solving modular arithmetic questions
negative_passages.docid: 23523
negative_passages.text: Two problems on number theory
negative_passages.docid: 11470
negative_passages.text: Divisibility of integers
negative_passages.docid: 99739
negative_passages.text: The diophantine equation $x^2+y^2=3z^2$
negative_passages.docid: 48949
negative_passages.text: Solving a Diophantine equation with a large solution
negative_passages.docid: 148906
negative_passages.text: Finding integers $m,n$ such that $(m-n)^2=4mn/(m+n-1)$
negative_passages.docid: 108941
negative_passages.text: Combinatorics Question Asking How Many Integer Solutions Given Different Restrictions