The Primes and Their Subsets as Continuum like the Integers

Abstract

The present paper gives the proof of the set of primes as a continuum. It starts with the density of the primes, and shortly recapitulates the prime-number-formula and the complete-prime-number-formula. Reflecting the series of the primes over any prime gives the double density of occupation of integer positions by the union of the series of multiples of the primes. The remaining free positions render it possible to prove Goldbach’s conjecture and the set of primes as a continuum. The theoretical evaluation is followed in annexes by numerical evaluation, demonstrating the theoretical results. The numerical evaluation results in different constants and relations, which represent inherent properties of the set of primes.

Share and Cite:

Doroszlai, P. and Keller, H. (2023) The Primes and Their Subsets as Continuum like the Integers. Advances in Pure Mathematics, 13, 733-750. doi: 10.4236/apm.2023.1312051.

1. Introduction

The set of primes represents a continuum, meaning that the difference between adjacent primes relative to the value of the prime (distance from the origin) approaches zero. In order to prove this prerequisite condition, the following steps starting with the density of the primes, their number and their distribution are shortly repeated, with references to more detailed evaluations.

1) First the approximation of the integral of the density by summation is shown. The error of this approximation is compensated by a recursive formula [1] .

2) The next step is the prime-number-formula and the proof, that this formula represents the low limit function of the number of primes, including the dispersion around the exact value, which is evaluated with the recursive formula, given by the complete-prime-number-formula. The standard deviation of the dispersion is proportional to the number of primes present up to the square root of the distance. The factor of proportionality is again an inherent property of the set of the primes.

3) The difference between the best estimate number of the primes over the distance and the corresponding value of the prime-number-formula is proportional to the square of the number of primes present up to the square root of the distance.

4) The dispersion of the number of primes around their best estimate value, relative to the error of the prime-number-formula is approaching zero. Therefore the prime-number-formula represents the low limit of the number of primes.

5) The double density of occupation of integral positions by the sets of multiples of the primes is introduced by reflecting the sets of the primes over a point at any distance [2] . The remaining free positions compos diads equidistantly placed primes to the point of reflection. For the sets of diads the above steps 1 to 4 are carried out. The number of equidistantly placed primes around any integer greater than two with an infinity growing low limit function proves Goldbach’s conjecture. Based on the symmetry of the set of diads it is proved, that at any distance within a section of the length equal to the square root of the distance there is at least one prime (see Annex 1).

2. The Number of Primes

De la Valée Poussin proved 1899 [3] , which the number of primes up to the distance (c) is given by the integral of the logarithmic density, which may be written as sum over all integers:

$\pi \left(c\right)=Li\left(c\right)+O\left(c\right)\approx \underset{2}{\overset{c}{\int }}\frac{1}{\mathrm{ln}\left(c\right)}\text{d}c$ ; ${\pi }_{appr}\left(c\right)\approx \underset{n=2}{\overset{c}{\sum }}\frac{1}{\mathrm{ln}\left(n\right)}$ (2.1)

This above sum may be written as summing up first over all integers within the sections of the length ( $\sqrt{c}$ ) and then summing up over all the ( $\sqrt{c}$ ) sections of the length ( $\sqrt{c}$ ). Taking the average value over each section and summing up over the sections is a first simplification (see Annex 2), in the following used as sum over all sections:

${\pi }_{appr}\left(c\right)\approx \underset{n=2}{\overset{c}{\sum }}\frac{1}{\mathrm{ln}\left(n\right)}=\underset{j=2}{\overset{\sqrt{c}}{\sum }}\left[\underset{n=\left(j-1\right)\cdot \sqrt{c}}{\overset{j\cdot \sqrt{c}}{\sum }}\frac{1}{\mathrm{ln}\left(n\right)}\right]\approx \underset{j=1}{\overset{\sqrt{c}}{\sum }}\frac{\sqrt{c}}{\mathrm{ln}\left(j\cdot \sqrt{c}\right)}$ (2.2)

The well proven prime-number-formula PNF results from a second simplification of the above approximation by taking for each of the sections the smallest value of the density at ( $j=\sqrt{c}$ ):

$\underset{j=1}{\overset{\sqrt{c}}{\sum }}\frac{\sqrt{c}}{\mathrm{ln}\left(j\cdot \sqrt{c}\right)}>PNF\left(c\right)=\underset{j=1}{\overset{\sqrt{c}}{\sum }}\frac{\sqrt{c}}{\mathrm{ln}\left(\sqrt{c}\cdot \sqrt{c}\right)}=\frac{c}{\mathrm{ln}\left(c\right)}=S\left(c\right)$ (2.3)

The difference between the sum over all sections of the number of primes and the value resulting from the PNF [2] , is proportional to ( $R{\left(c\right)}^{2}$ ), the square of the number of primes up to the distance ( $\sqrt{c}$ ):

$\begin{array}{l}\underset{j=1}{\overset{\sqrt{c}}{\sum }}\frac{\sqrt{c}}{\mathrm{ln}\left(j\cdot \sqrt{c}\right)}-\underset{j=1}{\overset{\sqrt{c}}{\sum }}\frac{\sqrt{c}}{\mathrm{ln}\left(\sqrt{c}\cdot \sqrt{c}\right)}=\underset{j=1}{\overset{\sqrt{c}}{\sum }}\frac{\sqrt{c}}{\mathrm{ln}\left(j\cdot \sqrt{c}\right)}-\frac{\sqrt{c}}{\mathrm{ln}\left(c\right)}\cdot \underset{j=1}{\overset{\sqrt{c}}{\sum }}1\\ =\underset{j=1}{\overset{\sqrt{c}}{\sum }}\frac{\sqrt{c}}{\mathrm{ln}\left(j\cdot \sqrt{c}\right)}-S\left(c\right)={\gamma }_{c}\cdot R{\left(c\right)}^{2}\end{array}$ (2.4)

because the value ( ${\gamma }_{c}$ ) quickly and asymptotically converges to a constant value:

$\begin{array}{c}{\gamma }_{c}=\frac{\sqrt{c}}{\mathrm{ln}\left(c\right)\cdot R{\left(c\right)}^{2}}\cdot \left(\underset{j=1}{\overset{\sqrt{c}}{\sum }}\frac{\mathrm{ln}\left(c\right)}{\mathrm{ln}\left(j\cdot \sqrt{c}\right)}-\sqrt{c}\right)=\frac{1}{2\cdot R\left(c\right)}\cdot \left(\underset{j=1}{\overset{\sqrt{c}}{\sum }}\frac{\mathrm{ln}\left(c\right)}{\mathrm{ln}\left(j\cdot \sqrt{c}\right)}-\sqrt{c}\right)\\ =\frac{1}{R\left(c\right)}\cdot \left(\underset{j=1}{\overset{\sqrt{c}}{\sum }}\frac{\mathrm{ln}\left(\sqrt{c}\right)}{\mathrm{ln}\left(j\cdot \sqrt{c}\right)}-\frac{\sqrt{c}}{2}\right)\end{array}$ (2.5)

