Scribd
Upload
8 views21 pages

Chapter 2-2

This document discusses key concepts in number theory, including: 1. Divisibility and the division algorithm which defines how to divide one integer by another with a quotient and remainder. 2. Relatively prime numbers which are integers that only share 1 as a common factor. 3. The greatest common divisor (GCD) which is the largest integer that divides two numbers. Algorithms are provided to find the GCD. 4. Modular arithmetic including definitions of modulus, congruences, and properties of modular operations like addition and multiplication. Modular arithmetic treats integers modulo a given number.

Uploaded by

billiforu555
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
8 views21 pages

Chapter 2-2

This document discusses key concepts in number theory, including: 1. Divisibility and the division algorithm which defines how to divide one integer by another with a quotient and remainder. 2. Relatively prime numbers which are integers that only share 1 as a common factor. 3. The greatest common divisor (GCD) which is the largest integer that divides two numbers. Algorithms are provided to find the GCD. 4. Modular arithmetic including definitions of modulus, congruences, and properties of modular operations like addition and multiplication. Modular arithmetic treats integers modulo a given number.

Uploaded by

billiforu555
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/ 21

Information

Security
Number Theory

Divisibility
● A nonzero b divides a if a = mb for some m, where a, b, and m are integers. The notation b | a
is commonly used to mean b divides a
E.g 2|10 ; 2 (b) divides 10 (a) ; 10 (a) =5 (m) * 2 (b)

2
Number Theory

3
Number Theory

The Division Algorithm


● Given any positive integer n and any nonnegative integer a, if we divide a by n, we get an integer quotient q
and an integer remainder r that obey the following

4
Number Theory

Relatively Prime
● In number theory, two integers a and b are said to be relatively prime, mutually prime, or coprime (also
written co-prime) if the only positive integer (factor) that divides both of them is 1.

5
Number Theory

Greatest Common Divisor


● The greatest common divisor of a and b is the largest integer that divides both a and b. gcd(a, b) is the
notation.
● More formally, the positive integer c is said to be the greatest common divisor
of a and b if
1. c is a divisor of a and of b.
2. any divisor of a and b is a divisor of c
● gcd(a, b) = max[k, such that k |a and k |b]
● gcd(a, b) =
● gcd(a, -b) = gcd(-a, b) = gcd(-a, -b). In general, gcd(a, b) = gcd( a , b ).

6
Number Theory

7
Number Theory

Finding the Greatest Common Divisor


● For gcd( a , b ) there is no harm in assuming a > b or a = b
● Dividing a by b and applying the division algorithm, we can state:

● First consider the case in which r1 = 0. Therefore b divides a and clearly no larger number divides both b
and a, because that number would be larger than b. So we have d = gcd(a, b) = b
● The other possibility is r1 ≠ 0. For this case, we can state that d | r1. This is due to the basic properties of
divisibility: the relations d | a and d | b together imply that d | (a - q1b), which is the same as d | r1

8
Number Theory

Finding the Greatest Common Divisor

9
Number Theory

Finding the Greatest Common Divisor

10
Number Theory

Finding the Greatest Common Divisor

11
Number Theory

The Modulus
● If a is an integer and n is a positive integer, we define a mod n to be the remainder when a is divided by n.
The integer n is called the modulus.

● Two integers a and b are said to be congruent modulo n, if (a mod n) = (b mod n). This is written as

12
Number Theory

Properties of Congruences

13
Number Theory

Modular Arithmetic Operations

14
Number Theory

Modular Arithmetic Operations

15
Number Theory

Modular Arithmetic Operations

16
Number Theory

Modular Arithmetic Operations

17
Number Theory

Properties of Modular Arithmetic


● Zn as the set of nonnegative integers less than n

● This is referred to as the set of residues, or residue classes (mod n)


● To be more precise, each integer in Z n represents a residue class

● Of all the integers in a residue class, the smallest nonnegative integer is the
one used to represent the residue class. 18
Number Theory

Properties of Modular Arithmetic

19
Number Theory

20
THANKS!
Any questions?

21

You might also like