Scientific Research

An Academic Publisher

Infinite Number of Twin Primes

**Author(s)**Leave a comment

KEYWORDS

1. Introduction

A problem of twin prime numbers infinity formulated at the 5^{th} International Mathematical Congress is one of the main problems of the theory of prime numbers that has not been solved for 2000 years. It has been known that twin prime numbers are pairs of prime numbers which differ from each other by 2. For example, numbers 11 and 13, and numbers 17 and 19 are twin primes, but next adjacent prime numbers 37 and 41 are not twin primes. This problem is also known as the second Landau’s problem.

In the year 2013 American mathematician Zhang Yitang from the University of New Hampshire has proved that there are an infinite number of pairs of prime numbers, separated by a fixed distance is greater than 2 but less than 70 million. That is, the number of pairs of twin primes is infinite, where is greater than 2 but less than or equal to 70,000,000. James Maynard later improved this result to 600. In 2014, scientists led by Terence Tao (Polymath project) this result was improved up to 246 [1] .

A goal of this paper is to prove infinity of twin primes.

To solve this problem, we have proposed a new method, which allows to empirically estimate infinity of twin primes [2] . In this paper we present another simple proof, which provides more correct results for twin primes infinity.

First, for convenience we introduce the following notation. As is known, a sequential

multiplication of all integers up to a certain number n is called as factorial:

Hereafter a sequential multiplication of prime numbers will be occurred frequently, therefore for such cases we use the following notation:

Here is a prime number with index number. A combination of symbols means a sequential multiplication of prime numbers from 2 to only. We shall call it as a special factorial of a prime number. For example, is a special factorial of prime number or.

2. Matrices of Prime Numbers

In this paper we try to prove the infinity of number of twin primes. The proof will be on the basis of properties matrix of prime numbers.

The development of these matrices is implemented as follows.

Let we represent a set of natural numbers in a form of matrices family with elements a(k, I, j), where i is a row index number, j is a column index number, and k is an indexing number of matrix.

Here, a maximum number of rows of matrix must be equal to the special factorial i.e.. This means, that for every matrix with index number k there is a specific set of prime number sequence: (note that the last prime number, which corresponds to this matrix is). A number of columns can be arbitrarily large up to infinity.

Here and further it is supposed that we don’t know any prime number. Prime numbers will be generated in the course of creating matrices.

First, we show how matrix is formed. For this, we consider a series of natural numbers from 1 to infinity (Figure 1,). In this series, number 1 is followed by number 2. So number 2 is divided by 1 and 2 only. Therefore, the first prime number is 2, i.e.. Then, the first matrix built with consideration of the first prime number, has only 2 rows. A number of columns is infinite (Figure 1, -a). Numbers 2, 4, 6,… are located in the first row of matrix. These numbers form an arithmetic progression. The first term and common difference (step) of this progression are equal to 2, i.e. terms of the first row are respectively equal to:

The numbers located in the second row of new matrix, also form an arithmetic progression. The first term and common difference of this progression are 3 and 2 respectively, i.e.

Figure 1. Matrices of prime numbers.

As previously defined, number 2 is a prime number. Therefore, all numbers divisible by 2 are composite numbers. In view of this, all numbers, except 2, which are located in the first row of the considered matrix (Figure 1, -в) are dark painted for illustrative purposes. Thus, all composite numbers which should be divisible by 2 are defined by using matrix.

This implies that number 1 is not a prime number, otherwise all numbers divisible by 1 would be composite numbers. Number 1 is also not a composite number, since it is not divided by other numbers. That is why number 1 is located separately in the upper left corner in this and other matrices.

3. Algorithm for Matrix Transformation from One to Another Type

It is seen from matrix (Figure 1, -в), that not painted number next to number 2 is number 3 and it is not divisible by 2, and therefore it is the second prime number, i.e..

Thus, we transform matrix (Figure 1, -в) into next matrix (Figure 1, -а). A maximum number of rows of this matrix must be equal to a special factorial of the second prime number, i.e.. A number of columns as in the first case can be arbitrary.

