TOPICS
Search

Diophantine Set


A Diophantine set S of positive integers is a set for which there exists a polynomial Q with integral coefficients in m>=1 indeterminates such that

 S={Q(x_1,...,x_m)>=1:x_1>=1,...,x_m>=1}.

It has been proved that the set of prime numbers is a Diophantine set.

More generally, a subset A subset= Q^r is Diophantine over Q iff there is a polynomial P with rational number coefficients such that a in A exactly when P(a,w)=0 for some finite tuple w of rational numbers. Clearing denominators permits integer coefficients.

Burungale (2026) reports that every recursively enumerable set in Q^r is Diophantine over Q, with the converse following by enumerating rational witnesses. The reported forward implication uses the claimed Diophantine definition of Z in Q and therefore carries the same arithmetic dependencies as that claim. The paper also reports that the rational numbers whose reduced denominators are squares form a Diophantine subset of Q.


See also

Diophantine Equation, Hilbert's Tenth Problem, Prime Diophantine Equations, Recursively Enumerable Set

Explore with Wolfram|Alpha

References

Burungale, A. "A Diophantine Definition of Z in Q." 12 Nov 2026. https://arxiv.org/abs/2611.16130v1.Matiyasevich, Yu. V. Hilbert's Tenth Problem. Cambridge, MA: MIT Press, 1993. https://logic.pdmi.ras.ru/~yumat/H10Pbook/.Ribenboim, P. The New Book of Prime Number Records. New York: Springer-Verlag, pp. 189-192, 1995.

Referenced on Wolfram|Alpha

Diophantine Set

Cite this as:

Weisstein, Eric W. "Diophantine Set." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/DiophantineSet.html

Subject classifications