Transcription of Congruences and Modular Arithmetic
{{id}} {{{paragraph}}}
Example: bankruptcy
Congruences and Modular Arithmetic
Congruences and Modular ArithmeticRyan C. DailedaTrinity UniversityNumber TheoryDailedaCongruencesIntroductionModu lar Arithmetic is the Arithmetic of remainders. The somewhat surprising fact is that Modular Arithmetic obeysmost of the same laws that ordinary Arithmetic explains, for instance, homework exercise on theassociativity of will later see that because of this the set of equivalence classesunder congruence moduloncan be given the structure of Nanda,b Z. We say thata is congruent to b modulon, denoteda b(modn), providedn|a have: 7 22 (mod 5), 4 3 (mod 7), 19 119(mod 100), 37 1 (mod 4).
most of the same laws that ordinary arithmetic does. This explains, for instance, homework exercise 1.1.4 on the associativity of remainders. We will later see that because of this the set of equivalence classes under congruence modulo n can be given the structure of …
Loading..
Tags:
Information
Domain:
Source:
Link to this page:
Please notify us if you found a problem with this document: