CSE 20 Discrete Math. Winter, January 24 (Day 5) Number Theory. Instructor: Neil Rhodes. Proving Quantified Statements

Similar documents
CSE 20 Discrete Math. Algebraic Rules for Propositional Formulas. Summer, July 11 (Day 2) Number Systems/Computer Arithmetic Predicate Logic

MATH 13 FINAL EXAM SOLUTIONS

Final Exam Review. 2. Let A = {, { }}. What is the cardinality of A? Is

Functions. Definition 1 Let A and B be sets. A relation between A and B is any subset of A B.

INFINITY: CARDINAL NUMBERS

Today. Wrapup of Polynomials...and modular arithmetic. Coutability and Uncountability.

Chapter 1 : The language of mathematics.

MATH 201 Solutions: TEST 3-A (in class)

5. Use a truth table to determine whether the two statements are equivalent. Let t be a tautology and c be a contradiction.

RED. Name: Instructor: Pace Nielsen Math 290 Section 1: Winter 2014 Final Exam

Reed-Solomon code. P(n + 2k)

Math.3336: Discrete Mathematics. Cardinality of Sets

Section Summary. Sequences. Recurrence Relations. Summations. Examples: Geometric Progression, Arithmetic Progression. Example: Fibonacci Sequence

Section 1.7 Proof Methods and Strategy. Existence Proofs. xp(x). Constructive existence proof:

CSE 20 DISCRETE MATH. Fall

Department of Computer Science University at Albany, State University of New York Solutions to Sample Discrete Mathematics Examination II (Fall 2007)

Chapter 2: The Logic of Quantified Statements. January 22, 2010

MATH 3300 Test 1. Name: Student Id:

Section Summary. Proof by Cases Existence Proofs

Section 3.1: Direct Proof and Counterexample 1

Announcements. CS243: Discrete Structures. Sequences, Summations, and Cardinality of Infinite Sets. More on Midterm. Midterm.

Discrete Mathematics for CS Spring 2007 Luca Trevisan Lecture 27

Notes for Math 290 using Introduction to Mathematical Proofs by Charles E. Roberts, Jr.

Cardinality of Sets. P. Danziger

MATH 2200 Final LC Review

MATH FINAL EXAM REVIEW HINTS

A Short Review of Cardinality

ADVANCED CALCULUS - MTH433 LECTURE 4 - FINITE AND INFINITE SETS

Discrete Mathematics & Mathematical Reasoning Predicates, Quantifiers and Proof Techniques

MATH 13 SAMPLE FINAL EXAM SOLUTIONS

CSE 311: Foundations of Computing. Lecture 26: Cardinality

Fundamentals of Pure Mathematics - Problem Sheet

Discrete Mathematics. W. Ethan Duckworth. Fall 2017, Loyola University Maryland

586 Index. vertex, 369 disjoint, 236 pairwise, 272, 395 disjoint sets, 236 disjunction, 33, 36 distributive laws

Review Sheet for the Final Exam of MATH Fall 2009

Notation Index. gcd(a, b) (greatest common divisor) NT-16

Predicate Logic: Sematics Part 1

Sets are one of the basic building blocks for the types of objects considered in discrete mathematics.

University of Toronto Faculty of Arts and Science Solutions to Final Examination, April 2017 MAT246H1S - Concepts in Abstract Mathematics

THE LOGIC OF QUANTIFIED STATEMENTS. Predicates and Quantified Statements I. Predicates and Quantified Statements I CHAPTER 3 SECTION 3.

Section 7.5: Cardinality

MATH 2112/CSCI 2112, Discrete Structures I Winter 2007 Toby Kenney Homework Sheet 5 Hints & Model Solutions

Background for Discrete Mathematics

CITS2211 Discrete Structures (2017) Cardinality and Countability

Great Theoretical Ideas in Computer Science. Lecture 5: Cantor s Legacy

Announcements. Read Section 2.1 (Sets), 2.2 (Set Operations) and 5.1 (Mathematical Induction) Existence Proofs. Non-constructive

Definition: Let S and T be sets. A binary relation on SxT is any subset of SxT. A binary relation on S is any subset of SxS.

Discrete Mathematics and Probability Theory Spring 2014 Anant Sahai Note 20. To Infinity And Beyond: Countability and Computability