For transforming a matrix from one into another type a simple method is used. Implementation of this method lies in a simple transposition of numbers of certain rows and columns of the original matrix into corresponding rows and columns of a new matrix. For example, for forming a first column of matrix firstly the numbers 2 and 3 located in the first column of the original matrix are transposed to the first and second rows of the new matrix, then the numbers 4 and 5 of the first matrix are transposed to the third and fourth rows of the new matrix. Then numbers 6 and 7 are also transposed to the fifth and sixth rows of the new matrix. This completes formation of the first column of matrix. To form a second column of matrix, we similarly transpose the numbers (8 and 9), (10 and 11), and (12 and 13) in pairs into a second column of matrix. Next, we form other columns in a similar way.

Note, that in the new matrix (Figure 1, -а) all numbers located in the third and fifth rows are dark painted as they, due to matrix, have been already defined as composite numbers.

In the new matrix all numbers located in each row, as in the case of matrix, form an arithmetic progression, which in general takes the following form:

(1)

The common difference of this arithmetic progression is equal to. Expression (1) for matrix , particularly for its second row, appears as follows:

As you can see, all the numbers of this row are divisible by 3. Therefore, they (except number 3) are composite numbers. In a view of this they are dark painted in matrix (Figure 1, -в). In regard to the numbers located in the fifth row, they are also divided by 3. However, these numbers, as mentioned above while considering matrix, have been already defined as composite numbers. A set of numbers of fourth row (and sixth row as well) also form an arithmetic progression. But among them there are both prime and composite numbers. Therefore, numbers of these rows are not painted yet. Note, that rows containing only composite numbers are dark painted.

It should be pointed out that here and in all next figures, letter a denotes those matrices (e.g. -а, -a, -a), which are formed after transformation of the previous matrix. Letter в denotes those matrices (e.g., -в, -в, -в), which are obtained after processing has already transformed matrix.

It should be noted that during the process of the second matrix transformation, all numbers divisible by 3, are finally determined and dark painted accordingly.

It is seen from matrix (Figure 1, -в) that next to numbers 2 and 3 unpainted number is 5. Thus it is third prime number. Therefore, the second matrix (Figure 1, -в) is transformed into third matrix (Figure 1, -а). For this we use a similar procedure which was applied for transforming matrix into matrix.

For example, for forming the first column of matrix at first the numbers (2 - 7) located in the first column of the original matrix are transposed into (1^{st} - 6^{th}) row of new matrix. Then, the numbers (8 - 13) of the second column of matrix are transposed into (7^{th} - 12^{th}) row of a new matrix. After this, the numbers (14 ÷ 19) are transposed into (13^{th} - 18^{th}) row of the new matrix. Then the numbers (20 ÷ 25) are transposed into (19^{th} - 24^{th}) row of the new matrix and finally, the numbers (26 ÷ 31) are transposed into (25^{th} - 30^{th}) row of the new matrix. This completes formation of the first column of matrix.

For forming a second column of matrix, the numbers (32 - 37), (38 - 43), (44 - 49), (50 - 55) and (56 - 61), located in matrix, are gradually transposed into second column of matrix in a similar way. After that, other columns are similarly formed.

A maximum number of rows in third matrix should be equal to a special factorial of the third prime number, i.e.

.

For matrix expression (1) appears as follows:

From this expression, we obtain that all the numbers located in the fourth row are divisible by 5, and those numbers that located in the 24^{th} row are also divisible by 5. In this context, all of them are accordingly transposed into the series of composite numbers and repainted into dark color (except a prime number 5). Here, in the case of the third matrix (Figure 1, -в) it should be also noted that all numbers which must be divisible by 5, are finally defined and repainted into dark color (for example, a row with an index number 24).

Note that in all cases, there is no any strict regularity for location of painted and unpainted numbers within one column of any considered matrix. But a picture of mutual arrangement of these numbers within one column is repeated with perfect precision in the next columns (starting from the second column). This regularity of repeating pictures by columns is appeared when each previous matrix with a number of rows equal to is transformed into next matrix with a number of rows equal to.

