Chapter 3 Elementary Number Theory and Methods of Proof.

Slides:



Advertisements
Similar presentations
1 In this lecture Number Theory Quotient and Remainder Floor and Ceiling Proofs Direct proofs and Counterexamples (cont.) Division into cases.
Advertisements

Lecture 3 – February 17, 2003.
Discrete Mathematics Lecture 3
PROOF BY CONTRADICTION
Chapter 3 Elementary Number Theory and Methods of Proof.
Chapter 3 Elementary Number Theory and Methods of Proof.
(CSC 102) Lecture 12 Discrete Structures. Previous Lecture Summary Floor and Ceiling Functions Definition of Proof Methods of Proof Direct Proof Disproving.
(CSC 102) Discrete Structures Lecture 14.
Copyright © Cengage Learning. All rights reserved. CHAPTER 5 SEQUENCES, MATHEMATICAL INDUCTION, AND RECURSION SEQUENCES, MATHEMATICAL INDUCTION, AND RECURSION.
3.3 Divisibility Definition If n and d are integers, then n is divisible by d if, and only if, n = dk for some integer k. d | n  There exists an integer.
Elementary Number Theory and Methods of Proof
– Alfred North Whitehead,
Quotient-Remainder Theory, Div and Mod
Number Theory and Cryptography
Copyright © Cengage Learning. All rights reserved.
CMSC 250 Discrete Structures Number Theory. 20 June 2007Number Theory2 Exactly one car in the plant has color H( a ) := “ a has color”  x  Cars –H(
Proof Must Have Statement of what is to be proven.
Chapter 4: Elementary Number Theory and Methods of Proof
Copyright © Cengage Learning. All rights reserved.
1 Set Theory. Notation S={a, b, c} refers to the set whose elements are a, b and c. a  S means “a is an element of set S”. d  S means “d is not an element.
1 Set Theory. Notation S={a, b, c} refers to the set whose elements are a, b and c. a  S means “a is an element of set S”. d  S means “d is not an element.
1 Number Theory and Methods of Proof Content: Properties of integer, rational and real numbers. Underlying theme: Methods of mathematical proofs.
Copyright © 2007 Pearson Education, Inc. Slide 8-1.
Chapter 4: Elementary Number Theory and Methods of Proof 4.2 Direct Proof and Counter Example II: Rational Numbers 1 Such, then, is the whole art of convincing.
(CSC 102) Discrete Structures Lecture 10.
Introduction to Proofs
Chapter 3 Elementary Number Theory and Methods of Proof.
Fall 2015 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.
Copyright © Curt Hill Divisibility and Modular Arithmetic A Topic in Number Theory.
Chapter 3 Elementary Number Theory and Methods of Proof.
1 Introduction to Abstract Mathematics Chapter 3: Elementary Number Theory and Methods of Proofs Instructor: Hayk Melikya Direct.
Copyright © Cengage Learning. All rights reserved. CHAPTER 11 ANALYSIS OF ALGORITHM EFFICIENCY ANALYSIS OF ALGORITHM EFFICIENCY.
Copyright © Cengage Learning. All rights reserved. CHAPTER 8 RELATIONS.
1 Methods of Proof Proof techniques in this handout –Direct proof –Division into cases –Proof by contradiction In this handout, the proof techniques will.
Week 3 - Friday.  What did we talk about last time?  Proving universal statements  Disproving existential statements  Rational numbers  Proof formatting.
Copyright © Cengage Learning. All rights reserved. CHAPTER 4 ELEMENTARY NUMBER THEORY AND METHODS OF PROOF ELEMENTARY NUMBER THEORY AND METHODS OF PROOF.
Copyright © Cengage Learning. All rights reserved. CHAPTER 8 RELATIONS.
1 CMSC 250 Chapter 3, Number Theory. 2 CMSC 250 Introductory number theory l A good proof should have: –a statement of what is to be proven –"Proof:"
1 Set Theory Second Part. 2 Disjoint Set let A and B be a set. the two sets are called disjoint if their intersection is an empty set. Intersection of.
Section 1.7. Definitions A theorem is a statement that can be shown to be true using: definitions other theorems axioms (statements which are given as.
Direct Proof and Counterexample I Lecture 11 Section 3.1 Fri, Jan 28, 2005.
Divisibility and Modular Arithmetic
Section 1.8. Proof by Cases Example: Let b = max{a, b} = a if a ≥ b, otherwise b = max{a, b} = b. Show that for all real numbers a, b, c
1 Discrete Mathematical Mathematical Induction ( الاستقراء الرياضي )
Chapter 4 With Question/Answer Animations 1. Chapter Motivation Number theory is the part of mathematics devoted to the study of the integers and their.
The Relation Induced by a Partition
Methods of Proof Proof techniques in this handout
Direct Proof and Counterexample IV: Division into Cases and the Quotient-Remainder Theorem For each of the following values of n and d, find integers q.
Modular Arithmetic with Applications to Cryptography
The Language of Sets If S is a set, then
Set Theory.
Direct Proof and Counterexample III: Divisibility
Reflexivity, Symmetry, and Transitivity
Chapter 3 The Real Numbers.
ELEMENTARY NUMBER THEORY AND METHODS OF PROOF
Direct Proof and Counterexample V: Floor and Ceiling
Copyright © Cengage Learning. All rights reserved.
Direct Proof and Counterexample IV
The sum of any two even integers is even.
Copyright © Cengage Learning. All rights reserved.
Copyright © Cengage Learning. All rights reserved.
Direct Proof and Counterexample IV
Chapter 11: Further Topics in Algebra
Copyright © Cengage Learning. All rights reserved.
Quotient-Remainder Theorem
Lecture 5 Number Theory & Proof Methods
Copyright © 2011 Pearson Education, Inc.  Publishing as Prentice Hall
Copyright © Cengage Learning. All rights reserved.
PROGRAMME: F.Y.B.Sc.I.T. (SEM-I) COURSE: DISCRETE MATHEMATICS
Presentation transcript:

Chapter 3 Elementary Number Theory and Methods of Proof

3.5 Direct Proof and Counterexample 5 Floor & Ceiling

Definition – Floor Given any real number x, the floor of x, denoted x, is defined as: x = n ⇔ n ≤ x < n + 1. – Ceiling Given any real number x, the ceiling of x, denoted x, is defined as: x = n ⇔ n-1 < x ≤ n.

Examples Compute x and x for the following: – 25/4 25/4 = 6+ 1/4 = 6 25/4 = 6+ 1/4 = 7 – = /1000 = = /1000 = 1

Examples The 1,370 soldiers at a military base a re given the opportunity to take buses into town for an evening out. Each bus holds a maximum of 40 passengers – What is the maximum number of buses the base will send if only full buses are sent? 1,370/40 = = 34 – How many buses will be needed if a partially full bus is allowed? 1,370/40 = = 35

Addition Property of Floor Does x + y = x + y? Can you find a counterexample where the case is not true. If so, then you can prove that equality is false. – How about x = ½ and y = ½ ? ½ + ½ = 1 = 1 ½ + ½ = = 0 hence, the equality is false.

Proving Floor Property Prove that for all real numbers x and for all integers m, x + m = x + m – Suppose x is a particular but arbitrarily chosen real number and m is particular but arbitrarily chosen integer. – Show: x + m = x + m Let n = x, n is integer n ≤ x < n+1 n + m ≤ x + m < n + m + 1 (add m to all sides) x + m = n + m (from previous) since n = x Thus x + m = x + m Theorem 3.5.1

Floor of n/2 Theorem Floor of n/2 – For any n, n/2 = n/2 (if n even) or (n-1)/2 (if n odd) Examples – Compute floor of n/2 for the following: n = 5: 5/2 = 2 ½ = 2 = (5-1)/2 = 2 n = 8: 8/2 = 4 = 4 = (8)/2 = 4

Div / Mod and Floor There is a relationship between div and mod and the floor function. – n div d = n / d – n mod d = n – dn/d From the quotient-remainder theorem, n = dq + r and 0≤r<d a relationship can be proven between quotient and floor. Theorem – If n is any integer and d is a positive integer, and if q = n/d and r = n – dn/d then, n = dq + r and 0≤r<d