Top Banner
(CSC 102) Lecture 10 Discrete Structures
25

(CSC 102) Lecture 10 Discrete Structures. Previous Lectures Summary Divisors Prime Numbers Fundamental Theorem of Arithmetic Division Algorithm. Greatest.

Dec 26, 2015

Download

Documents

Kerrie Riley
Welcome message from author
This document is posted to help you gain knowledge. Please leave a comment to let me know what you think about it! Share it to your friends and learn new things together.
Transcript
Page 1: (CSC 102) Lecture 10 Discrete Structures. Previous Lectures Summary Divisors Prime Numbers Fundamental Theorem of Arithmetic Division Algorithm. Greatest.

(CSC 102)

Lecture 10

Discrete Structures

Page 2: (CSC 102) Lecture 10 Discrete Structures. Previous Lectures Summary Divisors Prime Numbers Fundamental Theorem of Arithmetic Division Algorithm. Greatest.

Previous Lectures Summary

• Divisors

• Prime Numbers

• Fundamental Theorem of Arithmetic

• Division Algorithm .

• Greatest common divisors.

• Least Common Multiple

• Relative Prime

Page 3: (CSC 102) Lecture 10 Discrete Structures. Previous Lectures Summary Divisors Prime Numbers Fundamental Theorem of Arithmetic Division Algorithm. Greatest.

Elementary Number Theory II

Page 4: (CSC 102) Lecture 10 Discrete Structures. Previous Lectures Summary Divisors Prime Numbers Fundamental Theorem of Arithmetic Division Algorithm. Greatest.

Today's Lecture

• Rational Number

• Properties of Rational Numbers

• Irrational numbers

• Absolute values

• Triangular inequality

• Floor and Ceiling functions

Page 5: (CSC 102) Lecture 10 Discrete Structures. Previous Lectures Summary Divisors Prime Numbers Fundamental Theorem of Arithmetic Division Algorithm. Greatest.

Rational Numbers

A real number r is rational if, and only if, r = a/b for some

integers a and b with b ≠ 0. A real number that is not

rational is irrational.

More formally, r is a rational number ↔ integers a and ∃

b such that r = a/b, b ≠ 0.

Determine whether following numbers are rational?a) 10/3b) -(5/39)c) 2/0d) 0.121212121212………

Page 6: (CSC 102) Lecture 10 Discrete Structures. Previous Lectures Summary Divisors Prime Numbers Fundamental Theorem of Arithmetic Division Algorithm. Greatest.

Cont….

a) Yes, 10/3 is quotient of the integers 10 and 3.

b) Yes, -5/39, which is a quotient of the integers.

c) No, 2/0 is not a number (division by 0 is not

allowed)

d) Yes,

Let x=0.1212121212121, then 100x=12.12121212…. 100x – x = 12.12121212….. - 0.1212121212…… = 12. 99∙x = 12 and so x=12/99. Therefore 0.12121212….. = 12/99, which is a ratio of two non zero

integers and thus is a rational number.

Page 7: (CSC 102) Lecture 10 Discrete Structures. Previous Lectures Summary Divisors Prime Numbers Fundamental Theorem of Arithmetic Division Algorithm. Greatest.

Properties Of Rational Number

Theorem: Every Integer is a rational NumberProof: Its obvious by the definition of rational Number.

Page 8: (CSC 102) Lecture 10 Discrete Structures. Previous Lectures Summary Divisors Prime Numbers Fundamental Theorem of Arithmetic Division Algorithm. Greatest.

Properties Of Rational Number

Theorem: The sum of any two rational Numbers is rational. Proof: Suppose r and s are rational numbers. Then by definition of rational,

r = a/b and s = c/dfor some integers a, b, c, and d with b ≠ 0 and d ≠ 0. So

r + s = a/b + c/d = (ad + bc)/b∙d. Let p = ad + bc and q = bd. Then p and q are integers because product and sum of integers are integers. Also q ≠ 0. Thus r+s = p/q. so r+s is a rational number.

Page 9: (CSC 102) Lecture 10 Discrete Structures. Previous Lectures Summary Divisors Prime Numbers Fundamental Theorem of Arithmetic Division Algorithm. Greatest.

Properties Of Rational Number

Theorem: The double of a rational number is rational.

