Authors: Chongxi Yu
Prime numbers are the basic numbers and are crucially important. There are many conjectures concerning primes that have been challenging mathematicians for hundreds of years. Goldbach's conjecture is one of the oldest and most well-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 magic, but when you open one and examine it, it contains only very simple, loose, colored objects such as beads or pebbles and bits of glass. Humans are very easily cheated by 2 words, infinite and anything, because we never see infinite and anything, and so we always make a simple thing complex. Goldbach’s conjecture is about all very simple numbers, with the pattern of prime numbers similar to a “kaleidoscope” of numbers. If we divided all 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.
Comments: 22 Pages.
Unique-IP document downloads: 105 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.