Maximal sets of integers with distinct divisors
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. \textit{P. Erdős} and \textit{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)\).
- The maximum number of subset divisors of a given size
- scientific article; zbMATH DE number 5130028 (Why is no real title available?)
- scientific article; zbMATH DE number 3561431 (Why is no real title available?)
- Maximal sets of numbers not containing k+1 pairwise coprime integers
- Maximal runs of strictly composite integers
This page was built for publication: Maximal sets of integers with distinct divisors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1378487)