CIS Spring 2018 (instructor Val Tannen)
|
|
- Roger Dickerson
- 6 years ago
- Views:
Transcription
1 CIS Spring 2018 (instructor Val Tannen) Lecture 09 Tuesday, February 13 PROOFS and COUNTING Figure 1: Too Many Pigeons Theorem 9.1 (The Pigeonhole Principle (PHP)) If k + 1 or more pigeons fly to roost in k pigeonholes then there is at least one pigeonhole that shelters at least two or more pigeons. or, equivalently, If f : A B is a function such that A > B then there exist at least two elements x 1, x 2 A such that x 1 x 2 but f(x 1 ) = f(x 2 ). (Why are these two formulations equivalent?) 1 From the second formulation we see that the Pigeonhole Principle is the contrapositive of the Injection Rule that we encountered before. We continue to accept them without proof. 1 In France, they say Principle of the Drawers instead of PHP. It might be easier to place k + 1 pieces of underwear in k drawers than to persuade k + 1 pigeons to fly into k pigeonholes together. 1
2 For example, the (PHP) can be used to conclude that in any group of thirteen people there are at least two who are born in the same month. Example 9.2 A drawer in a dark room contains red socks, green socks, blue socks, and orange socks. How many socks must you take from the drawer to be sure that you have at least one matching pair? (We assume that any two socks of the same color form a matching pair.) Solution: PHP can be applied by letting the pigeonholes correspond to the four colors: red, green, blue, and orange and the pigeons correspond to the socks. If we pick five or more socks we are guaranteed to have a matching pair. A weird application much beloved by some textbook authors is to prove that in NYC (or another big enough city) there exist two people with exactly the same number of hairs on their head. Surely, the premed students among you already know that the number of hairs on a person s head is at most 200,000. Actually, this only requires a city with 200,000 non-bald inhabitants. With 1M or 10M such inhabitants we can say more, by generalizing PHP as follows. But first, we ll need to formalize a couple concepts. In general, for integers r and n, the division r/n may not yield an integer. The notation r/n is called ceiling and can be defined for any real number, together with its dual, floor: Definition 9.3 Let x R. The ceiling of x, denoted x is the smallest integer z such that z x. Note that: x x < x + 1 The floor of x, denoted x is the largest integer z such that z x. Note that: x 1 < x < x With this definition in hand, we may now generalize PHP. Theorem 9.4 (The Generalized PHP) r objects are placed into n boxes. For any integer k such that r > k n there is at least one box containing at least k + 1 objects. or, equivalently, If f : A B is a function and k is an positive integer such that A > k B then there exist at least k + 1 pairwise distinct elements x 1,..., x k+1 A such that f(x 1 ) = = f(x k+1 ). or, equivalently, If r objects are placed into n boxes then there is at least one box containing at least r/n objects. Proof: Here is a proof of the last formulation of the three for the GPHP (the generalized PHP). You should prove on your own that the first two formulation are equivalent to the last one. 2
3 We prove the contrapositive. That is, we will show that if each box contains at most r/n 1 objects then the total number of objects is not equal to r. Assume that each box contains at most r/n 1 objects. Then, the total number of objects is at most ( r ) ( r ) n 1 < n n n = r Thus we have shown that the total number of objects is strictly less than r. Using the generalized pigeonhole principle we can conclude that among 100 people, there are at least 100/12 = 9 who are born in the same month. Example 9.5 Suppose each point in the plane is colored either red or blue. Show that there always exist two points of the same color that are exactly one foot apart. Solution: Consider an equilateral triangle with the length of each side being one feet. The three corners of the triangle are colored red or blue. By PHP, two of these three points must have the same color. (Note that the set of points in the plane is infinite, but we do not apply PHP to an infinite set!) Example 9.6 Given a sequence of n integers, show that there exists among them some integers which appear in consecutive positions in the sequence and whose sum is a multiple of n. Solution: Let x 1, x 2,..., x n be the sequence of n integers. Consider the following n sums. x 1, x 1 + x 2, x 1 + x 2 + x 3,..., x 1 + x x n If any of these n sums is divisible by n, then we are done. Otherwise, each of the n sums have a non-zero remainder when divided by n. There are at most n 1 different possible remainders: 1, 2,... n 1. Since there are n sums, by PHP, at least two of the n sums have the same remainder, call it r, when divided by n and let x 1 + x x p and x 1 + x x q with p q, be the two sums that give remainder r. Then, for some integers c 1 and c 2, x 1 + x x p = c 1 n + r and x 1 + x x q = c 2 n + r W.l.o.g. assume p < q. Subtracting the two sums, we get x p x q = (c 2 c 1 )n Hence, x p x q is divisible by n. 3
4 Example 9.7 Show that in any group of six people there are three mutual friends or three mutual strangers. (The unrealistic assumption here is that any two people are either friends or strangers.) Solution: Consider one of the six people, say A. The remaining five people are either friends of A or they do not know A. By PHP, at least 3 of the five people are either friends of A or are unacquainted with A. In the former case, if any two of the three people are friends then these two along with A would be mutual friends, otherwise the three people would be strangers to each other. The proof for the latter case, when three or more people are unacquainted with A, proceeds in the same manner. (BTW, this is a particular case of a famous theorem of Ramsey. We will come back to this later in the course.) Theorem 9.8 (Erdös-Szekeres) Let n be a positive integer. Every sequence of n distinct integers must contain a monotone (increasing or decreasing) subsequence of length n + 1. Proof: Subsequence means that some of the elements are chosen and listed in the same order. The elements of the subsequence need not be consecutive or adjacent in the sequence. Suppose we have a sequence of distinct integers. (We don t need this in the proof, but w.l.o.g. you can assume that they are positive; why?) For each integer x in the sequence let u x be the length of a longest increasing subsequence that starts at x (we count x in the length) and let d x be the length of a longest decreasing subsequence that starts at x (again we count x in the length). Lemma 9.9 If x y are distinct integers in the sequence such that x occurs before y then (u x, d x ) (u y, d y ). Proof: Indeed, if x < y then u x > u y (why?) and if x > y then d x > d y. Now we prove the theorem by contradiction. Suppose that all monotone subsequences have length at most n. Then for each x in the sequence we have u x, d x [1..n]. We use PHP with the pairs (i, j) [1..n] [1..n] as pigeonholes, with the integers in the sequence as pigeons, and with pigeon x being placed in pigeonhole (u x, d x ). Since we have n integers in the sequence but only n 2 pairs in [1..n] [1..n], we must have (u x, d x ) = (u y, d y ) for some distinct x y. This contradicts the Lemma. 2 2 Paul Erdös was one of the most famous mathematicians of the 20th century, google Erdos and read the Wikipedia page. 4
5 PROOFS: INDUCTION The Principle of (Ordinary) Induction of the form is a way (not the only way!) of proving statements for all natural numbers n we have P (n) where P (n) is a predicate whose truth depends on n. Examples of P (n) s of interest: (A) P (n) is n = 2 n+1 1 (B) P (n) is n = n(n + 1)/2 (C) P (n) is n 2 = n(n + 1)(2n + 1)/6 Proof Pattern (BASE CASE) Prove P (0). (INDUCTION STEP) Let k be an arbitrary natural number. Prove P (k) P (k + 1). Then you can conclude that for all natural numbers n we have P (n) (i.e., n N P (n)). The P (k) inside the box in the induction step is called the INDUCTION HYPOTHESIS (IH). The IH only makes sense within the induction step because it refers to a k that is quantified at the beginning of the induction step with let k be.... To understand a proof by induction it helps if the proof writer clearly identifies the IH. We shall accept the Principle of Ordinary Induction without proof. (It is very close to the axioms of Mathematics itself.) We shall see later the Principle of Strong Induction, hence the need for the adjective ordinary, and below the Well-Ordering Principle. These three are logically equivalent to each other, a fact that is not so hard to prove. Try it. Example 9.10 ((A) from above) Prove the following: n N n = 2 n+1 1 Solution: Here P (n) is n = 2 n+1 1. (BASE CASE) 2 0 = 1 and = 2 1 = 1. Check. 5
6 (INDUCTION STEP) Let k be an arbitrary natural number. Assume k = 2 k+1 1. (This is the IH.) (And WTS k+1 = 2 k+2 1.) We manipulate the LHS of the equality we want to show: k+1 = ( k ) + 2 k+1 = 2 k k+1 (by IH) = 2 2 k+1 1 = 2 k+2 1 BTW, this identity gives the summation of the geometric progression with ration 2. Sometimes the predicate P (n) used in a proof by induction is not true for n = 0, it is not even defined for n = 0, as is the case in the Examples (B) and (C) above. The following variation on the induction proof pattern takes care of such situations. Proof Pattern (BASE CASE) Prove P (n 0 ). (INDUCTION STEP) Let k N such that k n 0. Prove P (k) P (k + 1). Then you can conclude that for all natural numbers n n 0 we have P (n) (i.e., n N n n 0 P (n)). Using this proof pattern you should try to prove (B) and (C), with n 0 = 1. We will do a slightly more complicated example. Example 9.11 For big enough natural numbers n we have n 2 < 2 n. Part of the problem is to make precise big enough. Solution: To figure out the big enough we try n = 0, 1, 2, 3, 4, 5, 6 and we guess that it can be n 5. (BASE CASE) n = = 25 < 32 = 2 5. Check. (INDUCTION STEP) Let k 5. Assume (IH) k 2 < 2 k. (And WTS (k + 1) 2 < 2 k+1.) Note that (k + 1) 2 = k 2 + 2k + 1 and that 2 k+1 = 2 2 k = 2 k + 2 k. We already know by IH that k 2 < 2 k. So it would suffice to also show 2k + 1 k 2. We make this into a separate Lemma: 6
7 Lemma 9.12 For big enough m N we have 2m + 1 < m 2. Solution: Here, as above, we will assume that m 5. We then see that: 1 < m = 2m + 1 < 2m + m = 3m Similarly, we see that: Combining these two results, we have 3 < m = 3m < m 2 2m + 1 < 3m < m 2 as desired. In fact, we could have proven this Lemma with induction! We leave it as an exercise for the reader. Returning to the main proof, we have that: (k + 1) 2 = k 2 + 2k + 1 < k 2 + k 2 < 2 k + 2 k = 2 k+1 We have shown that n 5 n 2 < 2 n. 7
Putnam Pigeonhole Principle October 25, 2005
Putnam Pigeonhole Principle October 5, 005 Introduction 1. If n > m pigeons are placed into m boxes, then there exists (at least) one box with at least two pigeons.. If n > m, then any function f : [n]
More informationPigeonhole Principle and Ramsey Theory
Pigeonhole Principle and Ramsey Theory The Pigeonhole Principle (PP) has often been termed as one of the most fundamental principles in combinatorics. The familiar statement is that if we have n pigeonholes
More informationCIS Spring 2018 (instructor Val Tannen)
CIS 160 - Spring 018 (instructor Val Tannen) Lecture 11 Tuesday, February 0 PROOFS: STRONG INDUCTION Example 1.1 Any integer n can be written as the product of one or more (not necessarily distinct) prime
More informationCounting Methods. CSE 191, Class Note 05: Counting Methods Computer Sci & Eng Dept SUNY Buffalo
Counting Methods CSE 191, Class Note 05: Counting Methods Computer Sci & Eng Dept SUNY Buffalo c Xin He (University at Buffalo) CSE 191 Discrete Structures 1 / 48 Need for Counting The problem of counting
More informationCS 210 Foundations of Computer Science
IIT Madras Dept. of Computer Science & Engineering CS 210 Foundations of Computer Science Debdeep Mukhopadhyay Counting-II Pigeonhole Principle If n+1 or more objects (pigeons) are placed into n boxes,
More informationCS Foundations of Computing
IIT KGP Dept. of Computer Science & Engineering CS 30053 Foundations of Computing Debdeep Mukhopadhyay Pigeon Hole Principle 1 Pigeonhole Principle If n+1 or more objects (pigeons) are placed into n boxes,
More informationLECTURE 1. Logic and Proofs
LECTURE 1 Logic and Proofs The primary purpose of this course is to introduce you, most of whom are mathematics majors, to the most fundamental skills of a mathematician; the ability to read, write, and
More informationReview 3. Andreas Klappenecker
Review 3 Andreas Klappenecker Final Exam Friday, May 4, 2012, starting at 12:30pm, usual classroom Topics Topic Reading Algorithms and their Complexity Chapter 3 Logic and Proofs Chapter 1 Logic and Proofs
More informationDefinition: 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.
4 Functions Before studying functions we will first quickly define a more general idea, namely the notion of a relation. A function turns out to be a special type of relation. Definition: Let S and T be
More informationCMSC 250 Spring 2016: Final Exam Review Questions Key
CMSC 250 Spring 2016: Final Exam Review Questions Key 1 Description and disclaimer Use these questions to help review for the upcoming final exam. Note, these questions are not necessarily representative
More informationCSCE 222 Discrete Structures for Computing. Review for the Final. Hyunyoung Lee
CSCE 222 Discrete Structures for Computing Review for the Final! Hyunyoung Lee! 1 Final Exam Section 501 (regular class time 8:00am) Friday, May 8, starting at 1:00pm in our classroom!! Section 502 (regular
More informationLecture 3: Miscellaneous Techniques
Lecture 3: Miscellaneous Techniques Rajat Mittal IIT Kanpur In this document, we will take a look at few diverse techniques used in combinatorics, exemplifying the fact that combinatorics is a collection
More informationMonochromatic and Rainbow Colorings
Chapter 11 Monochromatic and Rainbow Colorings There are instances in which we will be interested in edge colorings of graphs that do not require adjacent edges to be assigned distinct colors Of course,
More informationMATH 402 : 2017 page 1 of 6
ADMINISTRATION What? Math 40: Enumerative Combinatorics Who? Me: Professor Greg Smith You: students interested in combinatorics When and Where? lectures: slot 00 office hours: Tuesdays at :30 6:30 and
More information2. Two binary operations (addition, denoted + and multiplication, denoted
Chapter 2 The Structure of R The purpose of this chapter is to explain to the reader why the set of real numbers is so special. By the end of this chapter, the reader should understand the difference between
More informationF 2k 1 = F 2n. for all positive integers n.
Question 1 (Fibonacci Identity, 15 points). Recall that the Fibonacci numbers are defined by F 1 = F 2 = 1 and F n+2 = F n+1 + F n for all n 0. Prove that for all positive integers n. n F 2k 1 = F 2n We
More informationMATH 324 Summer 2011 Elementary Number Theory. Notes on Mathematical Induction. Recall the following axiom for the set of integers.
MATH 4 Summer 011 Elementary Number Theory Notes on Mathematical Induction Principle of Mathematical Induction Recall the following axiom for the set of integers. Well-Ordering Axiom for the Integers If
More informationBasic Logic and Proof Techniques
Chapter 3 Basic Logic and Proof Techniques Now that we have introduced a number of mathematical objects to study and have a few proof techniques at our disposal, we pause to look a little more closely
More informationSome Review Problems for Exam 1: Solutions
Math 3355 Fall 2018 Some Review Problems for Exam 1: Solutions Here is my quick review of proof techniques. I will focus exclusively on propositions of the form p q, or more properly, x P (x) Q(x) or x
More informationNotes. Combinatorics. Combinatorics II. Notes. Notes. Slides by Christopher M. Bourke Instructor: Berthe Y. Choueiry. Spring 2006
Combinatorics Slides by Christopher M. Bourke Instructor: Berthe Y. Choueiry Spring 2006 Computer Science & Engineering 235 Introduction to Discrete Mathematics Sections 4.1-4.6 & 6.5-6.6 of Rosen cse235@cse.unl.edu
More informationReading and Writing. Mathematical Proofs. Slides by Arthur van Goetham
Reading and Writing Mathematical Proofs Slides by Arthur van Goetham What is a proof? Why explanations are not proofs What is a proof? A method for establishing truth What establishes truth depends on
More informationAlgorithms: Background
Algorithms: Background Amotz Bar-Noy CUNY Amotz Bar-Noy (CUNY) Algorithms: Background 1 / 66 What is a Proof? Definition I: The cogency of evidence that compels acceptance by the mind of a truth or a fact.
More informationLecture 6: The Pigeonhole Principle and Probability Spaces
Lecture 6: The Pigeonhole Principle and Probability Spaces Anup Rao January 17, 2018 We discuss the pigeonhole principle and probability spaces. Pigeonhole Principle The pigeonhole principle is an extremely
More informationContribution of Problems
Exam topics 1. Basic structures: sets, lists, functions (a) Sets { }: write all elements, or define by condition (b) Set operations: A B, A B, A\B, A c (c) Lists ( ): Cartesian product A B (d) Functions
More informationWriting Mathematical Proofs
Writing Mathematical Proofs Dr. Steffi Zegowitz The main resources for this course are the two following books: Mathematical Proofs by Chartrand, Polimeni, and Zhang How to Think Like a Mathematician by
More informationPropositional Logic, Predicates, and Equivalence
Chapter 1 Propositional Logic, Predicates, and Equivalence A statement or a proposition is a sentence that is true (T) or false (F) but not both. The symbol denotes not, denotes and, and denotes or. If
More informationOutline Goals and Assumptions Real Numbers Rational and Irrational. L11: Numbers. Alice E. Fischer
L11: Numbers Alice E. Fischer CSCI 1166 Discrete Mathematics for Computing March 5-8, 2018 1 Goals and Assumptions 2 Real Numbers 3 Rational and Irrational Assumptions We rely the following assumptions:
More informationWUCT121. Discrete Mathematics. Numbers
WUCT121 Discrete Mathematics Numbers 1. Natural Numbers 2. Integers and Real Numbers 3. The Principle of Mathematical Induction 4. Elementary Number Theory 5. Congruence Arithmetic WUCT121 Numbers 1 Section
More informationLECTURE NOTES DISCRETE MATHEMATICS. Eusebius Doedel
LECTURE NOTES on DISCRETE MATHEMATICS Eusebius Doedel 1 LOGIC Introduction. First we introduce some basic concepts needed in our discussion of logic. These will be covered in more detail later. A set is
More informationMCS-236: Graph Theory Handout #A4 San Skulrattanakulchai Gustavus Adolphus College Sep 15, Methods of Proof
MCS-36: Graph Theory Handout #A4 San Skulrattanakulchai Gustavus Adolphus College Sep 15, 010 Methods of Proof Consider a set of mathematical objects having a certain number of operations and relations
More informationmeans is a subset of. So we say A B for sets A and B if x A we have x B holds. BY CONTRAST, a S means that a is a member of S.
1 Notation For those unfamiliar, we have := means equal by definition, N := {0, 1,... } or {1, 2,... } depending on context. (i.e. N is the set or collection of counting numbers.) In addition, means for
More informationCDM Combinatorial Principles
CDM Combinatorial Principles 1 Counting Klaus Sutner Carnegie Mellon University Pigeon Hole 22-in-exclusion 2017/12/15 23:16 Inclusion/Exclusion Counting 3 Aside: Ranking and Unranking 4 Counting is arguably
More informationLecture 5 : Proofs DRAFT
CS/Math 240: Introduction to Discrete Mathematics 2/3/2011 Lecture 5 : Proofs Instructor: Dieter van Melkebeek Scribe: Dalibor Zelený DRAFT Up until now, we have been introducing mathematical notation
More informationIntroduction to Decision Sciences Lecture 10
Introduction to Decision Sciences Lecture 10 Andrew Nobel October 17, 2017 Mathematical Induction Given: Propositional function P (n) with domain N + Basis step: Show that P (1) is true Inductive step:
More informationMath 324 Summer 2012 Elementary Number Theory Notes on Mathematical Induction
Math 4 Summer 01 Elementary Number Theory Notes on Mathematical Induction Principle of Mathematical Induction Recall the following axiom for the set of integers. Well-Ordering Axiom for the Integers If
More informationLecture 3 - Tuesday July 5th
Lecture 3 - Tuesday July 5th jacques@ucsd.edu Key words: Identities, geometric series, arithmetic series, difference of powers, binomial series Key concepts: Induction, proofs of identities 3. Identities
More informationMath 10850, fall 2017, University of Notre Dame
Math 10850, fall 2017, University of Notre Dame Notes on first exam September 22, 2017 The key facts The first midterm will be on Thursday, September 28, 6.15pm-7.45pm in Hayes-Healy 127. What you need
More informationCHAPTER 8: EXPLORING R
CHAPTER 8: EXPLORING R LECTURE NOTES FOR MATH 378 (CSUSM, SPRING 2009). WAYNE AITKEN In the previous chapter we discussed the need for a complete ordered field. The field Q is not complete, so we constructed
More informationDirect Proof MAT231. Fall Transition to Higher Mathematics. MAT231 (Transition to Higher Math) Direct Proof Fall / 24
Direct Proof MAT231 Transition to Higher Mathematics Fall 2014 MAT231 (Transition to Higher Math) Direct Proof Fall 2014 1 / 24 Outline 1 Overview of Proof 2 Theorems 3 Definitions 4 Direct Proof 5 Using
More informationFinite and Infinite Sets
Chapter 9 Finite and Infinite Sets 9. Finite Sets Preview Activity (Equivalent Sets, Part ). Let A and B be sets and let f be a function from A to B..f W A! B/. Carefully complete each of the following
More informationThe Pigeonhole Principle
The Pigeonhole Principle 2 2.1 The Pigeonhole Principle The pigeonhole principle is one of the most used tools in combinatorics, and one of the simplest ones. It is applied frequently in graph theory,
More information6 CARDINALITY OF SETS
6 CARDINALITY OF SETS MATH10111 - Foundations of Pure Mathematics We all have an idea of what it means to count a finite collection of objects, but we must be careful to define rigorously what it means
More informationLecture Notes on DISCRETE MATHEMATICS. Eusebius Doedel
Lecture Notes on DISCRETE MATHEMATICS Eusebius Doedel c Eusebius J. Doedel, 009 Contents Logic. Introduction............................................................................... Basic logical
More informationLecture 4: Constructing the Integers, Rationals and Reals
Math/CS 20: Intro. to Math Professor: Padraic Bartlett Lecture 4: Constructing the Integers, Rationals and Reals Week 5 UCSB 204 The Integers Normally, using the natural numbers, you can easily define
More informationCS 173: Induction. Madhusudan Parthasarathy University of Illinois at Urbana-Champaign. February 7, 2016
CS 173: Induction Madhusudan Parthasarathy University of Illinois at Urbana-Champaign 1 Induction February 7, 016 This chapter covers mathematical induction, and is an alternative resource to the one in
More informationa. See the textbook for examples of proving logical equivalence using truth tables. b. There is a real number x for which f (x) < 0. (x 1) 2 > 0.
For some problems, several sample proofs are given here. Problem 1. a. See the textbook for examples of proving logical equivalence using truth tables. b. There is a real number x for which f (x) < 0.
More informationEquivalence of Propositions
Equivalence of Propositions 1. Truth tables: two same columns 2. Sequence of logical equivalences: from one to the other using equivalence laws 1 Equivalence laws Table 6 & 7 in 1.2, some often used: Associative:
More informationMath 38: Graph Theory Spring 2004 Dartmouth College. On Writing Proofs. 1 Introduction. 2 Finding A Solution
Math 38: Graph Theory Spring 2004 Dartmouth College 1 Introduction On Writing Proofs What constitutes a well-written proof? A simple but rather vague answer is that a well-written proof is both clear and
More informationn f(k) k=1 means to evaluate the function f(k) at k = 1, 2,..., n and add up the results. In other words: n f(k) = f(1) + f(2) f(n). 1 = 2n 2.
Handout on induction and written assignment 1. MA113 Calculus I Spring 2007 Why study mathematical induction? For many students, mathematical induction is an unfamiliar topic. Nonetheless, this is an important
More informationChapter 1. Pigeonhole Principle
Chapter 1. Pigeonhole Principle Prof. Tesler Math 184A Fall 2017 Prof. Tesler Ch. 1. Pigeonhole Principle Math 184A / Fall 2017 1 / 16 Pigeonhole principle https://commons.wikimedia.org/wiki/file:toomanypigeons.jpg
More informationCombinatorics. But there are some standard techniques. That s what we ll be studying.
Combinatorics Problem: How to count without counting. How do you figure out how many things there are with a certain property without actually enumerating all of them. Sometimes this requires a lot of
More informationThe following techniques for methods of proofs are discussed in our text: - Vacuous proof - Trivial proof
Ch. 1.6 Introduction to Proofs The following techniques for methods of proofs are discussed in our text - Vacuous proof - Trivial proof - Direct proof - Indirect proof (our book calls this by contraposition)
More informationNotes on arithmetic. 1. Representation in base B
Notes on arithmetic The Babylonians that is to say, the people that inhabited what is now southern Iraq for reasons not entirely clear to us, ued base 60 in scientific calculation. This offers us an excuse
More informationMath 31 Lesson Plan. Day 2: Sets; Binary Operations. Elizabeth Gillaspy. September 23, 2011
Math 31 Lesson Plan Day 2: Sets; Binary Operations Elizabeth Gillaspy September 23, 2011 Supplies needed: 30 worksheets. Scratch paper? Sign in sheet Goals for myself: Tell them what you re going to tell
More informationMat Week 8. Week 8. gcd() Mat Bases. Integers & Computers. Linear Combos. Week 8. Induction Proofs. Fall 2013
Fall 2013 Student Responsibilities Reading: Textbook, Section 3.7, 4.1, & 5.2 Assignments: Sections 3.6, 3.7, 4.1 Proof Worksheets Attendance: Strongly Encouraged Overview 3.6 Integers and Algorithms 3.7
More informationCMPSCI 250: Introduction to Computation. Lecture 11: Proof Techniques David Mix Barrington 5 March 2013
CMPSCI 250: Introduction to Computation Lecture 11: Proof Techniques David Mix Barrington 5 March 2013 Proof Techniques Review: The General Setting for Proofs Types of Proof: Direct, Contraposition, Contradiction
More informationTHE LOGIC OF QUANTIFIED STATEMENTS. Predicates and Quantified Statements I. Predicates and Quantified Statements I CHAPTER 3 SECTION 3.
CHAPTER 3 THE LOGIC OF QUANTIFIED STATEMENTS SECTION 3.1 Predicates and Quantified Statements I Copyright Cengage Learning. All rights reserved. Copyright Cengage Learning. All rights reserved. Predicates
More informationCIS Spring 2018 (instructor Val Tannen) Midterm 1 Review WITH SOLUTIONS
CIS 160 - Spring 018 (instructor Val Tannen) Midterm 1 Review WITH SOLUTIONS Posted Thursday February On Thursday March 1 we will have our first midterm exam during the usual class time. The exam will
More informationStudent Responsibilities Week 8. Mat Section 3.6 Integers and Algorithms. Algorithm to Find gcd()
Student Responsibilities Week 8 Mat 2345 Week 8 Reading: Textbook, Section 3.7, 4.1, & 5.2 Assignments: Sections 3.6, 3.7, 4.1 Induction Proof Worksheets Attendance: Strongly Encouraged Fall 2013 Week
More information1 Sequences and Summation
1 Sequences and Summation A sequence is a function whose domain is either all the integers between two given integers or all the integers greater than or equal to a given integer. For example, a m, a m+1,...,
More informationLecture Overview. 2 Weak Induction
COMPSCI 30: Discrete Mathematics for Computer Science February 18, 019 Lecturer: Debmalya Panigrahi Lecture 11 Scribe: Kevin Sun 1 Overview In this lecture, we study mathematical induction, which we often
More informationPosted Thursday February 14. STUDY IN-DEPTH...the posted solutions to homeworks 1-3. Compare with your own solutions.
CIS 160 - Spring 2019 (Instructors Val Tannen, Clayton Greenberg Midterm 1 Review Posted Thursday February 14 1 Readings STUDY IN-DEPTH......the posted notes for lectures 1-8. STUDY IN-DEPTH......the posted
More informationSection 20: Arrow Diagrams on the Integers
Section 0: Arrow Diagrams on the Integers Most of the material we have discussed so far concerns the idea and representations of functions. A function is a relationship between a set of inputs (the leave
More information3 The language of proof
3 The language of proof After working through this section, you should be able to: (a) understand what is asserted by various types of mathematical statements, in particular implications and equivalences;
More informationWriting proofs for MATH 61CM, 61DM Week 1: basic logic, proof by contradiction, proof by induction
Writing proofs for MATH 61CM, 61DM Week 1: basic logic, proof by contradiction, proof by induction written by Sarah Peluse, revised by Evangelie Zachos and Lisa Sauermann September 27, 2016 1 Introduction
More informationNotes on induction proofs and recursive definitions
Notes on induction proofs and recursive definitions James Aspnes December 13, 2010 1 Simple induction Most of the proof techniques we ve talked about so far are only really useful for proving a property
More informationTIPS FOR WRITING PROOFS IN HOMEWORK ASSIGNMENTS. 1. Simple rules
TIPS FOR WRITING PROOFS IN HOMEWORK ASSIGNMENTS MARK SKANDERA 1 Simple rules I require my students to follow the rules below when submitting problem sets While other instructors may be more lenient than
More informationLecture 7 Feb 4, 14. Sections 1.7 and 1.8 Some problems from Sec 1.8
Lecture 7 Feb 4, 14 Sections 1.7 and 1.8 Some problems from Sec 1.8 Section Summary Proof by Cases Existence Proofs Constructive Nonconstructive Disproof by Counterexample Nonexistence Proofs Uniqueness
More information35 Chapter CHAPTER 4: Mathematical Proof
35 Chapter 4 35 CHAPTER 4: Mathematical Proof Faith is different from proof; the one is human, the other is a gift of God. Justus ex fide vivit. It is this faith that God Himself puts into the heart. 21
More informationBmMT 2017 Individual Round Solutions November 19, 2017
1. It s currently 6:00 on a 12 hour clock. What time will be shown on the clock 100 hours from now? Express your answer in the form hh : mm. Answer: 10:00 Solution: We note that adding any multiple of
More information1. Propositions: Contrapositives and Converses
Preliminaries 1 1. Propositions: Contrapositives and Converses Given two propositions P and Q, the statement If P, then Q is interpreted as the statement that if the proposition P is true, then the statement
More informationAfter that, we will introduce more ideas from Chapter 5: Number Theory. Your quiz in recitation tomorrow will involve writing proofs like those.
Wednesday, Oct 17 Today we will finish Course Notes 3.2: Methods of Proof. After that, we will introduce more ideas from Chapter 5: Number Theory. The exercise generator Methods of Proof, 3.2 (also includes
More informationTechnische Universität München Department of Computer Science. Joint Advanced Students School 2009 Propositional Proof Complexity.
Technische Universität München Department of Computer Science Joint Advanced Students School 2009 Propositional Proof Complexity May 2009 Frege Systems Michael Herrmann Contents Contents ii 1 Introduction
More informationLecture 4: Probability, Proof Techniques, Method of Induction Lecturer: Lale Özkahya
BBM 205 Discrete Mathematics Hacettepe University http://web.cs.hacettepe.edu.tr/ bbm205 Lecture 4: Probability, Proof Techniques, Method of Induction Lecturer: Lale Özkahya Resources: Kenneth Rosen, Discrete
More informationSection Summary. Proof by Cases Existence Proofs
Section 1.8 1 Section Summary Proof by Cases Existence Proofs Constructive Nonconstructive Disproof by Counterexample Uniqueness Proofs Proving Universally Quantified Assertions Proof Strategies sum up
More informationDiscrete Mathematics and Probability Theory Spring 2016 Rao and Walrand Note 8
CS 70 Discrete Mathematics and Probability Theory Spring 2016 Rao and Walrand Note 8 Polynomials Polynomials constitute a rich class of functions which are both easy to describe and widely applicable in
More informationBasic Combinatorics. Math 40210, Section 01 Fall Homework 8 Solutions
Basic Combinatorics Math 4010, Section 01 Fall 01 Homework 8 Solutions 1.8.1 1: K n has ( n edges, each one of which can be given one of two colors; so Kn has (n -edge-colorings. 1.8.1 3: Let χ : E(K k
More informationBefore you get started, make sure you ve read Chapter 1, which sets the tone for the work we will begin doing here.
Chapter 2 Mathematics and Logic Before you get started, make sure you ve read Chapter 1, which sets the tone for the work we will begin doing here. 2.1 A Taste of Number Theory In this section, we will
More informationCSE 20 DISCRETE MATH SPRING
CSE 20 DISCRETE MATH SPRING 2016 http://cseweb.ucsd.edu/classes/sp16/cse20-ac/ Today's learning goals Describe computer representation of sets with bitstrings Define and compute the cardinality of finite
More informationLecture 2: Continued fractions, rational approximations
Lecture 2: Continued fractions, rational approximations Algorithmic Number Theory (Fall 204) Rutgers University Swastik Kopparty Scribe: Cole Franks Continued Fractions We begin by calculating the continued
More informationAt the start of the term, we saw the following formula for computing the sum of the first n integers:
Chapter 11 Induction This chapter covers mathematical induction. 11.1 Introduction to induction At the start of the term, we saw the following formula for computing the sum of the first n integers: Claim
More informationThe theory of numbers
1 AXIOMS FOR THE INTEGERS 1 The theory of numbers UCU Foundations of Mathematics course 2017 Author: F. Beukers 1 Axioms for the integers Roughly speaking, number theory is the mathematics of the integers.
More informationYour quiz in recitation on Tuesday will cover 3.1: Arguments and inference. Your also have an online quiz, covering 3.1, due by 11:59 p.m., Tuesday.
Friday, February 15 Today we will begin Course Notes 3.2: Methods of Proof. Your quiz in recitation on Tuesday will cover 3.1: Arguments and inference. Your also have an online quiz, covering 3.1, due
More information3 Finite continued fractions
MTH628 Number Theory Notes 3 Spring 209 3 Finite continued fractions 3. Introduction Let us return to the calculation of gcd(225, 57) from the preceding chapter. 225 = 57 + 68 57 = 68 2 + 2 68 = 2 3 +
More informationAssignment #2 COMP 3200 Spring 2012 Prof. Stucki
Assignment #2 COMP 3200 Spring 2012 Prof. Stucki 1) Construct deterministic finite automata accepting each of the following languages. In (a)-(c) the alphabet is = {0,1}. In (d)-(e) the alphabet is ASCII
More informationA Brief Introduction to Proofs
A Brief Introduction to Proofs William J. Turner October, 010 1 Introduction Proofs are perhaps the very heart of mathematics. Unlike the other sciences, mathematics adds a final step to the familiar scientific
More informationDiscrete Mathematics and Probability Theory Fall 2018 Alistair Sinclair and Yun Song Note 2
CS 70 Discrete Mathematics and Probability Theory Fall 018 Alistair Sinclair and Yun Song Note 1 Proofs In science, evidence is accumulated through experiments to assert the validity of a statement. Mathematics,
More informationTheorem (Special Case of Ramsey s Theorem) R(k, l) is finite. Furthermore, it satisfies,
Math 16A Notes, Wee 6 Scribe: Jesse Benavides Disclaimer: These notes are not nearly as polished (and quite possibly not nearly as correct) as a published paper. Please use them at your own ris. 1. Ramsey
More informationMAT115A-21 COMPLETE LECTURE NOTES
MAT115A-21 COMPLETE LECTURE NOTES NATHANIEL GALLUP 1. Introduction Number theory begins as the study of the natural numbers the integers N = {1, 2, 3,...}, Z = { 3, 2, 1, 0, 1, 2, 3,...}, and sometimes
More informationMathematics Review for Business PhD Students Lecture Notes
Mathematics Review for Business PhD Students Lecture Notes Anthony M. Marino Department of Finance and Business Economics Marshall School of Business University of Southern California Los Angeles, CA 90089-0804
More informationProofs. Chapter 2 P P Q Q
Chapter Proofs In this chapter we develop three methods for proving a statement. To start let s suppose the statement is of the form P Q or if P, then Q. Direct: This method typically starts with P. Then,
More informationDiscrete Structures for Computer Science: Counting, Recursion, and Probability
Discrete Structures for Computer Science: Counting, Recursion, and Probability Michiel Smid School of Computer Science Carleton University Ottawa, Ontario Canada michiel@scs.carleton.ca December 18, 2017
More informationChapter 1 : The language of mathematics.
MAT 200, Logic, Language and Proof, Fall 2015 Summary Chapter 1 : The language of mathematics. Definition. A proposition is a sentence which is either true or false. Truth table for the connective or :
More informationMATH 117 LECTURE NOTES
MATH 117 LECTURE NOTES XIN ZHOU Abstract. This is the set of lecture notes for Math 117 during Fall quarter of 2017 at UC Santa Barbara. The lectures follow closely the textbook [1]. Contents 1. The set
More informationChapter 1 The Real Numbers
Chapter 1 The Real Numbers In a beginning course in calculus, the emphasis is on introducing the techniques of the subject;i.e., differentiation and integration and their applications. An advanced calculus
More informationMath 202 notes. Jason Riedy. 27 August, Review 1. 2 Ruling out possibilities Logic puzzles The pigeonhole principle 2
Math 202 notes Jason Riedy 27 August, 2008 Contents 1 Review 1 2 Ruling out possibilities 1 2.1 Logic puzzles............................. 2 3 The pigeonhole principle 2 4 Mathematical reasoning 3 5 Next
More informationCS103 Handout 08 Spring 2012 April 20, 2012 Problem Set 3
CS103 Handout 08 Spring 2012 April 20, 2012 Problem Set 3 This third problem set explores graphs, relations, functions, cardinalities, and the pigeonhole principle. This should be a great way to get a
More informationMATH 2200 Final LC Review
MATH 2200 Final LC Review Thomas Goller April 25, 2013 1 Final LC Format The final learning celebration will consist of 12-15 claims to be proven or disproven. It will take place on Wednesday, May 1, from
More informationSEQUENCES, MATHEMATICAL INDUCTION, AND RECURSION
CHAPTER 5 SEQUENCES, MATHEMATICAL INDUCTION, AND RECURSION Copyright Cengage Learning. All rights reserved. SECTION 5.4 Strong Mathematical Induction and the Well-Ordering Principle for the Integers Copyright
More informationPreparing for the CS 173 (A) Fall 2018 Midterm 1
Preparing for the CS 173 (A) Fall 2018 Midterm 1 1 Basic information Midterm 1 is scheduled from 7:15-8:30 PM. We recommend you arrive early so that you can start exactly at 7:15. Exams will be collected
More information