Proof of a conjecture presented on the Fifth International Congress of Mathematics in 1912

Rodolfo A. Nieves Rivas fesol7luzley@gmail.com Abstract This article presents a proof of the twin prime conjecture which was presented at the Fifth Congress of Mathematics at Cambridge in 1912 by Edmund Landau and known as one of the Landaus problems. Similarly, it is presented the proof of its generalization known as Polignacs conjecture and concludes with the confirmation of the conjectures. Keywords: Landaus problems, twin primes, Polignacs conjecture

Introduction

One problem that has intrigued and challenged the intellect of many eminent and famous mathematicians since it was raised is: the twin prime conjecture3,4, and its generalization known as Polignacs conjecture made by Alphonse de Polignac in 1849. Both conjectures state: The twin prime conjecture is: There are infinitely many primes such that p + 2 is also prime. Polignacs conjecture is: For every natural number k there are infinitely many pairs of primes whose difference is 2k. The case k=1 is the assumption of twin primes. Note that the twin prime conjecture is part of Landau5 problems who presented at the Fifth International Congress of mathematics at Cambridge in 1912, remaining both unsolved up to date. The aim of this paper is to present the solution of the conjectures to the scientific community and thus provide another contribution based on the progress of science.

Theoretical Framework

Theorem 1: If gcd (a, n) = 1 then there are infinitely many prime numbers congruent to modulo n. (Dirichlet1,7). Theorem 2: There are infinitely many primes8 (Euclid)

Theorem 3: The sum of two numbers plus their difference is equal to twice the larger 2 Theorem 4: The sum of two numbers less than their difference is equal to twice the smaller 2 Theorem 5: The product of the sum of two numbers by their difference is equal to the difference of the squares of the two numbers2. Corollary 1: All semi-prime can be expressed as the difference of two squares. Lemma 1: Any product of two different odd primes has four and only four divisors6. Criterion 1: A difference of squares of the form n2-k2 is a semi-prime product of two different odd primes of the form (n-k) (n + k).If and only if (n +1)2-k2 is the sum of its four divisors.

Theoretical Bases (descriptive analysis)

(theorem 5) (definition) (definition) (definition) (definition) (condition) (deduction) (definition and deduction) (definition and deduction) (definition and condition) (condition) (deduction) (deduction) (deduction) (deduction) (deduction) (deduction) (deduction) (criterion 1 and lemma 1)

Let: (n+k)(n-k)=n2-k2 For: 0k<n Where: (n-k) = Pi And: (n+k) = Pj Where: Ax2+Bx+c=Pi.Pj For: Pi Pj Where: x= (Pi-1)/2 Where: A=4 (constant) And: B=2c+2 For c= any odd number Where: c1 And: k=(c-1)/2 Where: n=2x+k+1 And: 2n=4x+2k+2 And: 2n+1=4x+2k+3 Where: (n-k) =2x+1 When: (n+k) = 2x+2k+1 Where: Pj=Pi+2k= (n+k) Where: (Pi+1)(Pj+1)=Ay2+By+c=(n+1)2-k2

When: y= (Pi/2) If and only If: Ax2+Bx+c (Pn)3 Where: Pn Where: Ax2+Bx+c +4x+2k+3= n2-k2+ (n-k) + (n+k) +1 And: Ay2+By+c= Pi..Pj+Pi+Pj+1 Where: (n+k) (n-k)2 Where: (n-k) + (n+k) =2n And: (n-k)-(n+k) =2k When: (n-k)(n+k)= n2-k2

(definition) (condition) (definition) (criterion 1) (criterion 1) (condition) (theorem 3) (theorem 4) (theorem 5)

General Objective

Proof of the infinitude of twin primes and Polignacs conjecture. If: ax+b When: ax+c Where: a=2 (constant) When b=1 (constant) For: c3 Where: c is any odd number Since: gcd (a,b)=1 And: gcd (a,c)=1 Then: Ax2+Bx+c= is a semi-prime product of: Pi(Pi+2k) If: 2k= (c-1) Where: Pi When: Pi+2k If and only if: A=4 Where: B=2c+2 (By theorem 1) (By theorem 1)

For all: c3 If: x= (Pi-1)/2 And as: there are infinitely many Pi Then: there exist infinitely many x So that: there exist infinitely many semi-primes generated by: Ax2+Bx+c When: c=3 Then: there exist infinitely many primes: Pi and (Pi+2k) Where: k=1 Hence: the infinitude of the twin prime is true And as: All c is coprime to: a Then: there exist infinitely many semi-primes generated by: Ax2+Bx+c For all: k1 Then: Polignacs conjecture is true. Q.e.d. Q.e.d. (By theorem 2)

Results

Table I (Examples: For: K= 0) n - K2 = Ax2 + Bx + c = Semi-prime = (n-k)(n+k) 2 3 - 02 = 4.12 + 4.1 + 1 = 9 = 3.3 2 2 2 5 - 0 = 4.2 + 4.2 + 1 = 25 = 5.5 72 - 02 = 4.32 + 4.3 + 1 = 49 = 7.7 112 - 02 = 4.52 + 4.5 + 1 = 121 = 11.11 . . . . . . . . . . . . . . . . . . . . . Note: For: k=0 (constant), c= 1 (constant), B= (2.c+2) = 4 (constant)
2

