It is known that the prime-number-formula at any distance from the origin has a systematic error. It is shown that this error is proportional to the square of the number of primes present up to the square root of the ...It is known that the prime-number-formula at any distance from the origin has a systematic error. It is shown that this error is proportional to the square of the number of primes present up to the square root of the distance. The proposed completion of the prime-number-formula in the present paper eliminates this systematic error. This is achieved by using a quickly converging recursive formula. The remaining error is reduced to a symmetric dispersion of the effective number of primes around the completed prime-number-formula. The standard deviation of the symmetric dispersion at any distance is proportional to the number of primes present up to the square root of the distance. Therefore, the absolute value of the dispersion, relative to the number of primes is approaching zero and the number of primes resulting from the prime-number-formula represents the low limit of the number of primes at any distance.展开更多
If Goldbach’s conjecture is true, then for each prime number p there is at least one pair of primes symmetric with respect to p and whose sum is 2p. In the multiplicative number theory, covering the positive integers...If Goldbach’s conjecture is true, then for each prime number p there is at least one pair of primes symmetric with respect to p and whose sum is 2p. In the multiplicative number theory, covering the positive integers with primes, during the prime factorization, may be viewed as being the outcome of a parallel system which functions properly if and only if Euler’s formula of the product of the reciprocals of the primes is true. An exact formula for the number of primes less than or equal to an arbitrary bound is given. This formula may be implemented using Wolfram’s computer package Mathematica.展开更多
The present paper gives the proof of the set of primes as continuum and evaluates the analytical formula for the integral of the inverse of the primes over the distance. First it starts with the density of the primes,...The present paper gives the proof of the set of primes as continuum and evaluates the analytical formula for the integral of the inverse of the primes over the distance. First it starts with the density of the primes, shortly recapitulates the prime-number-formula and the complete-prime-number-formula, the proof of the set of primes as continuum. The theoretical evaluation is followed in annexes by numerical evaluation of the theoretical results and of different constants, which represent inherent properties of the set of primes.展开更多
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...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.展开更多
In this paper, some conclusions related to the prime number theorem, such as the Mertens formula are improved by the improved Abelian summation formula, and some problems such as “Dirichlet” function and “W(n)” fu...In this paper, some conclusions related to the prime number theorem, such as the Mertens formula are improved by the improved Abelian summation formula, and some problems such as “Dirichlet” function and “W(n)” function are studied.展开更多
Thek-dimensional Piatetski-Shapiro prime number problem fork?3 is studied. Let π(x 1 c 1,?,c k ) denote the number of primesp withp?x, $p = [n_1^{c_1 } ] = \cdots [n_k^{c_k } ]$ , where 1<c 1<?<c k are fixed...Thek-dimensional Piatetski-Shapiro prime number problem fork?3 is studied. Let π(x 1 c 1,?,c k ) denote the number of primesp withp?x, $p = [n_1^{c_1 } ] = \cdots [n_k^{c_k } ]$ , where 1<c 1<?<c k are fixed constants. It is proved that π(x;c 1,?,c k ) has an asymptotic formula ifc 1 ?1 +?+c k ?1 >k?k/(4k 2+2).展开更多
文摘It is known that the prime-number-formula at any distance from the origin has a systematic error. It is shown that this error is proportional to the square of the number of primes present up to the square root of the distance. The proposed completion of the prime-number-formula in the present paper eliminates this systematic error. This is achieved by using a quickly converging recursive formula. The remaining error is reduced to a symmetric dispersion of the effective number of primes around the completed prime-number-formula. The standard deviation of the symmetric dispersion at any distance is proportional to the number of primes present up to the square root of the distance. Therefore, the absolute value of the dispersion, relative to the number of primes is approaching zero and the number of primes resulting from the prime-number-formula represents the low limit of the number of primes at any distance.
文摘If Goldbach’s conjecture is true, then for each prime number p there is at least one pair of primes symmetric with respect to p and whose sum is 2p. In the multiplicative number theory, covering the positive integers with primes, during the prime factorization, may be viewed as being the outcome of a parallel system which functions properly if and only if Euler’s formula of the product of the reciprocals of the primes is true. An exact formula for the number of primes less than or equal to an arbitrary bound is given. This formula may be implemented using Wolfram’s computer package Mathematica.
文摘The present paper gives the proof of the set of primes as continuum and evaluates the analytical formula for the integral of the inverse of the primes over the distance. First it starts with the density of the primes, shortly recapitulates the prime-number-formula and the complete-prime-number-formula, the proof of the set of primes as continuum. The theoretical evaluation is followed in annexes by numerical evaluation of the theoretical results and of different constants, which represent inherent properties of the set of primes.
文摘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.
文摘In this paper, some conclusions related to the prime number theorem, such as the Mertens formula are improved by the improved Abelian summation formula, and some problems such as “Dirichlet” function and “W(n)” function are studied.
基金Project supported by the National Natural Science Foundation of China (Grant No. 19801021)the Natural Science Foundation of Shandong Province (Grant No. Q98A02110).
文摘Thek-dimensional Piatetski-Shapiro prime number problem fork?3 is studied. Let π(x 1 c 1,?,c k ) denote the number of primesp withp?x, $p = [n_1^{c_1 } ] = \cdots [n_k^{c_k } ]$ , where 1<c 1<?<c k are fixed constants. It is proved that π(x;c 1,?,c k ) has an asymptotic formula ifc 1 ?1 +?+c k ?1 >k?k/(4k 2+2).