In matrix (Figure 1, -в) a number 7 which is next to the numbers 2, 3, and 5 is not painted. Therefore, it is a fourth prime number. Now, knowing the fourth prime number 7, matrix can be similarly transformed into the next fourth matrix. In this matrix a maximum number of rows must be equal to a special factorial of prime number 7, i.e. 7! = 210.

In this case, carrying out a number of similar operations, as in previous cases, we can finally identify a set of all composite numbers, which should be divisible by 7. Similarly, we can build other matrices.

Here we have presented a procedure that allows to perform mechanical transformation of prime numbers matrices from one type to another. In general case an algorithm of this transformation is as follows.

Let there be given matrix with elements a(k,i,j), where i is an row index number, j is a column index number, and k is an index number of matrix. Then, as it follows from (1), the elements of this matrix are determined by the following expression:

And a maximum number of matrix rows should be equal to a special factorial, i.e.. A number of columns can be arbitrary large up to infinity. On the other hand, a family of numbers located in any selected row of this matrix, creates an arithmetic progression the first term of which is equal to and common difference of the progression is equal to.

Then the algorithm of building next matrix lies in a simple calculation of values of new matrix elements using the following equation:

Again, in this case a maximum number of matrix rows should be also equal to a special factorial, i.e.. A number of columns can be also arbitrary large up to infinity as in case of matrix. In this case a family of numbers located in any selected row of this matrix, also creates an arithmetic progression the first term of which is equal to (i+1) while common difference of the progression is equal to.

In a similar way matrix is being transformed into matrix, etc.

Here, based on the Dirichlet’s theorem on prime numbers in arithmetic progressions, it follows that if the first term and difference of the progression are not coprime numbers, then this progression will not contain any prime number or will contain only one prime number. And this prime number is the first term of the progression.

It also follows from the Dirichlet’s theorem that if the first term and difference of the progression are coprime numbers, then this progression contains prime numbers and composite numbers as well.

Therefore, in our case, first we determine if the first term and difference of the progression that consists of the numbers located in considered row of given matrix are coprime numbers. If they are not coprime numbers, then we conclude that all numbers of this row are composite numbers and they are dark painted for illustration purposes.

If the first term and difference of the considered progression are coprime numbers, then as mentioned above, this row contains both prime and composite numbers. Therefore, the numbers of these rows remain unpainted. Note, that dark painted are only those rows that contain only composite numbers.

Now, using matrices, we will try to determine a number of twin primes.

4. Infinite Number of Twin Primes

First, we set a number of definitions:

Definition 1. If in a certain row of a matrix there are only composite numbers, then the row is dark painted for illustration purposes and for convenience we call it as a painted row.

Definition 2. If in a certain row of a matrix there are both prime and composite numbers, the row is not painted and for convenience we call such rows as not painted row.

Definition 3. If the first number of a row is not painted but the rest numbers are painted, then this not painted number is a prime number and the rest numbers are composite.

Definition 4. If a difference between index numbers of two neighbor and not painted rows is equal to 2, then such rows we call a pair of twin rows or twin rows. For the numbers located in different rows but in one column of twin rows pairs, an equation is always satisfied.

Definition 5. If an index number of a certain painted row differs from an index number of the nearest not painted row by greater than 2, then the raw is called as a single row.

From these definitions it follows that twin prime numbers can be only in twin rows.

A goal of the paper is determine a total number of prime numbers. Therefore, hereafter we will put main emphasis on pairs of twin rows.

Theorem 1. A number of twin rows pairs in matrix is monotonically increased with a growth of index number k of the matrix and also in each row of any twin rowspair there are an infinite number of prime numbers.

As is known, all twin prime numbers can be located in paired twin rows only. Moreover, if at some point, for example when considering matrix, all pairs of twin rows are disappeared, then it obviously that they will not appear in next matrices. In that case, it means that a number of twin prime numbers should be limited.

We will analyze whether such case is possible and prove Theorem 1 conjointly.