n= (2x +k +1),

k= (c-1)/2,

x= (Pi-1)/2, Pi=3, 5, 7, 11

Table II (Examples: For: K= 1 twins)

Proof of the infinitude of twin primes n2 42 62 122 182 . . . K2 12 12 12 12 . . . = = = = = Ax2 4.12 4.22 4.52 4.82 . . . + + + + + Bx 8.1 8.2 8.5 8.8 . . . + + + + + c 3 3 3 3 . . .

(visualization) = Semi-prime = (n-k)(n+k) = 15 = 3.5 = 35 = 5.7 = 143 = 11.13 = 323 = 17.19 . . . . . .

Note: For: k=1 (constant), c= 3 (constant), B= (2.c+2) = 8 (constant) n= (2x +k +1), k= (c-1)/2, x= (Pi-1)/2, Pi=3, 5, 11, 17

Table III (Examples: For: K= 2) n2 52 92 152 212 . . . K2 22 22 22 22 . . . = = = = = Ax2 4.12 4.32 4.62 4.92 . . . + + + + + Bx 12.1 12.3 12.6 12.9 . . . + + + + + c 5 5 5 5 . . . = Semi-prime = (n-k)(n+k) = 21 = 3.7 = 77 = 7.11 = 221 = 13.17 = 467 = 19.23 . . . . . .

Note: For: k=2 (constant), c= 5 (constant), B= (2.c+2) = 12 (constant) n= (2x +k+1), k= (c-1)/2, x= (Pi-1)/2, Pi=3, 7, 13, 19

Table IV (Examples: For: K= 3) n2 82 102 142 162 . . . K2 32 32 32 32 . . . = = = = = Ax2 4.22 4.32 4.52 4.62 . . . + + + + + Bx 16.2 16.3 16.5 16.6 . . . + + + + + c 7 7 7 7 . . . = Semi-prime = (n-k)(n+k) = 55 = 5.11 = 91 = 7.13 = 187 = 11.17 = 247 = 13.19 . . . . . .

Note: For: k=3 (constant), c= 7 (constant), B= (2.c+2) = 16 (constant) n= (2x +k+1), k= (c-1)/2, x= (Pi-1)/2, Pi=5, 7, 11, 13

Discussion, analysis of results and its applications

The main applications deducted immediately from the obtained results are directly linked to two problems with similar characteristics which are: The infinitude of Sophie Germains primes and Golbach even conjecture. Open problems which do not have a satisfactory solution and also are of importance in number theory structuration and also considered intractable. This is one reason that Golbach conjecture is known as one of the most difficult problem to solve in mathematics. This is why once proved the consistency and veracity of the obtained results in this study, these would lead us towards the proof of these two other conjectures such that: If you prove that there exist infinitely many values for: x = Prime Then Sophie Germains primes are infinite So that: 2.x + 1 = Prime When: 2.x + c + Prime (see tables) (see tables)

And if it is proved that the difference of two squares of the form: n2 - k2 It is a semi-prime for all: n greater than or equal to: 3 Then: Goldbach even conjecture is true. Since: n2 - k2 = (n k). (n + k) (theorem5)

And hence: (n k) + (n + k) = 2. n = Sum of two prime numbers (theorem 3)

Conclusion and recommendations

Once obtained these results and have complied satisfactorily with the stated objective allows us to propose to the scientific community implementation study and the corresponding area, given its importance in theories such as number theory, sieve theory, primality algorithms, among other NPcomplete problems, it is precisely in these theories where the majority of open issues still remain unsolved and some other problems related to prime numbers.

References
[1] Angel, Jos y Guillermo, M.L. (2005).Breve resea sobre la Hiptesis de Reimann, Primalidad y el Algoritmo AKS. http://www.criptored.upm.es/guiateoria/gt_m117j.htm. [searched: 2011, June 15] [2] Baldor, A. Aritmtica terica-prctica. Ed. Cultural Venezolana S.A. 1992. ISBN980-204-0002. Pp. 86:108 [3]Balestrieri, F. An Equivalent Problem to the Twin Prime Conjecture.Arxiv:1106.6050v1.2011. pp.1-7 [4] Benoit, C. 10 Conjectures in Additive Number Theory. Arxiv:1101.4274v1. 2011. pp 1: 46 [5] Chengyan, L. Sieve Method and Landau Problems. Arxiv:9909.154v1. 1999. Pp 1-7 [6] Nieves R., Rodolfo. Prueba de Primalidad. Memorias XVIII Jornadas tcnicas de investigacin y II de postgrado. Ed. Horizontes. Venezuela. 2009. Pp. 216-220 [7] Selberg, Atle , "An elementary proof of Dirichlet's theorem about primes in an arithmetic progression", Annals of Mathematics 1949. pp. 297304 [8] Yamada,T. (s.f).Proofs of the Infinitude of u.ac.jp/~tyamada/files/infprime.pdf [searched: 2011, July 17] Primes. http://www.math.kyoto-