Estimates for the Syracuse problem via a probabilistic model

DOI10.1137/S0040585X97978245MaRDI QIDQ2752956zbMATH OpenFDO

Authors Dietmar Pfeifer, K. Borovkov

Publication date 22 October 2001

Published in Theory of Probability and its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/S0040585X97978245

zbMATH Keywords

\(3x+1\) problemCollatz' problemdynamical systemHasse's algorithmKakutani's problemrandom walkSyracuse problemUlam's problem

Mathematics Subject Classification ID

Sums of independent random variables; random walks (60G50) Renewal theory (60K05)

Recommendations

• 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

Cited in

(6)

• 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)