Journal of Mathematical Techniques and Computational Mathematics(JMTCM)

Independent researcher. Nantes. Loire Atlantique, France

Publications

• Research Article   
  Two Theorems To Verify Goldbach's Strong Conjecture ; or To Refute it By an Uninterrupted Sequence of Composite Odd Numbers In The Interval [n ─ 2n]
  Author(s): Bahbouhi Bouchaib*
  
  Let's assume an even number E that is one unit larger than to the largest prime number we know today. Let's call this prime number Pl. Now we have 0—E/2—E and therefore Pl > E/2. For GSC to be true E must be sum of two primes P1 and P2 such that P1 < E/2 and P2 > E/2. Therefore we have to calculate E – P2 = X. If X is composite GSC is not verified; if X = P1 then GSC is verified. We then calculate E – P2 starting with Pl and all P2 till the one which is the closest to E/2. The question is: are all the Xs resulting from calculated E – P2 = X composites? Is it possible that all Xs might be composite which means non-verification of GSC? By contrast, if only one X is prime, then GSC is true. We see that GSC is much more likley to be verified in this case because a very long sequence of composite numbers is very unlikely to be continuous from .. Read More»
  

  Abstract HTML PDF