Twin Prime Distribution Problem

The distribution of twin prime numbers is discussed. The research method of corresponding prime number distribution is proposed. The distribution of prime numbers corresponding to integers and composite numbers is discussed. Through the corresponding prime distribution rate of integers and composite numbers, it is found that the corresponding prime distribution rate of composite numbers approaches the corresponding prime distribution rate of integers. The distribution principle of corresponding prime number of composite number is proved. The twin prime distribution theorem is obtained. The number of twin prime numbers is thus obtained. It provides a practical way to study the conjecture of twin prime numbers.

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.

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.

How Prime Numbers Are Interconnected and Built with Two Equations: Addition and Subtraction Rules the Function (6µ)

Are all prime numbers linked by four simple functions? Can we predict when a prime will appear in a sequence of primes? If we classify primes into two groups, Group 1 for all primes that appear before ζ (such that , for instance 5, ), an even number divisible by 3 and 2, and Group 2 for all primes that are after ζ (such that , for instance 7), then we find a simple function: for each prime in each group, , where n is any natural number. If we start a sequence of primes with 5 for Group 1 and 7 for Group 2, we can attribute a μ value for each prime. The μ value can be attributed to every prime greater than 7. Thus for Group 1, and . Using this formula, all the primes appear for , where μ is any natural number.

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.

Corresponding Prime Number Distribution Equation

The conjecture of twin prime numbers is a mathematical problem. Proving the twin prime conjecture using traditional modern number theory is extremely profound and complex. We propose an elementary research method for corresponding prime number, proved that the conjecture of twin prime numbers and obtain the corresponding prime distribution equation. According to the distribution rate of corresponding prime numbers, the distribution pattern of twin prime numbers was proved the distribution rate theorem. This is the distribution rate of prime numbers corresponding to composite numbers, which approaches the distribution rate of prime numbers corresponding to integers. Based on the corresponding prime distribution equation, obtain the twin prime inequality function. Then, the formula for calculating twin prime numbers was discussed. There is also the Hardy Littlewood conjecture. This provides a practical and feasible approach for studying the distribution of twin prime numbers.

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.

Mersenne Numbers, Recursive Generation of Natural Numbers, and Counting the Number of Prime Numbers

A simple recursive algorithm to generate the set of natural numbers, based on Mersenne numbers: MN = 2N – 1, is used to count the number of prime numbers within the precise Mersenne natural number intervals: [0;MN]. This permits the formulation of an extended twin prime conjecture. Moreover, it is found that the prime numbers subsets contained in Mersenne intervals have cardinalities strongly correlated with the corresponding Mersenne numbers.

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.

Development of New Method for Generating Prime Numbers

The article is devoted to actual problems of prime numbers. A theorem that allows generating a sequence of prime numbers is proposed. An algorithm for generating prime numbers has been developed. A comparison of the proposed theorem, with Wilson’s theorem is also provided.

A Solution to the Famous “Twin’s Problem”

In the following pages I will try to give a solution to this very known unsolved problem of theory of numbers. The solution is given here with an important analysis of the proof of formula (4.18), with the introduction of special intervals between square of prime numbers that I call silver intervals . And I make introduction of another also new mathematic phenomenon of logical proposition “In mathematics nothing happens without reason” for which I use the ancient Greek term “catholic information”. From the theorem of prime numbers we know that the expected multitude of prime numbers in an interval is given by formula ?considering that interval as a continuous distribution of real numbers that represents an elementary natural numbers interval. From that we find that in the elementary interval around of a natural number ν we easily get by dx=1 the probability that has the ν to be a prime number. From the last formula one can see that the second part of formula (4.18) is absolutely in agreement with the above theorem of prime numbers. But the benefit of the (4.18) is that this formula enables correct calculations in set N on finding the multitude of twin prime numbers, in contrary of the above logarithmic relation which is an approximation and must tend to be correct as ν tends to infinity. Using the relationship (4.18) we calculate here the multitude of twins in N, concluding that this multitude tends to infinite. But for the validity of the computation, the distribution of the primes in a random silver interval is examined, proving on the basis of catholic information that the density of primes in the same random silver interval is statistically constant. Below, in introduction, we will define this concept of “catholic information” stems of “information theory” [1] and it is defined to use only general forms in set N, because these represent the set N and not finite parts of it. This concept must be correlated to Riemann Hypothesis.

