Weak Golbach's Conjecture from Isomorphic and Equivalent Odd Prime Number Functions

TL;DR

This paper proposes a novel approach to the weak Goldbach's conjecture by establishing isomorphic and equivalent functions between odd primes and odd natural numbers, aiming to prove the conjecture without traditional analytical methods.

Contribution

It introduces a new prime number function and demonstrates its isomorphism with odd natural numbers to provide a proof of the weak Goldbach's conjecture.

Findings

Sum of three elements in the function exceeds 7

Established isomorphism between prime and natural number functions

Provided a non-analytical proof of the conjecture

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 P_{odd}(x)p>2, including odd primes p > 2, isomorphic and equivalent to a function N_{odd}(x)n>1, including odd natural numbers greater than one, n_{odd} > 1, in which, the sum of three of its elements result in odd numbers greater than 7, proving the conjecture.