Results for '3n + 1, or Collatz problem'

Order:
  1. Walking Cautiously Into the Collatz Wilderness: Algorithmically, Number Theoretically, Randomly.Edward G. Belaga & Maurice Mignotte - 2006 - Discrete Mathematics and Theoretical Computer Science.
    Building on theoretical insights and rich experimental data of our preprints, we present here new theoretical and experimental results in three interrelated approaches to the Collatz problem and its generalizations: algorithmic decidability, random behavior, and Diophantine representation of related discrete dynamical systems, and their cyclic and divergent properties.
    Download  
     
    Export citation  
     
    Bookmark  
  2. Reflecting on the 3x+1 Mystery. Outline of a Scenario - Improbable or Realistic ?Edward G. Belaga - manuscript
    Guessing the outcome of iterations of even most simple arithmetical functions could be an extremely hazardous experience. Not less harder, if at all possible, might be to prove the veracity of even a "sure" guess concerning iterations : this is the case of the famous 3x+1 conjecture. Our purpose here is to study and conceptualize some intuitive insights related to the ultimate (un)solvability of this conjecture.
    Download  
     
    Export citation  
     
    Bookmark