Related papers: Benford's law for the $3x+1$ function
This article provides a brief overview on a range of basic dynamical systems that conform to the logarithmic distribution of significant digits known as Benford's law. As presented here, most theorems are special cases of known, more…
The main result of this paper is the following: let d be a natural number >= 3; the line bundle O(1,...,1) on the product of d copies of the projective line P^1 satisfies Property N_p of Green-Lazarsfeld if and only if p <= 3.
Benford's Law predicts that the first significant digit on the leftmost side of numbers in real-life data is proportioned between all possible 1 to 9 digits approximately as in LOG(1 + 1/digit), so that low digits occur much more frequently…
The $3x+k$ function $T_{k}(n)$ sends $n$ to $(3n+k)/2$ resp. $n/2,$ according as $n$ is odd, resp. even, where $k \equiv \pm 1~(\bmod \, 6)$. The map $T_k(\cdot)$ sends integers to integers, and for $m \ge 1$ let $n \rightarrow m$ mean that…
A number of the form $x(x+1)/2$ where $x$ is an integer is called a triangular number. Suppose, $N(a_1,\cdots,a_k;n)$ and $T(a_1,\cdots,a_k;n)$ denote the number of ways $n$ can be expressed as $\sum_{i=1}^k a_ix_i^2$ and $\sum_{i=1}^k…
Taking a new approach towards analyzing the Collatz Problem, or, 3x+1 conjecture. Introducing some new functions, the Collatz-2 and Collatz-3 sequences, as well as deducing results related to Collatz-2 and Collatz-3 sequences.
This paper gives a simple proof of the Wirsching-Goodwin representation of integers connected to 1 in the $3x+1$ problem (see \cite{Wirsching} and \cite{Goodwin}). This representation permits to compute all the ascending Collatz sequences…
We show that several classes of ordered structures (namely, convex linear orders, layered permutations, and compositions) admit first-order logical limit laws.
Benford's law is an empirical edict stating that the lower digits appear more often than higher ones as the first few significant digits in statistics of natural phenomena and mathematical tables. A marked proportion of such analyses is…
This note provides conditions under which the union of three well-founded binary relations is also well-founded.
Benford's law is a famous law in statistics which states that the leading digits of random variables in diverse data sets appear not uniformly from 1 to 9; the probability that d (d=1,...,9) appears as a leading digit is given by…
For a spectrally positive and strictly stable process with index in (1,2), a series representation is obtained for the joint distribution of the "first passage triple" that consists of the time of first passage and the undershoot and the…
Inspired by the basic stick fragmentation model proposed by Becker et al. in arXiv:1309.5603v4, we consider three new versions of such fragmentation models, namely, continuous with random number of parts, continuous with probabilistic…
Exponential growth occurs when the growth rate of a given quantity is proportional to the quantity's current value. Surprisingly, when exponential growth data is plotted as a simple histogram disregarding the time dimension, a remarkable…
This note proves a law of large numbers for predicting several steps ahead, which, in the case of uniformly bounded random variables, generalizes the standard law of large numbers for martingales; the standard law of large numbers…
We prove the law of the iterated logarithm for discrepancies of the sequence $\{(3/2)^kx\}$.
The Collatz conjecture asserts that repeatedly iterating $f(x) = (3x + 1)/2^{a(x)}$, where $a(x)$ is the highest exponent for which $2^{a(x)}$ exactly divides $3x+1$, always lead to $1$ for any odd positive integer $x$. Here, we present an…
We obtain the solution of the fourth order difference equation $$ x_{n+1}=\frac{ \alpha x_{n-3}}{A+B x_{n-1}x_{n-3}}$$ with the initial conditions; $x_{-3}=d,$ $x_{-2}=c,$ $x_{-1}=b,$ and $x_{0}=a$ are arbitrary nonzero real numbers,…
The 3x+1 problem is a difficult conjecture dealing with quite a simple algorithm on the positive integers. A possible approach is to go beyond the discrete nature of the problem, following M. Chamberland who used an analytic extension to…
We prove a "decomposition lemma" that allows us to count preimages of certain sets of permutations under West's stack-sorting map $s$. As a first application, we give a new proof of Zeilberger's formula for the number of 2-stack-sortable…