Information entropy and correlations in prime numbers

2017

Currently there is no known efficient formula for primes. Besides that, prime numbers have great importance in e.g., information technology such as public-key cryptography, and their position and possible or impossible functional generation among the natural numbers is an ancient dilemma. The properties of the functions 2ab+a+b in the domain of natural numbers are introduced, analyzed, and exhibited to illustrate how these single out all the prime numbers from the full set of odd numbers. The characterization of odd primes vs. odd non-primes can be done with 2ab+a+b among the odd natural numbers as an analogue to the other, well known type of fundamental characterization for irrational and rational numbers among the real numbers. The prime number theorem, twin primes and erratic nature of primes, are also commented upon with respect to selection, as well as with the Fermat and Euler numbers as examples. Keywords prime number generator, prime number theorem, twin primes, erratic nature of primes

2014

Let p n be the nth prime and p p n be the nth prime-indexed prime (PIP). The process of taking prime-indexed subsequences of primes can be iterated, and the number of such iterations is the prime-index order. We report empirical evidence that the set composed of finite-differenced PIP sequences of prime-index order k ≥ 1 forms a quasiself-similar fractal structure with scaling by prime-index order. Strong positive linear correlation (r ≥ 0.926) is observed for all pairwise combinations of these finite-differenced PIP sequences over the range of our sample, the first 1.3 billion primes. The structure exhibits translation invariance for shifts in the index set of the PIP sequences. Other free parameters of the structure include prime-index order and the order and spacing of the finite difference operator. The structure is graphed using 8-bit color fractal plots, scaled across prime-index orders k = 1..6 and spans the first 1.3 billion primes.

Entropy

We show how the cross-disciplinary transfer of techniques from dynamical systems theory to number theory can be a fruitful avenue for research. We illustrate this idea by exploring from a nonlinear and symbolic dynamics viewpoint certain patterns emerging in some residue sequences generated from the prime number sequence. We show that the sequence formed by the residues of the primes modulo k are maximally chaotic and, while lacking forbidden patterns, unexpectedly display a non-trivial spectrum of Renyi entropies which suggest that every block of size m > 1, while admissible, occurs with different probability. This non-uniform distribution of blocks for m > 1 contrasts Dirichlet's theorem that guarantees equiprobability for m = 1. We then explore in a similar fashion the sequence of prime gap residues. We numerically find that this sequence is again chaotic (positivity of Kolmogorov-Sinai entropy), however chaos is weaker as forbidden patterns emerge for every block of size m > 1. We relate the onset of these forbidden patterns with the divisibility properties of integers, and estimate the densities of gap block residues via Hardy-Littlewood k-tuple conjecture. We use this estimation to argue that the amount of admissible blocks is non-uniformly distributed, what supports the fact that the spectrum of Renyi entropies is again non-trivial in this case. We complete our analysis by applying the chaos game to these symbolic sequences, and comparing the Iterated Function System (IFS) attractors found for the experimental sequences with appropriate null models.

