Hostname: page-component-7b7567c8c-z4zkx Total loading time: 0 Render date: 2026-11-17T23:20:22.790Z Has data issue: false hasContentIssue false

Covering Classes of Residues

Published online by Cambridge University Press:  20 November 2018

James H. Jordan*
Affiliation:
Washington State University, Pullman, Wash.
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

A set of ordered pairs of integers {(ai, mi)} is said to cover the integers if each integer x satisfies the congruence x ≡ ai (mod mi ) for some i. We may assume that the mi are positive. Trivially {(0, 1)} covers, as does {(0, m), (1, m), (2, m), … , (m — 1, m)}. In order to arrive at some non-trivial problems concerning covers, the following definition is given: A finite set of ordered pairs of integers with mi > 1 andmi ≠ mj if i ≠ j, is called a covering class of residues if every integer x satisfies the congruence x ≡ ai (mod mi) for some i.

Information

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1967