Thus, the error of the second simplification resulting the PNF at the distance (c) is proportional to ( $R{\left(c\right)}^{2}$ ), the square of the number of primes present at ( $\sqrt{c}$ ). The factor of proportionality is evaluated in Annex 3 as ( ${\gamma }_{c}=0.28264$ ):

The relation between the error of the PNF at (c) and the square of the number of primes up to ( $\sqrt{c}$ ) is invariant. The constant factor of proportionality ( $\sqrt{{\gamma }_{c}}$ ) is an inherent propriety of the number of primes.

The systematic error of the PNF may be corrected by recursive application of a correction, resulting the complete-prime-number-Formula (CPNF) below, evaluated and demonstrated in ref [1] :

${\pi }_{appr}\left(c\right)=\underset{j=1}{\overset{\sqrt{c}}{\sum }}\frac{\sqrt{c}}{\mathrm{ln}\left(j\cdot \sqrt{c}\right)}+\underset{m=1}{\overset{\sqrt{c}}{\sum }}\left[{\left({\gamma }_{sec}\right)}^{m}\cdot \underset{j=1}{\overset{{e}^{\left(\frac{1}{{2}^{m+1}}\right)}}{\sum }}\frac{{e}^{\left(\frac{1}{{2}^{m+1}}\right)}}{\mathrm{ln}\left[j\cdot {e}^{\left(\frac{1}{{2}^{m+1}}\right)}\right]}\right]$ (2.6)

This formula converges very fast: Two steps with ( $m=2$ ) are already sufficient.

The factor ( ${\gamma }_{sec}=-0.041663$ ) is an inherent property of the set of primes.

Further, this formula gives identical results (see Annex 3) as ( $Li\left(c\right)$ ):

$\pi \left(c\right)=Li\left(c\right)+O\left(c\right)={\pi }_{appr}\left(c\right)+O\left(c\right)$ ; $\Delta {\pi }_{appr}\left(c\right)={\pi }_{appr}\left(c\right)-\pi \left(c\right)$ (2.7)

The remaining error is the dispersion around the CPNF (see Annex 4). It is proportional to the number of primes up to ( $R\left(c\right)$ ), the series of multiples which are covering positions at (c):

$S{D}_{\Delta \pi _appr_re}\left(c\right)=\sqrt{\frac{1}{k}\underset{j=1}{\overset{k}{\sum }}{\left(\frac{\Delta {\pi }_{appr}\left(c\right)}{R\left(c\right)}\right)}^{2}}$ ; $\underset{c\to \infty }{\mathrm{lim}}S{D}_{\Delta \pi _appr_re}\left(c\right)=0.160989$ (2.8)

