Talk:Polynomial Diophantine equation
Jump to navigation
Jump to search
 | This article is rated Start-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | ||||||||||
| |||||||||||
"Polynomial Diophantine equations can be solved using the extended Euclidean algorithm, which works as well with polynomials as it does with integers." - Is this not a solution to Hilbert's 10th problem? I'm not an expert but seems to me that it is an over-statement. I suppose Euclid only works for equations like sa + tb = c