You are here

A Note on Disjoint Covering Systems—Variations on a 2002 AIME Problem

by John W. Hoffman (Kent State University) and W. Ryan Livingston (University of Georgia) and Jared Ruiz (University of Nebraska)

This article originally appeared in:
Mathematics Magazine
June, 2011

Subject classification(s): Congruences | Number Theory | Algebra and Number Theory
Applicable Course(s): 4.3 Number Theory

A covering system is a system of \(k\) arithmetic progressions whose union includes all integers. This paper presents upper bounds on the number of consecutive integers which need to be checked to determine whether a covering system is a disjoint covering system.

A pdf copy of the article can be viewed by clicking below. Since the copy is a faithful reproduction of the actual journal pages, the article may not begin at the top of the first page.

To open this file please click here.

These pdf files are furnished by JSTOR.

Classroom Capsules would not be possible without the contribution of JSTOR.

JSTOR provides online access to pdf copies of 512 journals, including all three print journals of the Mathematical Association of America: The American Mathematical Monthly, College Mathematics Journal, and Mathematics Magazine. We are grateful for JSTOR's cooperation in providing the pdf pages that we are using for Classroom Capsules.

Capsule Course Topic(s):
Number Theory | Congruences, Covering Systems
Average: 3.5 (68 votes)

Dummy View - NOT TO BE DELETED