Estimates for the Syracuse problem via a probabilistic model
The Syracuse problem, or the Collatz' problem, Kakutani's problem, Ulam's problem, Hasse's algorithm, also called the \(3x+1\) problem, is investigated via a probabilistic model. Roughly speaking the problem concerns the behaviour of a dynamical system whose orbit is generated by the function \(f(x)= {3x+1\over 2}\) if \(x\) is odd and \(f(x)= {x\over 2}\) if \(x\) is even. The problem amounts to verifying the conjecture that \(t(x_0)= \inf\{k\geq 1: x_k= 1\}\) is finite, where \(x_0\) is the starting point and \(\{x_n\}\) the orbit. The paper investigates certain density properties of the orbit which are related to the conjecture.
- Probabilistic estimates for the generalized maximum satisfiability problem
- A stochastic probing problem with applications
- Вероятностные модели для анализа обратных экстремальных задач комбинаторики
- Probabilistic asymptotic properties of some combinatorial optimization problems
- Probabilistic models for the Steiner tree problem
- The \(3x+1\) problem: a lower bound hypothesis
- A remark about the density of the orbits of the Collatz permutation
- Lower bounds for the total stopping time of 3𝑥+1 iterates
- The Distribution of 3x+1 Trees
- Towards the undecidability of the Syracuse conjecture?
- A randomized version of the Collatz \(3x + 1\) problem
This page was built for publication: Estimates for the Syracuse problem via a probabilistic model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2752956)
