Encyclopedia > Diophantine

  Article Content

Diophantine set

Redirected from Diophantine

In mathematics, a set S of integers is Diophantine precisely if there is some polynomial with integer coefficients f(n,x1,...,xk) such that an integer n is in S if and only if there exist some integers x1,...,xk with f(n,x1,...,xk)=0. (Such a polynomial equation over the integers is also called a Diophantine equation.)

As a consequence of Matiyasevich's theorem, a set of integers is Diophantine if and only if it is recursively enumerable.



All Wikipedia text is available under the terms of the GNU Free Documentation License

 
  Search Encyclopedia

Search over one million articles, find something about almost anything!
 
 
  
  Featured Article
Michael Barrymore

...     Contents Michael Barrymore Michael Barrymore, born 4 May 1952, is a British comedian famous for his variety shows. This article is a ...

 
 
 
This page was created in 27.6 ms