Clarifications for the Published Article: “A Solution to the Famous Twin’s Problem” in the APM of SCIRP at 24 September of 2019

This article B is almost autonomous because it can be read independently from the first published article A [1] using only a few parts of the article A. Be-low are given instructions so to need the reader study only on few places of the article A. Also, in the part A of Introduction, here, you will find simple and useful definitions and the strategy we are going to follow as well useful new theorems (also and in Section 5, which have been produced in this solution). So the published solution of twin’s problem can now be easily understood. The inequalities (4.17), (4.18) of Article A are proved here in Section 4 by a new clear method, without the possible ambiguity of the text between the relations (4.14), (4.16) of the Article A. Also we complete the proof for the twin’s distri-bution which we use. At the end here are presented the Conclusions, the No-menclatures and the numerical control of the proof, which is probably useful as well in coding methods. For a general and convincing picture is sufficient, a study from the beginning of this article B until the end of the part A of the In-troduction here as well a general glance on the Section 5 and on the Conclu-sions below.

On the Distribution of Prime Pairs

A new approach to the research into the distribution of prime pairs is developed, attached with corollaries about the distribution of prime triplets and generally about that of prime h-tuplets. It differs from the usual methods(involving the sieve method) for this kind of research, and bases on Chebyshev inequality and on the computation of average concentration of all the related subsets, and leads to the proofs of following lemma and theorem, attached with four corollaries:[Lemma 1] Among all the prime-pair-subsets there exists at least one such subset (namely one of the sets of generalized prime twins) which is an infinite set.[Theorem 1] All the prime-pair-subsets (namely all sets of generalized prime twins) or infinitely many prime-pair-subsets are infinite sets.[Corollary 1] Among all the prime-triplet-subsets there exists at least one such subset which is an infinite set.[Corollary 2] All the prime-triplet-subsets or infinitely many prime-triplet-subsets are infinite sets.[Corollary 3] Among all the prime-h-tuplet-subsets there exists at least one such subset which is an infinite set, where h is an arbitrary finite integer ≥2.[Corollary 4] All the prime-h-tuplet-subsets or infinitely many prime-h-tuplet-subsets are infinite sets, where h is an arbitrary finite integer ≥2.

孪生素数椭圆曲线E_的整数点(英文)

设p和q是孪生素数. 本文讨论了椭圆曲线E?上的非平凡整数点. 运用初等数论方法证明了该椭圆曲线至多有1组非平凡整数点(x,±y).

关于广义孪生素数的几个结论

基于Chebyshev不等式以及对所有相关子集平均浓度的计算,提出并证明了下列引理、定理,以及4条推论:[引理1]至少有1个广义孪生素数集合(或称2素数组子集)是无限集合;[定理1]全部的或无限多的广义孪生素数集合是无限集合;[推论1]至少有1个3生素数集合(或称3素数组子集)是无限集合;[推论2]全部的或无限多的3生素数集合是无限集合;[推论3]普遍地说,至少有1个h生素数集合(或称h素数组子集)是无限集合(h是≥2的整数);[推论4]普遍地说,全部的或无限多的h生素数集合是无限集合(h是≥2的整数)．

孪生素数椭圆曲线在p=5时的整数点

运用初等数论方法证明了:孪生素数椭圆曲线E_:y2=x(x-5)(x-7)仅有整数点(0,0),(5,0)和(7,0);E+:y2=x(x+5)(x+7)仅有整数点(0,0),(-5,0),(-7,0).

孪生素数序列的k-错线性复杂度研究

该文用数学方法证明了周期为p(p+2)的孪生素数序列的p+1-错线性复杂度小于2p+2,远低于该序列的线性复杂度,并通过仿真实验验证了结果,表明孪生素数序列不适合作为伪随机序列发生器。

Goldbach猜想等与PA的一些联系——对一些数论问题的逻辑讨论(Ⅱ)

用模型论方法证明了Goldbach猜想和孪生素数猜想等的一些形式都独立于一组公理P1(而P1在自然数系N上与Peano公理组PA等价 ) .又证明了它们与一组较强的公理P2 相和谐(P2 也在N上与PA等价 ) .

孪生素数椭圆曲线在p=3时的整数点(英文)

本文研究了孪生素数椭圆曲线的整数点问题.运用初等数论方法,获得了一组孪生椭圆曲线的所有整数点.