The Ultimate Challenge: The 3x+1 Problem
The $3x 1$ problem, or Collatz problem, concerns the following seemingly innocent arithmetic procedure applied to integers: If an integer $x$ is odd then ""multiply by three and add one"", while if it is even then ""divide by two"". The $3x 1$ problem asks whether, starting from any positive integer, repeating this procedure over and over will eventually reach the number 1. Despite its simple appearance, this problem is unsolved. Generalizations of the problem are known to be undecidable, and the problem itself is believed to be extraordinarily difficult. This book reports on what is known on this problem. It consists of a collection of papers, which can be read independently of each other. The book begins with two introductory papers, one giving an overview and current status, and the second giving history and basic results on the problem. These are followed by three survey papers on the problem, relating it to number theory and dynamical systems, to Markov chains and ergodic theory, and to logic and the theory of computation. The next paper presents results on probabilistic models for behavior of the iteration. This is followed by a paper giving the latest computational results on the problem, which verify its truth for $x
Què opinen els usuaris - Escriviu una ressenya
No hem trobat cap ressenya als llocs habituals.
3x+1 function 3x+1 map 3x+1 problem Acta Arithmetica arithmetic behavior branching random walk cellular automata Collatz function Collatz mapping Collatz problem computation congruence classes constant counts the number cycles d-adic defined denote distribution divergent trajectories encode equation Erd˝os ergodic theory example exists finite forward iteration FRACTRAN program frieze patterns given graph H. S. M. Coxeter halting problem infinite initial inverse iterates J. C. Lagarias J. H. Conway Klarner Lagarias Lagarias and Weiss log2 logn Lothar Collatz Markov chain Math Mathematics maximum excursion Minsky natural density node Note number of iterates Number Theory odd integers paper studies periodic orbits permutation positive integers prediction proof proved random walk random walk model rational numbers record-holders recursive relatively prime type residue classes set of integers shows stochastic models symbols tag system Theorem total stopping tree Turing machines Ulam undecidable universal vector Wirsching