J. Daudin

collaborators

2 papers

math.NT2020

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

Jean-Jacques Daudin

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

math.NT2018

A simple proof of the Wirsching-Goodwin representation of integers connected to 1 in the $3 x + 1$ problem

Jean-Jacques Daudin, Laurent Pierre

This paper gives a simple proof of the Wirsching-Goodwin representation of integers connected to 1 in the $3 x + 1$ problem (see \cite{Wirsching} and \cite{Goodwin}). This representat…

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

A simple proof of the Wirsching-Goodwin representation of integers connected to 1 in the 3x+1 problem

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

A simple proof of the Wirsching-Goodwin representation of integers connected to 1 in the $3 x + 1$ problem