TWIN PRIMES ARE INFINITE RODOLFO A. NIEVES Email: fesol7luzley@gmail.com ABSTRACT.

This short paper presents the infinitude of the twin primes and their proof through a primality test based on a discriminant matrix whose elements are generated by a diophantine equation of second degree. 1. DESCRIPTION AND ANALYSIS 1.1 Diophantine equation of second degree Let: K= ax 2 + bx + c For: a=2 Where: k>x1 And: k>c0 Remark 1.1. This equation is defined only for positive integer values and is the generator equation of elements of a discriminant matrix of prime numbers determining all odd composite numbers. Condition 1: If k a i j , then: 2k+1=odd composite number b= (2c+2) c=(b-2)/2

1.2 DISCRIMINANT MATRIX [6], [7] OF PRIME NUMBERS Theorem 1. If: (k) a i j is the discriminant matrix For: (k)>i1 And: (k)>j0 Then:2 (k)+1 = odd composite number Remark 1.2. All the elements (k) of this matrix are generated by the Diophantine equation 1.1 and determines all odd composite numbers of the form 2(k) + 1 Condition 2: If k ai j , then:2k + 1 =odd prime number 1.3 RELATION OF 1.1 AND 1.2 Theorem 2. If: k=2x2 + bx + c And: (k) =aij Only when: i=x And: j=c Then: k=(k) = 2x2 + bx + c = a ij (ith row of a ij ) (j th column of a ij )

1.4 PRIMALITY TEST [2],[4] FOR DETERMINING TWIN PRIMES Based on: 1.1 and 1.2 Theorem 3. If 2k + 1and 2k +3 is prime only if k a i,j ,then: 2k + 1 and 2k + 3 are twin primes Proof: If 2k + 1 is an odd prime number Only when: k a i,j Then: 2k + 3 is an odd prime number If and only if: (k + 1) a i,j It is concluded that: The necessary and sufficient condition so that k and (k +1) do not generate the matrix is that there does not exist values for i and j for a i,j 1.5 PRIMALITY TEST [3] JUSTIFICATION AND DETERMINATION: i and j Theorem 4. If: (k) Proof: Let: aij = ax2 + bx + c When: (a ij )-j=ax2 +bx Where: (a ij )-j=ax2 +(2c+2)x Since: (a ij )-j=ax2 +2cx+2x And as: (a ij )-j=2x2 +2xc+2x And if: ((a ij )-j)/2i=x+c+1 And: (((a ij )-j)/(2i))-i=c+1 Where: (((a ij )-j)/(2i))-i=j+1 Then: (((k)-j)/2i))-i=j+1 1.6 PROOF OF THE TWIN PRIMES [1], [5] Since: There does not exist integer values for j when i= 1 = x Then: 2k + 1 = odd prime number Let: aij k For: i = 1 Where: j (takes the value 1, 2, 3, 4, 5natural equals to j) (by 1.3) (j=c) (2c+2=b) (by above) (a=2) (divided by 2x=2i) (minus i=x) (c=j) ((a ij )=(k)) aij, then: 2i2 +2ij+2i+j=k

Then: Generates elements in the row matrix that discriminate primes Row matrix = (4 7 10 13 16 19.kij = kxc) Where: 2 (4 7 10 13 16 19) + 1= (9 15 21 27 33 39) = 2k + 1= odd composite number Since: k ai j (1 2 3 5 6 8 9 11) does not belong Then: 2 (1 2 3 5 6 8 9 11) + 1= (3 5 7 11 13 17 19 23) =2k+1=odd prime number

Then: The matrix generates k+0 and k + 3, and: discriminates k + 1 and k + 2 (Which are twin primes) 1.7 CONCLUSION: If: 2k+1 =odd composite number If and only if: (k) a ij Then: 2k+1=odd prime number When: K ai j Since: (((k)-j)/2i))-ij+1 ACKNOWLEDGEMENT

This work was supported by Fundacin Integral para el Desarrollo Comunitario (F.I.D.E.C.)
REFERENCES [1] Agrawal, M.; Kayal, N.; and Saxena, N. "Primes in P." Preprint, Aug. 6, 2002. http://www.cse.iitk.ac.in/primality.pdf. [2] Chaves, M. Twin Primes and a Primality Test by Indivisibility. http://arxiv.org/PS_cache/math/pdf/0211/0211034v3.pdf [3] H. F. Chau and H.-K. Lo. Primality Test Via Quantum Factorization. http://arxiv.org/PS_cache/quant-ph/pdf/9508/9508005v3.pdf [4] Clark, E. "Polynomial Time Primality Test." sci.math newsgroup posting. 6 Aug 2002. [5] Crandall, R. and Pomerance, C. Prime Numbers: A Computational Perspective, 2nd ed. New York: Springer-Verlag, 2005. [6] Ltkepohl, H. Handbook of Matrices. New York: Wiley, 1996 [7] Pomerance, C. "A New Primal Screen." FOCUS: Newsletter of the Math. Assoc. Amer. 22, No. 8, 4-5, 2002b.