Skip to main content

Congruences

  • Chapter
  • 1855 Accesses

Part of the book series: Undergraduate Texts in Mathematics ((UTM))

Abstract

The exercises in Section 1.2 were concerned with divisibility properties. In many cases rules were studied for a given divisor that gave a new number significantly smaller than the dividend, both having the same remainder upon division by the divisor (e.g., for divisibility by 2, 3, 4, 5, 8, 9, 10, and 11). In general, this relation that two numbers have the same remainder upon division by a given divisor proves to be such a useful tool in number theory that Gauss introduced a special notation to represent it that quickly became part of almost every mathematician’s working vocabulary. Taking the names from Latin, we call two such numbers congruent, and their divisor the modulus.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   84.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. For the origins of these types of questions, see P. Erdős: Summa Brasiliensis Math. II (1950), pp. 113–123.

    Google Scholar 

  2. P. Erdős, E. Szemerédi: Acta Arithmetica 15 (1968), pp. 85–90.

    MathSciNet  Google Scholar 

  3. See the article by P. Erdős referred to in footnote 3, and also S. L. G. Choi: Mathematics of Computation 25 (1971) pp. 885–895.

    Article  MathSciNet  MATH  Google Scholar 

  4. Lifsic’s proof appears as the solution to Problem 143, p. 43 and pp. 159–161 in N. B. Vasil’ev, A. A. Egorov: Zadachi vsesoyuznikh matematicheskikh Olimpiad (Problems of the All-Soviet-Union Mathematical Olympiads), Nauka, Moscow, 1988 (in Russian).

    Google Scholar 

  5. For a proof of Dirichlet’s theorem we refer the reader to H. Rademacher: Lectures on Elementary Number Theory, Blaisdell Publ. Co., New York 1964. Cf. Chapter 14, pp. 121–136.

    MATH  Google Scholar 

  6. Remark of I. Z. Ruzsa, personal communication.

    Google Scholar 

  7. D. Burgess: Mathematika 4 (1957), pp. 106–112.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer Science+Business Media New York

About this chapter

Cite this chapter

Erdős, P., Surányi, J. (2003). Congruences. In: Topics in the Theory of Numbers. Undergraduate Texts in Mathematics. Springer, New York, NY. https://doi.org/10.1007/978-1-4613-0015-1_2

Download citation

  • DOI: https://doi.org/10.1007/978-1-4613-0015-1_2

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-1-4612-6545-0

  • Online ISBN: 978-1-4613-0015-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics