On Sequences of Numbers not Divisible one by another
The author proves that if \(a_1, a_2, \dots\) is a sequence of positive integers, no one of which divides any other, then \[ \sum_{m\leq x} \frac1{a_i}= O\left(\frac{\log y}{\sqrt{\log\log x}}\right), \tag{1} \] showing that the lower density of the sequence \(a_i\) is zero. If \(m = q_1a_{i_1} = q_2a_{i_2} = \dots = q_{A(m)} a_{i_{A(m)}}\) are all the representations of \(m\) as \(qa_i\) where \(q\) is quadratfrei, then no one \(q\) divides any other \(q\) and so by a theorem of \textit{E. Sperner} [Math. Z. 27, 544--548 (1928; JFM 54.0090.06)] \[ A(m)\leq\binom{\nu(m)}{[\tfrac12\nu(m)]} \] where \(\nu(m)\) is the number of different prime factors of \(m\). (1) is deduced by summing \(A(m)\) from 1 to \(x\). A result of the same type as (1) has been proved by \textit{P. Erdős} (see the preceding review Zbl 0012.05202), but neither result implies the other.
- scientific article; zbMATH DE number 2143742 (Why is no real title available?)
- On a theorem of Behrend
- On the divisibility properties of integers (I)
- scientific article; zbMATH DE number 3255835 (Why is no real title available?)
- On the Divisibility Properties of Sequences of Integers
- scientific article; zbMATH DE number 3394264 (Why is no real title available?)
- Felix Adalbert Behrend
- Note on Sequences of Integers No One of Which is Divisible By Any Other
- scientific article; zbMATH DE number 3031694 (Why is no real title available?)
- On the density of some sequences of integers
- A proof of the Erdős primitive set conjecture
This page was built for publication: On Sequences of Numbers not Divisible one by another
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5758705)