Proof: Suppose r is rational number. Then 2r = r + r is a sum of two rational number and is a rational number.

Page 10: (CSC 102) Lecture 10 Discrete Structures. Previous Lectures Summary Divisors Prime Numbers Fundamental Theorem of Arithmetic Division Algorithm. Greatest.

Irrational Numbers

The number which is not rational is called irrational

number. i.e., a decimal representation which is neither

repeating and non recurring. For example

=1.41421356237309……

Note: Product of two irrational is not irrational.

2 3

2 * 2 2

2

Page 11: (CSC 102) Lecture 10 Discrete Structures. Previous Lectures Summary Divisors Prime Numbers Fundamental Theorem of Arithmetic Division Algorithm. Greatest.

Cont….

Visualizing some irrational numbers .

Page 12: (CSC 102) Lecture 10 Discrete Structures. Previous Lectures Summary Divisors Prime Numbers Fundamental Theorem of Arithmetic Division Algorithm. Greatest.

For any real number x, the absolute value of x, denoted |x|, is defined as follows:

Examples

|5|= 5, |-4/7|= -(-4/7)=4/7, |0|=0

Absolute Number

: x 0| |

: x < 0

xx

x

Page 13: (CSC 102) Lecture 10 Discrete Structures. Previous Lectures Summary Divisors Prime Numbers Fundamental Theorem of Arithmetic Division Algorithm. Greatest.

Lemma: For all real numbers r, −| r | ≤ r ≤ | r |.

Proof: Suppose r is any real number. We divide into cases according to whether r ≥ 0 or r < 0.

Case 1: (r ≥ 0): In this case, by definition of absolute value, |r| = r . Also, since r is positive and −|r | is negative, −|r | < r . Thus it is true that −|r| ≤ r ≤ |r |.

Case 2: (r<0): both sides by −1 gives that −|r| = r . Also, since r is negative and |r | is positive ,r < |r |. Thus it is also true in this case that −|r| ≤ r ≤ |r |. Hence, in either case,

−|r| ≤ r ≤ |r |

Absolute Number

Page 14: (CSC 102) Lecture 10 Discrete Structures. Previous Lectures Summary Divisors Prime Numbers Fundamental Theorem of Arithmetic Division Algorithm. Greatest.

Theorem:

Proof:

Cont…..

2

For any real number a.

a | |a

2 2 2 2

2

2 2

Since a ( ) ( ) , the number +a and -a are square roots of a .

if a 0, then +a is the non negative square root of a , if a<0, then -a is

the non negative square root of a . Since a denotes the

a a

2 2 2

2

non negative

square root of a , we have a , if a 0 Also a , if a < 0

that is a | |

a a

a

Page 15: (CSC 102) Lecture 10 Discrete Structures. Previous Lectures Summary Divisors Prime Numbers Fundamental Theorem of Arithmetic Division Algorithm. Greatest.

Theorem: For all real numbers x and y,

|x + y| ≤ |x| + |y|.

Proof: Suppose x and y, are any real numbers.Case 1: (x + y ≥ 0):In this case, |x + y| = x + y, x ≤ |x| and y ≤ |y|.Hence, |x + y| = x + y ≤ |x| + |y|.

Case 2 (x + y<0): In this case, |x + y| = −(x + y) and also, −x ≤ |−x| = |x| and −y ≤ |− y| = |y|.It follows, that

|x + y| = (−x) + (−y) ≤ |x| + |y|.

Hence in both cases |x + y| ≤ |x| + |y|

Triangular Inequality

Page 16: (CSC 102) Lecture 10 Discrete Structures. Previous Lectures Summary Divisors Prime Numbers Fundamental Theorem of Arithmetic Division Algorithm. Greatest.

Given any real number x, the floor of x, denoted , is defined as follows:

= that unique integer n such that n ≤ x < n + 1.Symbolically, if x is a real number and n is an integer, then

= n ⇔ n ≤ x < n + 1.

Floor and Ceiling

x

x

x

Page 17: (CSC 102) Lecture 10 Discrete Structures. Previous Lectures Summary Divisors Prime Numbers Fundamental Theorem of Arithmetic Division Algorithm. Greatest.

Ceiling

Given any real number x, the ceiling of x, denoted , is defined as follows:

