Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
59 views

3 Euclidean Algorithm

This document defines key concepts related to integers, primes, and the Euclidean algorithm. It defines even and odd integers, prime and composite integers. It presents the division algorithm and states that the greatest common divisor (GCD) of two integers is the largest integer that divides both. It then presents several theorems about the GCD and Euclidean algorithm, including that the Euclidean algorithm can be used to find the GCD of two integers by repeated division.

Uploaded by

jeffrey santos
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
59 views

3 Euclidean Algorithm

This document defines key concepts related to integers, primes, and the Euclidean algorithm. It defines even and odd integers, prime and composite integers. It presents the division algorithm and states that the greatest common divisor (GCD) of two integers is the largest integer that divides both. It then presents several theorems about the GCD and Euclidean algorithm, including that the Euclidean algorithm can be used to find the GCD of two integers by repeated division.

Uploaded by

jeffrey santos
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 16

Euclidean

Algorithm
Definition 3.1
i. An integer n is even iff 2 divides n.
ii. An integer n is odd iff does not divide n.
Definition 3.2
An integer is prime iff and the only divisors of p are 1 and .
Definition 3.3
An integer n is composite iff and n is not prime.
Theorem 3.1 (Division Algorithm)
Let . Then, there exist unique integers and such that The
integers and are called the quotient and the remainder
respectively in the division of by .
Corollary 3.1
If and are integers with , then there exist unique integers
and such that
Exercises
Find and illustrating Corollary 3.1.
Definition 3.4
Let . The greatest common divisor of and denoted by is the
positive integer satisfying the following conditions.

i. If and , then
Theorem 3.2
If and are integers not both of which are zero, then the set
is precisely the set of all multiples of .
Definition 3.5
Two integers and not both of which are zero, are said to be
relatively prime iff .
Theorem 3.3
Let If , then there exists such that .
Theorem 3.4
Let If , then there exists such that .
Theorem 3.5
If , then .
Theorem 3.6
If and with , then .
Theorem 3.7
If with , then .
Theorem 3.8
Let iff

i. there exist , then


Theorem 3.9 (Euclidean Algorithm)
Let By repeated applications of the division algorithm,

Then, .
Illustration:
1. Find .
2. Find such that .
Exercises
1. Show that if and are integers with then .
2. Prove that if such that and then
3. Find .
4. Find such that .

You might also like