GROUP 6 PPT - MODULE 4 - 20241029 - 083830 - 0000 - Compressed

GROUP 6
MEMBERS
Engr. Ryza Nicole A. Aycardo

Engr. Kyla Cleofe
Engr. Catherine Mae B. Gunacao
Engr. Jared Miguel L. Puno
Engr. Ray Ann R. Toriana
Mathematical System
MODUL E 4
Intended Learning Outcomes
1. Define modular arithmetic.
2. Compare a clock arithmetic into modular
arithmetic
3. Explain comprehensively modular arithmetic.
4. Name different properties of modular arithmetic.
5. Tell whether the congruence is a congruence or
not.
6. Solve and perform operations on clock and in
modular arithmetic.
7. Construct a clock and a modulo n addition table.
Lesson Modular
4.1 Arithmetic
1. Compare modular arithmetic into group theory.

2. Illustrate accurately the modular arithmetic and its
operation as well as operations on group theory.
3. Make use of modular arithmetic and group theory
to apply in a real situation.
Modular Arithmetic:
NUMBER REMAINDER
INTEGERS THEORY
PRIVACY THEOREM
Special type of Code and decode emphasized the

Study of whole
arithmetic which or encrypt and concept of
numbers and
only involves decrypt secret remainder
their properties.
integers. message for theorem when
privacy solving problems.
Modular Arithmetic is all about modulo (the
remainder when dividing)
When we divide a number by 12, the remainder

is always between 0 to 11.
8 r. 4 66 r. 8
100 800
12 96
12 792
4 8
DON'T GET CONFUSED! 12-11 and 0-11 are the same,
it's just that 0-11 hours are more convenient to use in
modular arithmetic because of remainders.
Determining time and day using modular arithmetic
• If we want to determine a time in the future or in the
past, It's necessary to consider whether we have passed
12 o'clock.
We have 2 operations or process to use:

Did not pass 12 o'clock Pass 12 o'clock
Division
Addition or Subtraction (Gettting the remainder)
Examples:
1. What is the time 8 hrs after 3 o'clock?
3+8= 11 o'clock
2. What is the time 5 hrs before 8 o'clock?
8-5= 3 o'clock
Examples:
1. If it's 11 o'clock and you have to finish your
homework in 18 hours, what hour will be at that
time?
1) 11+18= 29
2 r. 5
29
2) 12 24
5
= 5 o'clock
Try This!
1) If it is 12:00 now, what time is it in 18 hours?

1) 12+18= 30 1) 0+18= 18
2 r. 6 1 r. 6
2) 12 30
24
2) 12 18
12
6 6
= 6 o'clock = 6 o'clock
Determining the day of the week using modular arithmetic
Example: Let us say today is Wednesday. What would be

the day 11 days after Wednesday?
1) 2+11= 13
1 r. 6
13
2) 7 7
6
=Sunday
Assigned number for each day of the week

Try This!
Example: Let us say today is Saturday. What would be day
15 days after Saturday?
1) 5+15= 20
2 r. 6
20
2) 7 14
6
=Sunday
Assigned number for each day of the week
Modular Arithmetic
•Two integers a and b are said to be congruent modulo n, where
n € N, if 𝑎−𝑏/𝑛 is an integer.
Two integers ( a ) and ( b ) are said to be congruent
a-b modulo ( n ) if their difference ( a - b ) is divisible by (
n n ). In other words, when you subtract ( a ) from ( b ),
the result is a multiple of ( n ).
Illustration: a = 17 b = 5 n = 6
a-b 17-5 12
n
= = = 2 17 ≡ 5 mod 6
6 6
•In this case, we write a ≡ b (mod n). The number n is called the
modulus. The statement a ≡ b (mod n) is called a congruence.
•So, looking back in our clock arithmetic, instead of 13 = 1, in
modular arithmetic we write 13 ≡ 1 (mod 12) and read it “13 is
congruent to 1 modulo 12” or, to abbreviate, “13 is 1 modulo 12”.
If n divides (a-b), (a-b) is a multiple of n. Therefore it's a

congruence. This could be stated in this form: n | a – b
Examples:
1. 22 ≡ 14 mod 8
8 | 22-14 22-14 is a multiple of 8; since 22-14= (8)(1)
2. 26 ≡ 10 mod 8
8 | 26-10 26-10 is a multiple of 8; since 26-10= 16 (8)(2)
Modulo Addition Table
Based on the given table 10 + 7 ≡ 5 or we could say that 17 ≡ 5 mod 12.

WRITING A CONGRUENCE
Write the statement 3 | 6 in the form a ≡ b (mod n).
We need to find two numbers (a) and (b)

3 | (18-12)= 6
that is a multiple of 3 and their difference is
6.
Here we have: a= 18 b= 12 n= 3
Now that our a, b, and n are complete. We

