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