Abstract
Two algorithms have been constructed. The first is intended for obtaining such residue-classes represented by the numberN to the given modulusM, that for the primen ≢N (modM) equation (1) is solvable in natural numbersx,y,z. Particularly, whenM=120120 (see Table 2) we obtain 198 suchN, i.e. the hypothesis indicated below is true with a probability greater than 0.99835. The second algorithm is intended for testing the conjecture by Erdös-Straus when 107 <n≦108.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
L. J. Mordell,Diophantine equations, London · New York, Acad. Press, 1969.
Г. Дэвенпорт,Высuаaя арuфмеmuкa, Москва, 1965.
L. Antonio Rosati,Sull'equazione diofantea 4/n=1/x 1+1/x 2+1/x 3, Bolettino della Unione Matematica Italiana, serie III, Anno IX (1954), No. 1.
L. Bernstein,Zur Lösung der diophantischen Gleichung m/n=l 1 x+l 2 y+l 3 z,insbesondere im Fall m=4, J. reine und angew. Math., 1962, 211, No. 1–2.
Koichi Yamomoto,On the diophantine equation 4/n=1/x+1/y+1/z, Mem. Fac. Sci. Kyushu Univ., 1965, A19, No.1.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Terzi, D.G. On a conjecture by Erdös-Straus. BIT 11, 212–216 (1971). https://doi.org/10.1007/BF01934370
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01934370