J. Daudin

activity

20112020

most citedA simple proof of the Wirsching-Goodwin representation of integers connected to 1 in the

3 x + 1

problem

2 citations · 2 across the 2 of their papers we have counts for

collaborators

Showing 2020Show all

1 paper · 1 filter

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.

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

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