Recursive Definitions
|
|
- Cynthia Henry
- 5 years ago
- Views:
Transcription
1 Recursive Definitions Example: Give a recursive definition of a n. a R and n N. Basis: n = 0, a 0 = 1. Recursion: a n+1 = a a n. Example: Give a recursive definition of n i=0 a i. Let S n = n i=0 a i, then: Basis: n = 0, S 0 = 0 i=0 a i = a 0. Recursion: S n+1 = S n + a n+1. 1
2 Example: Give a recursive definition of GCD(a, b), a < b, a, b are integers not both equal to 0. Basis: a = 0, GCD(a, b) = b. Recursion: GCD(a, b) = GCD(b mod a, a). Example: Recursive definition of Fibonacci numbers: f 0 = 0, f 1 = 1 f n = f n 1 + f n 2. Recursive programming is not always efficient. Computing the Fibonacci numbers by iterative approach is more efficient than by recursive programming. 2
3 Lame s Theorem: Let a, b Z + with a b. Then the number of divisions used by the Euclidean algorithm to find GCD(a, b) is five times the number of decimal digits in b, or it is O(log b). Proof. Let a = r 0, b = r 1. Use n steps of the Euclidean algorithm to find gcd(a, b). r 0 = r 1 q 1 + r 2 r 1 = r 2 q 2 + r 3... r n 2 = r n 1 q n 1 + r n r n 1 = r n q n where q 1,..., q n 1 1 and q n 2 since r n < r n 1. Thus r n 1 = f 2 r n 1 2r n 2f 2 = f 3 r n 2 r n 1 + r n f 3 + f 2 = f 4... r 2 r 3 + r 4 f n 1 + f n 2 = f n b = r 1 r 2 + r 3 f n + f n 1 = f n+1. 3
4 So after n divisions assuming a b we have b f n+1 but by the previous result f n+1 > α n 1, n > 2, α = , so b > α n 1. Since we have ( ) log 10 α = log 10 2 > 1/5 log 10 b > (n 1) log 10 α > (n 1)/5 or n 1 < 5 log 10 b. Suppose that b has k decimal digits. Then b < 10 k log 10 b < k. Hence n 1 < 5k or n 5k (since k is an integer) thus # of divisions 5k. Also 10 k 1 b k log so # of divisions is bounded above by 5(log ) = O(log b). 4
5 Example: Recursive definition of sets 3 S x + y S if x S and y S Then S is the set of positive integers divisible by 3. Example: Recursive definition of the set of strings. A string over an alphabet is a finite sequence of symbols from. Let denote the set of all strings over. String x and y can be concatenated to form string xy. 5
6 Basis: λ = φ empty string. Recursion: wx if w and x. That is concatenating a string in and a symbol in. Example: string. Recursive definition of the reversal of a Basis: λ R = λ Recursion: (ux) R = xu R for x, u. Problem: Prove that (w 1 w 2 ) R = w R 2 wr 1. 6
7 Recursive Algorithms An algorithm is recursive if it solves a problem by reducing it to an instance of the same problem with smaller input. Example: Recursive algorithm to compute gcd(a, b). if a = 0 then gcd(a, b) := b else gcd(a, b) := gcd(b mod a, a) Student should look at many other recursive algorithms in the Textbook. 7
8 Counting Suppose we want to find out how many passwords are possible if a password consists of 6, 7, or 8 characters (A-Z, and 0-9), and there is at least one digit in each password. Basic Counting Principles The sum rule: If the first task is done in n 1 ways, second task in n 2 ways and they are independent, then the number of ways to do the 2 tasks is n 1 + n 2. Example: The students can choose a project from 3 lists, the first list has 15 projects, the second list has 13 and the third list has 20. How many ways a student can choose a project from three lists? 8
9 The product rule: If a task can be broken into 2 sub-tasks. Sub-task 1 has n 1 ways to do and sub-task 2 has n 2 ways to do after sub-task 1. Then there are n 1 n 2 ways to do the task. Example: The chairs in this auditorium are labelled with a letter and a positive integer 10. What is the number of chairs in the auditorium? Example: How many different bit strings are there of length 8? Example: Each license plate has 3 letters followed by 3 digits. How many licence plates are possible? 9
10 Example: A password has 6, 7 or 8 characters. A character can be a letter A Z or a digit 0 9. There is at least one digit in each password. How many passwords are there? Let P = P 6 + P 7 + P 8 P 6 = P 7 = P 8 = P = 2, 684, 483, 063, 360 Note: see more examples in the textbook. 10
11 The inclusion-exclusion principle: avoid over counting. A 1 A 2 = A 1 + A 2 A 1 A 2. Example: How many bit strings of length 8, either start with a 1 or (inclusive or) end with 00? Inclusion: number of bit strings of length 8 and start with a 1: 2 7 = 128 number of bit strings of length 8 and end with 00: 2 6 = 64 Total inclusion: = 192 But we counted twice bit strings starting with 1 and ending with 00: Exclusion: 2 5 = 32 Result = = 160 bit strings. 11
12 Example: How many bit strings of length 8 that have: a) 3 consecutive 0s? b) 4 consecutive 1s? c) 3 consecutive 0s or 4 consecutive 1s? 3 consecutive 0s case x x x x x 2 5 = x x x x 2 4 = 16 3 x x x x 2 4 = 16 4 x x x x 2 4 = 16 5 y y y x (2 3 1) 2 = 14 6 z z z z = 13 total 107 yyy - any binary string except 000 (case 1) zzzz - any binary string except 0000, 0001 (case 1) or 1000 (case 2) 12
13 4 consecutive 1s case x x x x 2 4 = x x x 2 3 = x x 2 3 = 8 4 x x x 2 3 = 8 5 x x x = 8 total 48 3 consecutive 0s and 4 consecutive 1s case Total 8.
14 3 consecutive 0s or 4 consecutive 1s By inclusion-exclusion the answer is = 147 Example: a) How many bit strings of length 10 containing 5 consecutive 0s? b) How many bit strings of length 10 containing exactly 5 consecutive 0s and not more?
15 Counting functions Example: How many functions are there from m elements to n elements? Example: How many one-to-one functions are there from m elements to n elements? Tree diagrams: a useful technique for counting small number of cases. You need different tools for different problems. Example: How many bit strings of length 4 that do not have consecutive 1s? Inclusion-exclusion is difficult to apply in this problem. 13
16 Example: A playoff between 2 teams consists of at most 5 games. The first team that wins 3 games wins the playoff. In how many different ways the playoff can occur? 14
17 The Pigeonhole Principle If k + 1 or more objects are placed in k boxes then there is at least one box containing 2 or more objects. Example: For 366 persons (assume 365 days in a year) at least 2 have the same birthday. The Generalized Pigeonhole Principle: If N objects are placed in k boxes then there is at least one box containing at least N k objects. Applications Example: Show that among any n + 1 positive integers 2n there must be one integer that divides one of the others. Proof. Write each of n + 1 positive integers as a j = 2 k jq j, j = 1,..., n + 1, where k j 0 and q j is odd. Integers q j, j = 1,..., n+1 are odd, positive and < 2n. Since there are only n such integers we have by the pigeonhole principle that at least n+1 n = 2 of the integers q j, j = 1,..., n + 1 must be equal, e. g., q i = q j = q, i j. Then a i = 2 k iq, a j = 2 k jq, hence a i a j if k i k j or a j a i if k i > k j 15
18 Theorem: Every sequence of n 2 +1 distinct real numbers contains a subsequence of length n + 1 that is either strictly increasing or strictly decreasing. Proof. Let a 1,..., a n 2 +1 be a sequence of n2 + 1 distinct real numbers. Associate with a k a pair of (i k, d k ), where i k is the length of the longest increasing subsequence starting at a k, and d k is the length of the longest decreasing subsequence starting at a k. Suppose to the contrary that there are no increasing or decreasing subsequences of length n + 1. Then i k, d k are positive integers less or equal to n, k = 1,..., a n Hence, by the product rule there are up to n 2 different ordered pairs (i k, d k ). Since there are n pairs (i k, d k ) by the pigeonhole principle at least two of these ordered pairs are equal. That means there exist a s and a t, with s < t such that i s = i t and d s = d t. This is impossible. Indeed, because all the terms in the sequence are different, either a s < a t or a s > a t. If a s < a t, then since i s = i t, an increasing subsequence of length i s + 1 can be built starting at a s, by taking a s followed by an increasing sequence of length i t = i s starting at a t. This is contradiction. Similarly, if a s > a t, then we can obtain a decreasing subsequence of length d s + 1 by starting at a s, then 16
19 continuing to a t followed by a decreasing subsequence of length d t = d s starting at a t. This leads to a contradiction. Example: Assume a group of 6 people each pair consists of 2 friends or 2 enemies. Show that there are either 3 mutual friends or 3 mutual enemies. This is an example of a Ramsey theory problem. Proof. Let the group of 6 people be {A, B, C, D, E, F }. Choose A. In the remaining group of 5 people {B, C, D, E, F by the pigeonhole principle there are either three friends of A or three enemies of A, since 5 3 = 3. Suppose that B,C,D are enemies of A. If any two of these three people are enemies, say C,D then A,C,D form a group of three mutual enemies. Otherwise A,C,D form a group of three mutual friends. The proof in a latter case proceeds similarly.
Counting 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 informationMath.3336: Discrete Mathematics. Combinatorics: Basics of Counting
Math.3336: Discrete Mathematics Combinatorics: Basics of Counting Instructor: Dr. Blerina Xhabli Department of Mathematics, University of Houston https://www.math.uh.edu/ blerina Email: blerina@math.uh.edu
More informationCounting. Spock's dilemma (Walls and mirrors) call it C(n,k) Rosen, Chapter 5.1, 5.2, 5.3 Walls and Mirrors, Chapter 3 10/11/12
Counting Rosen, Chapter 5.1, 5.2, 5.3 Walls and Mirrors, Chapter 3 Spock's dilemma (Walls and mirrors) n n planets in the solar system n can only visit k
More informationInduction and recursion. Chapter 5
Induction and recursion Chapter 5 Chapter Summary Mathematical Induction Strong Induction Well-Ordering Recursive Definitions Structural Induction Recursive Algorithms Mathematical Induction Section 5.1
More informationChapter Summary. Mathematical Induction Strong Induction Well-Ordering Recursive Definitions Structural Induction Recursive Algorithms
1 Chapter Summary Mathematical Induction Strong Induction Well-Ordering Recursive Definitions Structural Induction Recursive Algorithms 2 Section 5.1 3 Section Summary Mathematical Induction Examples of
More information1. Consider the conditional E = p q r. Use de Morgan s laws to write simplified versions of the following : The negation of E : 5 points
Introduction to Discrete Mathematics 3450:208 Test 1 1. Consider the conditional E = p q r. Use de Morgan s laws to write simplified versions of the following : The negation of E : The inverse of E : The
More informationInduction and Recursion
. All rights reserved. Authorized only for instructor use in the classroom. No reproduction or further distribution permitted without the prior written consent of McGraw-Hill Education. Induction and Recursion
More informationCounting. Mukulika Ghosh. Fall Based on slides by Dr. Hyunyoung Lee
Counting Mukulika Ghosh Fall 2018 Based on slides by Dr. Hyunyoung Lee Counting Counting The art of counting is known as enumerative combinatorics. One tries to count the number of elements in a set (or,
More informationLecture 4: Counting, Pigeonhole Principle, Permutations, Combinations Lecturer: Lale Özkahya
BBM 205 Discrete Mathematics Hacettepe University http://web.cs.hacettepe.edu.tr/ bbm205 Lecture 4: Counting, Pigeonhole Principle, Permutations, Combinations Lecturer: Lale Özkahya Resources: Kenneth
More informationAnnouncements. CSE 321 Discrete Structures. Counting. Counting Rules. Important cases of the Product Rule. Counting examples.
Announcements CSE 321 Discrete Structures Winter 2008 Lecture 16 Counting Readings Friday, Wednesday: Counting 6 th edition: 5.1, 5.2, 5.3, 5 th edition: 4.1, 4.2. 4.3 Lecture 16 video will be posted on
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 informationICS141: Discrete Mathematics for Computer Science I
ICS141: Discrete Mathematics for Computer Science I Dept. Information & Computer Sci., Jan Stelovsky based on slides by Dr. Baek and Dr. Still Originals by Dr. M. P. Frank and Dr. J.L. Gross Provided by
More informationInduction. Induction. Induction. Induction. Induction. Induction 2/22/2018
The principle of mathematical induction is a useful tool for proving that a certain predicate is true for all natural numbers. It cannot be used to discover theorems, but only to prove them. If we have
More informationWith Question/Answer Animations
Chapter 5 With Question/Answer Animations Copyright McGraw-Hill Education. All rights reserved. No reproduction or distribution without the prior written consent of McGraw-Hill Education. Chapter Summary
More informationCounting. Math 301. November 24, Dr. Nahid Sultana
Basic Principles Dr. Nahid Sultana November 24, 2012 Basic Principles Basic Principles The Sum Rule The Product Rule Distinguishable Pascal s Triangle Binomial Theorem Basic Principles Combinatorics: The
More informationDepartment of Computer Science University at Albany, State University of New York Solutions to Sample Discrete Mathematics Examination II (Fall 2007)
Department of Computer Science University at Albany, State University of New York Solutions to Sample Discrete Mathematics Examination II (Fall 2007) Problem 1: Specify two different predicates P (x) and
More informationIntroduction to Decision Sciences Lecture 11
Introduction to Decision Sciences Lecture 11 Andrew Nobel October 24, 2017 Basics of Counting Product Rule Product Rule: Suppose that the elements of a collection S can be specified by a sequence of k
More informationHomework 7 Solutions, Math 55
Homework 7 Solutions, Math 55 5..36. (a) Since a is a positive integer, a = a 1 + b 0 is a positive integer of the form as + bt for some integers s and t, so a S. Thus S is nonempty. (b) Since S is nonempty,
More informationApplied Cryptography and Computer Security CSE 664 Spring 2017
Applied Cryptography and Computer Security Lecture 11: Introduction to Number Theory Department of Computer Science and Engineering University at Buffalo 1 Lecture Outline What we ve covered so far: symmetric
More informationDiscrete Mathematics & Mathematical Reasoning Chapter 6: Counting
Discrete Mathematics & Mathematical Reasoning Chapter 6: Counting Kousha Etessami U. of Edinburgh, UK Kousha Etessami (U. of Edinburgh, UK) Discrete Mathematics (Chapter 6) 1 / 39 Chapter Summary The Basics
More informationMATH 10B METHODS OF MATHEMATICS: CALCULUS, STATISTICS AND COMBINATORICS
MATH 10B METHODS OF MATHEMATICS: CALCULUS, STATISTICS AND COMBINATORICS Lior Pachter and Lawrence C. Evans Department of Mathematics University of California Berkeley, CA 94720 January 21, 2013 Lior Pachter
More informationPROBLEMS ON CONGRUENCES AND DIVISIBILITY
PROBLEMS ON CONGRUENCES AND DIVISIBILITY 1. Do there exist 1,000,000 consecutive integers each of which contains a repeated prime factor? 2. A positive integer n is powerful if for every prime p dividing
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 informationCounting Review R 1. R 3 receiver. sender R 4 R 2
Counting Review Purpose: It is the foundation for many simple yet interesting examples and applications of probability theory. For good counting we need good crutches (fingers?). Hence good images for
More information2!3! (9)( 8x3 ) = 960x 3 ( 720x 3 ) = 1680x 3
CSCI 2200 Foundations of Computer Science Spring 2018 Quiz 2 (April 11, 2018) SOLUTIONS 1. [6 POINTS] An NBA team has nine players show up for a game, but only five players can be on the floor to play
More informationAn Introduction to Combinatorics
Chapter 1 An Introduction to Combinatorics What Is Combinatorics? Combinatorics is the study of how to count things Have you ever counted the number of games teams would play if each team played every
More informationRecurrence Relations and Recursion: MATH 180
Recurrence Relations and Recursion: MATH 180 1: Recursively Defined Sequences Example 1: The sequence a 1,a 2,a 3,... can be defined recursively as follows: (1) For all integers k 2, a k = a k 1 + 1 (2)
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 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 informationChapter 8 Sequences, Series, and Probability
Chapter 8 Sequences, Series, and Probability Overview 8.1 Sequences and Series 8.2 Arithmetic Sequences and Partial Sums 8.3 Geometric Sequences and Partial Sums 8.5 The Binomial Theorem 8.6 Counting Principles
More informationSlides for a Course Based on the Text Discrete Mathematics & Its Applications (5 th Edition) by Kenneth H. Rosen
University of Florida Dept. of Computer & Information Science & Engineering COT 3100 Applications of Discrete Structures Dr. Michael P. Frank Slides for a Course Based on the Text Discrete Mathematics
More informationPutnam 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 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 informationMy Favorite Problems, 2 Harold B. Reiter University of North Carolina Charlotte
My Favorite Problems, 2 Harold B. Reiter University of North Carolina Charlotte This is the second of a series of columns about problems. I am soliciting problems from the readers of M&I Quarterly. Mathematical
More informationDiscrete Mathematics with Applications MATH236
Discrete Mathematics with Applications MATH236 Dr. Hung P. Tong-Viet School of Mathematics, Statistics and Computer Science University of KwaZulu-Natal Pietermaritzburg Campus Semester 1, 2013 Tong-Viet
More informationRemainders. We learned how to multiply and divide in elementary
Remainders We learned how to multiply and divide in elementary school. As adults we perform division mostly by pressing the key on a calculator. This key supplies the quotient. In numerical analysis and
More informationMATH 114 Fall 2004 Solutions to practice problems for Final Exam
MATH 11 Fall 00 Solutions to practice problems for Final Exam Reminder: the final exam is on Monday, December 13 from 11am - 1am. Office hours: Thursday, December 9 from 1-5pm; Friday, December 10 from
More informationIntroduction to Number Theory. The study of the integers
Introduction to Number Theory The study of the integers of Integers, The set of integers = {... 3, 2, 1, 0, 1, 2, 3,...}. In this lecture, if nothing is said about a variable, it is an integer. Def. We
More information6.8 The Pigeonhole Principle
6.8 The Pigeonhole Principle Getting Started Are there two leaf-bearing trees on Earth with the same number of leaves if we only consider the number of leaves on a tree at full bloom? Getting Started Are
More informationInternational Mathematical Olympiad. Preliminary Selection Contest 2011 Hong Kong. Outline of Solutions
International Mathematical Olympiad Preliminary Selection Contest Hong Kong Outline of Solutions Answers:.. 76... 6. 7.. 6.. 6. 6.... 6. 7.. 76. 6. 7 Solutions:. Such fractions include. They can be grouped
More informationMath 230 Final Exam, Spring 2008
c IIT Dept. Applied Mathematics, May 15, 2008 1 PRINT Last name: Signature: First name: Student ID: Math 230 Final Exam, Spring 2008 Conditions. 2 hours. No book, notes, calculator, cell phones, etc. Part
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 informationPRACTICE PROBLEMS: SET 1
PRACTICE PROBLEMS: SET MATH 437/537: PROF. DRAGOS GHIOCA. Problems Problem. Let a, b N. Show that if gcd(a, b) = lcm[a, b], then a = b. Problem. Let n, k N with n. Prove that (n ) (n k ) if and only if
More informationFall 2017 Test II review problems
Fall 2017 Test II review problems Dr. Holmes October 18, 2017 This is a quite miscellaneous grab bag of relevant problems from old tests. Some are certainly repeated. 1. Give the complete addition and
More informationPUTNAM TRAINING NUMBER THEORY. Exercises 1. Show that the sum of two consecutive primes is never twice a prime.
PUTNAM TRAINING NUMBER THEORY (Last updated: December 11, 2017) Remark. This is a list of exercises on Number Theory. Miguel A. Lerma Exercises 1. Show that the sum of two consecutive primes is never twice
More informationSolution: By direct calculation, or observe that = = ( ) 2222 = =
1 Fillins 1. Find the last 4 digits of 3333 6666. Solution: 7778. By direct calculation, or observe that 3333 6666 = 9999 2222 = (10000 1) 2222 = 22220000 2222 = 22217778. 2. How many ways are there to
More informationCHAPTER 8 Advanced Counting Techniques
96 Chapter 8 Advanced Counting Techniques CHAPTER 8 Advanced Counting Techniques SECTION 8. Applications of Recurrence Relations 2. a) A permutation of a set with n elements consists of a choice of a first
More informationcse 311: foundations of computing Spring 2015 Lecture 12: Primes, GCD, applications
cse 311: foundations of computing Spring 2015 Lecture 12: Primes, GCD, applications casting out 3s Theorem: A positive integer n is divisible by 3 if and only if the sum of its decimal digits is divisible
More informationAlgorithms (II) Yu Yu. Shanghai Jiaotong University
Algorithms (II) Yu Yu Shanghai Jiaotong University Chapter 1. Algorithms with Numbers Two seemingly similar problems Factoring: Given a number N, express it as a product of its prime factors. Primality:
More informationDiscrete Probability
Discrete Probability Counting Permutations Combinations r- Combinations r- Combinations with repetition Allowed Pascal s Formula Binomial Theorem Conditional Probability Baye s Formula Independent Events
More informationDiscrete Structures, Final Exam
Discrete Structures, Final Exam Monday, May 11, 2009 SOLUTIONS 1. (40 pts) Short answer. Put your answer in the box. No partial credit. [ ] 0 1 (a) If A = and B = 1 0 [ ] 0 0 1. 0 1 1 [ 0 1 1 0 0 1 ],
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 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 information2 - Strings and Binomial Coefficients
November 14, 2017 2 - Strings and Binomial Coefficients William T. Trotter trotter@math.gatech.edu Basic Definition Let n be a positive integer and let [n] = {1, 2,, n}. A sequence of length n such as
More informationREVIEW QUESTIONS. Chapter 1: Foundations: Sets, Logic, and Algorithms
REVIEW QUESTIONS Chapter 1: Foundations: Sets, Logic, and Algorithms 1. Why can t a Venn diagram be used to prove a statement about sets? 2. Suppose S is a set with n elements. Explain why the power set
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 informationDISCRETE STRUCTURES AMIN WITNO
DISCRETE STRUCTURES AMIN WITNO p h i. w i t n o. c o m Discrete Structures Revision Notes and Problems Amin Witno Preface These notes were prepared for students as a revision workbook
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 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 information1. Induction on Strings
CS/ECE 374: Algorithms & Models of Computation Version: 1.0 Fall 2017 This is a core dump of potential questions for Midterm 1. This should give you a good idea of the types of questions that we will ask
More informationCarleton University. Final Examination Fall DURATION: 2 HOURS No. of students: 223
Carleton University Final Examination Fall 2016 DURATION: 2 HOURS No. of students: 223 Department Name & Course Number: Computer Science COMP 2804A Course Instructor: Michiel Smid Authorized memoranda:
More informationRecursion and Induction
Recursion and Induction Themes Recursion Recurrence Definitions Recursive Relations Induction (prove properties of recursive programs and objects defined recursively) Examples Tower of Hanoi Gray Codes
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 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 informationComputer Organization I Test 1/Version 1 CMSC 2833 Autumn 2007
. Print your name on your scantron in the space labeled NAME. 2. Print CMSC 2833 in the space labeled SUBJECT. 3. Print the date, 9-20-2007, in the space labeled DATE. 4. Print your CRN, 2393, in the space
More informationcse 311: foundations of computing Fall 2015 Lecture 12: Primes, GCD, applications
cse 311: foundations of computing Fall 2015 Lecture 12: Primes, GCD, applications n-bit unsigned integer representation Represent integer x as sum of powers of 2: If x = n 1 i=0 b i 2 i where each b i
More informationnot to be republished NCERT REAL NUMBERS CHAPTER 1 (A) Main Concepts and Results
REAL NUMBERS CHAPTER 1 (A) Main Concepts and Results Euclid s Division Lemma : Given two positive integers a and b, there exist unique integers q and r satisfying a = bq + r, 0 r < b. Euclid s Division
More informationPS2 - Comments. University of Virginia - cs3102: Theory of Computation Spring 2010
University of Virginia - cs3102: Theory of Computation Spring 2010 PS2 - Comments Average: 77.4 (full credit for each question is 100 points) Distribution (of 54 submissions): 90, 12; 80 89, 11; 70-79,
More information1 The Basic Counting Principles
1 The Basic Counting Principles The Multiplication Rule If an operation consists of k steps and the first step can be performed in n 1 ways, the second step can be performed in n ways [regardless of how
More informationCS1800 Discrete Structures Final Version A
CS1800 Discrete Structures Fall 2017 Profs. Aslam, Gold, & Pavlu December 11, 2017 CS1800 Discrete Structures Final Version A Instructions: 1. The exam is closed book and closed notes. You may not use
More informationDiscrete Mathematics: Midterm Test with Answers. Professor Callahan, section (A or B): Name: NetID: 30 multiple choice, 3 points each:
Discrete Mathematics: Midterm Test with Answers Professor Callahan, section (A or B): Name: NetID: 30 multiple choice, 3 points each: 1. If f is defined recursively by: f (0) = -2, f (1) = 1, and for n
More informationNumber Theory: Representations of Integers
Instructions: In-class exercises are meant to introduce you to a new topic and provide some practice with the new topic. Work in a team of up to 4 people to complete this exercise. You can work simultaneously
More informationQuiz 1 Solutions. (a) f 1 (n) = 8 n, f 2 (n) = , f 3 (n) = ( 3) lg n. f 2 (n), f 1 (n), f 3 (n) Solution: (b)
Introduction to Algorithms October 14, 2009 Massachusetts Institute of Technology 6.006 Spring 2009 Professors Srini Devadas and Constantinos (Costis) Daskalakis Quiz 1 Solutions Quiz 1 Solutions Problem
More informationBinomial Coefficient Identities/Complements
Binomial Coefficient Identities/Complements CSE21 Fall 2017, Day 4 Oct 6, 2017 https://sites.google.com/a/eng.ucsd.edu/cse21-fall-2017-miles-jones/ permutation P(n,r) = n(n-1) (n-2) (n-r+1) = Terminology
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 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 information1 True/False. Math 10B with Professor Stankova Worksheet, Discussion #9; Thursday, 2/15/2018 GSI name: Roy Zhao
Math 10B with Professor Stankova Worksheet, Discussion #9; Thursday, 2/15/2018 GSI name: Roy Zhao 1 True/False 1. True False When we solve a problem one way, it is not useful to try to solve it in a second
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 informationMATH 243E Test #3 Solutions
MATH 4E Test # Solutions () Find a recurrence relation for the number of bit strings of length n that contain a pair of consecutive 0s. You do not need to solve this recurrence relation. (Hint: Consider
More informationCarleton University. Final Examination Winter DURATION: 2 HOURS No. of students: 152
Carleton University Final Examination Winter 2014 DURATION: 2 HOURS No. of students: 152 Department Name & Course Number: Computer Science COMP 2804B Course Instructor: Michiel Smid Authorized memoranda:
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 informationUndergraduate Notes in Mathematics. Arkansas Tech University Department of Mathematics. Introductory Notes in Discrete Mathematics Solution Guide
Undergraduate Notes in Mathematics Arkansas Tech University Department of Mathematics Introductory Notes in Discrete Mathematics Solution Guide Marcel B. Finan c All Rights Reserved 2015 Edition Contents
More informationLogic. Facts (with proofs) CHAPTER 1. Definitions
CHAPTER 1 Logic Definitions D1. Statements (propositions), compound statements. D2. Truth values for compound statements p q, p q, p q, p q. Truth tables. D3. Converse and contrapositive. D4. Tautologies
More informationDiscrete Structures CRN Test 3 Version 1 CMSC 2123 Autumn 2013
. Print your name on your scantron in the space labeled NAME. 2. Print CMSC 223 in the space labeled SUBJECT. 3. Print the date 2-2-203, in the space labeled DATE. 4. Print your CRN, 786, in the space
More information8. Given a rational number r, prove that there exist coprime integers p and q, with q 0, so that r = p q. . For all n N, f n = an b n 2
MATH 135: Randomized Exam Practice Problems These are the warm-up exercises and recommended problems taken from all the extra practice sets presented in random order. The challenge problems have not been
More informationStrong Induction (Second Principle) Example: There are two piles of cards, players take turn: each turn: one player removes any number of cards from
Strong Induction (Second Principle) Example: There are two piles of cards, players take turn: each turn: one player removes any number of cards from 1 pile (any of the two). The player who removes the
More informationALGEBRA+NUMBER THEORY +COMBINATORICS
ALGEBRA+NUMBER THEORY +COMBINATORICS COMP 321 McGill University These slides are mainly compiled from the following resources. - Professor Jaehyun Park slides CS 97SI - Top-coder tutorials. - Programming
More informationMathematical Background
Chapter 1 Mathematical Background When we analyze various algorithms in terms of the time and the space it takes them to run, we often need to work with math. That is why we ask you to take MA 2250 Math
More informationCISC 4090: Theory of Computation Chapter 1 Regular Languages. Section 1.1: Finite Automata. What is a computer? Finite automata
CISC 4090: Theory of Computation Chapter Regular Languages Xiaolan Zhang, adapted from slides by Prof. Werschulz Section.: Finite Automata Fordham University Department of Computer and Information Sciences
More informationCSC 125 :: Final Exam December 15, 2010
1-5. Complete the truth tables below: CSC 125 :: Final Exam December 15, 2010 p q p q p q p q p q p q T T F F T F T F 6-13. Fill in the missing portion of each of the rules of inference named below: 6.
More informationBOUNDS ON ZIMIN WORD AVOIDANCE
BOUNDS ON ZIMIN WORD AVOIDANCE JOSHUA COOPER* AND DANNY RORABAUGH* Abstract. How long can a word be that avoids the unavoidable? Word W encounters word V provided there is a homomorphism φ defined by mapping
More informationJohns Hopkins Math Tournament Proof Round: Automata
Johns Hopkins Math Tournament 2018 Proof Round: Automata February 9, 2019 Problem Points Score 1 10 2 5 3 10 4 20 5 20 6 15 7 20 Total 100 Instructions The exam is worth 100 points; each part s point value
More informationExecutive Assessment. Executive Assessment Math Review. Section 1.0, Arithmetic, includes the following topics:
Executive Assessment Math Review Although the following provides a review of some of the mathematical concepts of arithmetic and algebra, it is not intended to be a textbook. You should use this chapter
More informationDiscrete Mathematics. Benny George K. September 22, 2011
Discrete Mathematics Benny George K Department of Computer Science and Engineering Indian Institute of Technology Guwahati ben@iitg.ernet.in September 22, 2011 Set Theory Elementary Concepts Let A and
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 information{ 10,12,17} { 4, 7,13}
Math 13 L Shipley Exam #3 Review Spring 2011 Exam #3 will cover chapter 6, and the first two sections of chapter 7. This review will give you an idea about what types of concepts will be covered on the
More informationUnit Combinatorics State pigeonhole principle. If k pigeons are assigned to n pigeonholes and n < k then there is at least one pigeonhole containing more than one pigeons. Find the recurrence relation
More informationMonty Hall Puzzle. Draw a tree diagram of possible choices (a possibility tree ) One for each strategy switch or no-switch
Monty Hall Puzzle Example: You are asked to select one of the three doors to open. There is a large prize behind one of the doors and if you select that door, you win the prize. After you select a door,
More informationCSci 311, Models of Computation Chapter 4 Properties of Regular Languages
CSci 311, Models of Computation Chapter 4 Properties of Regular Languages H. Conrad Cunningham 29 December 2015 Contents Introduction................................. 1 4.1 Closure Properties of Regular
More informationDiscrete Mathematics (CS503)
Discrete Mathematics (CS503) Module I Suggested Questions Day 1, 2 1. Translate the following statement into propositional logic using the propositions provided: You can upgrade your operating system only
More information