Number Theory

    

About the Strong Euler-Goldbach Conjecture

Authors: Philippe Sainty

In this article, we define a " recursive local" algorithm in order to construct two reccurent numerical sequences of positive prime numbers (u2n) and (v2n), ((u2n) function of (v2n)), such that for any integer n≥ 2, their sum is 2n. To build these , we use a third sequence of prime numbers (w2n) defined for any integer n≥ 3 by : w2n = Sup(p∈IP : p ≤ 2n-3), where IP is the infinite set of positive prime numbers. The Goldbach conjecture has been verified for all even integers 2n between 4 and 4.1018. In the Table of Goldbach sequence terms given in paragraph § 10, we reach values of the order of 2n= 101000 Thus, thanks to this algorithm of "ascent and descent", we can validate the strong Euler-Goldbach conjecture.

Comments: 14 Pages.

Download: PDF

Submission history

[v1] 2022-12-04 01:29:06

Unique-IP document downloads: 125 times

Vixra.org is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. Vixra.org will not be responsible for any consequences of actions that result from any form of use of any documents on this website.

Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.

comments powered by Disqus