Results

**1 - 5**of**5**### On Goldbach’s Conjecture

, 2002

"... It is shown that if every odd integer n> 5 is the sum of three primes, then every even integer n> 2 is the sum of two primes. A conditional proof of Goldbach’s conjecture, based on Cramér’s conjecture, is presented. Theoretical and experimental results available on Goldbach’s conjecture allow ..."

Abstract
- Add to MetaCart

It is shown that if every odd integer n> 5 is the sum of three primes, then every even integer n> 2 is the sum of two primes. A conditional proof of Goldbach’s conjecture, based on Cramér’s conjecture, is presented. Theoretical and experimental results available on Goldbach’s conjecture allow that a less restrictive conjecture than Cramér’s conjecture be used in the conditional proof. A basic result of the Maier’s paper on Cramér’s model is criticized.

### Weak Golbach’s Conjecture from Isomorphic and Equivalent Odd Prime Number Functions Research

"... 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 n ..."

Abstract
- Add to MetaCart

(Show Context)
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. MSC: 11P32, 37M10