On non-intersecting arithmetic progressions (Q4429658)

Let \(f(x)\) denote the maximum value for the number \(k\) of disjoint (in pairs) arithmetic progression with moduli \(\leq x\) and \(\geq2\). Let \(L(c,x)=\exp(c\sqrt{\log x\log\log x})\). The author proves that \[ x/L(\sqrt{2}+o(1),x)<f(x)<x/L(1/6-o(1),x). \] Actually, the upper bound is a consequence of the main result of the paper showing if the moduli of a disjoint system of arithmetical progression are all square--free then \(k<x/L(\sqrt{2}-o(1),x)\). For the proof of the lower bound the ideas used for the previously proved estimates for \(f(x)\) [see \textit{P. Erdős} and \textit{E. Szemeredi}, ibid. 15, 85--90 (1968; Zbl 0186.07903)] are adapted.