18 ≡ 12 (mod 3) or
can now substitute it in the form a ≡ b
(mod n). 12 ≡ 18 (mod 3)
DETERMINING IF THE GIVEN CONGRUENCE
IS TRUE OR NOT
Is 53 ≡ 17 (mod 3)
a-b 53-17 36
n
= =
3
= 11 THIS IS A TRUE CONGRUENCE
3
Is 15 ≡ 4 (mod 6)
a-b 15-4 11
= = = 1.83 THIS IS NOT A TRUE CONGRUENCE
n 6 6
Is 7 ≡ 12 (mod 5)
a-b 7-12 5
n = = = 1 THIS IS A TRUE CONGRUENCE
5 5
Is 8 ≡ 15 (mod 4)
a-b 15-8 7
= = = 1.75 THIS IS NOT A TRUE CONGRUENCE
n 4 4
An alternative method to determine a true congruence
in a ≡ b(mod n), where a and b are whole numbers,
then when a and b is divided by n, they must have the
same remainder.
Example:
Let us say the given modulo is 53 ≡ 17 (mod 3).
Theorem: Properties on congruence
Let n > 0 be fixed and a, b, c and d are arbitrary integers.
Then,
a) a ≡ a(mod n)
b) if a ≡ b(mod n) then b ≡ a(mod n)
c) if a ≡ b(mod n) and b ≡ c(mod n), then a ≡ c(mod n)
d) if a ≡ b(mod n) and c ≡ d(mod n), then a + c = b + d (mod n)
and ac ≡ bd (mod n)
e) if a ≡ b(mod n), then a + c ≡ b + c (mod n) and ac ≡ bc
(mod n)
f) If a ≡ b (mod n), then ak ≡ bk (mod n)
Theorem: Properties in Congruence
a) a ≡ a (mod n) Reflexive
Reflexive property states that any number is equal or
congruent to itself. It’s always equals to 0.
6 ≡ 6 (mod 2)
Proof:
2 | 6-6
2|0=0
b) if a ≡ b(mod n) then b ≡ a(mod n) Symmetric

If a ≡ b (modn), then it holds true that b ≡ a (modn). If ( a-b) is
divisible by n. Then ( b-a ) is also divisible by n.
If 13 ≡ 10 (mod 3), then 10 ≡ 13 (mod 3)

Proof:
3 | 13-10 3 | 10-13
3|3=1 3 | -3 = -1
c) if a ≡ b (mod n) and b ≡ c (mod n), then a ≡ c (mod n) Transitive

This theorem states that we have 3 given numbers at the same time and
if a ≡ b; b ≡ c then a ≡ c.
If 2 ≡ 14(mod 3) and 14 ≡ 5(mod 3), then 2 ≡ 5(mod 3).
Proof:
3 | 2-14 3 | 14-5 3 | 2-5
3 | 12 = 4 3|9=3 3 | -3 = -1
d) if a ≡ b(mod n) and c ≡ d(mod n), then a + c = b + d (mod n) Addition
The addition property of congruence states that if two pairs of integers
are congruent modulo n, then their sums are also congruent modulo n.
Specifically if a+b (modn)=c+d(modn)
If 7 ≡ 19(mod 2) and 27 ≡ 11 (mod 2) then (7 + 27) ≡ (19 + 11) (mod 2)
Proof:
2 | 7-19 2 | 27-11 7+27= 34 19+11= 30
2 | -12 = -6 2 | 16 =8 2| 34 = 17 2 | 30= 15
e) Assume that a ≡ b(mod n). We know that c ≡ c (mod n). Then, ac ≡ bc (mod n)
Multiplication
The multiplication property of congruence modulo states that if two
integers (a) and (b) are congruent to two other integers (c) and (d)
respectively, modulo (n), then their products are also congruent modulo
(n).
Given that 31 ≡ 13 (mod 2). Let c = 3, then (31•3) ≡ (13•3)(mod 2)
Proof:
2| 31-13 31•3= 93 13•3 = 39
2 | 18 = 9 3 | 93= 31 3 | 39= 13
f). a ^ n + 1 ≡ b ^ n + 1 (mod n) where n + 1 = k. Hence, a^k ≡ b^k (mod n) Power

Power modulo, also known as modular exponentiation, is a way to find the
remainder when a number raised to a power is divided by another number.
Given that 3 ≡ 8 (mod 5) and k = 2, then 3² ≡ 8² (mod 3)

Proof: 3² = 9 8² = 64
1 r. 4 12 r. 4
5 | 8-3
9 64
5|5=1 5 5 5 60
4 4
Lesson Operations on
4.2 Modular Arithmetic
1. Name and explain the different operations on modular
arithmetic.
2. Perform and solve the operations on modulo n such as

addition, subtraction, multiplication, the additive and
multiplicative inverse.
3. Solve the congruence equation.

Modular arithmetic is a system of arithmetic for integers
where numbers wrap around upon reaching a certain
value—the modulus. In modular arithmetic, operations like
addition, subtraction, and multiplication behave similarly to
normal arithmetic, but the results are taken modulo a
certain number n.
a≡b mod n
In 29≡8 mod 3 , we could verify that its congruence is true

