Number Theory

    

Functional Proofs of Goldbach Conjecture

Authors: Tae Beom Lee

Goldbach's Conjecture(GC) states that any even integer ≥ 4 can be represented by the sum of two prime numbers. This was conjectured by Christian Goldbach in 1742 and still remains unproved. In this thesis we proved GC by introducing, we called them, Goldbach Partition Model Table(GPMT) and Sieve Functions(SFs). GPMT is a 2-dimensional table of all possible pair of two numbers (x, 2n – x), whose sum can be any even number 2n. To functionally treat the sieve of Eratosthenes, we devised SFs that have sinusoidal symmetry and period properties. By using GPMT and the SFs, we could induce GC False Conditions(GCFC) that must be satisfied if GC is false. And we proved that GCFC can not be satisfied, so, GC is true.

Comments: 25 Pages.

Download: PDF

Submission history

[v1] 2021-08-30 22:27:17

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