Scribd
Upload
5 views2 pages

Module 1

This module on Modular Arithmetic is part of an Abstract Algebra course, focusing on the importance of mathematics and the application of modulo concepts. It defines congruence modulo n and presents examples and theorems related to modular arithmetic. The document is prepared by Ariel C. Lopez and approved by academic authorities.

Uploaded by

wbelisario46
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
5 views2 pages

Module 1

This module on Modular Arithmetic is part of an Abstract Algebra course, focusing on the importance of mathematics and the application of modulo concepts. It defines congruence modulo n and presents examples and theorems related to modular arithmetic. The document is prepared by Ariel C. Lopez and approved by academic authorities.

Uploaded by

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

Binalonan, Pangasinan

MODULE TOPICS

Modular Arithmetic
MODULE 1
Course Title: Abstract Algebra
Course Code: M114
Name: _______________________________________ Course and Year: ____________________
Date and Time Allotment:
I. Module Objectives
1. Appreciate and be able to articulate the importance of mathematics in one’s self
2. Use modulo concepts and properties to solve modular arithmetic problems and compose proofs;
II. Lecture and Discussions
Definition
In studying the integers we have seen that is useful to write a = qb + r. Often we can solve
problems by considering only the remainder, r. This throws away some of the information, but is useful
because there are only finitely many remainders to consider. The study of the properties of the system of
remainders is called modular arithmetic. It is an essential tool in number theory.
In this section we give a careful treatment of the system called the integers modulo (or mod)

Definition: Let a, b ∈ Z and let n ∈ N. We say 1 that a is congruent to b modulo n , written a ≡ b (mod n)
Let a, b and n are integers and n > 0.

• We write a ≡ b mod n if and only if n divides a – b.


• a and b have the same remainder when they are divided by n. (n ≠ 1)
n is called the modulus
b is called the remainder
How (mod n) works:
Example:
(mod 2) = (0 , 1)
(mod 5) = (0 , 1 , 2 . 3 , 4)

Another example in a ≡ b (mod n) form:


1. 10 ≡ 14 (mod 4)
• Since 4 | (10 − 14).
• 10 ÷ 4 = 2 r 2 , 14 ÷ 4 = 3 r 2
2. 23 ≡ 3 (mod 10)
• Since 10 | (23 − 3).
• 23 ÷ 10 = 2 r 3 , 3 ÷ 10 = 0 r 3
Binalonan, Pangasinan

3. 10000 ≡ 4 (mod 7)
• Since 7 | (10000 − 4).
• 10000 ÷ 7 = 1428 r 4 , 4÷7=0r4
4. 29 ≡ 15 (mod 7)
• Since 7 | (29 −15).
• 29 ÷ 7 = 4 r 1 , 15 ÷ 7 = 2 r 1
Since any two integers are congruent mod 1, we usually require n ≥ 2 from now on. Congruence modulo n generalizes
the notion of divisibility, since a ≡ 0 (mod n) ⇐⇒ n | a.
Theorem Let n > 1 and let a, b, c, d ∈ Z. Then
a) If a = b then a ≡ b (mod n).
b) a ≡ a (mod n).
c) If a ≡ b (mod n) then b ≡ a (mod n).
d) If a ≡ b (mod n) and b ≡ c (mod n) then a ≡ c (mod n).
e) If a ≡ b (mod n) and c ≡ d (mod n) then a + c ≡ b + d (mod n) and ac ≡ bd (mod n).
Proof
a) a − b = 0 so n | (a − b).
b) Follows from (a).
c) If n | (a − b) then n | (b − a).
d) If n | (a − b) and n | (b − c) then n | ((a − b) + (b − c)) so n | (a − c).
e) Suppose n | (a − b) and n | (c − d). Then n | ((a − b) + (c − d)) so n | ((a + c) − (b + d)), that is, a +
c ≡ b + d (mod n).

Prepared By: Noted By: Approved By:


ARIEL C. LOPEZ DR. RAYMOND N. CLARO GLORIA C. NEMEDEZ, Ph. D.
Faculty, CTE Dean, CTE Assistant Vice President for Academic Affairs

You might also like