On non-intersecting arithmetic progressions
Tom 157 / 2013
Acta Arithmetica 157 (2013), 381-392
MSC: Primary 11B25; Secondary 05D05.
DOI: 10.4064/aa157-4-5
Streszczenie
We improve known bounds for the maximum number of pairwise disjoint arithmetic progressions using distinct moduli less than $x$. We close the gap between upper and lower bounds even further under the assumption of a conjecture from combinatorics about $\varDelta $-systems (also known as sunflowers).
