2
$\begingroup$

I had a question in my mind from many years. we generally present the trivial solutions to Diophantine equations. Diophantine equations usually always have some sort of trivial solution (if you allow zero even Fermat’s equation has trivial solutions: $0^n+x^n=x^n$). I suppose the hard question is whether there are non-trivial solutions? The question of non-trivial solutions is already tough for polynomial Diophantine equations and requires detailed knowledge in algebraic and arithmetic geometry, modular forms, etc (see Wiles’ proof of Fermat’s last theorem).

What I am looking for, can we find non-trivial solutions to any polynomial Diophantine equations? If yes, what are the method so far existing?

Thanks in advance to all members of mse.

  • 0
    Its modular forms, please fix it. @gandhi2012-04-03
  • 1
    @Iyengar!I think now the edited one is much clear2012-04-03
  • 1
    There was a fairly similar (although more focused) question on this site before: http://math.stackexchange.com/questions/13166/what-are-diophantine-equations-really/2012-04-03
  • 0
    @gandhi: The solution to Hilbert's $10$th problem still leaves many interesting questions. Is there an algorithm for two-variable equations? Probably. For three-variable equations? For cubics in many variables?2012-04-03

2 Answers 2