37
1 Properties of Integers Objectives At the end of this unit, students should be able to: State the division algorithm Apply the division algorithm Find the gcd using Euclidean algorithm Use the gcd to represent a linear combination of two integers Find the least common multiple Represent an integer as a product of primes

1 Properties of Integers Objectives At the end of this unit, students should be able to: State the division algorithm Apply the division algorithm Find

Embed Size (px)

Citation preview

Page 1: 1 Properties of Integers Objectives At the end of this unit, students should be able to: State the division algorithm Apply the division algorithm Find

1

Properties of Integers

Objectives

At the end of this unit, students should be able to: State the division algorithm Apply the division algorithm Find the gcd using Euclidean algorithm Use the gcd to represent a linear combination of

two integers Find the least common multiple Represent an integer as a product of primes

Page 2: 1 Properties of Integers Objectives At the end of this unit, students should be able to: State the division algorithm Apply the division algorithm Find

2

Contents

Division algorithm Greatest common divisor Fundamental Theorem of Arithmetic

Page 3: 1 Properties of Integers Objectives At the end of this unit, students should be able to: State the division algorithm Apply the division algorithm Find

3

Division Algorithm

Definition 4.1

Given a, b Z and b 0,

b divides a, written as b | a,

if there is an integer n such that a = bn.

b is a divisor of a,

or a is a multiple of b.

E.g 2 | 8, 3 | 15, etc.

3 I 7

Page 4: 1 Properties of Integers Objectives At the end of this unit, students should be able to: State the division algorithm Apply the division algorithm Find

4

Theorem 4.3

For all a, b, c Z (set of integers),

a. 1|a and a|0.

b. [(a | b) (b | a)] a = b.

c. [(a | b) (b | c)] a | c.

d. a | b a | bx for all x Z.

Page 5: 1 Properties of Integers Objectives At the end of this unit, students should be able to: State the division algorithm Apply the division algorithm Find

5

Theorem 4.3 (cont.)

e. If x = y + z, for some x, y, z Z, and a divides two of the three integers x, y, and z, then a divides the remaining integer.

f. [(a | b) (a | c)] a | (bx + cy), for all x, y Z. (The expression bx + cy is called a linear combination of b, c.)

g. For 1 i n, let ci Z. If a divides each ci,

then a| (c1x1 + c2x2 + … + cnxn), where xi Z

for all 1 i n.

Page 6: 1 Properties of Integers Objectives At the end of this unit, students should be able to: State the division algorithm Apply the division algorithm Find

6

Proof (part f)

If a|b and a|c, then b = am and c = an, for some m, n Z.

So bx + cy = (am)x + (an)y = a(mx + ny)

Since bx + cy = a(mx + ny), with mx + ny Z, it follows that

a | (bx + cy).

Page 7: 1 Properties of Integers Objectives At the end of this unit, students should be able to: State the division algorithm Apply the division algorithm Find

7

Page 8: 1 Properties of Integers Objectives At the end of this unit, students should be able to: State the division algorithm Apply the division algorithm Find

8

Question

???

Page 9: 1 Properties of Integers Objectives At the end of this unit, students should be able to: State the division algorithm Apply the division algorithm Find

9

Prime and Composite Numbers

Page 10: 1 Properties of Integers Objectives At the end of this unit, students should be able to: State the division algorithm Apply the division algorithm Find

10

Prime Numbers

LEMMA 4.1

If n Z+ and n is composite, then there is a prime p such that p | n.

E.g 5 | 20 (5 is a prime and 20 a composite)

Theorem 4.4

There are infinitely many primes.

Page 11: 1 Properties of Integers Objectives At the end of this unit, students should be able to: State the division algorithm Apply the division algorithm Find

11

Division Algorithm

Theorem 4.5

The Division Algorithm. If a, b Z, with b > 0, then there exist unique q, r Z

with a = qb + r, 0 r < b.

q: quotient

r: remainder

b: divisor

a: dividend.

Page 12: 1 Properties of Integers Objectives At the end of this unit, students should be able to: State the division algorithm Apply the division algorithm Find

12

Page 13: 1 Properties of Integers Objectives At the end of this unit, students should be able to: State the division algorithm Apply the division algorithm Find

13

Page 14: 1 Properties of Integers Objectives At the end of this unit, students should be able to: State the division algorithm Apply the division algorithm Find

14

Page 15: 1 Properties of Integers Objectives At the end of this unit, students should be able to: State the division algorithm Apply the division algorithm Find

15

Greatest Common Divisor

Objectives:

On completion this unit, you should be able to:

1. Find the gcd using Euclidean algorithm

2. Use the gcd to represent a linear combination of two integers

3. Find the least common multiple

4. Represent an integer as a product of primes

