Module in Math 114 (Abstract Algebra) La Carlota City College

MODULE 1.1
Modular Arithmetic

Introduction
Modular arithmetic is a topic residing under Number Theory, it is a
system of arithmetic for integers, where numbers “wrap around” upon
reading a certain value the- Modulus.
EXAMPLES:
10 o’clock + 9 hours 2.) 8x8(mod 4)
10 + 9(mod 12) 8x8=64(mod 4)
10 + 9= 19(mod 12) 64/4- 16 r. 0 (mod 4)
19/12= 1 r.7

• Modulo is a math operation that finds the remainder when one integer is
divided by another. In writing, it is frequently abbreviated as mod, or
represented by the symbol %.
For two integers a and b:
a mod b = r
Where a is the dividend, b is the divisor (or modulus), and r is the remainder.

Examples:
11 mod 4 = 3, because 11 divides by 4 (twice), with 3 remaining.
25 mod 5 = 0, because 25 divides by 5 (five times), with 0 remaining.
3 mod 2 = 1, because 3 divides by 2 (once), with 1 remaining.
5 mod 2 = 1, because all odd numbers yield a remainder of 1 when divided by 2.

• Congruence Modulo for a positive integer n, two integers a & b are said to be
congruent modulo, n written: 𝑎 ≅ 𝑏(𝑚𝑜𝑑 𝑛) if their difference a-b is an integer
multiple of n. The number is called the modulus of congruence.

𝐴 ≅ 𝐵(𝑚𝑜𝑑 𝑛)
• A leaves a remainder of B when divided by n.

Example:
10 ≅ 4(𝑚𝑜𝑑 6), because 10/6 remainder 4.

• 𝑎 ≅ 𝑏(𝑚𝑜𝑑 𝑛) when a-b is a multiple of n or when (a-b)/n is an integer.

Example:
10 ≅ −2(𝑚𝑜𝑑 6) , because 10-(-2)=12 which is multiple of 6 or [(10-(-2))/6]= 2 which is
an integer.

• A=tm + b for some integer t.

Examples:

1.) 39 ≅ 4(𝑚𝑜𝑑 7), because 39= (5)(7)+4

2.) 43 ≅ 3(𝑚𝑜𝑑 5), because 43=(8)(5)+3

ADDITION RULE
When a, b, c and d are integers and m is a positive integer such that:
Module in Math 114 (Abstract Algebra) La Carlota City College

𝑎 ≅ 𝑐 (𝑚𝑜𝑑 𝑚) and 𝑏 ≅ 𝑑 (𝑚𝑜𝑑 𝑚)

𝑎 + 𝑏 ≅ 𝑐 + 𝑑(𝑚𝑜𝑑 𝑚)
Example:
15 ≅ 3(𝑚𝑜𝑑 6) & 23 ≅ 5(𝑚𝑜𝑑 6)

a=15 b=23 c=3 d=5 m=6

Solution:
𝑎 + 𝑏 ≅ 𝑐 + 𝑑 (𝑚𝑜𝑑 𝑚)
15 + 23 ≅ 3 + 5(𝑚𝑜𝑑 6) ≅ 8(𝑚𝑜𝑑 6) ≅ 2(𝑚𝑜𝑑 6)

SUBTRACTION RULE
When a, b, c and d are integers and m is a positive integer such that:
𝑎 ≅ 𝑐 (𝑚𝑜𝑑 𝑚) and 𝑏 ≅ 𝑑 (𝑚𝑜𝑑 𝑚)

𝑎 − 𝑏 ≅ 𝑐 − 𝑑(𝑚𝑜𝑑 𝑚)
Example:
𝟐𝟑 ≅ 𝟑(𝒎𝒐𝒅 𝟓) & 𝟐𝟏 ≅ (𝒎𝒐𝒅 𝟓)

a=23 b=21 c=3 d=1 m=5

Solution:
𝒂 − 𝒃 ≅ 𝒄 − 𝒅(𝒎𝒐𝒅 𝒎)
𝟐𝟑 − 𝟐𝟏 ≅ 𝟑 − 𝟏(𝒎𝒐𝒅 𝟓) ≅ 𝟐(𝒎𝒐𝒅 𝟓)

MULTIPLICATION RULE
When a, b, c and d are integers and m is a positive integer such that:
𝑎 ≅ 𝑐 (𝑚𝑜𝑑 𝑚) and 𝑏 ≅ 𝑑 (𝑚𝑜𝑑 𝑚)

