Proof of Goldbach's Conjecture
Reza Javaherdashti
Abstract
After certain subsets of Natural numbers called Range and Row are defined, we assume (1) there is a function that can produce prime numbers and (2) each even number greater than 2, like A, can be represented as the sum of n prime numbers. We show this by DC(A)less than or equal to n. Each Row is similar to each other in properties,(so is each Range). It is proven that in an arbitrary Row for any even number greater than 2, DC(A)=2, that is to say, each prime number greater than two is the sum of two prime numbers. So Goldbach's conjecture is proved.
Create a lesson
Related papers
On the Rank Condition for Perfect Cuboids
Valery Asiryan
A Local Proof of Langlands's First Main Lemma for Local Epsilon Factors over Nonarchimedean Local Fields
Fukuhiro Ueda
The first type of power mean bounds for the Gaussian hypergeometric function
Zhen-Hang, Yang, Jing-Feng Tian
On a new class of q-fractional integral operators involving multivariate q-Mittag-Leffler functions
Min-Jie Luo, Qing-Hui Peng, Ravinder Krishna Raina
Partition-theoretic density formulas: radial Tauberian theory and non-radial instability
Mohammad F. Marashdeh
Octonionic Kittaneh Numerical Radius Inequalities
K. Mahesh Krishna