Save
MATHM
MATHM | Modular Arithmetic
Save
Share
Learn
Content
Leaderboard
Share
Learn
Created by
Pj ౨ৎ
Visit profile
Cards (9)
Is a system of arithmetic for integers, which considers the remainder.
Modular
Arithmetic
Let a and b are integers and m is a natural counting number.
Congruence
Formula for Congruence
b
-
a
(
modn
)
To determine the least residue is to simply get the remainder when b is divided by m.
Least
Residue
Formula for Least Residue
b
(
modm
)
Modulo addition is defined as (
a
+
b
)
mod
m
Modulo subtraction is defined as (
a-b
)
mod
m
Modulo multiplication is defined as (
a
*
b
)
mod
m
Modulo division is defined as (
a/b
)
mod
m