zbMATH — the first resource for mathematics

Maximal sets of integers with distinct divisors. (English) Zbl 0886.11002
Electron. J. Comb. 2, Research paper R22, 5 p. (1995); printed version J. Comb. 2, 339-343 (1995).
Summary: A set of positive integers is said to have the distinct divisor property if there is an injective map that sends every integer in the set to one of its proper divisors. P. Erdős and C. Pomerance [Util. Math. 24, 45-65 (1983; Zbl 0525.10023)] showed that for every \(c>1\), a largest subset of \([N,cN]\) with the distinct divisor property has cardinality \(\sim\delta(c)N\), for some constant \(\delta(c)>0\). They conjectured that \(\delta(c)\sim c/2\) as \(c\to\infty\). We prove their conjecture. In fact we show that there exist positive absolute constants \(D_1\), \(D_2\) such that \[ D_1\leq c^\beta(c/2- \delta(c))\leq D_2, \] where \(\beta=\log 2/\log(3/2)\).
11A05 Multiplicative structure; Euclidean algorithm; greatest common divisors
Full Text: EMIS EuDML