$3n+1$ problem: an heuristic lower bound for the number of integers connected to 1 and less than $x$
| Autor: | Daudin, Jean-Jacques |
|---|---|
| Rok vydání: | 2020 |
| Předmět: | |
| Druh dokumentu: | Working Paper |
| Popis: | This paper gives an heuristic lower bound for the number of integers connected to 1 and less than $x$, $\theta(x) > 0.9x,$ in the context of the $3n+1$ problem. |
| Databáze: | arXiv |
| Externí odkaz: |
|