The 3x+1 problem: a lower bound hypothesis

DOI10.7169/FACM/1583zbMATH Open1415.11026arXiv1510.01610OpenAlexW2963569500MaRDI QIDQ1746201FDOQ1746201

Authors: Olivier Rozier 

Publication date: 24 April 2018

Published in: Functiones et Approximatio. Commentarii Mathematici (Search for Journal in Brave)

Abstract: Much work has been done attempting to understand the dynamic behaviour of the so-called "3x+1" function. It is known that finite sequences of iterations with a given length and a given number of odd terms have some combinatorial properties modulo powers of two. In this paper, we formulate a new hypothesis asserting that the first terms of those sequences have a lower bound which depends on the binary entropy of the "ones-ratio". It is in agreement with all computations so far. Furthermore it implies accurate upper bounds for the total stopping time and the maximum excursion of an integer. Theses results are consistent with two previous stochastic models of the 3x+1 problem.

Full work available at URL: https://arxiv.org/abs/1510.01610

Recommendations

• The \(3x +1\) problem: Two stochastic models
• scientific article; zbMATH DE number 566416
• Lower bounds for the total stopping time of 3𝑥+1 iterates
• The 3x + 1 Problem and Its Generalizations
• The Collatz problem

zbMATH Keywords

parity vectorCollatz conjecture\(3x+1\) problembinary entropy functionmaximum excursionones-ratio

Mathematics Subject Classification ID

Measures of information, entropy (94A17) Sums of independent random variables; random walks (60G50) Other combinatorial number theory (11B75) Recurrences (11B37)

Cites Work

• Title not available (Why is that?)
• The dynamical system generated by the \(3n+1\) function
• The ultimate challenge. The \(3x+1\) problem
• On the "3x + 1" Problem
• Iteration of the number-theoretic function \(f(2n)=n\), \(f(2n+1)=3n+2\)
• The 3x + 1 Problem and Its Generalizations
• Title not available (Why is that?)
• A stopping time problem on the positive integers
• Stochastic models for the \(3x+1\) and \(5x+1\) problems and related problems
• The \(3x+1\) problem: New lower bounds on nontrivial cycle lengths
• Statistical (3x + 1) problem
• The \(3x +1\) problem: Two stochastic models
• Estimates for the Syracuse problem via a probabilistic model
• Discrete logarithms and their equidistribution

Cited In (8)

• The \(3x+1\) problem: New lower bounds on nontrivial cycle lengths
• Bounds for the 3x+1 problem using difference inequalities
• 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
• The \(3x +1\) problem: Two stochastic models
• Title not available (Why is that?)
• Stochastic models for the \(3x+1\) and \(5x+1\) problems and related problems
• Agnesi’s Problem III … Could the Textbook Be Wrong?

This page was built for publication: The \(3x+1\) problem: a lower bound hypothesis

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