We prove that the digits of the primes are aperiodic in all bases with a single exception. We introduce a set of related theorems that regulate the behaviour of the natural numbers through the notion of periodicity and the computational mechanism of the binary derivative. We use these theorems to establish and then investigate the behaviour of a metric p(s') which is an analytic probability of primality. This metric is based purely upon the periodicity observed in a binary number and its binary derivatives. We demonstrate that this metric is exactly quadratic. We empirically discover a small stochastic imbalance in the number of primes in the two halves of the natural numbers partitioned by their final binary derivative. We show that this stochastic imbalance must vanish in the limit such that the variance of the difference between Pi(x) and Li(x) tends to zero. This confirms our earlier work via a different method. Proof of the Riemann Hypothesis implicitly follows through the 1901 equivalence of Von Koch. We again use our metric to reorder the number line and show that the related prime density is quadratic.

Advances in Mathematical Physics

The prime numbers have attracted mathematicians and other researchers to study their interesting qualitative properties as it opens the door to some interesting questions to be answered. In this paper, the Random Matrix Theory (RMT) within superstatistics and the method of the Nearest Neighbor Spacing Distribution (NNSD) are used to investigate the statistical proprieties of the spacings between adjacent prime numbers. We used the inverse χ 2 distribution and the Brody distribution for investigating the regular-chaos mixed systems. The distributions are made up of sequences of prime numbers from one hundred to three hundred and fifty million prime numbers. The prime numbers are treated as eigenvalues of a quantum physical system. We found that the system of prime numbers may be considered regular-chaos mixed system and it becomes more regular as the value of the prime numbers largely increases with periodic behavior at logarithmic scale.

2017

Currently there is no known efficient formula for primes. Besides that, prime numbers have great importance in e.g., information technology such as public-key cryptography, and their position and possible or impossible functional generation among the natural numbers is an ancient dilemma. The properties of the functions 2ab+a+b in the domain of natural numbers are introduced, analyzed, and exhibited to illustrate how these single out all the prime numbers from the full set of odd numbers. The characterization of odd primes vs. odd non-primes can be done with 2ab+a+b among the odd natural numbers as an analogue to the other, well known type of fundamental characterization for irrational and rational numbers among the real numbers. The prime number theorem, twin primes and erratic nature of primes, are also commented upon with respect to selection, as well as with the Fermat and Euler numbers as examples.

International Journal of General Systems, 2014

The frequency of occurrence of prime numbers at unit number spacing intervals exhibits selfsimilar fractal fluctuations concomitant with inverse power law form for power spectrum generic to dynamical systems in nature such as fluid flows, stock market fluctuations, population dynamics, etc. The physics of long-range correlations exhibited by fractals is not yet identified. A recently developed general systems theory visualises the eddy continuum underlying fractals to result from the growth of large eddies as the integrated mean of enclosed small scale eddies, thereby generating a hierarchy of eddy circulations, or an interconnected network with associated long-range correlations. The model predictions are as follows: (i) The probability distribution and power spectrum of fractals follow the same inverse power law which is a function of the golden mean. The predicted inverse power law distribution is very close to the statistical normal distribution for fluctuations within two standard deviations from the mean of the distribution. (ii) Fractals signify quantumlike chaos since variance spectrum represents probability density distribution, a characteristic of quantum systems such as electron or photon. (ii) Fractal fluctuations of frequency distribution of prime numbers signify spontaneous organisation of underlying continuum number field into the ordered pattern of the quasiperiodic Penrose tiling pattern. The model predictions are in agreement with the probability distributions and power spectra for different sets of frequency of occurrence of prime numbers at unit number interval for successive 1000 numbers. Prime numbers in the first 10 million numbers were used for the study.

Print ISBN: 978-93-48388-06-3, eBook ISBN: 978-93-48388-54-4, 2024

In this paper I present the distribution of prime numbers which was treated in many researches by studying the function of Riemann; because it has a remarkable property; its non trivial zeros are prime numbers; but in this work I will show that we can find the distribution of prime numbers on remaining in natural numbers onl

Symmetry

In this work, the Sieve of Eratosthenes procedure (in the following named Sieve procedure) is approached by a novel point of view, which is able to give a justification of the Prime Number Theorem (P.N.T.). Moreover, an extension of this procedure to the case of twin primes is formulated. The proposed investigation, which is named Limited INtervals into PEriodical Sequences (LINPES) relies on a set of binary periodical sequences that are evaluated in limited intervals of the prime characteristic function. These sequences are built by considering the ensemble of deleted (that is, 0) and undeleted (that is, 1) integers in a modified version of the Sieve procedure, in such a way a symmetric succession of runs of zeroes is found in correspondence of the gaps between the undeleted integers in each period. Such a formulation is able to estimate the prime number function in an equivalent way to the logarithmic integral function Li(x). The present analysis is then extended to the twin prime...

arXiv: Data Analysis, Statistics and Probability, 2014

Here, we propose a new tool to estimate the complexity of a time series: the entropy of difference (ED). The method is based solely on the sign of the difference between neighboring values in a time series. This makes it possible to describe the signal as efficiently as prior proposed parameters such as permutation entropy (PE) or modified permutation entropy (mPE), but (1) reduces the size of the sample that is necessary to estimate the parameter value, and (2) enables the use of the Kullback-Leibler divergence to estimate the distance between the time series data and random signals.