Paradoxical behavior in Collatz sequences
From MaRDI portal
Cites work
- A stopping time problem on the positive integers
- Almost all orbits of the Collatz map attain almost bounded values
- Collatz high cycles do not exist
- Collatz meets Fibonacci
- scientific article; zbMATH DE number 5885063 (Why is no real title available?)
- scientific article; zbMATH DE number 4027582 (Why is no real title available?)
- scientific article; zbMATH DE number 3465382 (Why is no real title available?)
- scientific article; zbMATH DE number 737196 (Why is no real title available?)
- scientific article; zbMATH DE number 3433944 (Why is no real title available?)
- Inequalities: theory of majorization and its applications
- Iteration of the number-theoretic function f(2n)=n, f(2n+1)=3n+2
- On the "3x + 1" Problem
- On the Collatz 3n + 1 Algorithm
- Permutation Patterns of the Iterated Syracuse Function
- Stochastic models for the 3x+1 and 5x+1 problems and related problems
- The \(3x+1\) problem: a lower bound hypothesis
- The \(3x+1\) problem: New lower bounds on nontrivial cycle lengths
- The 3x + 1 Problem and Its Generalizations
- The ultimate challenge. The \(3x+1\) problem
- Theoretical and computational bounds for m-cycles of the 3n+1-problem
This page was built for publication: Paradoxical behavior in Collatz sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7285270)