PROOF OF THE BINARY GOLDBACH CONJECTURE

this article the proof of the binary Goldbach conjecture is established (Any integer greater than one is the mean arithmetic of two positive primes) . To this end, Chen’s weak conjecture is proved (Any even integer greater than one is the difference of two positive primes) and a "localised" algorithm is developed for the construction of two recurrent sequences of primes () and ( ), ( ( ) dependent of ( ) ) such that for any integer n their sum is equal to 2n : () and ( ) are extreme Goldbach decomponents. To form them, a third sequence of primes () is defined for any integer n by = Sup ( p ∈ : p ≤ 2n - 3 ) , denoting the set of positive primes. The Goldbach conjecture has been proved for all even integers 2n between 4 and 4.a neighbourhood of , and . The table of extreme Goldbach decomposants, compiled using the programs in Appendix 14 and written with the Maxima and Maple scientific computing software, as well as files from ResearchGate, the Internet Archive, and the OEIS, reaches values of the order of 2n = . In addition, a global proof by strong recurrence "finite ascent and descent method" on all the Goldbach decomponents is provided by using sequences of primes () defined by = Sup ( p ∈ : p ≤ 2n - q ) for any odd positive prime q , and a majorization of by , 0.7 (n) with probability one and 5 (n) on average for any integer n large enough is justified.. Finally, the Lagrange-Lemoine-Levy (3L) conjecture and its generalization called "Bachet-Bézout-Goldbach"(BBG) conjecture are proven by the same type of method.