Pré-Publication, Document De Travail Année : 2016

Proof by induction of the strong Goldbach's conjecture

Résumé

To prove the conjecture, we consider for any even natural number 2n > 4, with n > 2, the finite sequence of natural numbers Sm (n) = (si (n)) defined by : si (n) = 2n-pi, with i belonging to set {1,2,...,m}, where pi is the i-th prime number in the finite strictly ordered sequence of primes Pm := p1 = 2 < p2 = 3 < p3 = 5 < ... < pm, where m denotes the number of primes p such that p < 2n. Using two stages of proofs: the proof by contradiction and mathematical induction, we prove that, for any natural number n > 2, there exists at least one prime number sr (n) = 2n - pr belonging to the sequence Sm (n), which confirms the result 2n = sr (n) + pr where pr is the r-th prime number of the sequence Pm . This result attests the validity of Goldbach's statement which expresses that: every even integer 2n > 4, with n> 2, is the sum of two primes.

Fichier principal
Vignette du fichier
Goldbachs_Hall_Arxiv version corrigé.pdf (183.82 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Licence
Loading...

Dates et versions

hal-01251852 , version 1 (06-01-2016)
hal-01251852 , version 2 (08-01-2016)
hal-01251852 , version 3 (23-01-2016)

Licence

Identifiants

  • HAL Id : hal-01251852 , version 3

Citer

Douadi Mihoubi. Proof by induction of the strong Goldbach's conjecture. 2016. ⟨hal-01251852v3⟩
2856 Consultations
2057 Téléchargements

Partager

  • More