since both 29 and 8 have remainder 2 when divided by 3
which is the modulus.
14≡2mod3 because the remainder of 14÷3 is 2.
9≡0mod because the remainder of 9÷3 is 0.
2≡2mod 3 because the remainder of 2÷3 is 2.
Addition
Modulo n
(a+b) mod n
In modular arithmetic, adding the modulus to a number does
not change the equivalent value of the number. For instance;
13 ≡ 6 (mod 7)
20 ≡ 6 (mod 7)
27 ≡ 6 (mod 7)
13 ≡ 6 (mod 7)
20 ≡ 6 (mod 7)
27 ≡ 6 (mod 7)
1. (46 + 53)mod 8 =
13 ≡ 6 (mod 7)
20 ≡ 6 (mod 7)
27 ≡ 6 (mod 7)
1. (46 + 53)mod 8 = 3
13 ≡ 6 (mod 7)
20 ≡ 6 (mod 7)
27 ≡ 6 (mod 7)
1. (46 + 53)mod 8 = 3
2. (43 + 29)mod 10 =
13 ≡ 6 (mod 7)
20 ≡ 6 (mod 7)
27 ≡ 6 (mod 7)
1. (46 + 53)mod 8 = 3
2. (43 + 29)mod 10 = 2
Subtraction
Modulo n
(a−b) mod n
(33 – 16) mod 6
First, subtract 16 from 33:
33 - 16 = 17 (positive result).
Now, divide the difference by the modulus, which is 6:

17 ÷ 6 gives us 6 • 2 + 5, where the remainder is 5.
So, (33 – 16) mod 6 = 5.

(14 – 21) mod 5
We start by adding 5 to −7:

−7+5=−2
Since −2 is still negative, we add 5 again:

−2+5=3
Now we have 3, which is a positive number less than 5.
Thus, the solution to −7 mod 5 is:

−7 mod 5=3
Multiplication
Modulo n
(a×b) mod n
Like in addition and subtraction, let us evaluate given example
under multiplication modulo n to perform the operation
multiplication.
Evaluate (15•23) mod 11.
First, calculate the product of 15 and 23:

15⋅23=345
Now, divide 345 by 11:

345÷11=31 (quotient) remainder=4
The remainder when 345 is divided by 11 is 4, so:

(15⋅23) mod 11= 4
(16)(25) mod 18 =
(16)(25) mod 18 = 4
(16)(25) mod 18 = 4
Calculate the product of 16 and 25:

16⋅25 = 400
Now, divide 400 by 18:
400÷18 = 22 (quotient) 4 (remainder)
Thus, the result of (16⋅25) mod 18:

(16⋅25) mod 18 = 4
Additive and
Multiplicative
Inverses in Modular
Arithmetic
a+x ≡ 0 modn
a×x≡ 1 mod n
ADDITIVE INVERSES
Recall that if the sum of two numbers is zero (0),i.e.
a + (-a) = 0, then the numbers are additive inverses of each
other.
For instance, 5 + (-5) = 0. So 5 is the additive invers of -5

and -5 is the additive inverse of 5.
( 3 + __ ) = 0 mod 8.
( 3 + _5_ ) = 0 mod 8.
( 3 + _5_ ) = 0 mod 8
We need to find a number x such that: 3+x = 8
Now, in mod 8, the quation 3+x ≡ 0 (mod 8); means we are looking for x that
makes 3+x=8 or in mod 8, 0.
3+5 = 8
5+3 = 8
Find the additive inverse of 7 in mod 16 arithmetic.
Find the additive inverse of 7 in mod 16 arithmetic.
7+x ≡ 0 (mod 16)
7+9 = 16 ≡ 0 (mod 16)
MULTIPLICATIVE INVERSES
If the product of two number is 1, then the numbers are multiplicative inverses
of each other. This is one of the properties of real number, i.e.,
(𝑎) ( 1 /𝑎 ) = 1 .
The same concept applies to modular arithmetic (although the multiplicative
inverses will always be natural number).
Find the multiplicative inverse of 3 mod 7 (and 5 mod 7).

5⋅3 ≡ 1 (mod 7)
Look for x such that:

a⋅x ≡ 1 (mod n); where a =3 m=7
The equation is:

3⋅x≡1 (mod 7)
To verify: 5⋅3 ≡ 1 (mod 7)

Therefore,
The inverse of 3 mod 7 is 5.
The inverse of 5 mod 7 is 3.
SOLVING
CONGRUENCE
EQUATION
Solving a congruence equation means finding all whole numbers
values of the variable for which the congruence is true.
Example: Solve 3x + 5 ≡ 3 mod 4
Let's check each value of x.
Conclusion:
The values of x that satisfy the congruence equation 3x + 5 ≡ 3 mod 4
are x = 2 and x = 6.
Example: Solve 3x + 4 = 2x + 8 (mod 9)
Lesson Applications of
4.3 Modular Arithmetic
1. To apply the concept of modular arithmetic to determine the validity
of a certain serial number such the UPC, ISBN and the credit card.
2. To explain the validity and invalidity of the product code.
3. To differential cryptology to cryptography.
4. To make use of modular arithmetic to encrypt and decrypt the text.
5. To apply modular operations in making a modulo art.

