Weak Golbach's Conjecture from Isomorphic and Equivalent Odd Prime Number Functions
Abstract
Mathematicians has been trying to prove the weak Goldbach's conjecture by adding prime numbers, as stated in the conjecture. However, we believe that the solution does not need to be analytically solved. Instead of trying to add prime numbers to prove the conjecture, we developed a prime number function Podd(x)p>2, including odd primes p > 2, isomorphic and equivalent to a function Nodd(x)n>1, including odd natural numbers greater than one, nodd > 1, in which, the sum of three of its elements result in odd numbers greater than 7, proving the conjecture.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.