An Investigation on the Prime and Twin Prime Number Functions by Periodical Binary Sequences and Symmetrical Runs in a Modified Sieve Procedure
Autor: | Leonardo Santurri, Stefano Baronti, Bruno Aiazzi, Massimo Selva |
---|---|
Jazyk: | angličtina |
Rok vydání: | 2019 |
Předmět: |
Physics and Astronomy (miscellaneous)
General Mathematics Mathematics::Number Theory Twin prime 010103 numerical & computational mathematics 01 natural sciences Prime (order theory) Combinatorics Computer Science (miscellaneous) limited intervals 0101 mathematics prime number function Prime number theorem Mathematics Conjecture prime characteristic function lcsh:Mathematics 010102 general mathematics Prime number prime numbers binary periodical sequences Function (mathematics) lcsh:QA1-939 Sieve of Eratosthenes twin prime numbers Chemistry (miscellaneous) Prime Number Theorem (P.N.T.) Logarithmic integral function modified Sieve procedure prime and twin prime number function logarithmic integral estimations |
Zdroj: | Symmetry, Vol 11, Iss 6, p 775 (2019) Symmetry Volume 11 Issue 6 Symmetry (Basel) 11 (2019): 775-1–775-22. doi:10.3390/sym11060775 info:cnr-pdr/source/autori:Aiazzi B.; Baronti S.; Santurri L.; Selva M./titolo:An Investigation on the Prime and Twin Prime Number Functions by Periodical Binary Sequences and Symmetrical Runs in a Modified Sieve Procedure/doi:10.3390%2Fsym11060775/rivista:Symmetry (Basel)/anno:2019/pagina_da:775-1/pagina_a:775-22/intervallo_pagine:775-1–775-22/volume:11 |
ISSN: | 2073-8994 |
Popis: | 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 primes, by taking into account only the runs whose size is two. In this case, the proposed procedure gives an estimation of the twin prime function that is equivalent to the one of the logarithmic integral function Li 2 ( x ) . As a consequence, a possibility is investigated in order to count the twin primes in the same intervals found for the primes. Being that the bounds of these intervals are given by squares of primes, if such an inference were actually proved, then the twin primes could be estimated up to infinity, by strengthening the conjecture of their never-ending. |
Databáze: | OpenAIRE |
Externí odkaz: | |
Nepřihlášeným uživatelům se plný text nezobrazuje | K zobrazení výsledku je třeba se přihlásit. |