MODULAR ARITHMETIC
It has important role in different industry and some of these industries are
banking and finance, information and technology, medicine and health, trade
and industry, and in education sector.
WHY MODULAR
ARITHMETIC IS SO
IMPORTANT?
MODULAR ARITHMETIC
ADDITION
FIND: MODULO 5
2+1=3(mod 5)=3 3+3=6(mod 5)=1
3+1=4(mod 5)=4 4+3=7(mod 5)=2

MODULAR ARITHMETIC
MULTIPLICATION
FIND: MODULO 5
2 x 1=2(mod 5)=2 3 x 3=9(mod 5)=4
2 x 2=4(mod 5)=4 0 x 0=0(mod 5)=0

A. International Standard Book Number (ISBN)
B. Universal Product Code (UPC) and Credit Card
C. Cryptology and Cryptography
D. Modulo Operation in Designing Modulo Art

A. International Standard Book Number
(ISBN)
A. INTERNATIONAL STANDARD BOOK NUMBER (ISBN)
One of the applications of modular arithmetic is on how to

check or how to determine whether the ISBN
(International Standard Book Number) is valid or not.
Every book that is catalogued in the Library of Congress
must have an ISBN. The ISBN consists of 13 digits and
this was created to help to ensure that orders for books
are filled accurately and that books are catalogued
correctly.
The first digits of an ISBN are 978 (or 979), followed by 9 digits
that are divided into three groups of various lengths. These
indicate the country or region,the publisher, and the title of
the book. The last digit (13th digit) is called a check digit.
Example:
The ISBN of Richard Aufmann’s book entitled “Mathematics in the
Modern World” published by Rex Bookstore in 2018 is:
978 – 971 – 23 – 9357 – 0

Is ISBN valid?
B. Universal Product Code (UPC) and
Credit Card
UNIVERSAL PRODUCT CODE (UPC) AND CREDIT CARD
Another coding scheme that is closely related to the ISBN is the

UPC (Universal Product Code). This number is placed on many
items and is particularly useful in grocery stores. A check-out
clerk passes the product by a scanner, which reads the number
from a bar code and records the price on the cash register. If
the price of an item changes for a promotional sale, the price is
updated in the computer, thereby relieving a clerk of having to
reprice each item. In addition to pricing items, the UPC gives
the store manager accurate information about inventory and
the buying habits of the store’s customers.
The UPC is a 12-digit number that satisfies a modular
equation that is similar to the one for ISBNs.
The use of UPC Formula is to check the validity of check

digit or the last digit of code.
FORMULA:
d12 = 10 – (3d1 + d2 + 3d3 + d4 + 3d5 + d6 + 3d7 + d8 +
3d9 + d10 + 3d11)mod 10.
If d12 = 10, then the check digit is 0.
NOTE: EVERY OTHER DIGIT OR ODD PLACES DIGIT MUST BE

MULTIPLIED BY 3.
LET’S TRY THIS!
The staple wire has a bar code of 9-02870-766290. Is the UPC number of this
product is a valid number?
Solution:
d12 = 10 – (3d1 + d2 + 3d3 + d4 + 3d5 + d6 + 3d7 + d8 + 3d9 + d10 + 3d11)mod 10
d12 = 10 – [3(9) + 0 + 3(2) + 8 + 3(7) + 0 + 3(7) + 6 + 3(6) + 2 + 3(9)]mod 10
d12 = 10 – (27 + 0 + 6 + 8 + 21 + 0 + 21 + 6 + 18 + 2 + 27)mod 10
d12 = 10 – (136)mod 10
LET’S TRY THIS!
The staple wire has a bar code of 9-02870-766290. Is the UPC number of this
product a valid number?
Solution:
d12 = 10 – (136)mod 10 Divide the given then get the remainder

=136/10=13 (6 remainder)
d12= 10- 6
d12= 4 0
Since the computed check digit is not the last digit in a given code, therefore the bar
code is not valid.
LET’S TRY THIS!
A certain product has a bar code 4-804888-9027-8. Is the product code valid?
LET’S TRY THIS!
Solution:
d12 = 10 – (3d1 + d2 + 3d3 + d4 + 3d5 + d6 + 3d7 + d8 + 3d9 + d10 + 3d11)mod 10
d12 = 10 – [3(4) + 8 + 3(0) + 4 + 3(8) + 8 + 3(8) + 9 + 3(0) + 2 + 3(7)]mod 10
d12 = 10 – (12 + 8 + 0 + 4 + 24 + 8 + 24 + 9 + 0 + 2 + 21)mod 10
d12 = 10 – (112)mod 10
LET’S TRY THIS!
Solution:
d12 = 10 – (112)mod 10 Divide the given then get the remainder

