Uh? What is that
Number Theory
Level
5
Find the number of algorithms to determine whether a given polynomial Diophantine equation with integer coefficients has an integer solution.
10
8
4
6
I dunno know
12
Impossible
14
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
1 solution
This has been super-difficult to prove, proven in full only as recently as 1970. This is Hilbert's Tenth Problem No algorithm exists, or even can exist, that will find integer solutions, if any, for any polynomial Diophantine equation with integer coefficients.