Proof of Theorem 1.

Let suppose that some matrix has only one single pair of twin rows (for example, as in the case of Figure 1, -в). Here, there is reason to assume that in the course of further transformation of this matrix into the next matrices, pairs of twin rows may disappear. But, in fact the opposite is true. When transforming the matrix into the next matrix a number of twin rows pairs, as shown above, becomes larger.

For example, in matrix there is only one single pair of twin rows (Figure 1, -в). From the expression (1) it follows that terms of the arithmetic progression, which are located in the rows of this single pair of twin rows are defined by the expression:

(2)

Here signs “−” and “+” correspond to upper and lower row of the pair of twin rows respectively.

But this only one pair of rows generates 5 new pairs of rows during transformation of this matrix into matrix. That is, the original unique pair of twin rows is ungrouped by 5 new pairs of rows.

A set of numbers located in each row of 5 new pairs of rows of matrix also forms an arithmetic progression with a constant and is defined by the expression:

(3)

where.

From expression (3) we obtain that if at some value of the following equation is satisfied

(4)

then all numbers of this row are divided by exactly. Therefore, the numbers are composite. In fact, it is known that within interval of 0 the Equation (4) with regard to the parameter m has unique solution [3] [4] and [5] . For example, equation (4) for the case of is satisfied at m = 1 and for the case of at m = 4. That is, at m = 1 and m = 4 a pair of rows in question is not a pair of twin rows and corresponding row for which the equation (4) is satisfied, is dark repainted. As a result only 3 of 5 newly formed pairs of rows are twin rows.

All the numbers of each row of 3 newly formed pairs of twin rows, as stated above, form an arithmetic progression and in each of them the first term and difference of the arithmetic progression are coprimes, i.e.:

In virtue of this, it follows from Dirichlet theorem on prime numbers in arithmetic progressions, that in each row of these three pairs of twin rows there is an infinite number of prime numbers.

Now we consider a transformation of matrix into matrix. In this case, each pair of twin rows of matrix generates 7 new pairs of rows and totally 21 new pairs of rows are formed in new matrix. Values of numbers located in the rows of these pairs are defined by the expression:

(5)

where.

It can be seen from (5), that a set of numbers lying in each row of newly created 21 pairs of rows, separately forms an arithmetic progression with the difference of and the first terms defined as.

We now consider which of these 21 pairs of rows of matrix are pairs of twin rows. For this purpose we analyze divisibility of the first terms of the aforementioned arithmetic progressions by. In addition, for convenience and visualization, we consider a case where i = 3, but at the same time we mean the cases where i = 1 and i = 2. Then from (5) we find that values of numbers lying in 7 new rows of matrix generated by the last pair of twin rows of matrix are determined by the expression:

where.

Let we consider divisibility of the first terms of the arithmetic progression in question by, i.e. a satisfiability of the equation:

In this case, in the same way as for case (4), we find that within an interval of this equation with reference to parameter m (for the case of, and also for the case of) has an unique solution. Therefore, in this case 2 pairs of the rows in question are no longer pairs of twin rows. If we additionally consider the cases when and, then we finally obtain that 6 pairs of rows of 21 newly formed pairs of rows cease to be pairs of twin rows, and corresponding rows, as shown above, are dark repainted. As a result, a number of new pairs of twin rows in matrix is equal to 15.

Besides, all first terms and difference of the arithmetic progression formed from the numbers lying in each row of the newly created 15 pairs of twin rows of matrix, are coprimes, i.e.:

(6)

where

In view of this, it follows from Dirichlet theorem for prime numbers in arithmetic progression, that in each row of 15 newly formed pairs of twin rows there is an infinite number of prime numbers.

If we consider further similar transformations of matrices into the next following matrices, for example, matrix into matrix, then every time we verify that any pair of twin rows of the original matrix generates new pairs of rows in new matrix. In addition, 2 pairs of them will not be pairs of twin rows and corresponding rows are moving into a rank of painted and single rows. From this we obtain that in any matrix a total number of rows and total number of twin row pairs are respectively equal to:

