In 1954 Lorentz and Erdo s showed that there are very thin sets of positive integers complementary to the set of primes. In particular, there is an A N with (ii) every n n 0 can be written as n=a+ p, a # A, p prime. Erdo s conjectured that the bound (i) could be sharpened to o(ln 2 x) or even O(ln
✦ LIBER ✦
Partition Problems in Additive Number Theory
✍ Scribed by Béla Bollobás; Guoping Jin
- Publisher
- Elsevier Science
- Year
- 1996
- Tongue
- English
- Weight
- 866 KB
- Volume
- 56
- Category
- Article
- ISSN
- 0022-314X
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
On a Problem of Erdös in Additive Number
✍
Dieter Wolke
📂
Article
📅
1996
🏛
Elsevier Science
🌐
English
⚖ 263 KB
Minimal bases and maximal nonbases in ad
✍
Melvyn B. Nathanson
📂
Article
📅
1974
🏛
Elsevier Science
🌐
English
⚖ 490 KB
Randomized methods for the number partit
✍
Michael F. Argüello; Thomas A. Feo; Olivier Goldschmidt
📂
Article
📅
1996
🏛
Elsevier Science
🌐
English
⚖ 610 KB
The Proof of a Conjecture of Additive Nu
✍
Alexandru Gica
📂
Article
📅
2002
🏛
Elsevier Science
🌐
English
⚖ 94 KB
The aim of this paper is to show that for any n ¥ N, n > 3, there exist a, b ¥ N\* such that n=a+b, the ''lengths'' of a and b having the same parity (see the text for the definition of the ''length'' of a natural number). Also we will show that for any n ¥ N, n > 2, n ] 5, 10, there exist a, b ¥ N\
On the fundamental metric theorems of ad
✍
Robert D Stalley
📂
Article
📅
1970
🏛
Elsevier Science
🌐
English
⚖ 309 KB
On a contribution of Freiman to additive
✍
Peter C. Fishburn
📂
Article
📅
1990
🏛
Elsevier Science
🌐
English
⚖ 436 KB