Discrete Mathematics 2007: Lecture 5 Infinite sets

Math 3361-Modern Algebra Lecture 08 9/26/ Cardinality

not to be republished NCERT REAL NUMBERS CHAPTER 1 (A) Main Concepts and Results

MATH 220 (all sections) Homework #12 not to be turned in posted Friday, November 24, 2017

Disproof MAT231. Fall Transition to Higher Mathematics. MAT231 (Transition to Higher Math) Disproof Fall / 16

In N we can do addition, but in order to do subtraction we need to extend N to the integers

The Different Sizes of Infinity

Lecture Notes 1 Basic Concepts of Mathematics MATH 352

Exercises for Unit VI (Infinite constructions in set theory)

Mathematical Structures Combinations and Permutations

One-to-one functions and onto functions

MTH 299 In Class and Recitation Problems SUMMER 2016

Problem 1: Suppose A, B, C and D are finite sets such that A B = C D and C = D. Prove or disprove: A = B.

Section 2.1: Introduction to the Logic of Quantified Statements

CSCE 222 Discrete Structures for Computing. Review for Exam 1. Dr. Hyunyoung Lee !!!

UNIVERSITY OF VICTORIA DECEMBER EXAMINATIONS MATH 122: Logic and Foundations

NOTE: You have 2 hours, please plan your time. Problems are not ordered by difficulty.

Propositional Logic, Predicates, and Equivalence

Finite and Infinite Sets

Harvard CS 121 and CSCI E-207 Lecture 6: Regular Languages and Countability

Lecture Notes on DISCRETE MATHEMATICS. Eusebius Doedel

Part IA Numbers and Sets

Cardinality of sets. Cardinality of sets

In N we can do addition, but in order to do subtraction we need to extend N to the integers

CSE 215: Foundations of Computer Science Recitation Exercises Set #5 Stony Brook University. Name: ID#: Section #: Score: / 4

Mathematics 220 Workshop Cardinality. Some harder problems on cardinality.

Countable and uncountable sets. Matrices.

Intermediate Math Circles March 6, 2013 Number Theory I

CSE 1400 Applied Discrete Mathematics Proofs

MATH 2200 Final Review

Mathematics Review for Business PhD Students Lecture Notes

Math 105A HW 1 Solutions

CSE 20 DISCRETE MATH. Winter

Chapter 2 - Basics Structures MATH 213. Chapter 2: Basic Structures. Dr. Eric Bancroft. Fall Dr. Eric Bancroft MATH 213 Fall / 60

Mathematics 220 Midterm Practice problems from old exams Page 1 of 8

Example ( x.(p(x) Q(x))) ( x.p(x) x.q(x)) premise. 2. ( x.(p(x) Q(x))) -elim, 1 3. ( x.p(x) x.q(x)) -elim, x. P(x) x.

Carmen s Core Concepts (Math 135)

Preparing for the CS 173 (A) Fall 2018 Midterm 1

Exercises Exercises. 2. Determine whether each of these integers is prime. a) 21. b) 29. c) 71. d) 97. e) 111. f) 143. a) 19. b) 27. c) 93.

Packet #2: Set Theory & Predicate Calculus. Applied Discrete Mathematics

2.1 Sets. Definition 1 A set is an unordered collection of objects. Important sets: N, Z, Z +, Q, R.

Lecture 3. Logic Predicates and Quantified Statements Statements with Multiple Quantifiers. Introduction to Proofs. Reading (Epp s textbook)

To Infinity and Beyond

CS 514, Mathematics for Computer Science Mid-semester Exam, Autumn 2017 Department of Computer Science and Engineering IIT Guwahati

A Readable Introduction to Real Mathematics

Proof by Contradiction

Cool Results on Primes

Economics 204 Summer/Fall 2017 Lecture 1 Monday July 17, 2017

LECTURE NOTES DISCRETE MATHEMATICS. Eusebius Doedel

LECTURE NOTES DISCRETE MATHEMATICS. Eusebius Doedel

Fundamentals of Mathematics (MATH 1510)

Discrete Mathematical Structures: Theory and Applications

Transcription:

