Modular Arithmetic: Introduction to Congruences & Interesting Applications

  • MHB
  • Thread starter matqkks
  • Start date
  • Tags
    Arithmetic
In summary, congruences in number theory can be introduced by using modular arithmetic, which allows for operations on finite systems. This concept has many interesting applications and can be used to solve problems involving large numbers by breaking them down into smaller, more manageable pieces. Overall, mathematics is based on the concepts of the line and the circle, each with many stories and lessons to teach us.
  • #1
matqkks
285
5
What the best way to introduce congruences in a number theory course? I am looking for something which will have an impact. What are the really interesting applications of congruent mathematics?
 
Mathematics news on Phys.org
  • #2
matqkks said:
What the best way to introduce congruences in a number theory course? I am looking for something which will have an impact. What are the really interesting applications of congruent mathematics?
Ask your students this: If it rains at midnight, what is the probability that it will be sunny in 72 hours?
 
  • #3
Numbers (and by this I mean positive integers), as anyone ought to know, can be really big. Large numbers are quite time-consuming for us poor humans to deal with.

Often, however, we want to know just some PROPERTY of a number, like whether or not it is even or odd.

Well, it turns out that there is an arithmetic for that, and it works in much the same way as regular arithmetic.

In fact, we can STILL do arithmetic on a number of finite systems, by "looping" the number line (the integers embedded in the reals) around to 0, at some given integer n. This changes the "linear" aspect of arithmetical operations to a cyclical one. And everything still works (well, almost everything...division is problematic if n is not prime...for pretty much the same reason as we don't allow division by 0).

For example, if we are "counting by 6's", the fact that 6 = 2*3 suggests we should "count by 3's" and "count by 2's" and compare the results. And indeed, this works (this is a simplified explanation of the basis for the Chinese Remainder Theorem)!

Of course, what we are actually doing is taking an infinite cyclic integral domain, and forming the cyclic quotient ring, modulo a principal ideal. But that sounds so technical...and obscures the simple underlying idea: we tame infinity by chopping it up into finite bits.

And the payoff is: facts involving very BIG numbers can be deduced from facts involving much SMALLER numbers, and everybody wins!

(Evgeny's observation is pertinent: the "infinite line of time" can be tamed by use of a clock, which repeats itself every so often...the usefulness of this has been known from antiquity...the Babylonians took this idea and ran with it, basing their number system on "highly divisible numbers", forming the basis of our present calender, radial measurements, and time-keeping system...ever wonder where all those 12's, 30's, 60's and 360's come from?).

Mathematics is in many ways is the story of two simple concepts: the line and the circle. Each has many stories to tell, and secrets to teach us.
 
  • #4
Thanks for this detailed reply. It is exactly what I was looking for.
 
  • #5
Evgeny.Makarov said:
Ask your students this: If it rains at midnight, what is the probability that it will be sunny in 72 hours?
Cute, but "in 72 hours" can reasonably be interpreted as "72 hours from now". Better wording "If it rains at midnight, what is the probability it will be sunny 72 hour later?
 

What is modular arithmetic?

Modular arithmetic is a type of arithmetic that deals with integers and their remainders when divided by a fixed number called the modulus. It is also known as clock arithmetic because it is often used to solve problems involving time and periodic events.

What are congruences?

Congruences are mathematical statements that describe the relationship between two numbers in modular arithmetic. They are written as a ≡ b (mod m), which means that a and b have the same remainder when divided by m.

What are some practical applications of modular arithmetic?

Modular arithmetic has many real-world applications, such as in cryptography, computer science, and music theory. It is also used in calculating the day of the week, determining leap years, and solving problems related to repeating patterns or cycles.

What are the properties of modular arithmetic?

Modular arithmetic has several properties that make it useful for solving problems. These include the commutative, associative, and distributive properties, as well as the cancellation property and the Chinese Remainder Theorem.

How is modular arithmetic different from regular arithmetic?

The main difference between modular arithmetic and regular arithmetic is that in modular arithmetic, the numbers "wrap around" when they reach the modulus. This means that the result of any operation will always be a number between 0 and m-1, where m is the modulus. In regular arithmetic, there are no boundaries for the numbers, and they can continue to increase or decrease infinitely.

Similar threads

Replies
5
Views
2K
Replies
1
Views
1K
  • General Math
Replies
2
Views
1K
Replies
1
Views
1K
  • General Math
Replies
2
Views
857
Replies
7
Views
569
  • General Math
Replies
4
Views
2K
Replies
3
Views
1K
Replies
2
Views
2K
Back
Top