=112/10=11 (2 remainder)
d12= 10- 2
d12= 8 = 8
Since the computed check digit is the last digit in a given code, therefore the bar
code is valid.
The primary coding method is based on the Luhn Algorithm, which
uses mod 10 arithmetic. Credit card is usually or normally have 13
to 16 digits long. The first one to six digits are used to identify the
card issuer. The table below shows some of the identification
prefixes used by four popular card issuers. .
LUHN ALGORITHM
Checks whether a card number is input correctly by checking

both the number and value of digits entered. The final number is
used as a check to ensure that the card number is valid. This
simple calculation helps separate potentially valid numbers from
randomly generated numbers.
STEPS OF LUGH ALGORITHM:

1. Beginning with the next-to-last digit (the last digit is the
check digit) and reading from right to left.
2. Double every other digit (2a,b,2c,d,2e........q)
3. If a digit becomes a two digit number after being

doubled, treat the number as two individual digits.
4. Find the sum of the new list of digits. The final sum must
be congruent to 0 mod 10.
LET’S TRY THIS

LET’S TRY THIS
Determine whether 5234-8213-3711-0210 is a valid card number
5x2 2 3x2 4 8x2 2 1x2 3 3x2 7 1x2 1 0x2 2 1x2 0
=10 2 6 4 16 2 2 3 6 7 2 1 0 2 2 0
LET’S TRY THIS
Determine whether 5234-8213-3711-0210 is a valid card number
5x2 2 3x2 4 8x2 2 1x2 3 3x2 7 1x2 1 0x2 2 1x2 0
=10 2 6 4 16 2 2 3 6 7 2 1 0 2 2 0
=(1+0) + 2 + 6 + 4 + (1+6) + 2 + 2 + 3 + 6 + 7 + 2 + 1 + 0 + 2 + 2+ 0
=1+ 2 + 6 + 4 + 7 + 2 + 2 + 3 + 6 + 7 + 2 + 1 + 0 + 2 + 2+ 0
=47
Since 47 0 mod 10, this is not a valid card number.
C. Cryptology and Cryptography
C. CRYPTOLOGY AND CRYPTOGRAPHY
Another usage of modular arithmetic is
cryptography. But what is the difference between
cryptology and cryptography?
Cryptology Cryptograpy
cryptography is the
the study of codes art of writing and
solving them.
Try this out!
Try to decrypt the secret code of the riddles. In an
English alphabet, line up with wheels so that “a" lines
up with “R".
Riddle #1:
They come out at night without being called, and are lost in the
day without being stolen. What are they?
Answer: JKRI =
Riddle #2:
What has a face and two hands but no arms and legs?
Answer: TCFTB =
Riddle #3:
Why was the math book sad?
Answer: ZK YRU KFF DREP GIFSCVDJ =
R→A E→N
S→B F→O
T→C G→P Riddle #1:
U→D H→Q
V→E I →R They come out at night without
being called, and are lost in the
W→ F J→S
day without being stolen. What are
X→G K→T they?
Y→H L→U Answer: JKRI =
Z→I M→ V
A→J N→W
B→K O→X
C→L P→Y
D→M Q→Z
R→A E→N
S→B F→O Riddle #1:
T→C G→P
They come out at night without
U→D H→Q being called, and are lost in the
V→E I →R day without being stolen. What are
W→ F J→S they?
X→G
Y→H
K→T
L→U
Answer: JKRI =
STAR
Z→I M→ V
A→J N→W
J =S
B→K O→X K =T
C→L P→Y R =A
D→M Q→Z I =R
R→A E→N
S→B F→O
T→C G→P Riddle #2:
U→D H→Q
V→E I →R What has a face and two hands
but no arms and legs?
W→ F J→S
Answer: TCFTB =
X→G K→T
Y→H L→U
Z→I M→ V
A→J N→W
B→K O→X
C→L P→Y
D→M Q→Z
R→A E→N
S→B F→O Riddle #2:
T→C G→P
What has a face and two hands
U→D H→Q but no arms and legs?
V→E I →R Answer: TCFTB =
W→ F
X→G
J→S
K→T
Clock
Y→H L→U
Z→I
T=C
M→ V
A→J N→W C=L
B→K O→X F=O
C→L P→Y T=C
D→M Q→Z B=K
R→A E→N Riddle #3:

S→B F→O Why was the math book sad?
T→C G→P Answer:
U→D H→Q ZK YRU KFF DREP GIFSCVDJ =
V→E I →R
W→ F J→S
X→G K→T
Y→H L→U
Z→I M→ V
A→J N→W
B→K O→X
C→L P→Y
D→M Q→Z
R→A E→N Riddle #3:

S→B F→O Why was the math book sad?
T→C G→P Answer:
U→D H→Q ZK YRU KFF DREP GIFSCVDJ =
V→E I →R
It had too many problems
W→ F J→S
X→G K→T Z=I
Y→H L→U K=T
G=P
Z→I M→ V Y=H D=M I=R
F=O
A→J N→W R=A R=A
S=B
U=D E=N
B→K O→X P=Y C=L
C→L P→Y K=T V=E
D=M
D→M Q→Z F=O
F=O J=S
The encrypted word is called the ciphertext while
the decrypted word is called the plaintext
Plain text - a message before it is coded
Ciphertext- the message after it has been written in code
Encryption- The method of changing from plaintext to ciphertext

