On the Counting Function of Primitive Sets of Integers
✍ Scribed by Rudolf Ahlswede; Levon H Khachatrian; András Sárközy
- Publisher
- Elsevier Science
- Year
- 1999
- Tongue
- English
- Weight
- 131 KB
- Volume
- 79
- Category
- Article
- ISSN
- 0022-314X
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
In this paper we give a new method for constructing sets of integers having equal th power sums. Using the method, some new results are derived concerning the Tarry-Escott Problem. i' 1995 Academic Press. Inc.
In this paper, we investigate representations of sets of integers as subset sums of other sets of minimal size, achieving results on the nature of the representing set as well as providing several reformulations of the problem. We apply one of these reformulations to prove a conjecture and extend a
A set tiles the integers if and only if the integers can be written as a disjoint union of translates of that set. We consider the problem of finding necessary and sufficient conditions for a finite set to tile the integers. For sets of prime power Ž . size, it was solved by D. Newman 1977, J. Numbe
A set A [1, ..., N] is of the type B 2 if all sums a+b, with a b, a, b # A, are distinct. It is well known that the largest such set is of size asymptotic to N 1Â2 . For a B 2 set A of this size we show that, under mild assumptions on the size of the modulus m and on the difference N 1Â2 &| A | (the