TITLE:
Rigorous Proof of Goldbach’s Conjecture
AUTHORS:
Zengyong Liang
KEYWORDS:
Set, Function, Sieve, Integer-Pair, Induction, Mathematical Analysis
JOURNAL NAME:
Journal of Applied Mathematics and Physics,
Vol.6 No.9,
September
7,
2018
ABSTRACT: In this article, we use set, function, sieve and number theory to study the prime and composite numbers, prove that the lower limit formula of the number of prime numbers derived from the Euler’s function, and find d(n) to count the lower limit formula of the number of prime integer-pairs. We proved that Goldbach’s conjecture is correct by mathematical induction. Finally, we proved proof reliance by mathematical analysis and computer data.