BIT Numerical Mathematics

, Volume 11, Issue 2, pp 212–216

On a conjecture by Erdös-Straus

  • D. G. Terzi

DOI: 10.1007/BF01934370

Cite this article as:
Terzi, D.G. BIT (1971) 11: 212. doi:10.1007/BF01934370


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 primenN (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.

Copyright information

© BIT Foundations 1971

Authors and Affiliations

  • D. G. Terzi
    • 1
  1. 1.Institute of Mathematics Siberian BranchAcademy of Sciences of the UssrNovosibirsk 90Ussr