An Elementary Proof of the Binary Goldbach Conjecture
We establish the binary Goldbach conjecture which asserts that every even positive integer greater than four can be expressed as a sum of two odd primes. This goal is achieved by proving that the number of ordered Goldbach pairs that add up to $2n$ is an $\mathcal{O}\left(\frac{n}{\ln^{2} n}\right)$ function. As an application, we provide a simpler verification of the ternary Goldbach conjecture that was first established in [6,7].
math.NT↗