Therefore, the dispersion of the effective number of primes around the CPNF relative to ( $R\left(c\right)$ ) is symmetrical around zero (with the factor of the standard deviation ( ${F}_{SD_\Delta \pi }=0.118234$ ), as demonstrated in Annex 4. The error term is limited and approaches zero:

$S{D}_{\Delta \pi _appr}\left(c\right)=\left({F}_{SD_\Delta \pi }±{\Delta }_{SD}\right)$ ; ${\Delta }_{SD}<0.02$ ; $\underset{c\to \infty }{\mathrm{lim}}\Delta {\pi }_{appr}\left(c\right)=O\left(c\right)=0$(2.9)

With (2.5) the difference between the best estimate number of primes CPNF and the PNF (the error of the PNF) is growing proportional to ( $R{\left(c\right)}^{2}$ ) while the width of the dispersion grows proportional to ( $R\left(c\right)$ ).

Therefore, the relation of the width of the dispersion to the error of the PNF is approaches zero with the distance (c) growing:

$\begin{array}{l}\underset{c\to \infty }{\mathrm{lim}}\left(\frac{{F}_{SD_\Delta \pi }\cdot R\left(c\right)}{{\gamma }_{c}\cdot R{\left(c\right)}^{2}}\right)=0\text{\hspace{0.17em}};\\ \underset{c\to \infty }{\mathrm{lim}}\left(\frac{{\gamma }_{c}\cdot R{\left(c\right)}^{2}}{S\left(c\right)}\right)=\underset{c\to \infty }{\mathrm{lim}}\left(\frac{{\gamma }_{c}\cdot \frac{2\cdot c}{\mathrm{ln}{\left(c\right)}^{2}}}{\frac{c}{\mathrm{ln}\left(c\right)}}\right)=\underset{c\to \infty }{\mathrm{lim}}\left({\gamma }_{c}\cdot \frac{2}{\mathrm{ln}\left(c\right)}\right)=0\end{array}$ (2.10)

The fact that the error of the PNF relative to the PNF and herewith the dispersion around the CPNF are approaching zero with the distance indicates that the set of primes is approaching continuity with the distance:

$\underset{c\to \infty }{\mathrm{lim}}\left(\frac{{F}_{SD_\Delta \pi }\cdot R\left(c\right)}{S\left(c\right)}\right)=\underset{c\to \infty }{\mathrm{lim}}\left(\frac{{F}_{SD_\Delta \pi }\cdot \frac{\sqrt{c}}{\mathrm{ln}\left(\sqrt{c}\right)}}{\frac{c}{\mathrm{ln}\left(c\right)}}\right)=\underset{c\to \infty }{\mathrm{lim}}\left(\frac{2\cdot {F}_{SD_\Delta \pi }}{\sqrt{c}}\right)=0$ (2.11)

Reflecting the series of multiples of any prime over a point at the distance (c) from the origin results the double density of occupation of integer positions within the interval ( $0 ) by the series of multiples of the primes if the prime is a relative prime to (c). This, because the positions covered by the straight and the reflected series of multiples are mutually exclusive for each prime if (c) is equal to a prime, greater than two. Reflected series of multiples of prime divisors of (c) do not change the occupation of integer positions: The number of remaining free integer positions has a minimum, if the point of reflection is a prime. This is demonstrated in Annex 5, Figure A4. The integer positions remaining free by the double density of occupation represent equidistant primes to the point of reflection, composing diads [2] . If any of the primes is a dividend of the distance of the point of reflection (c), then the reflected series of this specific prime does not cover additional positions: Therefore, the double density of occupation—with (c) as a prime—represents the minimum of positions left free by the double density of occupation.

The local density of free positions left by the density of occupation of the straight series of multiples of primes at the distance ( $c+d$ , $1 ) is ( $\frac{1}{\mathrm{ln}\left(c-d\right)}$ ) and by the reflected series it is ( $\frac{1}{\mathrm{ln}\left(c+d\right)}$ ). The combined local density of free positions—the density of diads—is evaluated in [2] yielding with the constant ( ${\delta }_{2}=1.320324$ ). This constant has the double value of the twin prime constant (C2), defined by G. H. Hardy and John Littlewood [4] :

${D}_{local}\left(c,d\right)=\frac{{\delta }_{2}}{\mathrm{ln}\left(c-d\right)\cdot \mathrm{ln}\left(c+d\right)}>\frac{{\delta }_{2}}{\mathrm{ln}{\left(c\right)}^{2}}$ (3.1)

Similarly to the evaluation of the number of primes as simplification of the integral of the local logarithmic density of primes in (2.1), the best estimate of the local density of the diads results as simplification of the integral of the above density by taking the sum over all integers (This same generalization from the primes to the twins, respectively to the k-tuples was made already by G. H. Hardy and John Littlewood):

${\pi }_{diad_appr}\left(c\right)=\underset{n=1}{\overset{c}{\sum }}\frac{{\delta }_{2}}{\mathrm{ln}\left(c-d\right)\cdot \mathrm{ln}\left(c+d\right)}$ (3.2)

This function results the best estimate value of the number of diads CDNF see Annex 5. The dispersion of the effective number of diads around this function is symmetrical, there is no correction of this function required. The reason is the symmetry of the set of diads.

This above sum may be written as summing up first over all integers within the sections of the length ( $\sqrt{c}$ ) and then summing up over all the ( $\sqrt{c}$ ) sections, analogue to (2.2). Taking the average value over each section and—as a first simplification—summing over the sections gives the best estimate value of the number of diads:

${\pi }_{diad_appr}\left(c\right)=\underset{j=1}{\overset{\sqrt{c}}{\sum }}\underset{n=\left(j-1\right)\sqrt{c}}{\overset{j\cdot \sqrt{c}}{\sum }}\frac{{\delta }_{2}\cdot \sqrt{c}}{\mathrm{ln}\left(n\right)\cdot \mathrm{ln}\left(\cdot 2c-n\right)}\approx \underset{j=1}{\overset{\sqrt{c}}{\sum }}\frac{{\delta }_{2}\cdot \sqrt{c}}{\mathrm{ln}\left(j\cdot \sqrt{c}\right)\cdot \mathrm{ln}\left(\cdot 2c-j\cdot \sqrt{c}\right)}$ (3.3)

Similarly, to the second simplification in case of the primes in (2.3), the low limit of the best estimate number of diads results—with the density taken for all sections of the length ( $\sqrt{c}$ )—at the upper limit of the sections at ( $j=\sqrt{c}$ ) the diads-number-Formula (DNF):

${\pi }_{diad_appr_local}\left(c\right)=DNF\left(c\right)=\underset{j=1}{\overset{\sqrt{c}}{\sum }}\frac{{\delta }_{2}\cdot \sqrt{c}}{\mathrm{ln}\left(\sqrt{c}\cdot \sqrt{c}\right)\cdot \mathrm{ln}\left(\cdot 2c-\sqrt{c}\cdot \sqrt{c}\right)}=\frac{{\delta }_{2}\cdot c}{\mathrm{ln}{\left(c\right)}^{2}}$ (3.4)

dispersion is additive. Therefore, the dispersion in case of the double density of occupation is as well proportional to ( $R\left(c\right)$ ), the number of primes covering positions at the distance (c).

$\Delta {\pi }_{diads}\left(c\right)={\pi }_{diads_appr}\left(c\right)-{\pi }_{diads_eff}\left(c\right)$ ; ${\pi }_{diads_rel}\left(c\right)=\frac{\Delta {\pi }_{diads}\left(c\right)}{R\left(c\right)}$ (3.5)

Therefore, the standard deviation f the relative dispersion of the diads approaches a constant value, similarly to the standard deviation of the dispersion of the effective number of the primes around the CPNF:

$\underset{c\to \infty }{\mathrm{lim}}SD$ $\underset{c\to \infty }{\mathrm{lim}}{\pi }_{diads_rel}\left(c\right)=\underset{c\to \infty }{\mathrm{lim}}\sqrt{\frac{1}{c}\underset{c}{\sum }{\left({\pi }_{diads_rel}\left(c\right)\right)}^{2}}=0.16089$ (3.6)

The difference between the number of diads CDNF (3.2) and the value resulting from the DNF is proportional to ( $R{\left(c\right)}^{2}$ ), the square of the number of primes up to the distance ( $\sqrt{c}$ ) on the power (y, $\frac{3}{2} ). The factor of proportionality ( ${\gamma }_{d}$ ) quickly and asymptotically converges with ( $y=1.836$ ) to a constant value ( ${\gamma }_{d}=0.040488$ ), as shown in Annex 6.

$\begin{array}{l}\underset{j=1}{\overset{\sqrt{c}}{\sum }}\frac{{\delta }_{2}\cdot \sqrt{c}}{\mathrm{ln}\left(j\cdot \sqrt{c}\right)\cdot \mathrm{ln}\left(2\cdot c-j\cdot \sqrt{c}\right)}-\underset{j=1}{\overset{\sqrt{c}}{\sum }}\frac{{\delta }_{2}\cdot \sqrt{c}}{\mathrm{ln}\left(\sqrt{c}\cdot \sqrt{c}\right)\cdot \mathrm{ln}\left(2\cdot c-\sqrt{c}\cdot \sqrt{c}\right)}\\ =\underset{j=1}{\overset{\sqrt{c}}{\sum }}\frac{{\delta }_{2}\cdot \sqrt{c}}{\mathrm{ln}\left(j\cdot \sqrt{c}\right)\cdot \mathrm{ln}\left(2\cdot c-j\cdot \sqrt{c}\right)}-\frac{{\delta }_{2}\cdot c}{\mathrm{ln}{\left(c\right)}^{2}}>{\gamma }_{d}\cdot R{\left(c\right)}^{2}\end{array}$ (3.7)

On the other hand, the low limit of the difference between the best estimate value and the low limit of the number of diads may be written as follows:

$\begin{array}{c}{\pi }_{diads_appr}\left(c\right)-{\pi }_{diads_appr_low}\left(c\right)=\underset{j=1}{\overset{\sqrt{c}}{\sum }}\frac{{\delta }_{2}\cdot \sqrt{c}}{\mathrm{ln}\left(j\cdot \sqrt{c}\right)\cdot \mathrm{ln}\left(2\cdot c-j\cdot \sqrt{c}\right)}-\frac{{\delta }_{2}\cdot c}{\mathrm{ln}{\left(c\right)}^{2}}\\ >\underset{j=1}{\overset{\sqrt{c}}{\sum }}\frac{{\delta }_{2}\cdot \sqrt{c}}{\mathrm{ln}\left(c\right)\cdot \mathrm{ln}\left(2\cdot c-c\right)}-\frac{{\delta }_{2}\cdot c}{\mathrm{ln}{\left(c\right)}^{2}}\end{array}$ (3.8)

Resulting the low limit as:

$\begin{array}{c}\frac{{\delta }_{2}}{\mathrm{ln}\left(c\right)}\cdot {\pi }_{appr}\left(c\right)-\frac{{\delta }_{2}\cdot c}{\mathrm{ln}{\left(c\right)}^{2}}=\frac{{\delta }_{2}}{\mathrm{ln}\left(c\right)}\cdot \left(S\left(c\right)+4\cdot {\gamma }_{c}\cdot {\delta }_{2}\cdot R{\left(c\right)}^{2}\right)-\frac{{\delta }_{2}\cdot c}{\mathrm{ln}{\left(c\right)}^{2}}\\ =4\cdot {\gamma }_{c}\cdot {\delta }_{2}\cdot \frac{c}{ln{\left(c\right)}^{2}}\end{array}$ (3.9)

Herewith the difference between the CDNF and the DNF—the error of the DNF—is growing proportional to ( $R{\left(c\right)}^{y}$ , $y>\frac{3}{2}$ ) while the width of the dispersion around the CDNF grows proportional to ( $R\left(c\right)$ ).

Therefore, the relation of the width of the dispersion around the CDNF to the error of the DNF is approaching zero with the distance (c) growing:

$\underset{c\to \infty }{\mathrm{lim}}\left(\frac{{F}_{SD_\Delta \rho }\cdot R\left(c\right)}{{\gamma }_{d}\cdot R{\left(c\right)}^{2}}\right)<\underset{c\to \infty }{\mathrm{lim}}\left(\frac{{F}_{SD_\Delta \pi }}{{\gamma }_{d}\cdot \sqrt{R\left(c\right)}}\right)=0$ (3.10)

$\underset{c\to \infty }{\mathrm{lim}}\left(\frac{{\gamma }_{d}\cdot R{\left(c\right)}^{2}}{S\left(c\right)}\right)=\underset{c\to \infty }{\mathrm{lim}}\left(\frac{{\gamma }_{d}\cdot \frac{4\cdot c}{\mathrm{ln}{\left(c\right)}^{2}}}{\frac{c}{\mathrm{ln}\left(c\right)}}\right)=\underset{c\to \infty }{\mathrm{lim}}\left(4\cdot {\gamma }_{d}\cdot {\left({c}^{\left(1-\frac{y}{2}\right)}\cdot \mathrm{ln}{\left(c\right)}^{2\cdot y-1}\right)}^{-1}\right)=0$

The fact, that the dispersion of the effective number of diads around the CDNF relative to the DNF approaches zero with the distance indicates, that the set of diads is approaching continuity:

$\begin{array}{c}\underset{c\to \infty }{\mathrm{lim}}\left(\frac{{F}_{SD_\Delta \pi _diads}\cdot R\left(c\right)}{{\pi }_{diads_apr_low}\left(c\right)}\right)=\underset{c\to \infty }{\mathrm{lim}}\left(\frac{{F}_{SD_\Delta \pi _diads}\cdot \frac{\sqrt{c}}{\mathrm{ln}\left(\sqrt{c}\right)}}{\frac{{\delta }_{2}\cdot c}{\mathrm{ln}{\left(c\right)}^{2}}}\right)\\ =\underset{c\to \infty }{\mathrm{lim}}\left(\frac{4\cdot {F}_{SD_\Delta \pi _diads}}{R\left(c\right)}\right)=0\end{array}$ (3.11)

Therefore, the DNF represents for each integer greater then two a monotonously to infinity growing low limit function. It is defined for primes as point of reflection of the double density of occupation by the series of multiples of primes. If the point of reflection is not a prime, the dividends of the distance up to the point of reflection cover no additional integer positions, then in case of the single density of occupation and the number of the remaining free positions (diads) remain larger. This is the case as well for even numbers as points of reflection, proving Goldbach’s conjecture.

The best estimate values of the diads, given by the approximating functions, the dispersion of the effective values around the best estimate values and the low limit functions are evaluated with the same method. Because the PNF is well proven for the set of the primes, the DNF and the other results for the diads are proven on the same right.

Diads with the central prime of reflection compose triads, the triads-number-formula TNF is with the density of primes therefore ( $\frac{{\delta }_{2}\cdot c}{\mathrm{ln}{\left(c\right)}^{3}}$ ).

Reflecting the union of the series of multiples of the primes additionally over the primes at both ails of the triads gives the set of five equidistant primes, the pentids. The number of the pentids , the pentides-number-formula PENF is ( $\frac{{\delta }_{5}\cdot c}{\mathrm{ln}{\left(c\right)}^{5}}$ ).

All formula for the number of the remaining free positions in case symmetric coverage of the set of integer positions—like (3.3)—do not require any correction, like the number the of primes (2.2) to (2.6). The origin of the required correction is therefore the asymmetry of the sets of primes.

4. The Continuity of the Set of Primes as Variable

Comparing the sets of primes and diads, the following similarities are obvious:

With (2.5) the difference between the best estimate number of primes CPNF and the PNF is proportional to ( $R{\left(c\right)}^{2}$ ), the square of the number of primes up to ( $\sqrt{c}$ ).

Similarly, with (3.7) the difference between the best estimate number of diads CDNF and the CDNF is proportional to ( $R{\left(c\right)}^{2}$ ), the square of the number of primes up to ( $\sqrt{c}$ ).

With (2.4) and (3.8) the factors of proportionality ( ${\gamma }_{d}=0.28298$ ) and ( ${\gamma }_{c}=0.29839$ ) are similar.

With (2.10) and (3.9) the dispersion around the effective numbers of primes, respectively diads are approaching zero, when compared with the differences between CPNF and PNF, respectively between CDNF and DNF, therefore the low limit functions are effectively low limit functions.

Now comes an important point: Taking the best estimate numbers of the diads in (3.3) in the first section from zero to ( $\sqrt{c}$ ), the number of free positions composing diads is:

$\begin{array}{c}{\pi }_{diads_appr_first}\left(c\right)\approx \frac{{\delta }_{2}\cdot \sqrt{c}}{\mathrm{ln}\left(\sqrt{c}\right)\cdot \mathrm{ln}\left(2\cdot c-\sqrt{c}\right)}>\frac{2\cdot {\delta }_{2}\cdot \sqrt{c}}{\mathrm{ln}\left(c\right)\cdot \mathrm{ln}\left(2\cdot c\right)}\\ =\frac{2\cdot {\delta }_{2}\cdot \sqrt{c}}{\mathrm{ln}\left(c\right)\cdot \left(\mathrm{ln}\left(2\right)+\mathrm{ln}\left(c\right)\right)}\approx \frac{2\cdot {\delta }_{2}\cdot \sqrt{c}}{\mathrm{ln}{\left(c\right)}^{2}}\end{array}$ (4.1)

Taking the sum of the diads over the first sections up to ( $\sqrt{c}$ ) does not influence the validity of the properties of the set of the diads: everything valid for the whole set of diads up to the distance (c) remains valid for the subinterval up to the distance ( $\sqrt{c}$ ). This fact is demonstrated in Annex 7.

Because of symmetry over (c), in case of the double density of occupation, the same amount of diads is present within the last section from ( $2\cdot c-\sqrt{c}$ ) to ( $2\cdot c$ ), (the same length) and their number is growing to infinity as well:

${\pi }_{diads_appr_last}\left(c\right)\approx {\pi }_{DNF_last}\left(c\right)=\frac{2\cdot {\delta }_{2}\cdot \sqrt{c}}{\mathrm{ln}{\left(c\right)}^{2}}$ ; $\underset{c\to \infty }{\mathrm{lim}}\left(\frac{2\cdot {\delta }_{2}\cdot \sqrt{c}}{\mathrm{ln}{\left(c\right)}^{2}}\right)=\infty$ (4.2)

If in case of the double density of occupation at ( $2\cdot c-\sqrt{c}$ ) the number of free positions within the last section of the length ( $\sqrt{c}$ ) is rising without limit to infinity, then this is certainly the case as well within the larger distance for the last section of the length ( $\sqrt{2\cdot c}$ ) and even more in case of the single density of occupation.

The same is the case within the section of the length ( $\sqrt{c}$ ) following ( $2\cdot c$ ) and therefore within the section of the length ( $\sqrt{2\cdot c}$ ) following ( $2\cdot c$ ) as well. This, because the first free position covered by the series of multiples of the smallest possible prime greater than ( ${P}_{\left(R\left(c\right)\right)}$ ), equal to ( ${P}_{\left(R\left(c\right)+1\right)}$ ) is already greater than ( $c+\sqrt{c}$ ).

This smallest prime must be ( ${P}_{\left(R\left(c\right)\right)}+2$ ) in case ( ${P}_{\left(R\left(c\right)\right)}$ ) and ( ${P}_{\left(R\left(c\right)+1\right)}$ ) are twins. In this case ( ${P}_{\left(R\left(c\right)+1\right)}\ge \sqrt{c}+1$ ) and the square of this smallest possible prime is already over ( $c+\sqrt{c}$ ):

$\begin{array}{c}{P}_{\left(R\left(c\right)+1\right)}^{2}={\left({P}_{\left(R\left(c\right)\right)}+2\right)}^{2}={P}_{\left(R\left(c\right)\right)}^{2}+4\cdot {P}_{\left(R\left(c\right)\right)}+4\ge {\left(\sqrt{c}-1\right)}^{2}+4\cdot \left(\sqrt{c}-1\right)+4\\ =c-2\cdot \sqrt{c}+1+4\cdot \sqrt{c}-4+4=c+2\cdot \sqrt{c}+1>c+\sqrt{c}\end{array}$ (4.3)

Herewith the low limit of free positions left within the section of the size ( $\sqrt{c}$ ) following (c) is not smaller, than the number of free positions within the last section of the same size just below (c).

It follows, that the set of the primes up to ( ${P}_{\left(R\left(c\right)\right)}$ ) normed with this last prime represent, as limit, a continuum, since for any prime within the set the following limit is valid:

$\frac{{P}_{\left(p+1\right)}-{P}_{\left(p\right)}}{{P}_{\left(p\right)}}<\frac{{P}_{\left(p\right)}+2\cdot \sqrt{{P}_{\left(p\right)}}+1-{P}_{\left(p\right)}}{{P}_{\left(p\right)}}=\frac{2\cdot \sqrt{{P}_{\left(p\right)}}+1}{{P}_{\left(p\right)}}<\frac{3}{\sqrt{{P}_{\left(p\right)}}}$ ; $\underset{p\to \infty }{\mathrm{lim}}\frac{3}{\sqrt{{P}_{\left(p\right)}}}=0$ (4.4)

herewith: $\underset{p\to \infty }{\mathrm{lim}}\frac{{P}_{\left(p+1\right)}-{P}_{\left(p\right)}}{{P}_{\left(p\right)}}=0$

The knowledge of the function of the best estimate value of the number of the primes allows for the evaluation of the standard deviation of the effective number of the primes around the exact function, given in ref [2] . From the constancy of the relative value of the standard deviation follows the integrability on the inverse of the primes.

5. Conclusions

The reflection of the set of the union of the series of multiples of the primes over any position equal to an integer greater than two leaves positions of integers free, which compose subsets of the primes. This subset up to the point of reflection has similar properties to the primes. Its symmetry around the point of reflection allows it to prove Goldbach’s conjecture and the continuity of the set of primes.

The number of sets of primes with distances of any even integer between its primes is similarly unlimited. All these sets have the best-estimated number of primes with the dispersion of the effective numbers around these best-estimated functions. All these sets have low limit functions of their number of primes. The distance between the best estimate function and the low limit function grows to infinity and remains always infinitely larger than the dispersion. Therefore, all of these sets compose continuums within the set of integers.

Annexes

Annex 1: Definition of Vectors and Variables for the Numeric Evaluation

First some general functions and values are defined: Based on the requirement of the constrain of non-divisibility by all smaller primes, a set of consecutive primes is evaluated and written to a file.

From this file they are read: ( $P=\text{READPRN}\left("\text{Primes}_\text{large}\text{.prn}"\right)$ ). The number of the primes in the set and their numbering are: ( ${N}_{P}=length\left(P\right)-1=5003713$ , $n=1,2,\cdots ,{N}_{P}$ ).

The complete-prime-number-formula CPNF, (2.6) is evaluated with the following routine (floor and ceil stand for round down and round up):

$\mathrm{exp}_\left(x\right)={e}^{x}$ ; ${\gamma }_{\mathrm{sec}}=-0.036765$ ; $c_\mathrm{exp}\left(c,m\right)=\mathrm{exp}_\left(\frac{1}{{2}^{m+1}}\right)$ (A1.1)

For the evaluation of the number of the next smaller prime to the distance (c) the routine resulting the index ( ${n}_{next}\left(c,{n}_{last}\right)$ ) of the prime next to any integer is needed ( ${P}_{\left(n\right)}\le c<{P}_{\left(n+1\right)}$ ). The evaluation starts either at the last evaluated index ( ${n}_{last}$ ), or at the index resulting from the complete-prime-number-Formula (see A1.1 and ref. [2] ). This shortens the evaluation process. In case ( ${P}_{\left(n\right)}$ ) is greater than the distance, the index is lowered. In case it is smaller, the index is risen until the corresponding prime is just smaller, or equal to the distance:

(A1.2)

Further functions are the formula evaluating the index of the next smaller prime to any distance and to the square root of any distance:

${S}_{eff}\left(c\right)={n}_{next}\left(c,1\right)$ ; ${R}_{eff}\left(c\right)={n}_{next}\left(\sqrt{c},1\right)$ ; $S\left(c\right)=\frac{c}{\mathrm{ln}\left(c\right)}$ ; $R\left(c\right)=\frac{\sqrt{c}}{\mathrm{ln}\left(\sqrt{c}\right)}$ (A1.3)

For the visualization of the results of the analysis the functions will be taken at sparse values, at distances corresponding to multiples of the square root of the largest prime considered. The index (kk) of the sparse values for the diads is limited to half the number of the index (k) in case of the primes:

$\Delta {\Delta }_{sp}=floor\left[\sqrt{{P}_{\left({N}_{P}\right)}}\right]$ ; ${k}_{limit}=floor\left[\frac{{P}_{\left({N}_{P}\right)}}{\Delta {\Delta }_{sp}}\right]-2$ ; $k=1,2,\cdots ,{k}_{limit}$ ;

${c}_{sp}{}_{\left(k\right)}=k\cdot \Delta {\Delta }_{sp}$ (A1.4)

$k{k}_{limit}=floor\left[\frac{{k}_{limit}}{2}\right]-1$ ; $kk=1,2,\cdots ,k{k}_{limit}$ ; $k{k}_{limit}=4637$

The vectors of the indexes of the primes next smaller to these sparse distances ( ${P}_{\left({n}_{sp\left(k\right)}\right)}\le {c}_{s{p}_{\left(k\right)}}<{P}_{\left({n}_{sp\left(k+1\right)}\right)}$ ), respectively to their square roots ( ${P}_{\left({n}_{sp\left(k\right)}\right)}\le \sqrt{{c}_{s{p}_{\left(k\right)}}}<{P}_{\left({n}_{sp\left(k+1\right)}\right)}$ ) are evaluated as ( ${\pi }_{sp}\left(c\right)$ ), respectively as ( ${\pi }_{sp}\left(\sqrt{c}\right)$ ). They are evaluated once and written to files. They are read from these files:

${\pi }_{sp}{}_{\left(k\right)}={n}_{next}\left[{c}_{s{p}_{\left(k\right)}},1\right]$ ; ${\pi }_{sp}{}_{\left(k\right)}={n}_{next}\left[\sqrt{{c}_{s{p}_{\left(k\right)}}},1\right]$ (A1.5)

$\text{WRITEPRN}\left("\text{index}_\text{distance}_\text{sp}\text{.prn}"\right)={\pi }_{sp}$ ;

${\pi }_{sp}=\text{READPRN}\left("\text{index}_\text{distance}_\text{sp}\text{.prn}"\right)$

$\text{WRITEPRN}\left("\text{index}_\text{distance}_\text{sqr}_\text{sp}\text{.prn}"\right)={\pi }_{sqr_sp}$

${\pi }_{sqr_sp}=\text{READPRN}\left("\text{index}_\text{distance}_\text{sqr}_\text{sp}\text{.prn}"\right)$

Annex 2: Evaluation of the Number of Primes as Sum over Sections and of the Factor of Correction of the Sum over All Sections

The number of primes as sum over sections is evaluated with (2.2) as a first simplification:

${\pi }_{sec_appr_}\left(c\right)=\underset{j=1}{\overset{floor\sqrt{c}}{\sum }}\frac{\sqrt{c}}{\mathrm{ln}\left(j\cdot \sqrt{c}\right)}$ (A2.1)

The approximating function is evaluated at sparse distances, respectively at the next smaller prime to these distances ( ${P}_{\left({n}_{s{p}_{\left(k\right)}}\right)}\le {c}_{s{p}_{\left(k\right)}}<{P}_{\left({n}_{s{p}_{\left(k+1\right)}}\right)}$ ) with (2.2). The evaluation at the next smaller prime corresponding to each distance assures, that the evaluated numbers of the primes correspond exactly to the distances considered:

${\pi }_{sec_appr}{}_{\left(k\right)}={\pi }_{sec_appr_}\left({P}_{\left({n}_{s{p}_{\left(k\right)}}\right)}\right)$ (A2.2)

They are evaluated once and written to a file. They are read from this file:

$\text{WRITEPRN}\left("\text{pr}_\mathrm{sec}_\text{appr}_\text{sp}_\text{t}\text{.prn}"\right)={\pi }_{sec_appr}$

${\pi }_{sec_appr}=\text{READPRN}\left("\text{pr}_\mathrm{sec}_\text{appr}_\text{sp}_\text{t}\text{.prn}"\right)$

The result of the first simplification (2.2) giving the sum over the sections of the density of primes has an error. This error is proportional to the number of primes up to ( $\sqrt{c}$ ). The error relative to ( $\pi \left(\sqrt{c}\right)$ ) results the factor of correction. Assuming the factor of correction ( ${\gamma }_{sec}$ ) is constant over the distance (c), it may be evaluated as relation of the average error to the effective number of primes ( $\pi \left(\sqrt{c}\right)=R\left({P}_{\left({\pi }_{s{p}_{\left(k\right)}}\right)}\right)$ ). The average error is:

$\Delta {\pi }_{se{c}_{\left(k\right)}}={\pi }_{sec_app{r}_{\left(k\right)}}-{\pi }_{s{p}_{\left(k\right)}}$ ; $\Delta {\pi }_{sec_a{v}_{\left(k\right)}}=\frac{1}{k}\cdot \underset{j=1}{\overset{k}{\sum }}\Delta {\pi }_{se{c}_{\left(j\right)}}$ (A2.3)

The value of the factor of correction is herewith:

${\gamma }_{sec}\left(c\right)=\frac{\Delta {\pi }_{sec_av}\left(c\right)}{\pi \left(\sqrt{c}\right)}$ ; ${\gamma }_{sec{_}_{\left(k\right)}}=\frac{\sqrt{2}\cdot \Delta {\pi }_{sec_av}\left(c\right)}{R\left({P}_{\left({\pi }_{s{p}_{\left(k\right)}}\right)}\right)}$ ; ${\gamma }_{sec}={\gamma }_{sec{_}_{\left({k}_{limit}\right)}}=-0.041663$ (A2.4)

Figure A1 shows the independence of the factor of correction ( ${\gamma }_{sec}$ ) from the distance. The averaging process (A2.3) to evaluate the factor of correction is therefore justified. This factor ( ${\gamma }_{sec}=-0.041663$ ) is invariant, an inherent property of the prime numbers. It is important because it is applied in the recursive Formula (2.6) of the complete-prime-number-formula CPNF.

Figure A1. Convergence of the relation of the average relative error of the sum over all sections.

Annex 3: Evaluation of the CPNF and the Error of the Second Simplification

The results of the CPNF, (2.6) are evaluated with (A1.1) once at sparse values of the distance ( ${c}_{s{p}_{\left(k\right)}}$ ). They are written to a file and are read from this file:

${\pi }_{app{r}_{\left(k\right)}}={\pi }_{appr_}\left({P}_{\left({\pi }_{s{p}_{\left(k\right)}}\right)}\right)$ (A3.1)

$\text{WRITEPRN}\left("\text{Pi}_\text{appr}_\text{sp}\text{.prn}"\right)={\pi }_{appr}$ ;

${\pi }_{appr}=\text{READPRN}\left("\text{Pi}_\text{appr}_\text{sp}\text{.prn}"\right)$

The number of primes resulting from the second simplification (2.3) results the PNF. The difference between the CPNF and the PNF results the error of the PNF. At the instance (c) it is proportional to ( $R{\left(c\right)}^{1.9829} ), the square of the number of primes covering positions at the distance ( $\sqrt{c}$ ). The factor of the proportionality ( ${\gamma }_{c}$ ) is illustrated in Figure A2 below:

Figure A2. Relation of the difference between the best estimate number of primes (CPNF) and its value evaluated with the prime-number-Formula (PNF) to ( $R{\left(c\right)}^{2}$ ).

$\Delta {\pi }_{appr}\left(c\right)={\pi }_{appr_c_}\left(c\right)-S\left(c\right)$ ; $\Delta {\pi }_{app{r}_{\left(k\right)}}={\pi }_{app{r}_{\left(k\right)}}-S\left({c}_{s{p}_{\left(k\right)}}\right)$ (A3.2)

${\gamma }_{c}\left(c\right)=\frac{\Delta {\pi }_{appr}\left(c\right)}{R{\left(c\right)}^{1.9829}}>\frac{\Delta {\pi }_{appr}\left(c\right)}{R{\left(c\right)}^{2}}$ ; ${\gamma }_{c{_}_{\left(k\right)}}=\frac{\Delta {\pi }_{appr}\left(c\right)}{R{\left(c\right)}^{1.9829}}>\frac{\Delta {\pi }_{app{r}_{\left(k\right)}}}{R{\left({c}_{s{p}_{\left(k\right)}}\right)}^{2}}$ ;

${\gamma }_{c}={\gamma }_{c{_}_{\left({k}_{limit}\right)}}=0.28264$

Annex 4: Dispersion of the Effective Number of Primes around the CPNF

The standard deviation SD of the relative dispersion of the primes around their best approximation (2.8) is evaluated as follows:

$\Delta {\pi }_{\left(k\right)}={\pi }_{app{r}_{\left(k\right)}}-{\pi }_{s{p}_{\left(k\right)}}$ ; $S{D}_{\Delta \pi _re{l}_{\left(k\right)}}=\sqrt{\frac{1}{k}\cdot \underset{j=1}{\overset{k}{\sum }}{\left[\frac{\Delta {\pi }_{\left(j\right)}}{{R}_{eff}\left({P}_{\left({\pi }_{s{p}_{\left(k\right)}}\right)}\right)}\right]}^{2}}$ (A4.1)

The results are evaluated once and written to a file, and they are read from this file:

$\text{WRITEPRN}\left("\text{SD}_\Delta _\text{pi}_\text{rel}\text{.prn}"\right)=S{D}_{\Delta \pi _rel}$ ;

$S{D}_{\Delta \pi _rel}=\text{READPRN}\left("\text{SD}_\Delta _\text{pi}_\text{rel}\text{.prn}\text{.prn}"\right)$

The average of the relation of the standard deviation converges to a final value, to the factor of proportionality ( ${F}_{SD_\Delta \pi }$ ). This factor is evaluated as follows:

$S{D}_{\Delta \pi _rel_a{v}_{\left(k\right)}}=\frac{1}{k}\cdot \underset{j=1}{\overset{k}{\sum }}S{D}_{\Delta \pi _re{l}_{\left(j\right)}}$ (A4.2)

The results are evaluated once and written to a file. They are read from this file:

$\text{WRITEPRN}\left("\text{SD}_\Delta _\text{pi}_\text{rel}_\text{av}\text{.prn}"\right)=S{D}_{\Delta \pi _rel}_av$

$S{D}_{\Delta \pi _rel}_av=\text{READPRN}\left("\text{SD}_\Delta _\text{pi}_\text{rel}_\text{av}\text{.prn}"\right)$

The constant factor is equal to the final average value of the standard deviation at large distances. The Figure A3 illustrates that the standard deviation is about constant over the distance. This fact rectifies taking the average over the whole distance for the evaluation:

Figure A3. Dispersion of the standard deviation of the dispersion of the number of primes around its average, the resulting constant value ( ${F}_{SD_\Delta \pi }$ ).

${F}_{SD_\Delta \pi }=S{D}_{\Delta \pi _rel_a{v}_{\left({k}_{limit}-1\right)}}=0.118234$ ; ${\Delta }_{SD_\pi }=0.02$ (A4.3)

Figure A3 indicates that the standard deviation of the dispersion of the effective number of primes around its approximation is rising proportionally to ( $R\left(c\right)$ ), the number of the series of multiples of primes, which are covering integer positions at this distance (c). The factor of proportionality ( ${F}_{SD_\Delta \pi }$ ) is again an inherent property of the prime numbers.

Annex 5: The Effective Number of Diads and Their Approximation

The approximate values of the number of diads (3.3) are evaluated once for sparse distances ( $c={P}_{\left({n}_{s{p}_{\left(kk\right)}}\right)}\le {c}_{s{p}_{\left(kk\right)}}$ ), with the center of the diads being equal to the next smaller prime to the sparse distances. The results are written to a file and are read from this file:

$\begin{array}{l}{\pi }_{diads_appr_}\left(c\right)=\sqrt{c}\cdot \underset{j=1}{\overset{ceil\left(\sqrt{c}\right)}{\sum }}\frac{{\delta }_{2}}{\mathrm{ln}\left(j\cdot \sqrt{c}\right)\cdot \mathrm{ln}\left(2\cdot c-j\cdot \sqrt{c}\right)};\\ {\pi }_{diads_app{r}_{\left(kk\right)}}={\pi }_{diads_appr_}\left({P}_{\left({\pi }_{s{p}_{\left(kk\right)}}\right)}\right)\end{array}$ (A5.1)

$\text{WRITEPRN}\left("\text{diads}_\text{appr}\text{.prn}"\right)={\pi }_{diads_appr}$ ;

${\pi }_{diads_appr}=\text{READPRN}\left("\text{diads}_\text{appr}\text{.prn}"\right)$

Similarly, the total number of diads around the center point at (c) with components within the first section up to ( $\sqrt{c}$ ) is given by (4.1). The results are written to a file and are read from this file:

${\pi }_{diads_appr_furst_}\left(c\right)=\frac{2\cdot {\delta }_{2}\cdot \sqrt{c}}{\mathrm{ln}{\left(c\right)}^{2}}$ ; ${\pi }_{diads_appr_firs{t}_{\left(kk\right)}}={\pi }_{diads_appr_first_}\left({P}_{\left({\pi }_{s{p}_{\left(kk\right)}}\right)}\right)$ (A5.2)

$\text{WRITEPRN}\left("\text{diads}_\text{appr}_\text{first}\text{.prn}"\right)={\pi }_{diads_appr_first}$

${\pi }_{diads_appr_first}=\text{READPRN}\left("\text{diads}_\text{appr}_\text{first}\text{.prn}"\right)$

The routine evaluating the effective number of diads at (c) checks for each prime ( ${P}_{\left(2\right)}<{P}_{\left(kk\right)} ), if the integer at de distance ( $d=2\cdot c-{P}_{\left(kk\right)}$ ) were a prime too. If it is a prime, then the sum of the diads around the central point is risen by one. The checking is made by control of the equality of the prime next to the distance (d) to the distance itself. Similarly, the diads within the first section are evaluated. For the evaluation of the index of the next smaller prime to a given distance the routine (A1.2) is used:

(A5.3)

The number of diads is evaluated for points of reflection being primes at sparse distances. The evaluation is carried out as sum of all diads up to the points of reflection ( ${\pi }_{diads}$ ) and for diads within the first section up to the square root of the distance of the point of reflection ( ${\pi }_{diads_first}$ ). Further as well for the case if the points of reflection are not primes, but even numbers ( ${\pi }_{diads_even}$ ) just next below the primes at sparse distances ( ${P}_{\left({\pi }_{s{p}_{\left(kk\right)}}\right)}-1$ ), with variable numbers of prime divisors. The comparison of the number of diads in case of the point of reflection is a prime or the next smaller integer to the prime is demonstrated in Figure A4. Because the evaluation is time consuming, the results are written to files and read from these files:

Figure A4. Comparison of the number of diads evaluated for points of reflection being primes with diads evaluated for even numbers just below the same primes.

${\pi }_{diad{s}_{\left(kk\left(\right)\right)}}={\pi }_{diads_}\left({P}_{\left({\pi }_{s{p}_{\left(kk\right)}}\right)}\right)$ ${\pi }_{diads_firs{t}_{\left(kk\left(\right)\right)}}={\pi }_{diads_first_}\left({P}_{\left({\pi }_{s{p}_{\left(kk\right)}}\right)}\right)$

$\text{WRITEPRN}\left("\text{pi}_\text{diads}\text{.prn}"\right)={\pi }_{diads}$ ; ${\pi }_{diads}=\text{READPRN}\left("\text{pi}_\text{diads}\text{.prn}"\right)$

$\text{WRITEPRN}\left("\text{pi}_\text{diads}_\text{first}\text{.prn}"\right)={\pi }_{diads}_first$ ;

${\pi }_{diads_first}=\text{READPRN}\left("\text{pi}_\text{diads}_\text{first}\text{.prn}"\right)$

Annex 6: Evaluation of the Error of the Second Simplification of the Diads

The number of diads resulting from the second simplification (3.3) results the DNF. The difference between the CDNF, (3.2) and the DNF, (3.9) results the error of the DNF. At the distance (c) it is proportional to ( $R\left(c\right)$ ), the number of primes covering positions at the distance (c). The difference between the CDNF and the DNF is:

$\Delta {\pi }_{diads_appr}\left(c\right)={\pi }_{diads}\left(c\right)-\frac{{\delta }_{2}\cdot c}{\mathrm{ln}{\left(c\right)}^{2}}$ ; $\Delta {\pi }_{diads_app{r}_{\left(kk\right)}}={\pi }_{diad{s}_{\left(kk\right)}}-\frac{{\delta }_{2}\cdot {P}_{\left({\pi }_{s{p}_{\left(kk\right)}}\right)}}{\mathrm{ln}{\left({P}_{\left({\pi }_{s{p}_{\left(kk\right)}}\right)}\right)}^{2}}$ (A6.1)

$\Delta {\pi }_{diads_firs{t}_{\left(kk\right)}}={\pi }_{diads_firs{t}_{\left(kk\right)}}-1.15\cdot {\pi }_{diads_appr_firs{t}_{\left( k k \right)}}$

The factor of the proportionality ( ${\gamma }_{d}$ ) results with the relation of the difference between the CDNF and the DNF to ( $R{\left(c\right)}^{y}$ , $\frac{3}{2} ) taken as average over the spare distances, illustrated in Figure A5. For the approximation of the diads in the first section an additional factor of (1.15) is applied: The reason is, that in this case there are no subsections over the first section considered.

Figure A5. Relation of the difference between the CDNF and the DNF to ( $R\left(c\right)$ ).

$\Delta {\pi }_{diads_rel}\left(c\right)=\frac{\Delta {\pi }_{diads}\left(c\right)}{R{\left(c\right)}^{1.836}}$ ; ${\gamma }_{d}=\frac{1}{k{k}_{limit}}\cdot \underset{j=1}{\overset{k{k}_{limit}}{\sum }}\frac{\Delta {\pi }_{diad{s}_{\left(j\right)}}}{R{\left({P}_{\left({\pi }_{s{p}_{\left(j\right)}}\right)}\right)}^{1.836}}=\text{0}\text{.040488}$ (A6.2)

Annex 7: Evaluation of the Properties of the Dispersion of Diads

The dispersion of both, of the free positions left by both, by the straight and by the reflected series of multiples of primes are proportional to the number of primes ( $R\left(c\right)$ ), the series of multiples of primes which are covering free positions at (c). Therefore, this is the case by the dispersion of the number of diads around its best estimate approximation as well. The relative dispersion with reference to ( $R\left(c\right)$ ) is evaluated and shown in the Figure A6. The results are written to a file and read from this file:

Figure A6. The dispersion of the relative number of diads around its best estimate approximation (left) and the standard deviation of the dispersion (right).

$\Delta {\pi }_{diads}={\pi }_{diads}-{\pi }_{diads_appr}$ ; $\Delta {\pi }_{diads_re{l}_{\left(kk\right)}}=\frac{\Delta {\pi }_{diad{s}_{\left(kk\right)}}}{R\left({P}_{\left({\pi }_{s{p}_{\left(j\right)}}\right)}\right)}$ (A7.1)

$\text{WRITEPRN}\left("\text{delta}_\text{pi}_\text{diads}_\text{rel}\text{.prn}"\right)=\Delta {\pi }_{diads_rel}$

$\Delta {\pi }_{diads_rel}=\text{READPRN}\left("\text{delta}_\text{pi}_\text{diads}_\text{rel}\text{.prn}"\right)$

The width of the dispersion of the diads is therefore estimated as

${K}_{\Delta diads}\le 0.1$ , ${\Delta }_{diads}\le {K}_{\Delta diads}\cdot R\left(c\right)$ (A7.2)

The standard deviation SD of the dispersion (A7.1) is assumed to be constant for large distances. It is evaluated as:

$S{D}_{\Delta \pi _diads_rel}\left(c\right)=\sqrt{\frac{1}{c}\cdot \underset{c}{\sum }\Delta {\pi }_{diads_rel}{\left(c\right)}^{2}}$ (A7.3)

$S{D}_{\Delta \pi _diads_re{l}_{\left(kk\right)}}=\sqrt{\frac{1}{kk}\cdot \underset{j=1}{\overset{kk}{\sum }}\Delta {\pi }_{diads_rel}{\left({P}_{\left({\pi }_{s{p}_{\left(j\right)}}\right)}\right)}^{2}}$

The factor of proportionality for the standard deviation of the diads is:

${F}_{SD_\Delta \pi _diads}=S{D}_{\Delta \pi _diads_re{l}_{\left(k{k}_{limit}-1\right)}}=0.2983886$ (A7.4)

Figure A6 indicates that the standard deviation of the dispersion of the effective number of diads around its approximation is rising proportionally to ( $F\left(c\right)$ ), the number of the series of multiples of primes, which are covering integer positions at the distance (c). The factor of proportionality ( ${F}_{SD_\Delta \pi _diads}$ ) is again an inherent property of the prime numbers.

Conflicts of Interest

The authors declare no conflicts of interest regarding the publication of this paper.

 [1] Doroszlai, P. and Keller, H. (2022) The Number of Primes. Advances in Pure Mathematics, 12, 81-95. https://doi.org/10.4236/apm.2022.122008 [2] Doroszlai, P. and Keller, H. (2022) The Symmetric Series of Multiples of Primes. Advances in Pure Mathematics, 12, 160-177. https://doi.org/10.4236/apm.2022.123014 [3] Titchmarsh, E.C. (1986) The Theory of the Riemann Zeta-Function. Oxford University Press, New York. [4] Hardy, G.H. and Littlewood, J.E. (1923) Some Problems of “Partitio Numerorum”; III: On the Expression of a Number as a Sum of Primes. Acta Mathematica, 44, 1-70. https://doi.org/10.1007%2FBF02403921