Keywords
Numerical Evidence Continue Fraction Expansion Probabilistic Assumption Famous Problem Future Danger
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Preview
Unable to display preview. Download preview PDF.
References
- C. Bays and R. Hudson (1978) Details of the first region of integers x with π3,2 (x) < π3,1 (x),Mathematics of Computation 32, 571–576MATHMathSciNetGoogle Scholar
- J. H. Conway (1972)Unpredictable iterations, Proceedings of the 1972 Number Theory Conference. Boulder, CO: University of Colorado, 49–52Google Scholar
- R. E. Crandall (1978) On the “3x + 1” Problem,Mathematics of Computation 32, 1281–1292MATHMathSciNetGoogle Scholar
- L. E. Garner (1981) On the Collatz 3n + 1 algorithm,Proceedings of the American Mathematical Society 82, 19–22MATHMathSciNetGoogle Scholar
- B. Hayes (1984) Computer recreations,Scientific American 250, 10–16CrossRefGoogle Scholar
- J. C. Lagarias, The 3x + 1 Problem and its generalizations,Amer. Math. Monthly (to appear)Google Scholar
- A. M. Odlyzko and H. J. J. te Riele, Disproof of the Mertens Conjecture (to appear)Google Scholar
- R. Terras (1976) A stopping time problem on the positive integers,Acta Arithmetica 30, 241–252MATHMathSciNetGoogle Scholar
Copyright information
© Springer Science+Business Media, Inc. 1985