The following pages link to On the "3x + 1" Problem (Q4177640):
Displaying 24 items.
- An analytic approach to the Collatz \(3n+1\) problem for negative start values (Q380718) (← links)
- The Collatz problem in the light of an infinite free semigroup (Q463258) (← links)
- The \(3x+1\) problem: New lower bounds on nontrivial cycle lengths (Q685592) (← links)
- The Collatz conjecture and de Bruijn graphs (Q740473) (← links)
- A simple (inductive) proof for the non-existence of 2-cycles of the \(3x+1\) problem (Q868892) (← links)
- A randomized version of the Collatz \(3x + 1\) problem (Q899629) (← links)
- The Collatz problem (Q1059095) (← links)
- The influence of computers in the development of number theory (Q1164656) (← links)
- Functional equations connected with the Collatz problem (Q1320068) (← links)
- The \(3x+1\) problem: a lower bound hypothesis (Q1746201) (← links)
- Statistical properties of an iterated arithmetic mapping (Q1906368) (← links)
- On the combinatorial structure of \(3N+1\) predecessor sets (Q1910555) (← links)
- Multiplication algorithm based on Collatz function (Q2032292) (← links)
- On the probabilistic proof of the convergence of the Collatz conjecture (Q2272862) (← links)
- A new approach on proving Collatz conjecture (Q2337122) (← links)
- On the almost sure convergence of Syracuse sequences (Q2507708) (← links)
- Is the Syracuse falling time bounded by 12? (Q2696028) (← links)
- Stress concentration factors due to the bending of a thick plate with circular hole (Q3033380) (← links)
- Lower bounds for the total stopping time of 3𝑥+1 iterates (Q4794658) (← links)
- (Q5148770) (← links)
- Parity sequences of the 3x+1 map on the 2-adic integers and Euclidean embedding (Q5383258) (← links)
- Almost all orbits of the Collatz map attain almost bounded values (Q5863760) (← links)
- On the \(3n+1\) problem (Q5953269) (← links)
- On the stopping time of the Collatz map in \(\mathbb{F}_2 [x]\) (Q6615537) (← links)
