Results 1 -
4 of
4
A complete Vinogradov 3-primes theorem under the Riemann hypothesis
- ERA Am. Math. Soc
, 1997
"... Abstract. We outline a proof that if the Generalized Riemann Hypothesis holds, then every odd number above 5 is a sum of three prime numbers. The proof involves an asymptotic theorem covering all but a finite number of cases, an intermediate lemma, and an extensive computation. 1. ..."
Abstract
-
Cited by 6 (1 self)
- Add to MetaCart
Abstract. We outline a proof that if the Generalized Riemann Hypothesis holds, then every odd number above 5 is a sum of three prime numbers. The proof involves an asymptotic theorem covering all but a finite number of cases, an intermediate lemma, and an extensive computation. 1.
New experimental results concerning the Goldbach conjecture
- Algorithmic Number Theory (Third International Symposium, ANTS-III
, 1998
"... and their applications. SMC is sponsored by the Netherlands Organization for Scientific Research (NWO). CWI is a member of ..."
Abstract
-
Cited by 2 (1 self)
- Add to MetaCart
and their applications. SMC is sponsored by the Netherlands Organization for Scientific Research (NWO). CWI is a member of
On a Proof of the Goldbach Conjecture and the Twin Prime Conjecture
, 2006
"... In this paper we use the connected sum operation on knots to show that there is a one-to-one relation between knots and numbers. In this relation prime knots are bijectively assigned with prime numbers such that the prime number 2 corresponds to the trefoil knot. From this relation we have a classif ..."
Abstract
- Add to MetaCart
In this paper we use the connected sum operation on knots to show that there is a one-to-one relation between knots and numbers. In this relation prime knots are bijectively assigned with prime numbers such that the prime number 2 corresponds to the trefoil knot. From this relation we have a classification table of knots where knots are one-to-one assigned with numbers. Further this assignment for the nth induction step of the number 2 n is determined by this assignment for the previous n − 1 steps. From this induction of assigning knots with numbers we can solve some problems in number theory such as the Goldbach Conjecture and the Twin Prime Conjecture. Mathematics Subject Classification: 11N05, 11P32, 11A51, 57M27. 1
1 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 that a ..."
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. 1

