Abstract
A polynomial with integer coefficients of 10 variables is constructed, whose set of all nonnegative values (for positive integer values of the variables) is precisely the set of all prime numbers.
Similar content being viewed by others
Literature cited
M. Davis, “Arithmetical problems and recursively enumerable predicates,” J. Symb. Logic,18, No. 1, 33–41 (1953).
H. Putnam, “An unsolvable problem in number theory,” J. Symb. Logic,25, No. 3, 220–232 (1960).
J. Robinson, “Unsolvable diophantine problems,” Proc. Am. Math. Soc.,22, No. 2, 534–538 (1969).
Yu. I. Manin, The Tenth Hubert Problem [in Russian], Sov. Probl. Mat., Vol. I (Itogi Nauki i Tekhn. VINITI AN SSSR), Moscow (1973), pp. 5–37.
Yu. V. Matijasevič, “Diophantine sets,” Usp. Mat. Nauk,27, No. 5, 185–222 (1972).
M. Davis, “Hilbert's tenth problem is unsolvable,” Am. Math. Monthly,80, No. 3, 233–269 (1973).
Yu. V. Matijasevič, “Diophantine representation of the set of prime numbers,” Dokl. Akad. Nauk SSSR,196, No. 4, 770–773 (1971).
Yu. Matijasevič and J. Robinson, “Reduction of an arbitrary diophantine equation to one in 13 unknowns,” Acta Arithmetica,27, 521–553 (1975).
H. Wada, “Polynomial expression of prime numbers,” Sugaku,27, No. 2, 160–161 (1975).
J. P. Jones, D. Sato, H. Wada, and D. Wiens, “Diophantine representation of the set of prime numbers,” Am. Math. Monthly,83, No. 6, 449–464 (1976).
J. Robinson, “Existential definability in arithmetic,” Trans. Am. Math. Soc.,72, No. 3, 437–449 (1952).
Additional information
Translated by Louise Guy and James P. Jones, The University of Calgary, Calgary, Canada
Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 68, pp. 62–82, 1977.
Rights and permissions
About this article
Cite this article
Matijasevič, Y.V. Primes are nonnegative values of a polynomial in 10 variables. J Math Sci 15, 33–44 (1981). https://doi.org/10.1007/BF01404106
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01404106