(encode)
Decryption- The method of changing from ciphertext to plaintext
(decode)
PLAINTEXT-CIPHERTEXT ( ENCRYPTION)
Formula:
c (p+m) mod 26
c=encrypted code
m=position/shifted position
p= no. corresponds to a letter in an Alphabet
n= 26(modulo)
PLAINTEXT-CIPHERTEXT( ENCRYPTION)
LET’S TRY THIS: c (p+m) mod 26
Convert the plaintext“LOVE” into its ciphertext if each letter was shifted in
22 positions (m = 22)
For: L: For O:
c ( 12+ 22) mod 26 c (15 + 22) mod 26
c 34mod 26 34/26=1(remainder 8) c 37mod 26
c 8=H c 11 = K
Convert the plaintext “LOVE” into its ciphertext if each letter was shifted in
22 positions (m = 22)?
FIND V: FIND E:
Convert the plaintext “LOVE” into its ciphertext if each letter was shifted in
FIND V: FIND E:
c ( 22+ 22) mod 26 c (5 + 22) mod 26
c 44mod 26 44/26=1(remainder 18) c 27mod 26
c 18 = R c 1= A
HKRA
CIPHERTEXT-PLAINTEXT ( BREAKING ENCRYPTION)
Formula:
p (c+n) mod 26
c=encrypted code
n= 26-m
Solving n:
n=26-m

LET’S TRY THIS: p (c+n) mod 26
Convert the ciphertext “HKRA” into its plaintext if each letter was shifted in
22 positions (m = 22)
Code: H: n = 26 – 22 = 4, Code: K: n = 26 – 22 = 4,
then p (8 + 4) mod 26 then p (11 + 4) mod 26
p 12mod 26 12/26=0( Remainder 12) p 15mod 26
p 12 = L p 15=0
FIND:R FIND:A
FIND:R FIND:A
Code: R: n = 26 – 22 = 4, Code: A: n = 26 – 22 = 4,
then p (18 + 4) mod 26 then p (1 + 4) mod 26
p 22mod 26 p 5mod 26
p 22 = V p 5=E
LOVE
PLAINTEXT-CIPHERTEXT ( ENCRYPTION BASED ON THE
CONGRUENCE)
Formula: NOTE: The ciphertext is the remainder of modulo
c (ap + m) mod 26
c=encrypted code
a= any no. that have no common factor with 26
where a and 26 do not have a common factor. For example, “a” cannot be 14 because 14
and 26 have a common factor of 2. The reason why “a” and 26 cannot have a common
factor is related to the procedure for determining the decoding congruence.
CONGRUENCE)
NOTE: The ciphertext is the
LET’S TRY THIS: c (ap + m) mod 26 remainder of modulo
Example: Use the congruence c (5p + 2) mod 26 to encode the
message LASER
ENCODING L INTO ENCRYPTION
c (5( 12)+ 2) mod 26

c (60 + 2) mod 26
c (62) mod 26 62/26= 2( remainder 10)
c 10
L J
CONGRUENCE)
message LASER
ENCODING A INTO ENCRYPTION
c (5( 1)+ 2) mod 26

c (5+2) mod 26
c (7) mod 26 7/26= 0( remainder 7)
c 7
A G
CONGRUENCE)
LET’S TRY THIS: c (ap + m) mod 26
message LASER NOTE: The ciphertext is the remainder of modulo
CONGRUENCE)
message LASER
ENCODING R INTO ENCRYPTION
c (5( 18)+ 2) mod 26

c (90+ 2) mod 26
c (92) mod 26 92/26= 3( remainder 14)
c 14
R N JGSAN
CIPHERTEXT-PLAINTEXT ( BREAKING ENCRYPTION BASED
ON THE CONGRUENCE)
Formula:
p [t(c – m)] mod 26
c=encrypted code
t= multiplicative number that is equals to 1
mod 26
ON THE CONGRUENCE)
Formula:
p [t(c – m)] mod 26
c (5p+2) mod 26
c 5p+2 Substracting both sides by 2
c-2 5p Find the multiplicative no. of a that is congruent
to 1 mod 26
Since 21(5)=1mod26
Multiply the no. of multiplicative to both sides of
21(c-2)=5p(21) the equation to change the a(n) into 1mod26
p [21(c-2)mod26
ON THE CONGRUENCE)
Formula: p [t(c – m)] mod 26
Using this congruence, we can decode the ciphertext message JGSAN.
p [21(c – 2)] mod 26
DECODING J INTO PLAINTEXT
p [21(10 – 2)] mod 26

p [21(8)] mod 26
p (168)mod 26 168/26= 6( remainder 12)
p 12
J L
ON THE CONGRUENCE)
DECODING G INTO PLAINTEXT
p [21(7 – 2)] mod 26