CSE 20 Discrete Math Proving Quantified Statements Prove universal statement: x D, P(x)Q(x) Exhaustive enumeration Generalizing from the generic particular Winter, 2006 Suppose x is in D and P(x) Therefore Q(x) Example: The difference of two odd numbers is even January 24 (Day 5) Number Theory Instructor: Neil Rhodes 2 Proving Quantified Statements Prove existential statement: x D: P(x) Constructive proof Display an x Give a set of directions for finding x Nonconstructive proof Proof by contradiction (assume non-existence and show a contradiction) Show x must exist Example: In a group of 367 people, at least two share a birthday Disproving Quantified Statements Disprove universal statement: x D, P(x) Counterexample Show an x in D where P(x), but not Q(x) Example: All numbers of the form 2 n - 1 (n>1) are prime Disprove existential statement: x D: P(x) Equivalent to: Prove Or, alternatively, Therefore, best bet is generalizing from the generic particular. Example: There exists a prime which can be written as the square of an integer > 1 3 4

Number Theory The study of the properties of integers Mathematics is the queen of the sciences and number theory is the queen of mathematics. Gauss Relationship to Computer Science Logical thinking Proof for important fundamental CS theorem very related to number-theory proof Cryptography Z (Zahl = Number) Z + Important Sets N (Natural) No general agreement on whether it includes 0 Q (Quotient) R (Real) P (Prime) 5 6 Prime Numbers A prime, p, is a positive integer (greater than 1) whose only positive divisors are 1 and p Quantified statement: A number greater than one that is not prime is called composite Quantified statement: Prime Numbers Unique Prime Factorization (the fundamental theorem of arithmetic) Any integer 2 can be written as the multiple of a unique set of prime numbers. m and n are relatively prime if they share no common factors We write m n The set of primes is infinite x Z+, y Z+: y > x P(y) Proving "2 is irrational Assume it can be written as m/n where n 2 and m n 2m 2 =n 2 n 2 is even n is even 2m 2 = (2k) 2 m 2 = 2k 2 m 2 is even But since m n, m 2 and n 2 can t share a common factor 7 8

A set is countable if: the number of elements is finite Countably Infinite or, it has the same number of elements as N, (countably infinite) Equivalent cardinality Given two sets A and B If there exists a function f: AB, such that f is bijective: a A, a A, f(a)=f(a )a=a (injective, or one-to-one) b B, a A: f(a)=b (surjective, or onto) A = B Hilbert s Grand Hotel The Grand Hotel has an infinite number of rooms and is all full One person wants to checkin A bus containing a countably infinite number of people want to checkin Examples odd integers = Z f(x) = (x-1)/2 Z + = N f(x) = x-1 P = N A countably infinite number of such buses arrive 9 10 Rationals are Countable Reals are not Countable Let s look at a subset of the reals: R*= [0, 1) Assume the existence of an bijective function, f: R*N Diagonalization Argument 11 12 Watch o

N =" o Infinite Hierarchy of Infinities Given a set S, the powerset of S, P(S), is of higher cardinality Diagonalization argument We say "i is the next largest set size after "i-1 Continuum hypothesis: There is no set whose size is between that of the integers and that of the reals Assume there exists routine: Halting Problem Boolean Halt(String program, String input) (returns true if program executed on input halts, false otherwise) We can write: Boolean trouble(string program) { if not Halt(program, program) return false; else while (true) ; } Boolean trouble2(string program) { return not Halt(program, program); } Diagonalization (with trouble2): 13 14 Rationals and Irrationals Rationals are closed under addition, subtraction, multiplication, and division Primes of the form 2 n -1 For example, 3, 7, 31, 63 Mersenne Primes Any such prime must actually be of the form 2 p -1 Because 2 km -1 = 2 m -1(2 m(k-1) + 2 m(k-2 ) + 1) 43rd known Mersenne prime: 2 30,402,457-1 Contains >9,000,000 digits Irrationals are not closed under multiplication Irrational * irrational may equal rational What about irrational * (non-zero) rational? 15 16

Make a list of natural numbers Sieve of Erataosthenes Circle the first number, 2, and mark all its multiples Repeat Circle the first uncircled unmarked number Mark all its multiples Distribution of Prime Numbers There are approximately x/ln x primes # x (The size of the nth prime is approximately n/ln n) Circled numbers are prime 17 18