Abstract
In this short note we give a simple proof of a 1962 conjecture of Erdős, first proved in 1969 by Crittenden and Vanden Eynden, and note two corollaries.
Similar content being viewed by others
References
R. B. Crittenden and C. L. Vanden Eynden, A proof of a conjecture of Erdős, Bull. Amer. Math. Soc., 75 (1969), 1326–1329
R. B. Crittenden and C. L. Vanden Eynden, Any \(n\) arithmetic progressions covering the first \(2^n\) integers cover all integers, Proc. Amer. Math. Soc., 24 (1970), 475–481
Erdős, P.: On integers of the form \(2^k + p\) and some related problems. Summa Brasil. Math. 2, 113–123 (1950)
P. Erdős, Remarks on number theory. IV. Extremal problems in number theory. I, Mat. Lapok, 13 (1962), 228–255 (in Hungarian)
P. Erdős, Extremal problems in number theory, in: Proc. Sympos. Pure Math., Vol. VIII, Amer. Math. Soc. (Providence, RI, 1965), pp. 181–189
P. Erdős, Remarks on number theory. V. Extremal problems in number theory. II, Mat. Lapok, 17 (1966), 135–155 (in Hungarian)
Filaseta, M., Ford, K., Konyagin, S., Pomerance, C., Yu, G.: Sieving by large integers and covering systems of congruences. J. Amer. Math. Soc. 20, 495–517 (2007)
Hough, R.: Solution of the minimum modulus problem for covering systems. Ann. Math. 181, 361–382 (2015)
Stein, S.K.: Unions of arithmetic sequences. Math. Ann. 134, 289–294 (1958)
Author information
Authors and Affiliations
Corresponding author
Additional information
The first two authors were partially supported by NSF grant DMS 1600742.
The third author was partially supported by CNPq (Proc. 303275/2013-8) and FAPERJ (Proc. 201.598/2014).
The fifth author was supported by a Trinity Hall Research Studentship.
Rights and permissions
About this article
Cite this article
Balister, P., Bollobás, B., Morris, R. et al. Covering intervals with arithmetic progressions. Acta Math. Hungar. 161, 197–200 (2020). https://doi.org/10.1007/s10474-019-00980-z
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10474-019-00980-z