Bounds for the 3x+1 problem using difference inequalities
From MaRDI portal
Abstract: We study difference inequality systems for the 3x+1 problem introduced by the first author in 1989. These systemes can be used to give lower bounds for the number of integers below x that contain 1 in their forward orbit under the 3x+1 map. Previous methods gave away some information in these inequalities. We give an improvement which apparantly extracts full information from the inequalities. By computer aided proof we show that at least x^{0.84} of the integers below x contain 1 in their forward orbit under the 3x+1 map.
Recommendations
Cited in
(10)- How many numbers satisfy the \(3x+1\) conjecture?
- A new approach on proving Collatz conjecture
- Lower bounds for Z-numbers
- Density Bounds for the 3x + 1 Problem. I. Tree-Search Method
- Inequalities involving the sequence ∛(a + ∛(a+...+ ∛(a)))
- A Collatz-type conjecture on the set of rational numbers
- Almost all orbits of the Collatz map attain almost bounded values
- Linear dynamics of an operator associated to the Collatz map
- Generalized Collatz maps with almost bounded orbits
- T. Tao and the Syracuse conjecture
This page was built for publication: Bounds for the 3x+1 problem using difference inequalities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4484453)
