How many numbers satisfy the 3x+1 conjecture?

DOI10.1155/S0161171289000979MaRDI QIDQ1825890zbMATH OpenOpenAlexWikidataFDO

Authors Ilia Krasikov

Publication date 1989

Published in International Journal of Mathematics and Mathematical Sciences (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/46421

zbMATH Keywords

\(3x+1\) conjectureCollatz problemsystem of difference inequalities

Mathematics Subject Classification ID

Recurrences (11B37) Special sequences and polynomials (11B83)

Review text

Summary: Let \(\theta(x)\) be the number of numbers not exceeding \(x\) satisfy the \(3x+1\)-conjecture. We obtain a system of difference inequalities on functions closely related to \(\theta\). Solving this system in the simplest case, we establish \(\theta(x)>cx^{3/7}\). This improves a result of \textit{R. E. Crandall} [Math. Comput. 32, 1281--1292 (1978; Zbl 0395.10013)].

Recommendations

• On the (3N+1)-conjecture
• Bounds for the 3x+1 problem using difference inequalities
• scientific article; zbMATH DE number 58307
• Density Bounds for the 3x + 1 Problem. I. Tree-Search Method
• scientific article; zbMATH DE number 566416

Cited in

(6)

• On the combinatorial structure of \(3N+1\) predecessor sets
• On the (3N+1)-conjecture
• Bounds for the 3x+1 problem using difference inequalities
• A Collatz-type conjecture on the set of rational numbers
• On the \(3n+1\) problem
• The Collatz conjecture \& non-Archimedean spectral theory. I: Arithmetic dynamical systems and non-Archimedean value distribution theory

This page was built for publication: How many numbers satisfy the \(3x+1\) conjecture?

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1825890)