Number Theory


A Proof of Goldbach's Conjecture

Authors: Chongxi Yu

Prime numbers are the basic numbers and are crucial important. There are many conjectures concerning primes are challenging mathematicians for hundreds of years. Goldbach's conjecture is one of the oldest and best-known unsolved problems in number theory and in all of mathematics. A kaleidoscope can produce an endless variety of colorful patterns and it looks like a magic, but when you open it, it contains only very simple, loose, colored objects such as beads or pebbles and bits of glass. Goldbach’s conjecture is about all numbers, the pattern of prime numbers likes a “kaleidoscope” of numbers, we divided any even numbers into 10 groups and primes into 4 groups, Goldbach’s conjecture becomes much simpler. Here we give a clear proof for Goldbach's conjecture based on the fundamental theorem of arithmetic and Euclid's proof that the set of prime numbers is endless.

Comments: 33 Pages.

Download: PDF

Submission history

[v1] 2017-02-07 08:27:42
[v2] 2017-02-12 00:48:46
[v3] 2017-02-13 23:18:35
[v4] 2017-02-22 02:59:46
[v5] 2017-02-22 08:26:54

Unique-IP document downloads: 93 times

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