𝑎𝑏 ≅ 𝑐𝑑(𝑚𝑜𝑑 𝑚)
Example:
𝟏𝟐 ≅ 𝟐(𝒎𝒐𝒅 𝟓) & 𝟏𝟖 ≅ 𝟑(𝒎𝒐𝒅 𝟓)

a=12 b=18 c=2 d=3 m=5

Solution:
𝒂𝒃 ≅ 𝒄𝒅(𝒎𝒐𝒅 𝒎)
𝟏𝟐(𝟏𝟖) ≅ (𝟐)(𝟑)(𝒎𝒐𝒅 𝟓) ≅ 𝟔(𝒎𝒐𝒅 𝟓) ≅ 𝟏(𝒎𝒐𝒅 𝟓)

Other uses of Modular Arithmetic

• Today is Monday; what day will it be in 13 days?

Sunday

• Today is Thursday; what day will it be 23 days before?

Tuesday

• Since January 1, 2007, books are now assigned a 13-digit ISBN number. A three
Module in Math 114 (Abstract Algebra) La Carlota City College

digit EAN (European Article Number) was added to the beginning of the order.
However, this changes the process of how the check number is created. The first
12-digits of the ISBN 978-0-439-02348 for The Hunger Games are Follow the steps
below to determine the check digit.

1. Write the formula below replacing the letters with the digits from the ISBN.
(a x 1) + (b x 3) + (c x 1) + (d x 3) + (e x 1) + (f x 3) + (g x 1) + (h x 3) + (i x 1) + (j x 3) + (k x
1) + (l x 3) = (9 x 1) + (7 x 3) + (8 x 1) + (0 x 3) + (4 x 1) + (3 x 3) + (9 x 1) + (0 x 3) + (2 x 1) +
(3 x 3) + (4 x 1) + (8 x 3)
2. Evaluate the expression. = 99
3. Divide the sum by 10. Find the remainder. 99 mod 10 = 9
4. The check digit is the difference of 10 and the remainder. = 1

Exercises:

A. Write the following division problems in the modular arithmetic format.

1. 12÷5 3. 28÷8
2. 42÷7 4. 97÷10

B. Find the solution to each equation written in modular arithmetic format.

5. 51 mod 7 7. 37 mod 6
6. 23 mod 4

C. Fill in the blanks below.

In 1970, books began to be published with a 10-digit ISBN (International Standard Book
Numbers). The first nine numbers helped to identify the country group, publisher, and title of
the book. The last digit was a check digit for verification. The first 9-digits of the ISBN for The
Hobbit are 0-618-00221. Follow the steps below to determine the check digit.

1. Write the formula below replacing the letters with the digits from the ISBN.
(a x 10) + (b x 9) + (c x 8) + (d x 7) + (e x 6) + (f x 5) + (g x 4) + (h x 3) + (i x 2)
= ________________________________________________________________
2. Evaluate the expression. = ________________________
3. Divide the sum by 11. Find the remainder. _____________________________
4. The check digit is the difference of 11 and the remainder. = ________________

D. Find the value of x

1. 𝟖𝟑 ≅ 𝒙(𝒎𝒐𝒅 𝟐)
2. 𝟐𝟔 ≅ 𝒙(𝒎𝒐𝒅 𝟏𝟐)
3. 𝟓 ≅ 𝒙(𝒎𝒐𝒅 𝟑)
4. 𝟕 ≅ 𝒙(𝒎𝒐𝒅 𝟐)
5. 𝟏𝟐 ≅ 𝒙(𝒎𝒐𝒅 𝟓)
Module in Math 114 (Abstract Algebra) La Carlota City College

➢ Introduction to Functions

A relation in which each x-coordinate is matched with only one y-coordinate is

said to describe y as a function of x. A function is a relation in which each input (x) has
only one output (x).

-Domain & Range: Suppose F is a relation which describes y as a function of x. The set of
the x-coordinates of the points in F is called the domain of F. The set of the y-
coordinates of the points in F is called the range of F.
-The Vertical Line Test: A set of points in the plane represents y as a function of x if and
only if no two points lie on the same vertical line.

Example: Use the Vertical Line Test to determine which of the following relations describes y as
a function of x.

Solution: Looking at the graph of R, we can easily imagine a vertical line crossing the graph more
than once. Hence, R does not represent y as a function of x. However, in the graph of S, every
vertical line crosses the graph at most once, so S does represent y as a function of x

-Inverse Function: An inverse function is a function that undoes the action of the function.
A function f has an inverse function only if for every y in its range there is only one value of x in
its domain for which f(x)=y. This inverse function is unique and is frequently denoted by f −1 and
called “f inverse.”