= that unique integer n such that n − 1 < x ≤ n.Symbolically, if x is a real number and n is an integer, then

= n ⇔ n − 1 < x ≤ n.

x

x

x

Page 18: (CSC 102) Lecture 10 Discrete Structures. Previous Lectures Summary Divisors Prime Numbers Fundamental Theorem of Arithmetic Division Algorithm. Greatest.

Examples

Compute and for each of the following values of x:

a. 25/4b. 0.999c. −2.01

Solution:

d. 25/4 = 6.25 and 6 < 6.25 < 7; hence

b. 0 < 0.999 < 1; hence .

c. −3 < −2.01 < −2; hence

x x

25 / 4 6 and 25/4 7

0.999 0 and 0.999 1

2.01 3 and -2.01 2

Page 19: (CSC 102) Lecture 10 Discrete Structures. Previous Lectures Summary Divisors Prime Numbers Fundamental Theorem of Arithmetic Division Algorithm. Greatest.

The 1,370 students at a college are given the opportunity to take buses to an out-of-town game. Each bus holds a maximum of 40 passengers.

a. For reasons of economy, the athletic director will send only full buses. What is the maximum number of buses the athletic director will send?

b. If the athletic director is willing to send one partially filled bus, how many buses will be needed to allow all the students to take the trip?

Example

). 1370 / 40 34.25 34

b). 1370/40 34.25 35

a

Page 20: (CSC 102) Lecture 10 Discrete Structures. Previous Lectures Summary Divisors Prime Numbers Fundamental Theorem of Arithmetic Division Algorithm. Greatest.

General Values of Floor

Solution:

If is an integer, what are k and 1/ 2 ? Why?k k

12

Suppose is an integer. Then

becuase is an integer and 1

and

1k+ becuase is an integer and 1

2

k

k k k k k k

k k k k k

Page 21: (CSC 102) Lecture 10 Discrete Structures. Previous Lectures Summary Divisors Prime Numbers Fundamental Theorem of Arithmetic Division Algorithm. Greatest.

Cont…

Is the following statement true or false? For all realNumbers x and y,

Solution: The statement is false, take x = y = 1/2, then

Hence

x y x y

1 11 1

2 2

where as

1 10 0 0

2 2

x y

x y

x y x y

Page 22: (CSC 102) Lecture 10 Discrete Structures. Previous Lectures Summary Divisors Prime Numbers Fundamental Theorem of Arithmetic Division Algorithm. Greatest.

Theorem: For all numbers x and all integers m,

Proof: Suppose a real number x and an integer m are

given. Let n = that unique integer n such that,

n ≤ x < n + 1. Add m to all sides to obtain n + m ≤ x + m <

n + m + 1. Now n + m is an integer and so, by definition of

floor,

But n = . Hence by substitution

Properties of Floor

x m x m

x

x m n m x

x m x m

Page 23: (CSC 102) Lecture 10 Discrete Structures. Previous Lectures Summary Divisors Prime Numbers Fundamental Theorem of Arithmetic Division Algorithm. Greatest.

Theorem:

Proof: Suppose n is a integer. Then either n is odd or n is even.Case 1: in this case n = 2k+1 for some integers k.

Cont….For any integer

; if n is even2

12; if n is odd

2

n

nn

n

2 1 2 1

2 2 2 2

1

2

because is an integer and 1/ 2 1. But since

12 1 1 2

2

n k k

k k

k k k k

nn k n k k

Page 24: (CSC 102) Lecture 10 Discrete Structures. Previous Lectures Summary Divisors Prime Numbers Fundamental Theorem of Arithmetic Division Algorithm. Greatest.

also. Since both the left-hand and right-hand sides equal k,

they are equal to each other. That is,

Case 2: In this case, n = 2k for some integer k.

Since k=n/2 by the definition of even number. So

Cont…

2

nk

2

2 2

n kk k

2 2

n nk

Page 25: (CSC 102) Lecture 10 Discrete Structures. Previous Lectures Summary Divisors Prime Numbers Fundamental Theorem of Arithmetic Division Algorithm. Greatest.

Lecture Summary

• Rational Number

• Properties of Rational Numbers

• Irrational numbers

• Absolute values

• Triangular inequality

• Floor and Ceiling