Scribd
Upload
39 views13 pages

Divisibility and Modular Arithmetic

Modular arithmetic involves dividing integers by a positive integer called the modulus and analyzing the remainders. It allows integers to be added, subtracted, and multiplied according to their remainders when divided by the modulus. For example, when doing arithmetic modulo 11, 7 + 9 = 5 and 7 * 9 = 8 because 16 divided by 11 leaves a remainder of 5, and 63 divided by 11 leaves a remainder of 8. Modular arithmetic is used in many areas of mathematics.

Uploaded by

Meky Quirante
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
39 views13 pages

Divisibility and Modular Arithmetic

Modular arithmetic involves dividing integers by a positive integer called the modulus and analyzing the remainders. It allows integers to be added, subtracted, and multiplied according to their remainders when divided by the modulus. For example, when doing arithmetic modulo 11, 7 + 9 = 5 and 7 * 9 = 8 because 16 divided by 11 leaves a remainder of 5, and 63 divided by 11 leaves a remainder of 8. Modular arithmetic is used in many areas of mathematics.

Uploaded by

Meky Quirante
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/ 13

DIVISIBILITY AND

MODULAR
ARITHMETIC
REPORTERS: ALJUN S. JUTBA
REBECCA S. TARAJI
Division

 When one integer is divided by a second nonzero integer, the quotient may or may
not be an integer.
 If a and b are integers with a = 0, we say that a divides b if there is an integer c
such that b = ac, or equivalently, if b over a is an integer. When a divides b we say
that a is a factor or divisor of b, and that b is a multiple of a. The notation a | b
denotes that a divides b. We write a | b when a does not divide b.
Example 1:

 Determine whether 3 | 7 and whether 3 | 12


3|7 3 | 12
= 3 not divisible by 7 = 12/3
= 7/3 =4
= 2.3
EXAMPLE 2:

 2 |8 5|13
=8/2 = 13 / 5
=4 = 2.6
The Division Algorithm

 When an integer is divided by a positive integer, there is a quotient and a remainder, as


the division algorithm shows.
 Let a be an integer and d a positive integer. Then there are unique integers q and r, with 0
≤ r<d, such that a = dq + r.
 In the equality given in the division algorithm, d is called the divisor, a is called the
dividend, q is called the quotient, and r is called the remainder. This notation is used to
express the quotient and remainder: q = a div d, r = a mod d.
Example 1:

1. What are the quotient and remainder when 101 is divided by 11


a = dq + r q = a div d
101 = 11* ? + ? = 101/11
101 = 11* 9 + 2 = 9.18
Example 2:

1. What are the quotient and remainder when −11 is divided by 3?


a = dq + r q = a div d
-11 = 3 * ? + ? = -11/3
-11 = 3 * (-4) + 1 = -3.67
Modular Arithmetic

 If a and b are integers and m is a positive integer, then a is congruent to b modulo m if m


divides a − b. We use the notation a ≡ b (mod m) to indicate that a is congruent to b
modulo m. We say that a ≡ b (mod m) is a congruence and that m is its modulus (plural
moduli). If a and b are not congruent modulo m, we write a ≡ b (mod m)
Example:

1. 17 Ξ 5 (mod 6) CHECKING:
17 – 5 = 12 6 17
12/6 = 2 12
5
2. 15 Ξ 3 (mod 12) 12 15
15 – 3 = 12 12
12/12 = 1 3
Example:

3. 10 Ξ 2 (mod 6) CHECKING:
10 – 2 = 8 6 10
8/6 = 1.3 6
4
4. 13 Ξ 3 (mod 13) 13 13
13 – 3 = 10 13
10/13 = 0.8 0
Example:

5. -1 Ξ 1 (mod 2) CHECKING:
-1-1 = -2 2 -1
-2/2 = -4 -2
1
Arithmetic Modulo m

 We can define arithmetic operations on Zm, the set of nonnegative integers less than m,
that is, the set {0, 1,...,m − 1}. In particular, we define addition of these integers, denoted
by +m by a +m b = (a + b) mod m, where the addition on the right-hand side of this
equation is the ordinary addition of integers, and we define multiplication of these
integers, denoted by ·m by a ·m b = (a · b) mod m, where the multiplication on the right-
hand side of this equation is the ordinary multiplication of integers. The operations +m
and ·m are called addition and multiplication modulo m and when we use these
operations, we are said to be doing arithmetic modulo m
Example:

Find 7 + 9 and 7 * 9

Solution: Using the definition of addition modulo 11,


we find that
7 + 9 = (7 + 9) mod 11 = 16 mod 11 = 5,
And
7 * 9 = (7 * 9) mod 11 = 63 mod 11 = 8.
Hence
7 + 9 = 5 and 7 * 9 = 8

You might also like