Type: Article
Publication Date: 2013-01-01
Citations: 0
DOI: https://doi.org/10.4064/aa157-4-5
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 $\v
Action | Title | Year | Authors |
---|