Related papers: Benford's law for the $3x+1$ function

The first digit law, also known as Benford's law or the significant digit law, is an empirical phenomenon that the leading digit of numbers from real world sources favors small ones in a form $\log(1+{1}/{d})$, where $d=1, 2, ..., 9$. Such…

New versions and extensions of Benson's outer approximation algorithm for solving linear vector optimization problems are presented. Primal and dual variants are provided in which only one scalar linear program has to be solved in each…

Let f be a polynomial of degree at least 2 with coefficients in a number field K, let x_0 be a sufficiently general element of K, and let alpha be a root of f. We give precise conditions under which Newton iteration, started at the point…

In this paper, we will see that the proportion of d as leading digit, d $\in$ 1, 9, in data (obtained thanks to the hereunder developed model) is more likely to follow a law whose probability distribution is determined by a specific upper…

We show that the sequence of ratios $d(n+1) / d(n)$ of consecutive values of the divisor function attains every positive rational infinitely many times. This confirms a prediction of Erd\H{o}s.

Let $s(n)$ be the number of different remainders $n \bmod k$, where $1 \leq k \leq \lfloor n/2 \rfloor$. This rather natural sequence is sequence A283190 in the OEIS and while some basic facts are known, it seems that surprisingly it has…

We provide a criterion to determine whether a real multiplicative function is a strong Benford sequence. The criterion implies that the $k$-divisor functions, where $k \neq 10^j$, and Hecke eigenvalues of newforms, such as Ramanujan tau…

Prime numbers seem to distribute among the natural numbers with no other law than that of chance, however its global distribution presents a quite remarkable smoothness. Such interplay between randomness and regularity has motivated sci-…

We prove the Ribenboim hypothesis, which states that if, starting from some integer $N$, consecutive prime numbers $p_ {n}$, $p_{n+1}$ satisfy the inequality $\sqrt {p_ {n+1}}-\sqrt{p_{n}} <1$, then the Landau problem # 4 (1912) has a…

In this part we study the dynamics of the following rational multi-parameter first order difference equation x_{n+1} =(ax_{n}^3+ bx_{n}^2+cx_{n} + d)/x_{n}^3, x_{0}\in R^{+} where the parameters a, b, d together with the initial condition…

We show that any planar drawing of a forest of three stars whose vertices are constrained to be at fixed vertex locations may require $\Omega(n^\frac{2}{3})$ edges each having $\Omega(n^\frac{1}{3})$ bends in the worst case. The lower bound…

This paper proposes a formula expression for the well-known Collatz conjecture (or 3x+1 problem), which can pinpoint all the growth points in the orbits of the Collatz map for any natural numbers. The Collatz map $Col: \mathcal{N}+1…

We determine, by hierarchy, dependencies between higher order linear symmetries which occur when generating them using recursion operators. Thus, we deduce a formula which gives the number of independent generalized symmetries (basis) of…

Formulas of $\pi(x)$-fine structure are presented.

Let $T(n)=\left\{\begin{array}{ll}3n+1&(n\hbox{ odd})\frac n2&(n\hbox{ even})\end{array}\right.$ ($n\in\mathbb Z$). We call "the orbit of the integer $n$", the set $$ \mathcal O_n:=\{m\in\mathbb Z\;:\;\exists k\ge0,\ m=T^k(n)\} $$ and we…

We give a necessary and sufficient condition for the maximum multiplicity of a root of the matching polynomial of a tree to be equal to the minimum number of vertex disjoint paths needed to cover it.

Improving on a theorem of Heath-Brown, we show that if $X$ is sufficiently large then a positive proportion of the values $\{n^3+2:n\in (X,2X]\}$ have a prime factor larger than $X^{1+10^{-52}}$.

The Collatz problem is generalized into $3n + 3^k$ problem. It is shown that as long as the Collatz function iterates converge to the cycle passing through the number 1, the $3n + 3^k$ sequence converges to the cycle passing through the…

The $3x+1$ problem, also called the Collatz conjecture, is a very interesting unsolved mathematical problem related to computer science. This paper generalized this problem by relaxing the constraints, i.e., generalizing this deterministic…

It is shown that the first $n$ prime numbers $p_1,...,p_n$ determine the next one by the recursion equation $$ p_{n+1} =\lim\limits_{s\to +\infty} [\prod\limits^n_{k=1} (1-\frac{1}{p^s_k}) \sum\limits^\infty_{j=1} \frac{1}{j^s} -1]^{-1/s}.…