Page 16: 1 Properties of Integers Objectives At the end of this unit, students should be able to: State the division algorithm Apply the division algorithm Find

16

Contents

Greatest common divisor Least common multiple Fundamental Theorem of Arithmetic

Page 17: 1 Properties of Integers Objectives At the end of this unit, students should be able to: State the division algorithm Apply the division algorithm Find

17

Common Divisor

c is a common divisor of a and b thenc | b and c | be.g. 3 | 6 and 3 | 9 3 is a common divisor of 6 and 9.1 | 42 and 1 | 702 | 42 and 2 | 707 | 42 and 7 | 7014 | 42 and 14 | 70(1,2, 7, 14) are common divisors.The greatest common divisor (gcd) is 14.

Page 18: 1 Properties of Integers Objectives At the end of this unit, students should be able to: State the division algorithm Apply the division algorithm Find

18

Greatest Common Divisor

Definition 4.3

Let a, b Z, where either a 0 or b 0. Then c Z+ is called a greatest common divisor of a, b if

i) c|a and c|b (that is, c is a common divisor of a, b), and

ii) for any common divisor d of a and b, we have d|c. (i.e. d ≤ c)

Page 19: 1 Properties of Integers Objectives At the end of this unit, students should be able to: State the division algorithm Apply the division algorithm Find

19

Greatest Common Divisor

Theorem 4.6For all a, b Z+, there exists a unique c Z+ that is the greatest

common divisor of a, b.

gcd(a, b) = gcd(b, a)For each a Z, if a 0, then

gcd(a, 0) = |a|.when a, b Z+, we have

gcd(–a, b) = gcd(a, –b) = gcd(– a, – b) = gcd(a, b)gcd(0, 0) not defined and is of no interest to us.

Page 20: 1 Properties of Integers Objectives At the end of this unit, students should be able to: State the division algorithm Apply the division algorithm Find

20

Relatively Prime integers

From Theorem 4.6, not only does gcd(a, b) exist but that gcd(a, b) is also the smallest positive integer we can write as a linear combination of a and b.

Integers a and b are called relatively prime when gcd(a, b) = 1 that is, when there exist x, y Z with ax + by = 1.

Page 21: 1 Properties of Integers Objectives At the end of this unit, students should be able to: State the division algorithm Apply the division algorithm Find

21

Page 22: 1 Properties of Integers Objectives At the end of this unit, students should be able to: State the division algorithm Apply the division algorithm Find

22

Page 23: 1 Properties of Integers Objectives At the end of this unit, students should be able to: State the division algorithm Apply the division algorithm Find

23

Page 24: 1 Properties of Integers Objectives At the end of this unit, students should be able to: State the division algorithm Apply the division algorithm Find

24

Question

???

Page 25: 1 Properties of Integers Objectives At the end of this unit, students should be able to: State the division algorithm Apply the division algorithm Find

25

Page 26: 1 Properties of Integers Objectives At the end of this unit, students should be able to: State the division algorithm Apply the division algorithm Find

26

Page 27: 1 Properties of Integers Objectives At the end of this unit, students should be able to: State the division algorithm Apply the division algorithm Find

27

Activity

Find gcd(72,63), gcd(330,156)

Page 28: 1 Properties of Integers Objectives At the end of this unit, students should be able to: State the division algorithm Apply the division algorithm Find

28

Least Common Multiple

Definition 4.4

For a, b, c Z+, c is called a common multiple of a, b if c is a multiple of both a and b.

Furthermore, c is the least common multiple of a, b if it is the smallest of all positive integers.

We denote c by lcm(a, b).

Page 29: 1 Properties of Integers Objectives At the end of this unit, students should be able to: State the division algorithm Apply the division algorithm Find

29

Page 30: 1 Properties of Integers Objectives At the end of this unit, students should be able to: State the division algorithm Apply the division algorithm Find

30

Page 31: 1 Properties of Integers Objectives At the end of this unit, students should be able to: State the division algorithm Apply the division algorithm Find

31

Page 32: 1 Properties of Integers Objectives At the end of this unit, students should be able to: State the division algorithm Apply the division algorithm Find

32

Fundamental Theorem of Arithmetic

Page 33: 1 Properties of Integers Objectives At the end of this unit, students should be able to: State the division algorithm Apply the division algorithm Find

33

Page 34: 1 Properties of Integers Objectives At the end of this unit, students should be able to: State the division algorithm Apply the division algorithm Find

34

Page 35: 1 Properties of Integers Objectives At the end of this unit, students should be able to: State the division algorithm Apply the division algorithm Find

35

Page 36: 1 Properties of Integers Objectives At the end of this unit, students should be able to: State the division algorithm Apply the division algorithm Find

36

Page 37: 1 Properties of Integers Objectives At the end of this unit, students should be able to: State the division algorithm Apply the division algorithm Find

37