On non-intersecting arithmetic progressions

DOI10.4064/AA110-3-3MaRDI QIDQ4429658zbMATH OpenOpenAlexFDO

Authors Ernest S. Jun. Croot

Publication date 28 September 2003

Published in Acta Arithmetica (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/math/0208236

zbMATH Keywords

arithmetic progressiondisjoint covering

Mathematics Subject Classification ID

Arithmetic progressions (11B25)

Abstract: We prove that if one has k non-intersecting arithmetic progressions of integers, with common differences 2 <= q_1,...,q_k <= x, then k < x exp((-1/6 + o(1)) sqrt(log x loglog x)). This improves a result of Szemeredi and Erdos.

Review text

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.

Recommendations

• On non-intersecting arithmetic progressions
• On disjoint arithmetic progressions
• Integer Sets Containing No Arithmetic Progressions
• Répartition Statistique Des Entiers Sans Grand Facteur Premier Dans Les Progressions Arithmétiques
• Maximal collections of intersecting arithmetic progressions

Cited in

(5)

• Longest arithmetic progressions in reduced residue systems
• Maximal collections of intersecting arithmetic progressions
• On non-intersecting arithmetic progressions
• On disjoint arithmetic progressions
• Integer sequences without singleton intersection

This page was built for publication: On non-intersecting arithmetic progressions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4429658)