The 3n +1 Problem
Library Home || Full Table of Contents || Suggest a Link || Library Help
|A probabilistic approach to the Collatz conjecture. With references to continued-fraction convergence of log(3)/log(2), m-cycles, and other classical approaches to the 3n+1 problem, as well as the MSVC++ C code that confirmed many of Cox's propositions.|
|Math Topics:||Number Theory|
© 1994-2013 Drexel University. All rights reserved.
The Math Forum is a research and educational enterprise of the Drexel University School of Education.