Lower bounds for the total stopping time of 3𝑥+1 iterates

DOI10.1090/S0025-5718-02-01425-4zbMath1052.11017arXivmath/0103054OpenAlexW2013372732MaRDI QIDQ4794658

No author found.

Publication date: 19 February 2003

Published in: Mathematics of Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0103054

Mathematics Subject Classification ID

Related Items (4)

A randomized version of the Collatz \(3x + 1\) problem ⋮ Linear dynamics of an operator associated to the Collatz map ⋮ An automated approach to the Collatz conjecture ⋮ Lower bounds for Z-numbers

Cites Work

• Unnamed Item
• The Collatz problem
• The \(3x +1\) problem: Two stochastic models
• The dynamical system generated by the \(3n+1\) function
• Estimates for the Syracuse Problem via a Probabilistic Model
• The 3x + 1 Problem and Its Generalizations
• Imitation of an Iteration
• On the "3x + 1" Problem
• Maximum excursion and stopping time record-holders for the problem: Computational results
• Density Bounds for the 3x + 1 Problem. I. Tree-Search Method
• The Distribution of 3x+1 Trees

This page was built for publication: Lower bounds for the total stopping time of 3𝑥+1 iterates