Estimates for the Syracuse problem via a probabilistic model (Q2752956)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Estimates for the Syracuse problem via a probabilistic model |
scientific article; zbMATH DE number 1665890
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Estimates for the Syracuse problem via a probabilistic model |
scientific article; zbMATH DE number 1665890 |
Statements
22 October 2001
0 references
Syracuse problem
0 references
dynamical system
0 references
random walk
0 references
Collatz' problem
0 references
Kakutani's problem
0 references
Ulam's problem
0 references
Hasse's algorithm
0 references
\(3x+1\) problem
0 references
0.8398886
0 references
0.83913743
0 references
0.8294378
0 references
0.8274206
0 references
0.82712257
0 references
Estimates for the Syracuse problem via a probabilistic model (English)
0 references
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.
0 references