(7-1)

or

(7-2)

where-an index number of matrix and/or prime number, and

It follows from (7) that a number of twin rows pairs is monotonically increased while moving to the next matrices, i.e. with increasing of index number k of matrix,. On the other side, a set of numbers located in each row of these pairs of twin rows, forms an arithmetic progression. And the first term and difference of each this progression are coprimes. Therefore it follows from Dirichlet’s theorem that in each row of any pair of twin rows there is an infinite number of prime numbers.

The theorem 1 is proved.

As is shown in (7), a number of twin row pairs will be progressively increasing during the process of moving to the next matrices. But a number of ordinary rows of each next matrix is increased as a special factorial. In a view of this, a density of twin

row pairs is progressively decreased along with the matrices since the ratio

is progressively reduced with rising of.

Theorem 2. There are prime twin numbers in any pair of twin rows of any matrix.

As shown above, all twin prime numbers can be located in twin rows only. But the question arises are there cases where in some pair of twin rows no any pair of two prime numbers is located in one column. Then, due to the asymmetry (i.e. due to the skewness of prime numbers location) there will be no any pair of prime twin numbers in this pair of twin rows. If such skewness happens in all twin rows pairs of this matrix, then this and all next matrices will no longer contain prime twin numbers. Therefore we can definitely say that a number of prime twins should be limited.

We will analyze this case now and prove the Theorem 2.

Proof of the Theorem 2.

Let consider matrix which contains only one unique pair of twin rows (Figure 1, -в). On the other hand, as shown above, twin prime numbers can be located in pairs of twin rows only. This means that all existing twin prime numbers are located only in this unique pair of twin rows.

A simple analysis shows that pairs of twin prime numbers conform to some simple rules. In particular, the last digit of any prime number (except 2 and 5) can not be an even number and it can not be equal to 5 as well. This means that last digits of the first and second number of any pair of twins should be respectively (1 and 3) and (7 and 9), and (9 and 1) as well. Therefore, a set of twin prime numbers should be divided into 3 subsets on these grounds. In fact, when we form matrix, a single pair of twin rows of matrix generates new three pairs of twin rows in matrix. Moreover, the last digits of each number located in the rows of individually selected pair of twin rows are respectively equal (1 and 3) and (7 and 9) and (9 and 1). This fact is readily illustrated by Figure 1, -в.

Consequently, the fact that in each pair of twin rows of matrix there is a set twin primes, which is sorted with regard to a value of the latest digit, is beyond question. That is, in pairs of twin rows of the matrix the skewness will not appear.

Now we consider next matrix. The analysis we performed shows that all members of each pair of twin rows of this matrix are more ordered than in case of matrix. For example, last two digits of each number of the arithmetic progression, located in any row of any twin row pair of matrix form cyclically increasing sequence: 21, 31, 41, …, 81, 91, 01, 11, 21, 31, …

Here we suppose that an average distance by columns between cells, where adjacent prime numbers are located in one pair of twin rows of matrix, must be less than an average distance of cells, where adjacent primes in one pair of twin rows of matrix are located.

If this is so, then in each pair of twin rows of matrix there inevitably are twin primes. Since in this case, due to the tightness even if above-mentioned skewness of prime numbers appears in matrix, then it appears in a less degree then in case of matrix. At least there will not be a general skewness of prime numbers in matrix.

To verify this, first we enter a new parameter which is a distance by columns between the cells, where adjacent prime numbers with index numbers i and i + 1 (Figure 2) are located:

(8)

where is an index number of the column in which a cell of i-th prime number is located. Moreover, if two adjacent prime numbers are located in two mutually adjacent cells along one row (i.e. horizontally, as shown in Figure 2, a), then a distance between these cells is equal to 1:

Figure 2. Location of prime numbers in a pair of twins rows.

On the other hand, if two adjacent prime numbers are located in two neighboring and adjoining cells lying in the same column (i.e. vertically as shown in Figure 2, в), then a distance between these cells is equal to zero:

In this case these two prime numbers are twins.

