Corpus ID: 115169803

Stochastic Models for the 3x+1 and 5x+1 Problems

@article{Kontorovich2009StochasticMF,
title={Stochastic Models for the 3x+1 and 5x+1 Problems},
author={Alex Kontorovich and J. Lagarias},
journal={arXiv: Number Theory},
year={2009}
}
• Published 2009
• Mathematics
• arXiv: Number Theory
This paper discusses stochastic models for predicting the long-time behavior of the trajectories of orbits of the 3x+1 problem and, for comparison, the 5x+1 problem. The stochastic models are rigorously analyzable, and yield heuristic predictions (conjectures) for the behavior of 3x+1 orbits and 5x+1 orbits.

Figures and Tables from this paper

Analogues of the 3 x + 1 Problem in Polynomial Rings of Characteristic 2
A generalized analogue of a theorem of Terras concerning the asymptotic distribution of stopping times is proved in this setting of analogous dynamical systems in rings of functions of algebraic curves over . Expand
The 3x+1 problem: a lower bound hypothesis
Much work has been done attempting to understand the dynamic behaviour of the so-called "3x+1" function. In this paper, we formulate a new hypothesis that relates the minimal value of the first termExpand
Averaging Structure in the 3 x + 1 Problem
The (still) open conjecture is that for each n ∈ Z there exists a k such that T (n) = 1, that is, the k iterate of n equals one. Despite its simplicity, this beguiling problem has withstood manyExpand
Multiplicative semigroups related to the 3x+1 problem
• A. Caraiani
• Mathematics, Computer Science
• 2010
A generalization of the Wild semigroup is considered which leads to the statement of a Weak qx+1 Conjecture for q any prime and this conjecture for q=5 is proved together with a result analogous to the Wild Number Theorem. Expand
Generalized 3x+1 Mappings : convergence and divergence.
Discussion about the convergence and divergence of trajectories generated by certain functions derived from generalized 3x+1 mappings
Distribution function.
From a known result of diophantine equations of the first degree with 2 unknowns we simply find the results of the distribution function of the sequences of positive integers generated by theExpand
Walking to Infinity Along Some Number Theory sequences
• Mathematics
• 2020
An interesting open conjecture asks whether it is possible to walk to infinity along primes, where each term in the sequence has one digit more than the previous. We present different greedy modelsExpand
Conservation of Singularities in Functional Equations Associated to Collatz-Type Dynamical Systems; or, Dreamcatchers for Hydra Maps
It is known that the Collatz Conjecture (and the study of similar maps, here called "Hydra maps") can be stated in terms of solution sets of functional equations; or, equivalently, the fixed pointsExpand
A Conjecture on the Collatz-Kakutani Path Length for the Mersenne Primes
• Mathematics
• 2011
We present here a new conjecture for the nature of the Mersenne prime numbers by connecting it with the Collatz-Kakutani problem. By introducing a natural path length on the basis of theExpand
Almost all orbits of the Collatz map attain almost bounded values
Define the \emph{Collatz map} $\mathrm{Col} : \mathbb{N}+1 \to \mathbb{N}+1$ on the positive integers $\mathbb{N}+1 = \{1,2,3,\dots\}$ by setting $\mathrm{Col}(N)$ equal to $3N+1$ when $N$ is odd andExpand

References

SHOWING 1-10 OF 44 REFERENCES
Estimates for the Syracuse Problem via a Probabilistic Model
• Mathematics
• 2001
We employ a simple stochastic model for the Syracuse problem (also known as the 3x+1 problem) to get estimates for the average behavior of the trajectories of the original deterministic dynamicalExpand
The Dynamical System Generated by the 3n+1 Function
Some ideas around 3n+1 iterations.- Analysis of the Collatz graph.- 3-adic averages of counting functions.- An asymptotically homogeneous Markov chain.- Mixing and predecessor density.
Benford's law for the 3x + 1 function
• Mathematics
• 2005
We show that for most choices of an initial seed $x_0$, the sequence of the first $N$ iterates of $x_0$ under the $3x+1$ map approximately satisfies Benford's law.
Benford's law, values of L-functions and the 3x+1 problem
• Mathematics
• 2004
We show the leading digits of a variety of systems satisfying certain conditions follow Benford's Law. For each system proving this involves two main ingredients. One is a structure theorem of theExpand
Density bounds for the 3x + 1 problem. II: Krasikov inequalities
• Mathematics
• 1995
The 3x + 1 function T(x) takes the values (3x + 1)/2 if x is odd and x/2 if x is even. Let a be any integer with a ¬= 0 (mod 3). If π a (x) counts the number of n with |n| ≤ x which eventually reachExpand
Bounds for the 3x+1 problem using difference inequalities
• Mathematics
• 2003
We study difference inequality systems for the 3x+1 problem introduced by the first author in 1989. These systemes can be used to give lower bounds for the number of integers below x that contain 1Expand
The Distribution of 3x+1 Trees
• Mathematics, Computer Science
• Exp. Math.
• 1995
The range of variation exhibited by the 3x + 1 trees appears significantly narrower than that of the branching process models, and the variation in expected leaf-counts associated to the congruence class of a mod 3 j converges almost everywhere as j → ∞ to a limit function on the invertible 3-adic integers. Expand
HOW MANY NUMBERS SATISFY THE 3X + 1 CONJECTURE?
Let 0(x) be the number of numbers not exceeding x satisfy the 3X + conjecture. We obtain a system of difference inequalities on functions closely related to 0. Solving this system in the simplestExpand
Uniform Distribution in the (3x+1)-Problem
Structure theorem of the (3x + 1)-problem claims that the images under T n of arithmetic progressions with step 2 k are arithmetic progressions with step 3 m. Here T is the basic underlying map and aExpand
Density bounds for the 3x + 1 problem. I: tree-search method
• Mathematics
• 1995
The 3x + 1 function T(x) takes the values (3x + 1)/2 if x is odd and x/2 if x is even. Let a be any integer with a ¬= 0 (mod 3). If n k (a) counts the number of n with T (k) (n) = a, then for allExpand