Paper detail

The 3x+1 problem: a lower bound hypothesis

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.

preprint2016arXivOpen access

Signal facts

What is known right now

Open access1 author1 topic

Next steps

Decide what to do with this paper

Use like or dislike for the fast social read. The more specific scholarly feedback stays available below when needed.

Log in to curate

Reading frame

Keep the important context close to the paper

Keep the important signals around this paper in one place: votes, save state, collection context, reviews and the metadata you need before deciding what to do next.

Institutions

Add specific reaction

Move through the context

Research map

Open full explorer

Move through nearby people, institutions, topics and adjacent work without leaving the paper page.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Structured reviews

0 review(s)

ContributeLeave structured feedbackUse the review template when you have a concrete strength, concern or method question.Open review form

No structured reviews yet. High-signal critique starts here.

Work discussion

0 comment(s)

DiscussAdd a high-signal commentKeep quick notes, caveats and replication pointers separate from formal reviews.Open comment form

No discussion yet. The first strong comment sets the tone.