As an example, we now consider a fragment of one pair of twin rows of any matrix. Let suppose that this fragment contains n prime numbers, as shown in Figure 2(c). In this figure light circles denote cells, in which composite numbers are located and dark circles mark cells with prime numbers. Then, above mentioned average distance by columns between cells, where adjacent prime numbers are located, will be equal to:

(9)

In this case, as shown above, a distance by columns between cells, where adjacent prime numbers with index numbers (1 and 3) and (4 and 6) are located, is equal 1, i.e.:.

On the other hand a distance by columns between cells of adjacent prime numbers with index numbers (1 and 2), (5 and 6) and (7 and 8) is equal to zero, that is. Therefore, if we consider a prime number with index number 1, then its nearest adjacent prime number on the right side is a prime number with index number 2, rather than a number with index number 3 (Figure 2(c)). If we consider a prime number with index number 4, its nearest neighbor to the right side is a prime number with index number 5, rather than a number with index number 6. This is easily seen, if a difference between values of these numbers is calculated using formula (1). Similarly, it can be easily determined that the nearest neighbor of a prime number with index number 9 on the left side is a prime number with a index number 8, rather than a number with index number 7, although these two prime numbers (7 and 9) are located in the same row.

Note, that the numbers with index numbers (1 and 2), (5 and 6), and (7 and 8) are twins (Figure 2(c)).

It should be noted that the first prime number can be located in a cell that is lying not in the first column of the considered fragment (Figure 2(c)). Similarly, we can say that a cell in which the last prime number with index number n is located, may be also situated not in the last column. These cases are not taken into account in (9), parameters and are not presented in expression (9). is a number of columns calculated from the beginning of the considered fragment to a cell containing first prime number and is a number of columns from a cell with last prime number to the end of the considered fragment (Figure 2(c)). To take this into account, we consider a sum:

.

It should be noted that a value of the considered parameter is comparable and most likely equal to the distance by columns from the cell of the last prime number with an index number n to the cell, where next prime number with index number n + 1 will be located. As it follows from Figure 2(c) this number, is located outside the analyzed fragment, but it will be the nearest adjacent prime number from the right side for n-th prime number. From this it follows that:

If we also add the parameter into the sum in a numerator of the expression (9), then we exactly obtain “a length” of the considered fragment (Figure 2(с)):

Here, a number of summands in the numerator of expression (9) will be greater by 1, i.e. a number of prime numbers in question is supposedly increased by 1 and becomes equal to. Accordingly, expression (9) takes the following form:

(10)

Now we consider a real case of matrix fragment with dimensions. Here is a number of pairs of twin rows, is a number of columns in given fragment of matrix, which corresponds to a prime number. It should be noted here that a value of should be sufficiently large so it make statistical sense. For example, it should be:

(11)

Let is a total number of all prime numbers lying in all pairs of twin rows of the considered fragment of matrix, is a number of prime numbers contained in one selected pair of twin rows with index number l. In addition a total number of twin rows pairs should be equal, i.e. l takes values from 1 to, in short

Then when applying (10) for the case of matrix we obtain:

(12)

where is an average distance by columns between cells where adjacent prime numbers, lying in one pair of twin rows with index number, are located.

Note that here and further the first index of the parameter in question (in this case index k − 1) will correspond to index number of the considered matrix, and second index of this parameter (in this case index l) is an index number of the analyzed pair of twin rows.

Above we made an assumption that prime numbers in pairs of twin rows of each new matrix must be spaced more closely than in pairs of twin rows of previous matrix. To analyze and evaluate the assumption we will analyze a value of by pairs of twin rows of the considered fragment.

From the papers of Siegel [6] [7] [8] and other researchers [9] [10] [11] [12] it follows that if the constants (common differences) of different arithmetic progressions are equal to each other and the first term and common difference of each arithmetic progressions are co-primes, then prime numbers are distributed similarly and identically in these progressions. On the other hand, as shown above, a sequence of numbers located in any row of any pair of twin rows of matrix forms an arithmetic progression with the same common difference equal to. In addition the first term and common difference of these arithmetic progressions are co-primes. These progressions differ from each other only by a value of the first term and they are identical in all other respects. This means that within the considered fragment quantities of prime numbers in any pair of twin rows are approximately equal, i.e.:

