PROGRAMME: F.Y.B.Sc.I.T. (SEM-I) COURSE: DISCRETE MATHEMATICS

Slides:



Advertisements
Similar presentations
Discrete Mathematics Lecture 3
Advertisements

Chapter 3 Elementary Number Theory and Methods of Proof.
1 In this lecture  Number Theory ● Rational numbers ● Divisibility  Proofs ● Direct proofs (cont.) ● Common mistakes in proofs ● Disproof by counterexample.
Chapter 3 Elementary Number Theory and Methods of Proof.
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.
1 Section 2.4 The Integers and Division. 2 Number Theory Branch of mathematics that includes (among other things): –divisibility –greatest common divisor.
Elementary Number Theory and Methods of Proof
Chapter Primes and Greatest Common Divisors ‒Primes ‒Greatest common divisors and least common multiples 1.
– Alfred North Whitehead,
Basic properties of the integers
Copyright © Cengage Learning. All rights reserved.
Elementary Number Theory and Methods of Proof. Basic Definitions An integer n is an even number if there exists an integer k such that n = 2k. An integer.
Chapter II. THE INTEGERS
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(
Discrete Structures Chapter 2 Part B Mathematical Induction
Proof Must Have Statement of what is to be proven.
Copyright © Cengage Learning. All rights reserved.
WHOLE NUMBERS; INTEGERS Whole numbers: Z 0,+ = the natural numbers  {0}. Integers:
Fall 2002CMSC Discrete Structures1 Let us get into… Number Theory.
The Integers and Division
Week 3 - Wednesday.  What did we talk about last time?  Basic number theory definitions  Even and odd  Prime and composite  Proving existential statements.
CSCI 1900 Discrete Structures
Chapter 2 The Fundamentals: Algorithms, the Integers, and Matrices
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/2/2015Discrete Structures1 Let us get into… Number Theory.
(CSC 102) Discrete Structures Lecture 10.
February 24, 2015Applied Discrete Mathematics Week 4: Number Theory 1 Modular Arithmetic Let a be an integer and m be a positive integer. We denote by.
Chapter 3 Elementary Number Theory and Methods of Proof.
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.
P.1 Real Numbers. 2 What You Should Learn Represent and classify real numbers. Order real numbers and use inequalities. Find the absolute values of real.
1 Methods of Proof Proof techniques in this handout –Direct proof –Division into cases –Proof by contradiction In this handout, the proof techniques will.
Copyright © 2009 Pearson Education, Inc. Chapter 5 Section 1 - Slide 1 Chapter 1 Number Theory and the Real Number System.
Foundations of Discrete Mathematics Chapter 4 By Dr. Dalia M. Gil, Ph.D.
Slide Copyright © 2009 Pearson Education, Inc. Unit 1 Number Theory MM-150 SURVEY OF MATHEMATICS – Jody Harris.
Direct Proof and Counterexample III
Copyright © Cengage Learning. All rights reserved. CHAPTER 4 ELEMENTARY NUMBER THEORY AND METHODS OF PROOF ELEMENTARY NUMBER THEORY AND METHODS OF PROOF.
Real Number and the number Line. Number System Real numbers: is number that can be positive or negative and have decimal places after the point. Natural.
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:"
AF2. Turn off your phones Primes, gcd, some examples, reading.
1 Discrete Structures – CNS2300 Text Discrete Mathematics and Its Applications Kenneth H. Rosen (5 th Edition) Chapter 2 The Fundamentals: Algorithms,
Methods of Proof Lecture 4: Sep 20 (chapter 3 of the book, except 3.5 and 3.8)
Ch04-Number Theory and Cryptography 1. Introduction to Number Theory Number theory is about integers and their properties. We will start with the basic.
Number Theory Lecture 1 Text book: Discrete Mathematics and its Applications, 7 th Edition.
Slide Copyright © 2009 Pearson Education, Inc. Slide Copyright © 2009 Pearson Education, Inc. Chapter 1 Number Theory and the Real Number System.
§ 1.2 Symbols and Sets of Numbers. Martin-Gay, Beginning and Intermediate Algebra, 4ed 22 Set of Numbers Natural numbers – {1, 2, 3, 4, 5, 6...} Whole.
Dr Nazir A. Zafar Advanced Algorithms Analysis and Design Advanced Algorithms Analysis and Design By Dr. Nazir Ahmad Zafar.
Number Theory. Introduction to Number Theory Number theory is about integers and their properties. We will start with the basic principles of divisibility,
Methods of Proof Proof techniques in this handout
Mathematics Introduction & Formulas. Number System Number System is a writing system for expressing numbers.
Direct Proof and Counterexample III: Divisibility
Advanced Algorithms Analysis and Design
Integers and Division Section 3.4.
CMSC Discrete Structures
Thinking Critically 4.1 Divisibility Of Natural Numbers
MATH301- DISCRETE MATHEMATICS Copyright © Nahid Sultana Dr. Nahid Sultana Chapter 4: Number Theory and Cryptography.
Applied Discrete Mathematics Week 4: Number Theory
ELEMENTARY NUMBER THEORY AND METHODS OF PROOF
Direct Proof and Counterexample V: Floor and Ceiling
Foundations of Discrete Mathematics
Direct Proof and Counterexample III
Copyright © Cengage Learning. All rights reserved.
Copyright © Cengage Learning. All rights reserved.
Properties of Real Numbers
Copyright © Zeph Grunschlag,
Lecture 5 Number Theory & Proof Methods
Foundations of Discrete Mathematics
Applied Discrete Mathematics Week 10: Introduction to Counting
Copyright © 2011 Pearson Education, Inc.  Publishing as Prentice Hall
Number Theory.
Presentation transcript:

PROGRAMME: F.Y.B.Sc.I.T. (SEM-I) COURSE: DISCRETE MATHEMATICS SKM’S JASHBHAI MAGANBHAI PATEL COLLEGE OF COMMERCE PROGRAMME: F.Y.B.Sc.I.T. (SEM-I) COURSE: DISCRETE MATHEMATICS UNIT-II : NUMBER THEORY Miss. Aayesha Ansari Assistant Professor- Mathematics

Topics: Even Number Odd Number Prime Number Composite Number Rational Number Divisibility UFI: Unique Factorization Theorem The Quotient Reminder Theorem Absolute Value, Ceiling and Floor Value GCD: Greatest Common Divisor Ms. Aayesha Ansari (Asst.Prof. - Mathematics)

An integer n is even if, and only if, n equals twice some integer. i.e. if n is an integer, then n is even ⇔∃an integer k such that n =2k An integer n is odd if, and only if, n equals twice some integer plus 1. i.e. N is odd ⇔∃an integer k such that n =2k+1. Is 0 even? Is−301 odd? If a and b are integers, is 6a2b even? If a and b are integers, is 10a+8b+1 odd? e. Is every integer either even or odd? Ms. Aayesha Ansari (Asst.Prof. - Mathematics)

if n= rs, then either r or s equals n. An integer n is prime if and only if, n >1 and for all positive integers r and s, if n= rs, then either r or s equals n. i.e. n is prime ⇔ ∀ positive integers r and s, if n =rs then either r =1 and s =n or r =n and s =1. An integer n is composite if, and only if, n>1 and n=rs for some integers r and s with 1 < r < n and 1 < s < n. n is composite ⇔∃ positive integers r and s such that n =rs and 1 < r < n and 1 < s < n. Ms. Aayesha Ansari (Asst.Prof. - Mathematics)

b. Is every integer greater than 1 either prime or composite? Is 1 prime? b. Is every integer greater than 1 either prime or composite? c. Write the first six prime numbers. d. Write the first six composite numbers. Ms. Aayesha Ansari (Asst.Prof. - Mathematics)

No. A prime number is required to be greater than 1. Yes. Let n be any integer that is greater than 1. Consider all pairs of positive integers r and s such that n =rs. There exist at least two such pairs, namely r =n and s =1 and r =1 and s =n. Moreover, since n =rs, all such pairs satisfy the inequalities 1≤r ≤n and 1 ≤ s ≤ n. If n is prime, then the two displayed pairs are the only ways to write n as rs. Otherwise, there exists a pair of positive integers r and s such that n =rs and neither r nor s equals either 1 or n. Therefore, in this case 1 < r < n and 1 < s < n, and hence n is composite. 2, 3, 5, 7, 11, 13 4, 6, 8, 9, 10, 12 Ms. Aayesha Ansari (Asst.Prof. - Mathematics)

∃x ∈ D such that Q(x) is true if and only if, Q(x) is true for at least one x in D. Prove the following: ∃ an even integer n that can be written in two ways as a sum of two prime numbers. Suppose that r and s are integers. Prove the following: ∃ an integer k such that 22r +18s =2k. Ms. Aayesha Ansari (Asst.Prof. - Mathematics)

Let n =10. Then 10=5+5=3+7 and 3, 5, and 7 are all prime numbers. Let k =11r +9s. Then k is an integer because it is a sum of products of integers; and by substitution, 2k =2(11r +9s), which equals 22r +18s by the distributive law of algebra. Disprove the following statement by finding a counterexample: ∀ real numbers a and b, if a2 =b2 then a =b Ms. Aayesha Ansari (Asst.Prof. - Mathematics)

Generalizing from the particular: Ms. Aayesha Ansari (Asst.Prof. - Mathematics)

The sum of any two even integers is even. Suppose m and n are [particular but arbitrarily chosen] even integers,vthen show that m+n is even. By definition of even, m =2r and n =2s for some integers r and s. Then m+n =2r +2s by substitution m+n =2(r +s) by factoring out Note that r and s are integers therefore r + s is also is an integer (because it is a sum of integers.) m+n is some integer multiple of 2 Hence m + n is an integer. Ms. Aayesha Ansari (Asst.Prof. - Mathematics)

Show that “ there is a positive integer n such that n2+3n +2 is prime” is false. Suppose n is any arbitrarily chosen positive integer. Since n2+3n +2 = (n+1)(n+2) n+1 and n+2 both are integer as they are sum of integer also n+1 > 1 & n+2 > 1 ( since n> 1) n2+3n +2 is product of two integers both are greater than 1. Therefore n2+3n +2 not prime. Ms. Aayesha Ansari (Asst.Prof. - Mathematics)

A real number that is not rational is irrational. More formally, A real number r is rational if and only if, it can be expressed as a quotient of two integers with a non zero denominator. A real number that is not rational is irrational. More formally, if r is a real number, then r is rational ⇔ ∃ integers a and b such that r = a b and b =0. Is 10/3 a rational number? b. Is− 5 39 a rational number? c. Is 0.281 a rational number? d. Is 7 a rational number? e. Is 0 a rational number? Ms. Aayesha Ansari (Asst.Prof. - Mathematics)

Every integer is a rational number If neither of two real numbers is zero, then their product is also not zero Every integer is a rational number ∀real numbers r and s, if r and s are rational then r +s is rational. The double of a rational number is rational Ms. Aayesha Ansari (Asst.Prof. - Mathematics)

Ms. Aayesha Ansari (Asst.Prof. - Mathematics)

Is 21 divisible by 3? b. Does 5 divide 40? c. Does 7|42? d. Is 32 a multiple of−16? e. Is 6 a factor of 54? f. Is 7 a factor of−7? Ms. Aayesha Ansari (Asst.Prof. - Mathematics)

The only divisor of 1 are 1 or -1. If a and b are integers, is 3a+3b divisible by 3? If k and m are integers, is 10km divisible by 5? For all integers n and d, d∤n ⇔ n/d is not an integer. Prove that for all integers a, b, and c, if a|b and b|c, then a|c. For all integers a and b, if a|b and b|a then a =b. Ms. Aayesha Ansari (Asst.Prof. - Mathematics)

Ms. Aayesha Ansari (Asst.Prof. - Mathematics)

The Quotient Reminder Theorem Ms. Aayesha Ansari (Asst.Prof. - Mathematics)

Ms. Aayesha Ansari (Asst.Prof. - Mathematics)

Ms. Aayesha Ansari (Asst.Prof. - Mathematics)

Ms. Aayesha Ansari (Asst.Prof. - Mathematics)

Ms. Aayesha Ansari (Asst.Prof. - Mathematics)

Ms. Aayesha Ansari (Asst.Prof. - Mathematics)

Greatest Common Divisor Let a and b be integers that are not both zero. The greatest common divisor of a and b, denoted gcd(a,b), is that integer d with the following properties: d is a common divisor of both a and b. In other words, d|a and d|b. 2. For all integers c, if c is a common divisor of both a and b, then c is less than or equal to d. In other words, for all integers c,if c|a and c|b,then c ≤d. Ms. Aayesha Ansari (Asst.Prof. - Mathematics)

If a and b are any integers not both zero, and if q and r are any integers such that a =bq+r, then gcd(a,b) =gcd(b,r). gcd(a,b) =gcd(b,r) if a,b,q, and r are integers with a =b·q +r and 0≤r < b. 2. gcd(a,0) =a.] Ms. Aayesha Ansari (Asst.Prof. - Mathematics)

Thank you Ms. Aayesha Ansari (Asst.Prof. - Mathematics)