On Sequences of Numbers not Divisible one by another (Q5758705)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3018147
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On Sequences of Numbers not Divisible one by another |
scientific article; zbMATH DE number 3018147 |
Statements
On Sequences of Numbers not Divisible one by another (English)
0 references
1935
0 references
sequences
0 references
multiplicative number theory
0 references
0.8631808161735535
0 references
0.8360255360603333
0 references
0.8323795199394226
0 references
0.8257871270179749
0 references
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.
0 references