(13)

where is an average quantity of prime numbers containing in a pair of twin rows of the considered fragment of matrix.

Then from this and expression (12) we obtain:

,

or

(14)

where―an average distance by columns between cells where adjacent prime numbers, lying in a pair of twin rows of the considered fragment of matrix, are located.

On the other side, it follows from (13) that

(15)

Here, we call attention to the following:

1) A certain selected row of any pair of twin rows in any matrix, excepting matrices and (Figure 1, and Figure 1,), could not contain prime twin numbers as shown above.

2) If two prime numbers, as shown above, are located in one column within one pair of twin rows, then they are twins. In this case a distance by columns between cells, where these prime twin numbers are located should be equal to zero.

3) Considered distance by columns between cells, where adjacent prime numbers are located, should not be confused with a difference, i.e. with a distance between values of adjacent prime numbers. It is plain, that in one cell of considered fragment of any matrix only one number can be located. In addition, difference of values of adjacent prime numbers, which are located in different, but adjacent to each other by row, cells of the fragment can take a value of any even integer.

As shown in a case of proving Theorem 1, it follows from (7), that while transforming matrix into matrix, each pair of twin rows of matrix generates new pairs of twin rows and 2 additional single rows in new matrix. As a result, each pair of twin rows of matrix creates pairs of new rows. Totally, pairs of twin rows generate new pairs of twin rows and additionally pairs of single rows in new matrix.

In brief, a set of prime numbers lying in all pairs of twin rows of the considered fragment of matrix is redistributed by new pairs of rows of new fragment corresponding to new matrix. Then an amount of prime numbers located in all newly created pairs of twin rows of matrix fragment is defined by the expression:

Therefore, a number of prime numbers, located in one selected pair of twin rows of the considered fragment of new matrix, is on the average:

(16)

On other hand, while transforming a fragment of matrix into a fragment of matrix, a number of columns in new fragment, as shown above, is reduced by times, i.e..

Then from (14), (15) and (16) we obtain, an average distance by columns between the cells, where adjacent prime numbers, lying in one pair of twin rows of the considered fragment of matrix, are located

(17)

Here we note the following. In the numerator (10) parameter is treated as a single term. In fact this option consists of two settings and. So if these two settings in the numerator (10) will be counted simultaneously, then the number of summands in the numerator (10) will be equal to. With this in mind, the expression (10) takes the following form:

If using this expression, enter appropriate simple changes to (12) and (14), then the expression (17) eventually goes into the following form:

From the inequality (11) get that

Therefore, with this in mind, we obtain that the expression for the parameter will have the same appearance-what is in (17). In short, the joint consideration of parameters and gives the same result, which is obtained at considering only one parameter.

From this it follows that with increase of index number k of matrix an average distance between the cells of adjacent prime numbers in any pair of twin rows of matrix decreases continuously.

As can be seen, “a density”, i.e. closeness of prime numbers is increasing. Therefore due to infinity of prime numbers and identity of their distribution in any pair of twin rows of matrix, a probability of occurrence of twin numbers will be greater than in case of previous matrix.

In particular, due to the fact that general skewness of prime numbers in pairs of twin rows of matrix does not exist, as shown above, then it will not appear in pairs of twin rows of the next matrices So, there are twin prime numbers in each pair of twin rows of any matrix.

The Theorem 2 is proved.

Now we consider a problem posed in front of this paper.

Theorem 3. A number of twin primes is infinite.

Proof of the Theorem 3.

As is shown above, each matrix corresponds to a certain prime number. It is known that a number of prime numbers is infinite. Therefore, a number of matrix variations is also infinite. On the other hand, twin prime numbers can be located in pairs of twin rows only.

It follows from the Theorem 1 and expression (7) that with rising growth of matrix index number, a number of pairs of twin rows in this matrix is steadily increased. i.e.

