$3n+1$ problem: an heuristic lower bound for the number of integers connected to 1 and less than $x$

preprint2020arXivOpen access

This paper gives an heuristic lower bound for the number of integers connected to 1 and less than $x$ , $θ(x) > 0.9x,$ in the context of the $3n+1$ problem.

Explore this paper’s authors, topics and related work.

Building this map preview

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

Write a reviewWrite

No reviews yet.

Add a commentWrite

No comments yet.

$3n+1$ problem: an heuristic lower bound for the number of integers connected to 1 and less than $x$

Abstract

Connections

Building this map preview

Reviews 0

Discussion 0

3n+13n+13n+1 problem: an heuristic lower bound for the number of integers connected to 1 and less than xxx

Abstract

Connections

Building this map preview

Reviews 0

Discussion 0

$3n+1$ problem: an heuristic lower bound for the number of integers connected to 1 and less than $x$