0% found this document useful (0 votes)
25 views

5.1 Modular Arithmetic Part 1

The document discusses modular arithmetic and its applications in clock and calendar arithmetic. Modular arithmetic involves performing arithmetic operations like addition, subtraction, multiplication and division according to a repeating cycle defined by a modulus. It allows representing situations like time on a 12-hour clock or days of the week as arithmetic modulo 12 or 7. Examples are provided to demonstrate evaluating expressions involving addition and subtraction on a clock and calendar using modular notation.

Uploaded by

meia quider
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
25 views

5.1 Modular Arithmetic Part 1

The document discusses modular arithmetic and its applications in clock and calendar arithmetic. Modular arithmetic involves performing arithmetic operations like addition, subtraction, multiplication and division according to a repeating cycle defined by a modulus. It allows representing situations like time on a 12-hour clock or days of the week as arithmetic modulo 12 or 7. Examples are provided to demonstrate evaluating expressions involving addition and subtraction on a clock and calendar using modular notation.

Uploaded by

meia quider
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 16

Mathematical

Systems
Module 5
Section 5.1

Modular
arithmetic
Learning
At the endOutcomes
of this section, the students are expected to:

1. perform addition, subtraction, multiplication modulo n;


2. apply modular arithmetic in predicting a specific time or
day;
3. identify congruent/incongruent integers modulo n;
4. solve linear congruence in one variable; and
5. determine the additive/multiplicative inverse of
an integer modulo n.
If we want to determine a time in the future
or in the past, it is necessary to consider
whether we have passed 12 o’clock.
To determine the time 7 hours after 3 o’clock,
we add 3 and 7. Because we did not pass
12 o’clock, the time is 10 o’clock.

+ 7 hours
However, to determine
the time 10 hours after
7 o’clock, we must take
into consideration that
once we have passed
12 o’clock, we begin
again with 1. Therefore,
10 hours after 7 o’clock is
5 o’clock.
We will use the ⊕ symbol to denote addition
on a 12-hour clock. Using this notation,
3 ⊕ 7 =10
and
7⊕9=5
on a 12-hour clock.
We can also perform
subtraction on a 12-hour
clock. If the time now is
8 o’clock, then 7 hours ago
the time was 1 o’clock, which
is the difference between 8
and 7.
8−7=1
However, if the time
now is 3 o’clock, then
we see that 4 hours
ago it was 11 o’clock.
If we use the symbol ⊝ to denote subtraction
on a 12-hour clock, we can write
8 ⊝ 7 =1
and
3 ⊝ 4 = 11
on a 12-hour clock.
Example 5.1.1 Evaluate each of the following,
where ⊕ and indicate addition and subtraction,
respectively, on a 12-hour clock.
a. 9⊕8
b. 6 ⊕ 11
c. 3 9
d. 7 10
Solution.
a. 9⊕8=5
b. 6 ⊕ 11= 4
c. 3 9=6
d. 7 10 = 9
A similar example involves days-of-the-week
arithmetic. If we associate each day of the week
with a number, as shown below, then 5 days after
Friday is Wednesday and 20 days after Tuesday is
Monday.
Monday = 1
Tuesday = 2
Wednesday = 3
Thursday = 4
Friday = 5
Saturday = 6
Sunday = 0
We will use the ⊞ symbol for days-of-the-
week arithmetic to differentiate from the ⊕
symbol for clock arithmetic.
Thus,
5 ⊞ 5 = 3 and 2 ⊞ 20 = 1.

Situations such as these that repeat in cycles


are represented mathematically by using
modular arithmetic, or arithmetic modulo n.
Definition 5.1.1 Two integers and are said
to be congruent modulo , where is a natural
number if is an integer. In symbols,
.
The number is called the modulus. The
statement is called a congruence.
NOTE. We write (mod ) to indicate that is not
congruent to modulo that is, is not an
integer.

You might also like