It also follows from the Theorem 2, that in any pair of twin rows there are prime twin numbers. This entire means that a number of prime twins is infinite.

This conclusion is also unavoidably followed from the expression (17).

If in (17) we express the parameter in terms of, which is a mean distance by columns between cells, where adjacent prime numbers are located in a pair of matrix twin rows, then we obtain

then

Next, in the same manner, we transform parameter through use of, then through use of, etc. While continuing the transformation up to, we obtain that an average distance by columns between cells of prime numbers in any pair of matrix twin rows can be generally determined by the expression:

(18)

where and is a mean distance between cells of adjacent prime numbers lying in a single not painted row of matrix (Figure 1, -в).

It follows from (18), that with rising of index number of matrix an average distance between cells of prime numbers in any pair of twin rows of matrix is progressively decreasing. And if we obtain that. In fact, having done small transformation we obtain from (18) that

Here, the infinite series containing reciprocals of prime numbers diverges, as was shown by Euler [13] , i.e.:

Therefore,

(19)

This means that with a growth of matrix’s index number an average distance between the cells, where adjacent primes are located, tends to zero. In addition the infinity of twins is not only inevitable but also obvious because it follows from (7) that at k → ∞ a number of twin rows pairs tends to infinity:. On the other hand as it follows from the Theorem 2, in each of these pairs of twin rows there are twin prime numbers.

The Theorem 3 is proved.

5. Conclusion

Study authors introduce the concept of matrix primes for researching of the properties of prime numbers. After, a number of theorems were proved in the work. Using these theorems and the theorems of Dirichlet, Siegel and Euler the proof of the infinity of twin primes was offered.

Conflicts of Interest

The authors declare no conflicts of interest.

Cite this paper

*Advances in Pure Mathematics*,

**6**, 954-971. doi: 10.4236/apm.2016.613073.

[1] |
A Prime Number. Wikipedia. https://ru.wikipedia.org/wiki/Простое_число#cite_note-27 |

[2] | Baibekov, S.N. (2016) About Infinity of Prime Twins. Poisk, No, 203-213. |

[3] | Baibekov, S.N. (2015) Development of New Method for Generating Prime Numbers, Eurasian Gumilev University Bulletin, No. 4, 14-21. |

[4] | Baibekov, S.N. and Altynbek, S.A. (2015) Development of New Method for Generating Prime Numbers. Natural Science, 7, 416-423. |

[5] | Baibekov, S.N. (2015) Generation and Test of Prime Numbers. Eurasian Gumilev University Bulletin, No. 6, Part 2, 263-365. |

[6] | Siegеl, С.L. (1935) Acta Arithmetica, v. 1, 83-86. |

[7] |
Numbers of Arithmetic Progression. universal_ru_en.academic.ru/...копия |

[8] | Karatsuba, A.A. (1975) The Fundamentals of Analytical Number Theory. M., Chapter 9. |

[9] | Linnik, Yu.V. (1961) The Dispersion Method in Binary Additive Problems. L.: LGU Publishing. |

[10] | Linnik, Yu., Barban, M. and Tshudakov, N. (1964) On Prime Numbers in an Arithmetic Progression with a Prime-Power Difference. Acta Arithmetica, 9, 375-390. |

[11] | Gritsenko, S.A. and Dhevtsova, M.V. (2011) On Distribution of primes in Arithmetic Progressions with a Difference of Special Type. Scientific Bulletin, Mathematics and Physics Series,. No (100), n. 22, 17-37. |

[12] | German-Yevtushenko, M.S. (2013) About a Sum of Values of Divisor Function by Numbers Lying in Arithmetic Progressions with a Difference of Special Type. Scientific Bulletin, Mathematics and Physics Series,. No 12(155), n. 31, 12-19. |

[13] |
Zagier, D. (1977) The First 50 Million Prime Numbers. http://ega-math.narod.ru/Liv/Zagier.htm |

Copyright © 2018 by authors and Scientific Research Publishing Inc.

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.