Difference between revisions of "Modular arithmetic"
m (altered useful facts section) |
(links plurality) |
||
Line 23: | Line 23: | ||
=== Applications === | === Applications === | ||
− | Modular arithmetic is an extremely useful tool in mathematics competitions. It enables us to easily solve [[Linear diophantine | + | Modular arithmetic is an extremely useful tool in mathematics competitions. It enables us to easily solve [[Linear diophantine equation]]s, and it often helps with other [[Diophantine equation | Diophantine equations]] as well. |
Revision as of 18:25, 22 June 2006
Modular arithmetic a special type of arithmetic that involves only integers. If two integers leave the same remainder when they are divided by some positive integer , we say that and are congruent modulo or .
Contents
[hide]Introductory
Useful Facts
Consider four integers and a positive integer such that and . In modular arithmetic, the following identities hold:
- Addition: .
- Substraction: .
- Multiplication: .
- Division: , where is a positive integer that divides and .
- Exponentiation: where is a positive integer.
Examples
Applications
Modular arithmetic is an extremely useful tool in mathematics competitions. It enables us to easily solve Linear diophantine equations, and it often helps with other Diophantine equations as well.