Number Theory


Goldbach's Conjecture Proof

Authors: Elizabeth Gatton-Robey

I created an algorithm that guarantees the validity of Goldbach’s Conjecture. The algorithm eliminates all even integers that are not the sum of an even integer when the number 3 is added to one other prime number. The visual pattern that emerges from the algorithm maps all prime numbers. This pattern is also applied to individual consecutive primes to eliminate all even numbers that are not the sum of each prime number plus one other prime number. By layering the pattern to account for all possible “sums of two prime numbers” combinations, it can either be said that “all evens will be eliminated” or “no evens will be eliminated”. What this means is that what happens to one even integer is universal.

Comments: 2 Pages.

Download: PDF

Submission history

[v1] 2018-04-28 14:33:16

Unique-IP document downloads: 89 times 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. 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