Abstract
Let m be a natural number. If a — b is a multiple of m, then we say that a and b are congruent mod m, and we write a ≡ b (mod m). If a, b are not congruent mod m, then we write a ≢ b (mod m).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1982 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Keng, H.L. (1982). Congruences. In: Introduction to Number Theory. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-68130-1_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-68130-1_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-68132-5
Online ISBN: 978-3-642-68130-1
eBook Packages: Springer Book Archive