p [21(5)] mod 26
p (105)mod 26 105/26= 4( remainder 1)
p 1
G A
ON THE CONGRUENCE)
DECODING S INTO PLAINTEXT
p [21(19 – 2)] mod 26

p [21(17)] mod 26
p (357)mod 26 357/26= 13( remainder 19)
p 19
S S
ON THE CONGRUENCE)
DECODING A INTO PLAINTEXT
p [21(1 – 2)] mod 26 Note: To decode A, it is necessary to determine (-21)mod 26.
Recall that this requires adding the modulus until a whole
number less than 26 results. So, (-21) + 26 = 5, we have
p [21(-1)] mod 26 (-21)mod 26 = 5
p (-21)mod 26 (-21)+26=5
p 5
A E
ON THE CONGRUENCE)
LET’ TRY THIS:
DECODING N INTO PLAINTEXT
p [21(14 – 2)] mod 26

p [21(12)] mod 26
p (252)mod 26 256/26= 9( remainder 18
p 18
N R
Hence, the decoded word for “JGSAN” would be “LASER”.
D. Modulo Operation in Designing
Modulo Art
D. MODULO OPERATION IN DESIGNING MODULO ART
According to Mr. Livin G. Rejuso, based on his slide share

presentation that Mathematics can be considered as study of
patterns. One of the ways in which we use number patterns is in
the creation of unique and artistically pleasing design. This
design is from number pattern in Modular Arithmetic formed
modulo art.
MODULO OPERATION
Facilitates the creation of repeating patterns, symmetry, and
dynamic variations that can enhance the overall visual
experience. Whether you're coding, painting, or designing
digitally, understanding and applying the modulo operation
can elevate your artwork.
Using addition, subtraction, and multiplication to create
patterns and designs known as modulo art.
Now, let us take a look once again our modulo 4 addition table .
Let’s take the encircled part We got the pattern

Now, let us take a look once again our modulo 4 multiplication table .
Let’s take the encircled part We got the pattern

LATIN SQUARE DESIGN
Now, let us make a design based on the modulo 4 addition table.
Our legend would be as follows:

LATIN SQUARE DESIGN
The created pattern could be repeated, reflected or rotated.
Repeated
LATIN SQUARE DESIGN
Rotated
LATIN SQUARE DESIGN
Relected
Lesson
4.4
Group Theory
Intended Learning Outcomes:
1. Relate clock arithmetic into the fundamental concept of
group.
2. Explain the concept of group theory in permutatio
3. Define and differentiate group from an abelian group.
4. Name and list all the properties in order to days that
the elements in a given set could be said a group.
5. Show that the integers under its operation from a
group.
6. Define what an order of a group is.
7. Construct Cayley’s table
8. Explain what a symmetry of group and it’s symbolic notation is.
9. Compare and evaluate symmetry of group and its symbolic notation.
Introduction
Another important topics in the field of mathematics is what we called a group

theory and of course, this could be important and very useful tool in teaching
some topics in mathematics. Based on “The Evolution of Group Theory; A
Brief”, that the four major sources in the evolution of group theory together with
the name of the creators and the date are as follows: a) Classical Algebra by
J.L Langrange (1770), b) Number Theory by C.F. gauss (1801) c) Geometry by
F. Klein (1874) and d) Analysis by S. Lie (1874) and by H. Poincare and F Klein
(1876).
Discussion
A. Introduction to Group
Before we define group, let us recall the clock arithmetic!
Now, let’s do the clock arithmetic

3+5=
4+3=
1-5=
Here we could say that clock arithmetic is also a modular arithmetic.

In 7 hours clock, this would be integer 7 or modulo 7.
Thus, Z7 = {1,2,3,4,5,6,,0}
Discussion
A. Introduction to Group
Before we define group, let us recall the clock arithmetic!
Now, let’s do the clock arithmetic

3+5=1
4+3=0
1-5=3
Here we could say that clock arithmetic is also a modular arithmetic.

In 7 hours clock, this would be integer 7 or modulo 7.
Thus, Z7 = {1,2,3,4,5,6,,0}
Let us answer the question, “How many ways can you
rotate/flip the triangle so that it looks the same before and
after”?
In arithmetic, there are only two operations, the addition and the
multiplication. The opposite of addition is subtraction and the opposite of
multiplication is its reciprocal.
Now, what is a GROUP? In our previous lesson, we discussed operations
modulo n. Now, let us consider the set of elements {0,1,2,3,4,5} and the
operation is addition modulo 6. Here, we have only one operation.
The previous table is an example of an algebraic system called group. An
algebraic system is a set of elements along with one or more operations
for combining the elements. The real numbers with the operations of
addition and multiplication are an example of an algebraic system.
Mathematicians classify this particular system as a field.
Example 1: The binary operator addition mod 5, denoted by * is defined on the set
Z = {0,1,2,3,4}. Complete the table and show that (Z, *) is a group.
P1: (Z, +) is closed since all

