Abstract
There is explicitly given a polynomial (of degree 17 in 48 variables), the set of whose positive values (for natural values of the variables) is precisely the set of all perfect numbers. The construction of this polynomial is based on a new test for a number to be perfect, formulated in terms of the divisibility of binomial coefficients.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Literature cited
Yu. V. Matiyasevich, “Diophantine sets,” Usp. Mat. Nauk,27, No. 5, 185–222 (1975).
Yu. Matyasevič and J. Robinson, “Reduction of an arbitrary diophantine equation to one in 13 unknowns,” Acta Arithm.,27, 521–553 (1975).
Yu. V. Matiyasevich, “Prime numbers are enumerated by a polynomial in 10 variables,” Zap. Nauchn. Sem. Leningr. Otd. Mat. Inst. Akad. Nauk SSSR,68, 62–82 (1977).
Yu. V. Matiyasevich, “A class of tests for primeness, formulated in terms of divisibility of binomial coefficients,” Zap. Nauchn. Sem. Leningr. Otd. Mat. Inst. Akad. Nauk SSSR,67, 167–183 (1977).
E. E. Kummer, “Überdie ergänzungssatze zu den algemeinen Reciprocitätsgesetzen,” J. Reine Angew. Math.,44, 93–146 (1952).
J. Robinson, “Diophantine decision problems,” in: MAA Studies in Math., Vol. 6 (1969), pp. 76–116.
Additional information
Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 88, pp. 78–89, 1979.
Rights and permissions
About this article
Cite this article
Kryauchyukas, V.Y. Diophantine representation of perfect numbers. J Math Sci 20, 2307–2313 (1982). https://doi.org/10.1007/BF01629440
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01629440