Mathematics in The Modern World Chapter 5-Mathematical-System
Mathematics in The Modern World Chapter 5-Mathematical-System
Mathematics in The Modern World Chapter 5-Mathematical-System
Study Guide in Mathematics in the Modern World (draft copy) FM-AA-CIA-15 Rev. 0 10-July-2020
MODULE 5
MATHEMATICAL SYSTEM
MODULE OVERVIEW
Mathematical system consists of modular arithmetic, congruences and the different applications of
these two in real world.
LEARNING OBJECTIVES
LEARNING CONTENTS
Keep the idea of the clock in mind. You see 12 numbers on the clock. The modulus is 12 with
the twelve remainders 0,1,2,3,4,5,6,7,8,9,10,11. To determine a time in the future or in the past, we
actually give a remainder between 0 and 11.
To determine the time 5 hours after 3 o’clock A.M., we add 3 and 5. It does not pass 12 o’clock,
the time is 8 o’clock A.M. However, to determine the time 5 hours after 11 o’clock A.M., we must take
into consideration that once we have passed 12 o’clock, we begin again with 1. Therefore, 5 hours after
11 o’clock A.M. is 4 o’clock P.M.
We use the symbol ⊕ to denote addition on a 12-hour clock. Using this notation,
3 A . M .⊕ 5 hrs .=8 A . M .
and 11 A . M .⊕ 5 hrs .=4 P . M . on a 12-hour clock.
Study Guide in Mathematics in the Modern World (draft copy) FM-AA-CIA-15 Rev. 0 10-July-2020
We can also perform subtraction on a 12-hour clock. If the time now is 3 o’clock A.M., then 7
hours ago, the time was 8 o’clock P.M. Use the symbol ⊖ to denote subtraction on a 12-hour clock
and write
3 A . M ⊖7 hrs .=8 P . M .
Example
.2
A similar example involves day-of-the-week arithmetic. If we associate each day of the week with a
number,
Monday = 1 Friday = 5
Tuesday = 2 Saturday = 6
Wednesday = 3 Sunday = 7
Thursday = 4
Then, 12 days after Sunday is Friday. In symbols, we write
7 ⊞ 12=5.
Take note that we are using the ⊞ symbol for day-of-the-week arithmetic to differentiate from the
Your Turn 1
Disregarding A.M. and P.M. Evaluate each expression, where ⊕ indicate addition, using a 12-hour
clock.
a.) 12 ⊕ 3 d.) 5 ⊕ 10
b.) 8 ⊕ 9 e.) 8 ⊕ 8
c.) 6 ⊕ 7 f.) 11 ⊕ 10
Evaluate each expression, where ⊞ indicate addition, using days-of-the-week arithmetic.
a.) 6 ⊞ 4 b.) 3 ⊞ 5
b . (Burton, 2007)
Example
.2
Use the division algorithm to find the quotient and remainder when a=158∧b=17 .
Study Guide in Mathematics in the Modern World (draft copy) FM-AA-CIA-15 Rev. 0 10-July-2020
Solution:
By division algorithm a=qb+r , substitute the value of a and b which is
158=9× 17+5 so q=9∧r=5 . Therefore, the value of quotient and remainder is 9 and 5.
Corollary 1.2
If a∧b are integers, with b ≠ 0 , then there exist unique integer q∧r such that
Example
.2.2
When b < 0, let us take b = −7 . Let a=1 ,−2, 61∧−59 to satisfy that the remainder is
nonnegative then 0 ≤ r< ¿ b∨¿ , then the expressions are
1=0 (−7 )+ 1,
−2=1 (−7 ) +5,
61=(−8 )(−7 ) +5,
−59=9 (−7 ) +4.
Therefore, the remainders are nonnegative.
Your Turn 2
Find the remainder (r) and quotient (q) given the following values of a and b.
a.) If a = 21 and b = 12.
b.) If a = – 12 and b = 21.
c.) when 21 is divided by 5.
d.) when – 21 is divided by 5.
Example
.3
−12 is divisible by 4, since −12=4 (−3 ) +0 . However, 10 is not divisible by 3; since by
division algorithm, 10=3 ( 3 )+1 then r =1≠ 0 for there is no integer q which makes 10=3 q true.
Theorem 1.3.1
For integers a, b, c the following hold:
Study Guide in Mathematics in the Modern World (draft copy) FM-AA-CIA-15 Rev. 0 10-July-2020
Example
.3.2
Is 42 divisible by 3?
YES because 42 = 3 ∙ 14 + 0. Thus, by division algorithm q=14 and r=0 .
Example
.3.3
Let a = 3, b = 21 and c = 42. Since 3∨21 because 21 = 3(7)+0 and 21|42 because 42 =
21(2)+0, then by Theorem 1.3.1 (iii), 3|42.
d∨a∧d ∨b . If one of a∧b is not zero, then there are only a finite numbers of common divisors
of a∧b . (Burton, 2007)
Example
.3
The positive divisor of −12 are 1,2,3,4,6 and 12 while those of 30 are 1,2,3,5,6,10,15 and
30. Hence, the positive common divisors of −12∧30 are 1,2,3 and 6.
gcd (a , b) or simply (a , b) is defined as the largest among all common divisors of a∧b .
(Burton, 2007)
Remark: ( a , b ) =(|a|,|b|)
Example
.3
In Example 1.3.4, since 6 is the largest of the integers, it follows that gcd (−12,30 ) =6 .
Your Turn 3
Study Guide in Mathematics in the Modern World (draft copy) FM-AA-CIA-15 Rev. 0 10-July-2020
r n−1 is divided by r n .
The result is the following system of equation:
a=q1 b+r 1 , 0 ≤ r 1<b
b=q2 r 1 +r 2 , 0 ≤ r 2<r 1
r 1=q 3 r 2+ r 3 , 0 ≤ r 3< r 2
.
.
.
r n−2=qn r n−1+ r n , 0 ≤ r n< r n−1
r n−1=q n+1 r n +0 .
Example
Study Guide in Mathematics in the Modern World (draft copy) FM-AA-CIA-15 Rev. 0 10-July-2020
Your Turn 4
Find the following.
a.) gcd (143, 227)
b.) gcd (306, 657)
c.) gcd (272, 1479)
Use the Euclidean algorithm to obtain integer x and y satisfy
gcd (56, 72) = 56x + 72y
Study Guide in Mathematics in the Modern World (draft copy) FM-AA-CIA-15 Rev. 0 10-July-2020
LEARNING POINTS
In this lesson, we performed the operations of clock arithmetic and day of the week using the
symbols ⊕, ⊖ and ⊞ . The relation of integers of a and b and the greatest common divisor of
integers were determined. Also, the definition and computation of the division algorithm, greatest
common divisor and Euclidean algorithm had been presented.
LEARNING ACTIVITY 1
1. Military Time. Evaluate each expression, where ⊕ indicate addition and ⊖ indicate
subtraction, respectively, using military time. (Military time uses a 24-hour clock, where 2:00
A.M is equivalent to 0200 hours and 10 P.M is equivalent to 2200 hours).
a.) 0800 ⊕ 2000
b.) 0600 ⊖ 2200
c.) 1000 ⊖ 1400
2. Disregarding A.M. and P.M. Evaluate each expression, where ⊖ indicate subtraction, using
a 12-hour clock.
a.) 3 ⊖ 8 d.) 2 ⊖ 6
b.) 10 ⊖ 11 e.) 1 ⊖ 4
c.) 4 ⊖ 9
3. Evaluate each expression, where ⊟ indicate subtraction, respectively, using days-of-the-
week arithmetic.
a.) 2 ⊟ 3 b.)3 ⊟ 6
4. Use the division algorithm. There are 24 hours in one complete day. How many complete days
are contained in 2500 hours?
5. Use the division algorithm to find the expression that will satisfy the following.
a.) when b < 0, where b = – 3 then for the choices of a = 4, 12, 21, -31, -52, and 69.
b.) when b > 0, where b = 6 then for the choices of a = 2, 12, 21, 31, -52, -72 and 99.
6. List all common divisors and find the greatest common divisor of the following.
a.) 47 and 74
b.) 47 and – 74
Study Guide in Mathematics in the Modern World (draft copy) FM-AA-CIA-15 Rev. 0 10-July-2020
c.) – 69 and 96
LEARNING CONTENTS
Study Guide in Mathematics in the Modern World (draft copy) FM-AA-CIA-15 Rev. 0 10-July-2020
Congruence often arises in everyday life. For instance, clock work either modulo 12 or 24 for
hours, and modulo 60 for minutes and seconds, calendars work modulo 7 for days and modulo 12 for
months.
Definition 2.1.1 Congruence
Let m be a positive integer. If a and b are integers, we say that a is congruent to
b modulo m if m∨( a−b) .
If a is congruent to b modulo m , we write a ≡b (mod m) . If m∤(a−b) , we write
a ≢ b(mod m) , and say that a and b are incongruent modulo m . (Adamchik, 2005)
Example
2
Since 22−4=18 and 9∣18 , then we have 22≡ 4 (mod 9) . Likewise, since
200−2=198∧9∣198, then we have 200 ≡2(mod 9) . On the other hand, 13 ≢5(mod 9)
since 9 ∤ ( 13−5 )=8.
Theorem 2.1.1
Let m be a positive integer. Congruence modulo m satisfies the following
properties:
(i) Reflexive property
If a is an integer, then a ≡ a(mod m) .
(ii) Symmetric property
If a and b are integers such that a ≡b (mod m) , then b ≡ a(mod m) .
(iii) Transitive property
If a , b∧c are integers with a ≡b (mod m) and b ≡ c( mod m) , then
a ≡ c(mod m) .
Addition Modulo m
+¿m
For any integer m we define addition modulo m to be the operation such that
¿
Example
2.2
Study Guide in Mathematics in the Modern World (draft copy) FM-AA-CIA-15 Rev. 0 10-July-2020
Example
2.2.2
In 12-hour clock, we subtract 25∧8 as follows: 25−8=17 and 17 divided by the
Example
2.2.3
Evaluate ( 21−52 ) mod 12 .
Subtract 21−52=−31 . Because the answer is negative, we must find x so that
−31≡ x mod 12 . Evaluate the expression for whole number values of x less than 12.
Repeatedly add the modulus to the difference results in the following.
−31+12=−19
−19+12=−7
−7+12=5
We have x = 5. Therefore, ( 21−52 ) ≡5( mod 12) .
Multiplication Modulo m
For any integer m we define multiplication modulo m to be the operation ×m such
Study Guide in Mathematics in the Modern World (draft copy) FM-AA-CIA-15 Rev. 0 10-July-2020
Example
2.2
How do we compute (5 × 8) mod 12?
First we multiply 5 × 8 = 40 and 40 divided by the modulus 12 gives a remainder of 4 since
5 ×12 8=40(mod 12) then 5 ×12 8=4 . Therefore, ( 5 ×8 ) ≡ 4(mod 12) .
table mod 2
⨁ 0 1 ⨂ 0 1
0 0 1 0 0 0
1 1 0
1 0 1
table mod 4
⨁ 0 1 2 3 ⨂ 0 1 2 3
0 0 1 2 3 0 0 0 0 0
1 1 2 3 0 1 0 1 2 3
2 2 3 0 1 2 0 2 0 2
3 3 0 1 2 3 0 3 2 1
Your Turn 5
Perform the modular arithmetic.
a.) (28 + 31) mod 4
b.) (50 + 1) mod 15
c.) (24 – 41) mod 8
d.) (60 – 32) mod 9
Study Guide in Mathematics in the Modern World (draft copy) FM-AA-CIA-15 Rev. 0 10-July-2020
Theorem 2.3.1
The linear congruence ax ≡ b ( mod m ) has a solution if and only if gcd(a,m)|b. If gcd(a,m)|b
and if d=gcd(a,m), then it has d incongruent solutions.
If the linear congruence is solvable, the d incongruent solutions are given by
m
x=x 0 + t , 0≤ t ≤ d
d
We illustrate now the use of Theorem 2.3.1.
Example
2.3
Solve the linear congruence 160x ≡142(mod 202)
Solution:
Find the gcd(a,m)=gcd(160,202) by using Euclidean algorithm.
202 = 160 ∙ 1 + 42
160 = 42 ∙ 3 + 34
42 = 34 ∙ 1+8
34 = 8 ∙ 4+2
8=2 ∙ 4+0
The gcd(160,202)=2 and 2|142. By Theorem 2.3.1, there are 2 incongruent solutions.
2 = 34-8(4)
= 34 – [42-34](4)
= 34 – 42(4) + 34(4)
= 34(5) – 42(4)
= [160 – 42(3)](5) – 42(4)
= 160(5) – 42(15) - 42(4)
= 42(-19) + 160 (5)
Study Guide in Mathematics in the Modern World (draft copy) FM-AA-CIA-15 Rev. 0 10-July-2020
= [202-160](-19) + 160(5)
= 202(-19) + 160 (19) + 160(5)
2= 160(24) + 202(-19) or 2 = 160(24) – 202(19)
Multiply the whole equation by 71 to get 142 = 160(1704) – 202(1349)
So, x =1704 and y = 1349.
Other solutions are given by
m
x=x 0 + t , 0≤ t ≤ d
d
x 0=1704
202
x 1=1704+ t , 0 ≤t ≤2
2
x 1=1704+101 ( 1 )=1805
x 2=1704+101 ( 2 )=1906
Your Turn 6
Solve the congruence equation
a.) 10x ≡ 5 mod 21
b.) 10x ≡ 5 mod 15
c.) 10x ≡ 4 mod 14
that a+ (−a )=0 . In other words, – a is the additive inverse of a if and only if
a+ (−a ) ≡0(mod m) . (Gawron, 2005)
Example
2
( 3+5 ) ≡0 mod 8
In mod 8 arithmetic, 3 is the additive inverse of 5 and 5 is the additive inverse of 3.
Here we consider only those whole numbers smaller than the modulus. Note that 3 + 5 = 8; that
is, the sum of a number and it is inverse equals the modulus. Using this fact, we can easily find the
additive inverse of a number for any modulus. For instance, in mod 11 arithmetic, the additive inverse of
Study Guide in Mathematics in the Modern World (draft copy) FM-AA-CIA-15 Rev. 0 10-July-2020
To find the multiplicative inverse of a mod m, solve the modular equation ax ≡ 1 mod m for
x. If the product of two numbers is 1, then the numbers are multiplicative inverse of each other.
(Huffman, 2013)
Example
2 .2
In mod 7 arithmetic, find the multiplicative inverse of 2.
To find the multiplicative inverse of 2, solve the equation 2x ≡ 1 (mod 7) by trying different
natural number values of x less than the modulus,
2x ≡ 1 (mod 7)
If x = 1, 2(1) = 2 ≢ 1 (mod 7)
x = 2, 2(2) = 4 ≢ 1 (mod 7)
x = 3, 2(3) = 6 ≢ 1 (mod 7)
x = 4, 2(4) = 8 ≡ 1 (mod 7)
Therefore, in mod 7 arithmetic, the multiplicative inverse of 2 is 4.
Your Turn 7
Find the additive inverse of the given number.
1.) 4 in modulo 9 arithmetic
2.) 4 in modulo 5 arithmetic
3.) 7 in modulo 10 arithmetic
4.) 11 in modulo 16 arithmetic
5.) 3 in modulo 8 arithmetic
LEARNING POINTS
In this lesson, we defined different terminologies in studying modular arithmetic and also
determined that the congruence holds and performed the operations on arithmetic modulo m.
LEARNING ACTIVITY
Study Guide in Mathematics in the Modern World (draft copy) FM-AA-CIA-15 Rev. 0 10-July-2020
LEARNING CONTENTS
Study Guide in Mathematics in the Modern World (draft copy) FM-AA-CIA-15 Rev. 0 10-July-2020
indicate the publisher, the next group of digits indicates the title of the book, and the last digit (the 13 th
one) is called a check digit.
If we label the first digit of an ISBN d 1 , the second digit d 2 , and so on to the 13th digit d 13 ,
then the check digit is chosen to satisfy the following congruence.
Formula for the ISBN Check Digit
d 13 =10− ( d 1+ 3 d 2+d 3+3 d 4 +d 5 +3 d 6 +d 7 +3 d 8 +d 9 +3 d 10+d 11 +3 d 12) mod 10 .
This is the check digit that is used to ensure accuracy.
Example
3
The ISBN for fourth edition of the American Heritage Dictionary is 978-0-395-82517-4.
Suppose, however, that a bookstore clerk send an order for the American Heritage Dictionary and
inadvertently enters the number 978-0-395-28517-4, where the clerk transposed the 8
and 2 in the five numbers that identify the book.
Correct ISBN: 978-0-395-82517-4
Incorrect ISBN: 978-0-395-28517-4
The receiving clerk calculates the check digit as follows.
d 13 ≡ 10−[ 9+3 ( 7 )+ 8+3 ( 0 ) +3+3 ( 9 )+ 5+3 ( 2 )+ 8+3 ( 5 ) +1+3 ( 7 ) ] mod 10
≡10−124 mod 10
≡10−4=6
Because the check digit is 6 and not 4 as it should be, the receiving clerk knows that an incorrect ISBN
has been sent. Transposition errors are among the most frequent errors that occur. The ISBN coding
system will catch most of them.
Another coding scheme that is closely related to the ISBN is the UPC.
Definition 3.1.2 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 promotional sale, the price is updated in the
computer, thereby relieving a clerk of having to re-price 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. (Huffman, 2013)
The UPC is a 12-digit number that satisfies a congruence equation that is similar to the one for
ISBNs. The last digit is the check digit. If we label the 12 digits of the UPC as d 1 ,d 2 , d 3 ,… , d 12 ,
we can write a formula for the UPC check digit d 12 .
Formula for the UPC Check Digit
d 12 ≡10−(3 d 1+ d2 +3 d 3 +d 4 +3 d 5+ d 6+ 3 d 7+ d 8+3 d 9+ d 10+3 d11 )mod 10
If d 12=10 , then the check digit is 0.
Example
Study Guide in Mathematics in the Modern World (draft copy) FM-AA-CIA-15 Rev. 0 10-July-2020
Find the check digit for the DVD release of the Alice in Wonderland. The first 11 digits are 7-86936-
79798-?
7
3 7 +8+3 6 +9+3 3 +6+3 (¿)+ 9+3 ( 7 ) +9+3(8)
( ) ( ) ( )
¿
d 12 ≡ 10−¿
≡10−155 mod 10
≡10−5=5
The check digit is 5.
The ISBN and UPC coding system will normally catch transposition errors. There are instances,
however, when they do not.
Example
3 .3
The UPC for Crisco Puritan Canola Oil with Omega-DHA is
0-51500-24275-9
Suppose, however, that the product code is written 0-51500-24725-9, where 2 and 7 have been
transposed. Calculating the check digit, we have
2
3 ( 0 ) +5+3 ( 1 ) +5+3 ( 0 ) +0+3(¿)+4 +3 ( 7 ) +2+3(5)
¿
d 12 ≡10−¿
≡10−61 mod 10
≡10−1=9
The same check digit is calculated, yet the UPC has been entered incorrectly. This was an
unfortunate coincidence; if any other two digits were transposed, the result would have given a different
check digit and the error would have been caught. It can be shown that the ISBN and UPC coding
methods will not catch a transposition error of adjacent digits a and b if | a – b| = 5. For the Canola Oil
UPC, | 7 – 2| = 5.
Your Turn 8
Determine whether the given number is a valid ISBN.
a.) 978-0-281-44268-5
b.) 978-0-55690-182-9
Study Guide in Mathematics in the Modern World (draft copy) FM-AA-CIA-15 Rev. 0 10-July-2020
break, the sender can prevent the communication from being read if it is intercepted by an unauthorized
person.
Definition 3.2.1 Cryptology
Cryptology is the study of making and breaking secret codes. (Huffman, 2013)
Before we discuss how message are coded, we need to define a few terms.
Definition 3.2.2 Plaintext
Plaintext is a message before it is coded. (Huffman, 2013)
Example
3.2
The line SHE WALKS IN BEAUTY LIKE THE NIGHT, from Lord Byron’s poem “She Walks in
Beauty” is in plaintext.
Definition 3.2.3 Ciphertext
Ciphertext is the message after it has been written in code. (Huffman, 2013)
Example
3.2.2
The line ODA SWHGO EJ XAWQPU HEGA PDA JECDP is the same message of the poem in
ciphertext.
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
↕ ↕ ↕ ↕ ↕ ↕ ↕ ↕ ↕ ↕ ↕ ↕ ↕ ↕ ↕ ↕ ↕ ↕ ↕ ↕ ↕ ↕ ↕ ↕ ↕ ↕
W X Y Z A B C D E F G H I J K L M N O P Q R S T U V
X A W Q P U
Y B X R Q V
Z C Y S R W Shift four position
Study Guide in Mathematics in the Modern World (draft copy) FM-AA-CIA-15 Rev. 0 10-July-2020
A D Z T S X
B E A U T Y
Once a recognizable word has been found (BEAUTY), count the number of positions that the
letters have been shifted (four, in this case). To decode the message, substitute the letter of the normal
alphabet that comes four positions after the letter in the ciphertext.
Example
3.2.3
The ciphertext word is ODA.
O D A
P E B
Q F C Four position
R G D
S H E
Cyclical encrypting using the alphabet is related to modular arithmetic. We begin with the
normal alphabet and associate each letter with a number as shown in Table 3.1
Table 3.1 Numerical Equivalents for the Letters of the Alphabet
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
↕ ↕ ↕ ↕ ↕ ↕ ↕ ↕ ↕ ↕ ↕ ↕ ↕ ↕ ↕ ↕ ↕ ↕ ↕ ↕ ↕ ↕ ↕ ↕ ↕ ↕
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 0
The encrypting code is to shift each letter of the plaintext message m positions, then the
corresponding letter in the ciphertext message is given by c ≡ ( p+m ) mod 26 , where p is the
numerical equivalent of the plaintext letter and c is the numerical equivalent of the ciphertext letter. The
letter Z is coded as 0 because 26 ≡0 mod 26 .
Each letter in Lord Byron’s poem was shifted 22 positions (m = 22) to the right. To code the
plaintext letter S in the word SHE, we use the congruence c ≡ ( p+m ) mod 26 .
c ≡ ( p+m ) mod 26
c ≡ ( 19+22 ) mod 26 p = 19 (S is the 19th letter)
c ≡ 41 mod 26 m = 22, the number of positions the letter is
shifted
c=15
The 15th letter is O. Thus S is coded as O.
Study Guide in Mathematics in the Modern World (draft copy) FM-AA-CIA-15 Rev. 0 10-July-2020
Once plaintext has been converted to ciphertext, there must be a method by which the person
receiving the message can return the message to plaintext. For the cyclical code, the congruence is
p≡ ( c +m ) mod 26 , where p and c are defined as before and n=26−m . The letter O in
ciphertext is decoded below using the congruence p≡ ( c +m ) mod 26 .
p≡ ( c +m ) mod 26
p≡ ( 15+4 ) mod 26 c = 19 (S is the 19th letter)
p≡ 19 mod 26 n = 26 – m = 26 – 22 = 4
p=19
The 19th letter is S. Thus O is coded as S.
Your Turn 9
Encryption, encode the message by using a cyclical alphabetic encrypting code that shifts the message
the stated number of positions.
a.) 12 positions: IT’S A GIRL
b.) 3 positions: STICKS AND STONES
LEARNING POINTS
The different terminologies in this lesson had been defined. We used the formula for ISNB and
UPC to determine whether the check digit is valid or not. The encryption and decryption are methods of
changing a message from plaintext to ciphertext and vice versa.
LEARNING ACTIVITY
1.) Determine whether the check digit is correct for the UPC.
a.) 6-53569-39973-1 (Scrabble)
b.) 0-79893-46500-2 (Organics Honey)
2.) Determine the correct check digit for each ISBN.
a.) 13-978-0073383-149 (Elementary Number Theory(7th edition))
b.) 13-978-0071294-121 (Algebra)
3.) Determine the correct check digit.
a.) 10-32031-13439-? (Beethoven’s 9th Symphony, DVD)
b.) 8-85909-19432-? (16 GB iPad with WiFi)
4.) Decoding, use a cyclical alphabetic encrypting code to decode the encrypted massage.
a.) AOB HVS HCFDSRCSG
b.) YBZAM HK YEBZAM
Study Guide in Mathematics in the Modern World (draft copy) FM-AA-CIA-15 Rev. 0 10-July-2020
5.) Encryption, Julius Caesar supposedly used an encrypting code equivalent to the
congruence c ≡ ( p+3 ) mod 26 . Use the congruence to encrypt the message “men
willingly believe what they wish.
6.) Decoding, Julius Caesar supposedly used an encrypting code equivalent to the
REFERENCES
A. Book
Ferguson, Niels and Bruce Schniere (2003). Practical Cryptography, New York: John Wiley & Sons.
Mel, H X Bakers (2001)., Cryptography and Decrypted New York, Addison –Wesley.
Scheiner ,Bruce . (1996). Applied Cryptography, New York; John Wiley &sons.
Rouohenon, (2014).Mathematical Cryptology,
Aufmann, Lockwood, et al.(2013). Mathematical Excursion (third edition): United Stateof America,
Graphic work Inc.
Burton, (2007).Elementary Number Theory (7th edtion): United State of America, Allyn and Bacon,
Inc.,
DEVELOPMENT AND VALIDATION OF A LEARNING MODULE IN MODULAR ARITHMETIC by
Beth PC. Argueza and Beverly B. Fernandez, June 2017
B. Website
Andreesscu,T Andrica (2010), Retrieved from http://www.springer.com/978-0-8176-4548-9.
Adamchick (2005), Modular Arithmetic,
Adamchick (2005), Integer Divisibility ,
Gawron,.(2005).Modular Arithmetic .Retrieved from http://www.rohan.sdsu.edu/-gawron.
Davis,(2006),Introduction to Linear Diophantine. Retrieved from
http://www.geometer.org/mathcircles.
Your Turn 1
1.)
a.) It means the time 3 hours after 12 o’clock is 3 o’clock, since 3 + 12 = 15 we have
passed 12 o’clock, we begin again with 1. Therefore 12 ⊕ 3 = 3.
b.) It means the time 9 hours after 8 o’clock is 5 o’clock, since 9 + 8 = 17 we have passed
12 o’clock, we begin again with 1. Therefore 8 ⊕ 9 = 5.
c.) It means the time 7 hours after 6 o’clock is 1 o’clock, since 7 + 6 = 13 we have passed
12 o’clock, we begin again with 1. Therefore 6 ⊕ 7 = 1.
d.) It means the time 10 hours after 5 o’clock is 3 o’clock, since 10 + 5 = 15 we have
passed 12 o’clock, we begin again with 1. Therefore 5 ⊕ 10 = 3.
Study Guide in Mathematics in the Modern World (draft copy) FM-AA-CIA-15 Rev. 0 10-July-2020
e.) It means the time 8 hours after 8 o’clock is 4 o’clock, since 8 + 8 = 16 we have passed
12 o’clock, we begin again with 1. Therefore 8 ⊕ 8 = 4.
f.) It means the time 10 hours after 11 o’clock is 4 o’clock, since 10 + 11 = 21 we have
passed 12 o’clock, we begin again with 1. Therefore 11 ⊕ 11 = 9.
2.)
a.) Given the day where 6 is Saturday and 4 is Thursday. Since 6 + 4 = 10 we have
passed the 7th day of the week which is Sunday, we begin again with Monday. Therefore, 6
⊞ 4 = 3 which is associate of Wednesday.
b.) Given the day where 3 is Wednesday and 5 is Friday. Since 3 + 5 = 10 we have passed
the 7th day of the week which is Sunday, we begin again with Monday. Therefore, 3 ⊞ 5=
1 which is associate of Monday.
Your Turn 2
1.)
a.) a=qb+r ⟹ 21=q (12)+ r , let q = 1 and r = 9. Therefore, 21=1 ( 12 ) +9 .
b.) a=qb+r ,−12=q (21)+r , let q = – 1 and r = 9. Therefore, −21=−1 ( 21 ) +9 .
c.) Since 21÷ 5=4 r . 1 , by division algorithm a=qb+r ⟹ 21=4(5)+1 .
Therefore, q = 4 and r = 1.
d.) Since −21÷ 5=−4 r .1 , by division algorithm a=qb+r ⟹−21=−4(5)+1 .
Therefore, q = – 4 and r = 1
Your Turn 3
a.) The common divisor of 24 and 54 is 6, we denote as gcd (24, 54) = 6.
b.) The common divisor of – 24 and 54 is 6, we denote as gcd (- 24, 54) = 6.
c.) The common divisor of 24 and – 54 is 6, we denote as gcd (24, -54) = 6.
d.) The common divisor of 10 and 100 is 10, we denote as gcd (10, 100) = 10
e.) The common divisor of 12 and 21 is 3, we denote as gcd (12, 21) = 3
Your Turn 4
1.)
a.) 227 ¿ 143 (1 )+ ( 84 ) c.) 657=306(2)+45
143=84 (1)+59 306=45 ( 6 ) +36
84=59 ( 1 )+25 45=36(1)+9
159=25 ( 2 ) +9 36=9 ( 4 )+0
25=9 ( 2 )+7 gcd (272,1479) = 9
7=2 ( 3 )+1
2=1 ( 2 ) +0
Study Guide in Mathematics in the Modern World (draft copy) FM-AA-CIA-15 Rev. 0 10-July-2020
Your Turn 5
1.)
a.) Add 28+31=59 and 59 divided by the modulus 4 leaves a remainder of 3 since
+¿ 4 31=59(mod 4) +¿ 4 31=3
then .
28 ¿ 28 ¿
Therefore, ( 28+31 ) ≡3(mod 4) .
b.) Add 50+1=51 and 51 divided by the modulus 15 leaves a remainder of 6 since
Study Guide in Mathematics in the Modern World (draft copy) FM-AA-CIA-15 Rev. 0 10-July-2020
Your Turn 6
1.)
a.) 10 x ≡5 ( mod 21 )
10(11)≡5(mod 21)
110 ≡5 (mod 21)
Answer x ≡11 (mod 21) .
b.) 10 x ≡5 ( mod 15 )
⟹10 (2) ≡5 (mod 15)
20 ≡5(mod15)
⟹10 (5)≡5 (mod 15)
50 ≡5(mod 15)
⟹10 (8)≡(mod 15)
80 ≡5(mod 15)
⟹10 (14)≡(mod 15)
140 ≡5(mod 15)
Answer x ≡ 2,5,8,11(mod 15) .
c.) 10 x ≡ 4 ( mod 14 )
⟹10 (6)≡(mod 14 )
60 ≡ 4(mod 14 )
Study Guide in Mathematics in the Modern World (draft copy) FM-AA-CIA-15 Rev. 0 10-July-2020
Your Turn 7
Your Turn 8
1.)
( 9+3 ( 7 )+ 8+3 ( 0 ) +2+3 ( 8 ) +1+3 ( 4 ) + 4+3 ( 2 ) +6+3 ( 8 ) ] mod 10
d13 ≡10−¿
≡10−117 ( mod 10 )
≡10−7=3. The check digit is 3. Therefore, this is not a valid ISBN.
2.)
( 9+3 ( 7 )+ 8+3 ( 0 ) +5+3 ( 5 ) +6+ 3 ( 9 ) +0+3 ( 1 ) +8+3 ( 2 ) ] mod 10
d 13 ≡10−¿
≡10−108 ( mod 10 )
≡10−8=2. The check digit is 2. Therefore, this is not a valid ISBN.
Your Turn 9
1.) By using a cyclical alphabetic encrypting code, that shift the message the stated the number
of positions is 22 and coding the plaintext letter I in the word IT’S MY GIRL. We use the