members of the Cayley Table
are in Z.
P2: In number theory, (a + b) +
c mod n = a + (b + c) mod n.
Hence, it is associative
P3: The identity element is 0,
e = 0.
P4: Each element has an
inverse. 0^-1 = 0; 1^-1 = 4;
2^-1 = 3; 3^-1 = 2; 4^-1 = 1
Since all the properties
satisfied, hence it is a group.
So, For all n  N, the integers
mod n, which we denote Zn,
forms a group under
addition. Then, the identity is
0, and the inverse of x is −x.
B. Cayley Tables of Groups In our previous lesson, we discuss about “Cayley’s Table”.
Here, we are going to define first the meaning of an order of the group.
Definition: Order of the group is just the number of element in a group and it is
denoted by |G|
llustration above is what we called a group of order 1. This group is called as

a trivial group.
C. Symmetry of Groups The concept of group is very general. The elements that make
up a group do not have to be numbers, and the operation does not have to be
addition or multiplication. Symmetry group is another type of group and it is based
on regular polygon (polygon whose sides are on the same length and with the same
angle measure).
D. Symbolic Notation The operation notation for symmetry triangle can be
presented into other notation called as symbolic notation and/or
permutation.
Example:
D. Symbolic Notation The operation notation for symmetry triangle can be
presented into other notation called as symbolic notation and/or
permutation.
Example:
PADAYON, FUTURE ENGINEERS!
IT MAY BE HARD THIS TIME BUT IT WILL BE
WORTH IT.
LOVE, GROUP 6
Thank
you!!

GROUP 6 PPT - MODULE 4 - 20241029 - 083830 - 0000 - Compressed

Uploaded by

Copyright:

Available Formats

GROUP 6 PPT - MODULE 4 - 20241029 - 083830 - 0000 - Compressed

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

GROUP 6 PPT - MODULE 4 - 20241029 - 083830 - 0000 - Compressed

Uploaded by

Copyright:

Available Formats

GROUP 6

Engr. Ryza Nicole A. Aycardo

1. Compare modular arithmetic into group theory.

Special type of Code and decode emphasized the

When we divide a number by 12, the remainder

We have 2 operations or process to use:

1. What is the time 8 hrs after 3 o'clock?

2. What is the time 5 hrs before 8 o'clock?

1) If it is 12:00 now, what time is it in 18 hours?

Example: Let us say today is Wednesday. What would be

Assigned number for each day of the week

If n divides (a-b), (a-b) is a multiple of n. Therefore it's a

Based on the given table 10 + 7 ≡ 5 or we could say that 17 ≡ 5 mod 12.

Write the statement 3 | 6 in the form a ≡ b (mod n).

We need to find two numbers (a) and (b)

Now that our a, b, and n are complete. We

b) if a ≡ b(mod n) then b ≡ a(mod n) Symmetric

If 13 ≡ 10 (mod 3), then 10 ≡ 13 (mod 3)

c) if a ≡ b (mod n) and b ≡ c (mod n), then a ≡ c (mod n) Transitive

Given that 31 ≡ 13 (mod 2). Let c = 3, then (31•3) ≡ (13•3)(mod 2)

f). a ^ n + 1 ≡ b ^ n + 1 (mod n) where n + 1 = k. Hence, a^k ≡ b^k (mod n) Power

Given that 3 ≡ 8 (mod 5) and k = 2, then 3² ≡ 8² (mod 3)

2. Perform and solve the operations on modulo n such as

3. Solve the congruence equation.

In 29≡8 mod 3 , we could verify that its congruence is true

Now, divide the difference by the modulus, which is 6:

So, (33 – 16) mod 6 = 5.

We start by adding 5 to −7:

Since −2 is still negative, we add 5 again:

Now we have 3, which is a positive number less than 5.

Thus, the solution to −7 mod 5 is:

Evaluate (15•23) mod 11.

First, calculate the product of 15 and 23:

Now, divide 345 by 11:

The remainder when 345 is divided by 11 is 4, so:

Calculate the product of 16 and 25:

Thus, the result of (16⋅25) mod 18:

For instance, 5 + (-5) = 0. So 5 is the additive invers of -5

Find the multiplicative inverse of 3 mod 7 (and 5 mod 7).

Look for x such that:

The equation is:

To verify: 5⋅3 ≡ 1 (mod 7)

Let's check each value of x.

2. To explain the validity and invalidity of the product code.

3. To differential cryptology to cryptography.

4. To make use of modular arithmetic to encrypt and decrypt the text.

5. To apply modular operations in making a modulo art.

2+1=3(mod 5)=3 3+3=6(mod 5)=1

3+1=4(mod 5)=4 4+3=7(mod 5)=2

2 x 1=2(mod 5)=2 3 x 3=9(mod 5)=4

2 x 2=4(mod 5)=4 0 x 0=0(mod 5)=0

B. Universal Product Code (UPC) and Credit Card

C. Cryptology and Cryptography

D. Modulo Operation in Designing Modulo Art

One of the applications of modular arithmetic is on how to

978 – 971 – 23 – 9357 – 0

Another coding scheme that is closely related to the ISBN is the

The use of UPC Formula is to check the validity of check

If d12 = 10, then the check digit is 0.