Discrete Math 08

Integers
Today’s
Menu:
Modular
Arithmetic
 Integers can add, subtract and multiply
into other integers
• But not always for division (some division yields
floating point numbers)

Some basic Other concept that we might often see is

modulo or modulus

concepts: Two integers can also generate two other

numbers: GCD and LCM
• From this GCD, we can also generate some sort of
linear combination
• Two integers are relatively prime when the GCD
among them is 1
 Basically how we produce GCD
out of two integers

Euclidean This involves a lot of modulos

Algorithm
We also have the crazier concept
of Extended Euclidean Algorithm
• See the boards for the step-by-step
 When dealing with integers,
we need this thing a lot,
especially Cryptography
Modular
Arithmetic In this scenario, our result is
constrained to a set from 0
to some set integers
 The range of operation is nominally the same
as ordinary math, but not so much of division
• Instead, we have inverse multiplicative over certain
modulus

In Modular There’s also this one thing called “congruent”

over modulus

Arithmetic Linear Congruence

Chinese Remainder Problem

 You can make a set of unique output if it
were over prime modulus

Generalization This thing is called “Field”

of Modular
Arithmetic A young French called Evariste Galois
expanded by suggesting certain number
types
• In his work (Galois Field), you can have either prime or
prime to the power of positive integer with a caveat