Results 101 to 110 of about 1,226 (146)

On the Goldbach Conjecture

1996
A natural number n always has a unique predecessor; it is either n - 1 or 0. The word “predecessor” will be understood to mean “immediate predecessor”. This is the fundamental concept in the theory of the natural numbers. If one takes “successor” as the basic concept and then postulates the existence of a sucessor to every natural number, one requires ...
David Booth, Renatus Ziegler
openaire   +1 more source

Goldbach’s conjecture in max-algebra

Computational Management Science, 2016
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

The Goldbach Conjecture

1993
In this chapter we investigate the question of the representation of an odd integer N as the sum of three prime numbers (the Goldbach Conjecture). We shall prove I.M. Vinogradov’s theorem on the asymptotic formula for the number of representations of N as the sum of three primes, from which it will follow that every sufficiently large odd number can be
Anatolij A. Karatsuba   +1 more
openaire   +1 more source

Goldbach's conjecture

2014
This paper has been replaced by the paper "Goldbach's Conjecture — A Route to the Inconsistency of Arithmetic".
openaire   +2 more sources

The second goldbach conjecture revisited

BIT, 1968
Goldbachs Vermutung, daß jede ungerade Zahl \(>7\) die Summe von drei ungeraden Primzahlen ist, \(S =p + q+ r\), wird hier dahin abgeändert, daß jede ungerade Zahl \(>5\) die Summe \(S = 2p + q\) hat. Verf. baut auf seiner früheren Arbeit [ibid. 6, 48--50 (1966; Zbl 0141.04302)] auf und zeigt in Tafel 1 Beziehungen zwischen \(n\), \(q(n)\) und \(q'(n)\)
openaire   +1 more source

Home - About - Disclaimer - Privacy