The Periodic Table of Primes

Over millennia, nobody has been able to predict where prime numbers sprout or how they spread. This study establishes the Periodic Table of Primes (PTP) using four prime numbers 2, 3, 5, and 7. We identify 48 integers out of a period 2×3×5×7=210 to be the roots of all primes as well as composites without factors of 2, 3, 5, and 7. Each prime, twin primes, or composite without factors of 2, 3, 5, and 7 is an offspring of the 48 integers uniquely allocated on the PTP. Three major establishments made in the article are the Formula of Primes, the Periodic Table of Primes, and the Counting Functions of Primes and Twin Primes.

The Integral of the Inverse 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.

On the Number of Primes in the Interval (x, 2x) by an Elementary Method

An elementary formula to know the number of primes in the interval (x, 2x) close to the exact figure for a fixed x is given here. A new elementary equation is derived (a relation between prime numbers and composite numbers distributed in the interval [1, 2x]). An elementary method to know the number of primes in a given magnitude is suitably placed in the form of a general formula, and we have proved it. The general formula is applied to the terms of the equation, and a tactical simplification of the terms gives rise to an expression whose verification envisages scope for its further studies.

Distribution and Relation of Primes with Tesla Numbers 3, 6, and 9

This work presents a different approach to twin primes, an approach from the perspective of the Tesla numbers and gives a refresh and new observation of twin primes that could lead us to an answer to the Twin Prime Conjecture problem. We expose a peculiar relation between twin primes and the generation of prime numbers with Tesla numbers. Tesla numbers seem to be present in so many domains like time, vibration and frequency [1], and the space between twin primes is not the exception. Let us say that twin primes are more than just prime numbers plus 2 or minus 2, and Tesla numbers are more involved with twin primes than we think, and hopefully, this approach give us a better understanding of the distribution of the twin pairs.

The Primes and Their Subsets as Continuum like the Integers

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.

Some Notes on the Distribution of Mersenne Primes

Mersenne primes are a special kind of primes, which are always an important content in number theory. The study of Mersenne primes becomes one of hot topics of the nowadays science. It has not settled that whether there exist infinite Mersenne primes. And several of conjectures on the distribution of it provided by scholars. Starting from the Mersenne primes known about, in this paper we study the distribution of Mersenne primes and argued against some suppositions by data analyzing.

Detecting a Regularity in the Generation and Utilization of Primes in the Multiplicative Number Theory

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 Numbers of Thousand Place of Mersenne Primes

Mersenne primes are a special kind of primes, which are an important content in number theory. The study of Mersenne primes becomes one of hot topics of the nowadays science. Searching for Mersenne primes is very challenging in scientific researches. In this paper, the numbers of thousand place of Mersenne primes are studied, and the conclusion is presented by using the Chinese remainder theorem.

A Comparison of Sufficiency Condtions for the Goldbach and the Twin Primes Conjectures

It is generally known that under the generalized Riemann hypothesis one could establish the twin primes conjecture by the circle method, provided one could obtain the estimate o (nlog-2 n)?for the integral of the representation function over the minor arcs. One of the new results here is that the assumption of GRH can be removed. We compare this and other such sufficiency results with similar results for the Goldbach conjecture.

Computation of Complex Primes Using Elliptic Curves: Application for Cryptosystem Design

This paper provides several generalizations of Gauss theorem that counts points on special elliptic curves. It is demonstrated how to implement these generalizations for computation of complex primes, which are applicable in several protocols providing security in communication networks. Numerical examples illustrate the ideas discussed in this paper.

On the Sum of Reciprocals of Mersenne Primes

The sum of reciprocals of Mersenne primes converges to 0.51645417894078856533···, which is an example of a probably infinite subset of primes whose sum of reciprocals is finite and can be computed accurately. This value is larger than , where ?is the set of perfect powers of prime numbers.

Primes in Arithmetic Progressions to Moduli with a Large Power Factor

Recently Elliott studied the distribution of primes in arithmetic progressions whose moduli can be divisible by highpowers of a given integer and showed that for integer a≥2 and real number A>0. There is a B=B(A)>0 such that , holds uniformly for moduli that are powers of a. In this paper we are able to improve his result.

Infinite Number of Twin Primes

This work is devoted to the theory of prime numbers. Firstly it introduced the concept of matrix primes, which can help to generate a sequence of prime numbers. Then it proposed a number of theorems, which together with theorem of Dirichlet, Siegel and Euler allow to prove the infinity of twin primes.

Regular Decimations Result in Irregular Distribution of Primes

Purpose: Primes are notorious for their irregular distribution in natural numbers. Such a lack of regularity makes primes elusive. Many NP-hard problems are related to the irregular occurrence of primes in natural numbers. Methods: To extract the underlying regularity of prime distribution, author started from the complementary relationship between composites and primes, through the regular occurrence of composites to infer the regularity underlying primes. Results: Previously random-appearing occurrence of primes resulted from the regular periodic decimations of various frequencies and cycles set by primes. Conclusions: Primes are the survivors of natural numbers after periodic decimations caused by primes. This leads to a novel concise representation of the set of all primes using sine function, suggestive of periodicity for both primes and composites.

The Symmetric Series of Multiples of Primes

The union of the straight and over the point of reflection—reflected series of the arithmetic progression of primes results in the double density of occupation of integer positions. It is shown that the number of free positions left by the double density of occupation has a lower limit function, which is growing to infinity. The free positions represent equidistant primes to the point of reflection: in case the point of reflection is an even number, they satisfy Goldbach’s conjecture. The double density allows proving as well that at any distance from the origin large enough—the distance between primes is smaller, than the square root of the distance to the origin. Therefore, the series of primes represent a continuum and may be integrated. Furthermore, it allows proving that the largest gap between primes is growing to infinity with the distance and that the number of any two primes, with a given even number as the distance between them, is unlimited. Thus, the number of twin primes is unlimited as well.

The Gaps between Primes

The union of the straight and—of the over a point of reflection—reflected union of the series of the arithmetic progression of primes results the double density of occupation of integer positions by multiples of the primes. The remaining free positions represent diads of equidistant primes to the point of reflection: in case the point of reflection is an even number, they satisfy Goldbach’s conjecture. Further, it allows to prove, that the number of twin primes is unlimited. The number of all greater gaps as two between primes has well defined lower limit functions as well: it is evaluated with the local density of diads, multiplied with the total of the density of no-primes of all positions over the distance between the components of the diads (the size of the gaps). The infinity of these lower limit functions proves the infinity of the number of gaps of any size between primes. The connection of the infinite number of diads to the infinity of the number of gaps of any size is the aim of the paper.

Diophantine Approximation with Two Primes and One Square of Prime

We show that if λ1 , λ2 , λ3 are non-zero real numbers, not all of the same sign, η is real and λ1 /λ2 is irrational, then there are infinitely many ordered triples of primes (p1 , p2 , p3 ) for which |λ1 p1 + λ2 p2 + λ3 p2 3 + η| < (max pj )- 1/40 (log max pj ) 4 .

Symmetrical Distribution of Primes and Their Gaps

Primes are of great importance and interest in mathematics partially due to their hard-to-predict distribution. A corollary of the Goldbach Conjecture is that two primes are equally distanced from a mid-point integer. Here the authors demonstrate that most primes are bilateral symmetrically distributed on the both sides of the halves of super products (or their integer multiples) of primes. This pattern suggests that greater primes may be obtained more efficiently by subtracting smaller ones from constants equal to super products (or their integer multiples) of primes.

The Number of Primes

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.