Primes Made Simple
Main Article Content
Abstract
In this article, the author presents yet another alternative approach to proving the binary Goldbach-Euler conjecture [2]. Drawing upon the ternary and binary problems, the author highlights the inherent systematic nature of prime numbers by proving a theorem regarding the arithmetic mean of a prime number. The article concludes with calculations that substantiate the aforementioned findings.
Article Details
Section
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
This is an Open Access article distributed under the terms of the Attribution-Noncommercial 4.0 International License [CC BY-NC 4.0], which requires that reusers give credit to the creator. It allows reusers to distribute, remix, adapt, and build upon the material in any medium or format, for noncommercial purposes only.