Numerical analysis approach to twin primes conjecture

The purpose of this paper is to demonstrate how the modified Sieve of Eratosthenes is used to have an approach to twin prime conjecture. If the Sieve is used in its basic form, it does not produce anything new. If it is used through the numerical analysis method explained in this paper, we obtain a specific counting of twin primes. This counting is based on the false assumption that distribution of primes follows punctually the Logarithmic Integral function denoted as Li(x) (see [5] and [10], pp. 174–176). It may be a starting point for future research based on this numerical analysis method technique that can be used in other mathematical branches.

The distribution of primes in a short interval

This research paper begins the presentation, with the topic of the distribution of primes in a short interval. The lower and upper limits for the number of primes within the interval are defined unambiguously. This provides us with a solid foundation, to resolve conclusively the Second Hardy-Littlewood´s conjecture. The paper concludes with the Merit of a Prime Gap and the Second Harald Cramer´s conjecture.

The Prime state and its quantum relatives

The Prime state of n qubits, |Pn⟩, is defined as the uniform superposition of all the computational-basis states corresponding to prime numbers smaller than 2n. This state encodes, quantum mechanically, arithmetic properties of the primes. We first show that the Quantum Fourier Transform of the Prime state provides a direct access to Chebyshev-like biases in the distribution of prime numbers. We next study the entanglement entropy of |Pn⟩ up to n=30 qubits, and find a relation between its scaling and the Shannon entropy of the density of square-free integers. This relation also holds when the Prime state is constructed using a qudit basis, showing that this property is intrinsic to the distribution of primes. The same feature is found when considering states built from the superposition of primes in arithmetic progressions. Finally, we explore the properties of other number-theoretical quantum states, such as those defined from odd composite numbers, square-free integers and starry primes. For this study, we have developed an open-source library that diagonalizes matrices using floats of arbitrary precision.

Erratum: Limiting properties of the distribution of primes in an arbitrarily large number of residue classes

As pointed out by Alexandre Bailleul, the paper mentioned in the title contains a mistake in Theorem 2.2. The hypothesis on the linear relation of the almost periods is not sufficient. In this note, we fix the problem and its minor consequences on other results in the same paper.

Successive Addition of Digits of an Integer Number: On Properties and Role in Studying Distribution of Primes

Successive-addition-of-digits-of-a-number(SADN) refers to the process of adding up the digits of an integer number until a single digit is obtained. Concept of SADN has been occasionally identified but seldom employed in extensive mathematical applications. This paper discusses SADN and its properties in terms of addition, subtraction and multiplication. Further, the paper applies the multiplication-property of SADN to understand the distribution of prime numbers. For this purpose the paper introduces three series of numbers -S1, S3 and S5 series- into which all odd numbers can be placed, depending on their SADN and the rationale of such classification. Extending the analysis the paper explains how composite numbers of the S1 and S5 series can be derived. Based on this discussion it concludes that even as the concept of SADN is rather simple in its formulation and appears as an obvious truism but a profound analysis of the properties of SADN in terms of fundamental mathematical functions reveals that SADN holds a noteworthy position in number theory and may have significant implications for unfolding complex mathematical questions like understanding the distribution of prime numbers and Goldbach-problem.