Results 101 to 110 of about 117,836 (141)
Microbiol Rev, 1978 Some of the next articles are maybe not open access.
Related searches:
Related searches:
Goldbach’s conjecture in max-algebra
Computational Management Science, 2016zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Peter Szabó
exaly +2 more sources
A study on Goldbach conjecture
Journal of Mathematical Chemistry, 2016zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ramon Carbó-Dorca
exaly +3 more sources
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
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
1996
Sometimes the most innocent question inspires the greatest effort in mathematics. Christian Goldbach (1690–1764) asked just such a question in 1742. Goldbach was a German mathematician who became professor of mathematics in 1725 in St. Petersburg, Russia. Three years later he traveled to Moscow to tutor Tsar Peter II.
openaire +1 more source
Sometimes the most innocent question inspires the greatest effort in mathematics. Christian Goldbach (1690–1764) asked just such a question in 1742. Goldbach was a German mathematician who became professor of mathematics in 1725 in St. Petersburg, Russia. Three years later he traveled to Moscow to tutor Tsar Peter II.
openaire +1 more source
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
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