相关论文: About the logic of the prime number distribution

A binary string representation of prime occurrences is a sequence of bits, where $1$ entries encode positions of prime numbers. This is a convenient representation for analysis of prime distribution, since it allows for application of a…

Bertrand's Postulate ensures existence of prime $p$ between $n$ and $2n$, $n$ an integer $\geq 2$ and the sieve of Eratosthenes, a very simple ancient algorithm, generates all prime numbers up to any given limit. Combining the above two, in…

We introduce a new permutation statistic, namely, the number of cycles of length $q$ consisting of consecutive integers, and consider the distribution of this statistic among the permutations of $\{1,2,...,n\}$. We determine explicit…

Suppose you look at today's stock prices and bet on the value of the first digit. One could guess that a fair bet should correspond to the frequency of $1/9 = 11.11%$ for each digit from 1 to 9. This is by no means the case, and one can…

n this paper, we state several conjectures regarding distribution of primes and of pairs of primes represented by irreducible homogeneous polynomial in two variables $f(a,b)$. We formulate conjectures with respect to the slope $t=b/a$ for…

In this article, we will use elementary number theory techniques to investigate a sequence of integers defined by a sifting process called the lucky numbers. Ulam introduced lucky numbers as a sieve-based analogue of prime numbers. We…

We discuss analogues of the prime number theorem for a hyperbolic rational map f of degree at least two on the Riemann sphere. More precisely, we provide counting estimates for the number of primitive periodic orbits of f ordered by their…

Bertrand's postulate establishes that for all positive integers $n>1$ there exists a prime number between $n$ and $2n$. We consider a generalization of this theorem as: for integers $n\geq k\geq 2$ is there a prime number between $kn$ and…

Although the prime numbers are deterministic, they can be viewed, by some measures, as pseudo-random numbers. In this article, we numerically study the pair statistics of the primes using statistical-mechanical methods, especially the…

Let $ \lfloor {x} \rfloor $ denote the greatest integer less than or equal to a real number $x$. Given real numbers $0<\alpha_1 < \alpha_2 < \cdots< \alpha_k < 1$ satisfying a certain condition, we show that there are infinitely many…

The author has previously extended the theory of regular and irregular primes to the setting of arbitrary totally real number fields. It has been conjectured that the Bernoulli numbers, or alternatively the values of the Riemann zeta…

Recently we have introduced a novel characterisation of the distribution of twin primes that consists of three essential elements. These are: that the twins are most naturally viewed as a subsequence of the primes themselves, that the…

Fix irrational numbers $\alpha,\hat\alpha>1$ of finite type and real numbers $\beta,\hat\beta\ge 0$, and let $B$ and $\hat B$ be the Beatty sequences $$ B:=(\lfloor\alpha m+\beta\rfloor)_{m\ge 1}\quad\text{and}\quad\hat…

We encode the sequence of prime numbers into simple superpositions of identical waves, mimicking the archetypal prime number sieve of Eratosthenes. The primes are identified as zeros accompanied by phase singularities in a physically…

The paper exploits an isomorphism between the natural numbers N and a space U of periodic sequences of the roots of unity in constructing a recursive procedure for representing and computing the prime numbers. The nth wave number ${\bf…

The Legendre type relation for the counting function of ordinary twin primes is reworked in terms of the inverse of the Riemann zeta function. Its analysis sheds light on the distribution of the zeros of the Riemann zeta function in the…

Let omega(n) be the number of distinct prime factors dividing n and m > n natural numbers. We calculate a formula showing which prime numbers in which intervals divide a given binomial coefficient. From this formula we get an identity…

Natural numbers can be divided in two non-overlapping infinite sets, primes and composites, with composites factorizing into primes. Despite their apparent simplicity, the elucidation of the architecture of natural numbers with primes as…

For an arbitrary complex number $a\neq 0$ we consider the distribution of values of the Riemann zeta-function $\zeta$ at the $a$-points of the function $\Delta$ which appears in the functional equation $\zeta(s)=\Delta(s)\zeta(1-s)$. These…

Logarithmic gaps have been used in order to find a periodic component of the sequence of prime numbers, hidden by a random noise (stochastic or chaotic). The recovered period for the sequence of the first 10000 prime numbers is equal to…