Number Theory

    

What Makes Goldbach's Conjecture Correct

Authors: Timothy W. Jones

A direct proof shows Goldbach's conjecture is correct. It is as simple as can be imagined. A table consisting of two rows is used. The lower row counts from 0 to any n and and the top row counts down from 2n to n. All columns will have all numbers that add to 2n. Using a sieve, all composites are crossed out and only columns with primes are left. Without loss of generality, an example shows that primes, ones that sum to 2n will always be left in such columns.

Comments: 4 Pages. Thanks for any patience. I think this draft should do it.

Download: PDF

Submission history

[v1] 2022-06-30 03:10:24
[v2] 2022-07-04 07:44:09
[v3] 2022-07-09 12:59:28
[v4] 2022-07-17 07:12:49
[v5] 2022-07-26 12:38:41

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