## An Elementary 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. Human is very easily cheated by 2 words, infinite and anything, because we never see infinite and anything, so we always make simple thing complex. Goldbach’s conjecture is about all very simple numbers, the pattern of prime numbers likes a “kaleidoscope” of numbers, we divided any even numbers into 5 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, the prime number theorem, and Euclid's proof that the set of prime numbers is endless.
Key words: Goldbach's conjecture, fundamental theorem of arithmetic, Euclid's proof of infinite primes, the prime number theorem

**Comments:** 19 Pages.

**Download:** **PDF**

### Submission history

[v1] 2017-04-09 02:46:21

[v2] 2017-04-10 22:29:48

[v3] 2017-04-14 23:03:01

**Unique-IP document downloads:** 49 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.*

*
*