# Infinite solutions of a diophantine equation [closed]

Given the Diophantine equation$$ax^2+bxy+cy^2+dx+ey+f=0$$ if the coefficients $(a,b,c,d,e,f)$ are chosen among all the prime numbers, we have infinite equations. Is it possible to prove that the solutions of the infinite equations are infinite and countable?

-

## closed as off topic by Gerry Myerson, Andreas Blass, Felipe Voloch, Emil Jeřábek, Pietro MajerFeb 17 '12 at 12:45

Questions on MathOverflow are expected to relate to research level mathematics within the scope defined by the community. Consider editing the question or leaving comments for improvement if you believe the question can be reworded to fit within the scope. Read more about reopening questions here.If this question can be reworded to fit the rules in the help center, please edit the question.

If $a$ and $c$ are large enough compared to the other coefficients then the left side will be positive for all $x,y$ so there will be no solutions. Pietro has shown that if you take the full set of equations (or even a small chunk) you get infinitely many solutions. Simple cardinality considerations show it's impossible to have an uncountable infinity of solutions, even taking all the equations. I see no question at a research level here, so I vote to close. – Gerry Myerson Feb 16 '12 at 22:24
Could you tell me why is this interesting? – Woett Feb 16 '12 at 22:37

Yes, if e.g. $a=e=2,\, b=5,\,c=d=3,$ and $f$ varies among all primes, that equation has the solution $x=-y=f$, which already makes infinitely many (distinct) solutions.