Suppose, $a,b,c \ge 1$ are integers.

Can the question whether the equation $$x^a+y^b+z^c=n$$ has a solution in integers $x,y,z$ for some particular integer $n$ be undecidable ?

I ask because I read that a slightly complication of the equation occuring in Fermat's last theorem can lead to an undecidable case and I wonder whether the given form already is sufficient to achieve this.

  • $\begingroup$ If x, y, z are all positive, then there seems to be only a finite number of possible trials fo r the expression. $\endgroup$ – herb steinberg Apr 23 '18 at 21:08
  • $\begingroup$ Of course, negative integers $x,y,z$ are allowed as well , otherwise the problem would be trivially decidable. $\endgroup$ – Peter Apr 23 '18 at 22:42

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.