On the "3x + 1" Problem
From MaRDI portal
Publication:4177640
DOI10.2307/2006353zbMath0395.10013OpenAlexW4235048180MaRDI QIDQ4177640
Publication date: 1978
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2006353
Related Items (23)
Lower bounds for the total stopping time of 3𝑥+1 iterates ⋮ Statistical properties of an iterated arithmetic mapping ⋮ On the combinatorial structure of \(3N+1\) predecessor sets ⋮ A simple (inductive) proof for the non-existence of 2-cycles of the \(3x+1\) problem ⋮ An analytic approach to the Collatz \(3n+1\) problem for negative start values ⋮ A randomized version of the Collatz \(3x + 1\) problem ⋮ Is the Syracuse falling time bounded by 12? ⋮ The influence of computers in the development of number theory ⋮ The Collatz problem in the light of an infinite free semigroup ⋮ The \(3x+1\) problem: a lower bound hypothesis ⋮ The \(3x+1\) problem: New lower bounds on nontrivial cycle lengths ⋮ Stress concentration factors due to the bending of a thick plate with circular hole ⋮ On the probabilistic proof of the convergence of the Collatz conjecture ⋮ On the \(3n+1\) problem ⋮ On the almost sure convergence of Syracuse sequences ⋮ Multiplication algorithm based on Collatz function ⋮ Parity sequences of the 3x+1 map on the 2-adic integers and Euclidean embedding ⋮ The Collatz conjecture and de Bruijn graphs ⋮ Unnamed Item ⋮ A new approach on proving Collatz conjecture ⋮ The Collatz problem ⋮ Almost all orbits of the Collatz map attain almost bounded values ⋮ Functional equations connected with the Collatz problem
This page was built for publication: On the "3x + 1" Problem
