G E D 0 1 03 M AT H IN T H E M OD E R N WOR L D

Nikki Blas
MODULAR ARITHMETIC
THE SNEAKY THING ABOUT MODULAR
ARITHMETIC IS WE’VE ALREADY BEEN USING
IT FOR KEEPING TIME — SOMETIMES
CALLED “CLOCK ARITHMETIC”

CLOCK ARITHMETIC
DID NOT PASS 12 O’CLOCK HAVE PASSED 12 O’CLOCK
Determine the time 8 hours Determine the time 8 hours
after 2 o’clock after 9 o’clock

8 + 2 = 10 8 + 9 = 17

10 o’clock 5 o’clock

CLOCK ARITHMETIC
ADDITION ON 12-HOUR CLOCK SUBTRACTION ON 12-HOUR CLOCK
If the time now is 10 o’clock, then 7 hours
8 ⊕ 2 = 10 ago the time was 3 o’clock.

8⊕9=5 10 ⊝ 7 = 3
If the time now is 10 o’clock,
then 7 hours ago the time was 3 o’clock
If the time now is 3 o’clock, then 7 hours
ago it was 8 o’clock.

3⊝7=8

CLOCK ARITHMETIC
CHECK YOUR PROGRESS: EVALUATE EACH OF THE FOLLOWING USING
A 12-HOUR CLOCK.
a. 6 ⊕ 10 =4
b. 5 ⊕ 9 =2
c. 7 ⊝ 11 =8
d. 5 ⊝ 10 =7

CLOCK ARITHMETIC
MODULAR ARITHMETIC
• is a special type of arithmetic that involves only integer
• When we divide two integers we will have an equation
that looks like the following:
𝐴
= 𝑄 remainder 𝑅
𝐵 Sometimes, we are only interested in what
A is the dividend the remainder is when we divide A by B.
B is the divisor
Q is the quotient For these cases there is an operator called the
R is the remainder modulo operator (abbreviated as mod). Using the
same A, B, Q, and R, we would have: A mod B = R.
Arithmetic modulo n, where n is a natural number, uses a variation
of the standard rules of arithmetic we have used earlier. Perform
the arithmetic operation and then divide by the modulus. The
answer is the remainder. Thus the result of an arithmetic operation
mod n is always a whole number less than n.

ARITHMETIC OPERATIONS
MODULO N
RECALL: USING LONG DIVISION TO
FIND THE REMAINDER
46 Equation form:
Example: 3 140 140
- 12 = 46 remainder 2
3
20
- 18
2

The remainder when 140 is divided by 3 is 2.

140 𝑚𝑜𝑑 3 = 2
Example:

Evaluate 65 mod 8 =1

ARITHMETIC OPERATIONS
MODULO N
Example:

Evaluate 30 mod 5 =0

ARITHMETIC OPERATIONS
MODULO N
Example:

Evaluate (53 + 72) mod 3 = 2

ARITHMETIC OPERATIONS
MODULO N
Example:

Evaluate (33 − 15) mod 7 = 4

ARITHMETIC OPERATIONS
MODULO N
Example:

Evaluate (21 − 43) mod 8 = 2

ARITHMETIC OPERATIONS
MODULO N
Example:

Evaluate (12 · 41) mod 17 = 16

ARITHMETIC OPERATIONS
MODULO N
 ADDITIVE AND MULTIPLICATIVE
INVERSES IN MODULAR ARITHMETIC

READING ASSIGNMENT
 END
NEXT MEETING:
CRYPTOLOGY
 Evaluate the following:
1. (10+43) mod 8
2. (6-21) mod 7
3. 30 mod 10
4. 9⊕9
5. 10 ⊝ 12

15 MINUTE ACTIVITY – ¼ SHEET OF

PAPER - INDIVIDUAL
 ANSWERS!

15 MINUTE ACTIVITY – ¼ SHEET OF

PAPER - INDIVIDUAL
 Evaluate the following:
1. (10+43) mod 8 = 5
2. (6-21) mod 7 = 6
3. 30 mod 10 = 0
4. 9⊕9=6
5. 7 ⊝ 33 = 10

15 MINUTE ACTIVITY – ¼ SHEET OF

PAPER - INDIVIDUAL
UPLOADED IN CANVAS: APPLICATION OF
MODULAR ARITHMETIC
TO BE SUBMITTED NEXT MEETING (10 MINUTES
BEFORE THE END OF CLASS, THAT MEANS, YOU CAN
WORK ON THESE PROBLEMS DURING OUR CLASS
TIME NEXT MEETING)
USE YELLOW PAD PAPER FOR YOUR COMPLETE
SOLUTION.
Applications
GROUP TASK / 2 MEMBERS of Modular
Arithmetic
Task: Applications of Modular Arithmetic
I. Determine whether the given number is a valid ISBN.
1) 978-0-281-44268-5
2) 978-0-143-03943-3
II. Determine the correct check digit for the ISBN of the book
Facebook for Dummies by Leah Pearlman and Carolyn Abraham;
978-0-470-87804-?
III. Determine the correct check digit for the UPC of Monopoly;
7-14043-01126-?
IV. Determine whether the given credit card number is a valid number
1) 4417-5486-1785-6411
2) 5591-4912-7644-1105