Number Theory

    

Demonstrating Goldbach's Strong Conjecture by Deduction Using 4x ± 1 Equations in Loops and Gaps of 4.

Authors: Bahbouhi Bouchaib

After defining the writing of even numbers with equations 4x ± 1; the article shows that odd numbers obey loops of 4 numbers to infinity that obey the equations 4x ± 1. Each odd number in the loop can be prime (P) or composite (C), but for an even number E to be E = P + P' such that P' > P and such that P' > E/2 and P < E/2, P and P' must belong to two loops symmetrical with respect to E/2 and occupy the same positions in them and specific unit digits. The article shows that the three possible sums of an even number E are E = C + C'; or E = P + C; or E = P + P' (C is composite and P is prime). The article demonstrates that E = C + C' ↔ E = C + P ↔ E = P + P' ; and that one sum can be converted into another by subtracting and adding gaps of 4n from or to the two terms of addition. This is a deductive demonstration of Goldbach's strong conjecture shown here for the first time.

Comments: 18 Pages. This is a new attempt to demonstrate Goldbach's strong conjecture using basic and accessible mathematics.

Download: PDF

Submission history

[v1] 2025-02-01 21:23:08
[v2] 2025-02-06 22:21:32

Unique-IP document downloads: 231 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