|
|
- Gwendoline Banks
- 5 years ago
- Views:
Transcription
1 Unit 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 satisfying the equation y n A 3 n + B 4 n. y n A 3 n + B 4 n. y n+ A 3 n+ + B 4 n + 3A3 n 4B 4 n y n+ A 3 n+ + B 4 n+ 9A3 n + B 4 n y n+ + y n+ y n 0 Solve a k 3a k, for k, with a 0. Let k0 a k x k a 0 + a x + a x + where is the generating function for the sequence a n. Given a k 3a k 3a k a k 0 Multiplying by x k and summing from to, we have 3 a k x k k 3x k k a k x k a k x k k 0 a k x k 0 3x a 0 + a x + a x + a x + a x + 0 3x a 0 0 [from ] 3x 0 (3x ) 3x k0 a k x k 3 k x k k0 a k Coefficient of x k in G(x) a k 3 n x xn If seven colours are used to paint 50 bicycles, then show that at least 8 bicycles will be the same colour. By Pigeon principle, If there are n pigeons and k holes, then there is at least one hole contains at least k + pigeons. Here k 50, n 7 k n There is at least 8 bicycles will be the same colour. n
2 Solve the recurrence relation y n 8y n + y n 0 for n, where y and y y n 8y n + y n 0 () Let y n r n be the solution of (). r n 8r n + r n 0 r n 8 r + r 0 r n r r 8r + 0 The characteristic equation is r 8r + 0 r 4 0 r 4,4 Hence the solution to this recurrence relation is y n α 4 n + α n4 n y α + α 3 Solving (3) and (4), we get y 3 80 α + 3α α, α 4 Substituting α, α in (), 4 y n 4n + 4 n4n Find the number of non-negative integer solutions of the equation x + x + x 3. If there are r unknowns and their sum is n, then the number of non-negative integer solution for the problem is n + r C r Here there are 3 unknowns and the sum is 7 The number of non-negative integer solutions of the equation x + x + x 3 is + 3 C 3 3C 78 Find the recurrence relation for the Fibonacci sequence. f n f n + f n, n and f 0 0, f Use Mathematical induction show that Let P n : n P : + + P() is true. n k k n n + n + n n + n + ()
3 Let us assume that P(n) is true. Now we have to prove that P(n + ) is true. To prove: P n + : n + n + n + n n + n + n n + n + + n + (from ) n n + n + + n + n + n n + + n + n + n + n + n + n + n + 7n n + n + n + n + n + 3 P n + is true. By induction method, P n : n n n + n + is true for all positive integers. There are 500 students in a college, of these 700 have taken a course in C, 000 have taken a course in Pascal and 550 have taken a course in Networking. Further 750 have taken courses in both C and Pascal. 400 have taken courses in both C and Networking, and 75 have taken courses in both Pascal and Networking. If 00 of these students have taken courses in C, Pascal and Networking. () How many of these 500 students have taken a course in any of these three courses C, Pascal and Networking? () How many of these 500 students have not taken a course in any of these three courses C, Pascal and Networking? Let U denote the number of students in a college. Let A denote the number of students taken a course in C. Let B denote the number of students taken a course in PASCAL. Let C denote the number of students taken a course in Networking. U 500, A 700, B 000, C 550, A B 750, A C 400, B C 75, A B C 00 () The number of students has taken a course in any of these three courses C, Pascal and Networking We know tat A B C A + B + C A B A C B C + A B C A B C 05. () The number of students has not taken a course in any of these three courses C, Pascal and Networking is A B C U A B C Using generating function solve y n+ 5y n+ + y n 0, n 0 with y o and
4 y. Let y n x n () where is the generating function for the sequence y n. Given y n+ 5y n+ + y n 0 Multiplying by x n and summing from 0 to, we have y n+ x n 5 x y n+x n + y n+ x n + y n x n 0 5 x n + y n+ x + y n x n 0 x y x y 0 5 x y [from ] x 5 x + y x y 0 x + 5y 0 x 0 x 5 x + x x + 5 x 0 x 5x + x x 4 x x 5x + x 4x x 4x x 5x + 4x 3x x 4x 3x x A 3x + B x 4x A x + B 3x Put x in () 4 B 3 B B Put x in () A 3 3 A 3 A y n x n 3x x 3x + x 3 n x n + n x n y n Coefficient of x n in G(x) y n 3 n + n+ A box contains six white balls and five red balls. Find the number of ways four balls can be drawn from the box if () They can be any colour () Two must be white and two red
5 (3) They must all be the same colour. Total number of balls + 5 () The number of ways four balls can be drawn from the box if they can be any colour is C ! () The number of ways four balls can be drawn from the box if two must be white and two red C 5C !! (3) The number of ways four balls can be drawn from the box if they must all be the same colour. C 4 + 5C 4 C + 5C ! Prove by the principle of Mathematical induction, for n a positive integer n n n + n + Let P n : n n n + n + () P : + + P() is true. Let us assume that P(n) is true. Now we have to prove that P(n + ) is true. To prove: P n + : n + n + n + n n + n + n n + n + + n + (from ) n n + n + + n + n + n n + + n + n + n + n + n + n + n + 7n n + n + n + n + n + 3 P n + is true. By induction method, P n : n n n + n + is true for all positive integers. Find the number of distinct permutations that can be formed from all the letters of each word () RADAR () UNUSUAL.
6 () The word RADAR contains 5 letters of which A s and R s are there. Te number of possible words 5!!! 30 Number of distinct permutation 30. () The word UNUSUAL contains 7 letters of which 3 U s are there. Te number of possible words 7! 3! 840 Number of distinct permutation 840. Solve the recurrence relation, (n) S(n ) + S(n ), with S(0) 3, S(), by finding its generating function. The given recurrence relation is a n + a n a n 0 with a 0 3, a. Let a n x n a 0 + a x + a x + where is the generating function for the sequence a n. Given a n + a n a n 0 Multiplying by x n and summing from to, we have a n x n + a n x n n x n n n a n x n a n x n + x a n x n n 0 n a n x n 0 x a 0 + a x + a x + + x a x + a x + a x + a 3 x 3 + a 4 x x + x xa 0 + a 0 + a x 0 [from ] x + x 3x x 0 x + x x 3 x 3 x + x x 3 + x x 3 x + x x A + x + B x 3 x A x + B + x Put x in () 3 B + 3 B B 4 3 Put x in () 3 + A + 3A 5 A x + x x x x
7 a n x n 5 n x n a n Coefficient of x n in G(x) n x n x xn a n 5 3 n n Prove, by mathematical induction, that for all n, n 3 + n is a multiple of 3. Let P n : n, n 3 + n is a multiple of 3. () P : is a multiple of 3. P() is true. Let us assume that P(n) is true. Now we have to prove that P(n + ) is true. To prove: P n + : (n + ) 3 + (n + ) is a multiple of 3 (n + ) 3 + n + n 3 + 3n + 3n + + n + n 3 + n + 3n + 3n + 3 n 3 + n + 3 n + n + From () n 3 + n is a multiple of 3 (n + ) 3 + n + is a multiple of 3 P n + is true. By induction method, P n : n, n 3 + n is a multiple of 3, is true for all positive integer n. Using the generating function, solve the difference equation y n+ y n+ y n 0, y, y 0 Let y n x n () where is the generating function for the sequence y n. Given y n+ y n+ y n 0 Multiplying by x n and summing from 0 to, we have y n+ x n x y n+x n + y n+ x n x n + y n+ x y n x n 0 y n x n 0 x y x y 0 x y 0 0 [from ] x x y x y 0 x + y 0 x 0 x x x x + x 0 x x + x x x x x x x x
8 x x x x 3x + x x 3x + x A 3x + B + x x A x + + B 3x Put x in () B B 5 B Put x in () 3 3 A A 5 3 A 3x + + x 3x + x y n x n 3 n x n + n x n y n Coefficient of x n in G(x) y n 3 n + n x xn How many positive integers n can be formed using the digits 3, 4, 4, 5, 5,, 7 if n has to exceed ? The positive integer n exceeds if the first digit is either 5 or or 7. If the first digit is 5 then the remaining six digits are 3,4,4,5,,7. Then the number of positive integers formed by six digits is! 30 [Since 4 appears twice]! If the first digit is then the remaining six digits are 3,4,4,5,5,7. Then the number of positive integers formed by six digits is! 80 [Since 4 & 5 appears twice]!! If the first digit is 7 then the remaining six digits are 3,4,4,5,,5. Then the number of positive integers formed by six digits is! 80 [Since 4 & 5 appears twice]!! The number of positive integers n can be formed using the digits 3,4,4,5,5,,7 if n has to exceed is Find the number of integers between and 50 both inclusive that are divisible by any of the integers,3,5,7. Let A, B, C and D represents the integer from to 50 that are divisible by,3,5 and 7 respectively. A 50 5, B , C , D
9 A B 50 3 A B D B D , A C , A D , B C , C D , A B C , A C D , B C D 50 A B C D The number of integers between and 50 both inclusive that are divisible by any of the integers,3,5,7 is A B C D A + B + C + D A B A C A D B C B D C D + A B C + A B D + A C D + B C D A B C D A B C D A B C D 93 Use mathematical induction to prove the inequality n < n for all positive integer n. Proof: Let P n : n < n () P : < < P() is true. Let us assume that P(n) is true. Now we have to prove that P(n + ) is true. To prove: n + P n + : n + < n < n (from ) n + < n + n + < n + n < n P n + is true. By induction method, n + <. n n + n + < P n : n < n is true for all positive integers. What is the maximum number of students required in a discrete mathematics class to be sure that at least six will receive the same grade if there are five possible grades A, B, C, D and F. By Pigeonhole principle, If there are n holes and k pigeons n k then there is at least one hole contains at least k + pigeons. n Here n 5 k + 5 k 5 k 5 k 5 The maximum number of students required in a discrete mathematics class is. Suppose that there are 9 faculty members in the mathematics department and in the computer science department. How many ways are there to select a committee to develop a discrete mathematics course at a school if the committee is to consist of three faculty member from mathematics department and four from the computer science department?
10 The number of ways to select 3 mathematics faculty members from 9 faculty members is 9C 3 ways. The number of ways to select 4 computer Science faculty members from faculty members is C 4 ways. The number of ways to select a committee to develop a discrete mathematics course at a school if the committee is to consist of three faculty member from mathematics department and four from the computer science department is 9C 3. C 4 ways. 9C 3. C ! ! 770 Using method of generating function to solve the recurrence relation a n + 3a n 4a n 0; n, given that a 0 3 and a. Let a n x n a 0 + a x + a x + where is the generating function for the sequence a n. Given a n + 3a n 4a n 0 Multiplying by x n and summing from to, we have n n a n x n + 3 a n x n 4 n n a n x n + 3x a n x n 4x n a n x n 0 n a n x n 0 a x + a 3 x 3 + a 4 x x a x + a x + 4x a 0 + a x + a x + 0 a 0 a x + 3x 3xa 0 4x 0 [from ] + 3x 4x 3 + x 9x 0 + 3x 4x 3 7x 3 7x + 3x 4x 3 7x + 4x x 3 7x + 4x x A + 4x + B x 3 7x A x + B + 4x Put x in () A A A 9 5 Put x in () 3 7 B + 4 5B 4 B x 5 x
11 a n x n n x n 4 5 a n Coefficient of x n in G(x) x n x xn a n n 4 5 Prove, by mathematical induction, that for all n, n 3 + n is a multiple of 3. Let P n : n, n 3 + n is a multiple of 3. () P : is a multiple of 3. P() is true. Let us assume that P(n) is true. Now we have to prove that P(n + ) is true. To prove: P n + : (n + ) 3 + (n + ) is a multiple of 3 (n + ) 3 + n + n 3 + 3n + 3n + + n + n 3 + n + 3n + 3n + 3 n 3 + n + 3 n + n + From () n 3 + n is a multiple of 3 (n + ) 3 + n + is a multiple of 3 P n + is true. By induction method, P n : n, n 3 + n is a multiple of 3, is true for all positive integer n. Using the generating function, solve the difference equation y n+ y n+ y n 0, y, y 0 Let y n x n () where is the generating function for the sequence y n. Given y n+ y n+ y n 0 Multiplying by x n and summing from 0 to, we have y n+ x n x y n+x n + y n+ x n x n + y n+ x y n x n 0 y n x n 0 x y x y 0 x y 0 0 [from ] x x y x y 0 x + y 0 x 0 x x x x + x 0 x x + x x x x x x x x
12 x x x x 3x + x x 3x + x A 3x + B + x x A x + + B 3x Put x in () B B 5 B Put x in () 3 3 A A 5 3 A 3x + + x 3x + x y n x n 3 n x n + n x n y n Coefficient of x n in G(x) y n 3 n + n x xn Using mathematical induction to show that >, n. 3 n Let P n : > n, n () n P : > > P() is true. Let us assume that P(n) is true. Now we have to prove that P(n + ) is true. To prove: P n + : n + n + > n n + n + n + from () n + n n + + n + n + n + n + > n + n + > n + n +
13 P n + is true. By induction method, n + n + > n + P n : > n, is true for all positive integer n. 3 n Using method of generating function to solve the recurrence relation a n 4a n 4a n + 4 n ; n, given that a 0 and a 8. Let a n x n a 0 + a x + a x + where is the generating function for the sequence a n. Given a n 4a n 4a n + 4 n 4a n 4a n + a n 4 n Multiplying by x n and summing from to, we have 4 a n x n 4 n 4x n n a n x n 4x a n x n + a n x n 4 n n n n n x n a n x n + a n x n 4 n 4x a 0 + a x + a x + 4x a x + a x + + a x + a 3 x 3 + a 4 x 4 + 4x + 4x 3 + 4x a 0 + a x + a x + 4x a 0 + a x + a x + + 4xa 0 + a x + a 3 x 3 + a 4 x 4 + 4x + 4x 3 + 4x 4x + 4xa 0 + a 0 a x x + 4x + 4x + [from ] 4x 4x + + 8x 8x x 4x 4x 4x + x 4x + x x + 4x 4x x x + 8x 4x x + 8x 4x x n x + 8x 4x x A 4x + B x + C x x + 8x A x + B x 4x + C 4x Put x in () x n C C C Put x in () 4
14 + 8 4 A A A 4 4 Put x 0 in () A + B + C 4 + B B 0 4 4x + 0 x x a n x n 4 4 n x n x xn & a n Coefficient of x n in G(x) a n 4 n + n + n + x n + n x n n + xn
Tutorial Obtain the principal disjunctive normal form and principal conjunction form of the statement
Tutorial - 1 1. Obtain the principal disjunctive normal form and principal conjunction form of the statement Let S P P Q Q R P P Q Q R A: P Q Q R P Q R P Q Q R Q Q R A S Minterm Maxterm T T T F F T T T
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 informationSimplification by Truth Table and without Truth Table
Engineering Mathematics 2013 SUBJECT NAME SUBJECT CODE MATERIAL NAME MATERIAL CODE REGULATION UPDATED ON : Discrete Mathematics : MA2265 : University Questions : SKMA1006 : R2008 : August 2013 Name of
More informationMA Discrete Mathematics
MA2265 - Discrete Mathematics UNIT I 1. Check the validity of the following argument. If the band could not play rock music or the refreshments were not delivered on time, then the New year s party would
More informationAnna University, Chennai, November/December 2012
B.E./B.Tech. DEGREE EXAMINATION, NOVEMBER/DECEMBER 2012 Fifth Semester Computer Science and Engineering MA2265 DISCRETE MATHEMATICS (Regulation 2008) Part - A 1. Define Tautology with an example. A Statement
More informationSimplification by Truth Table and without Truth Table
SUBJECT NAME SUBJECT CODE : MA 6566 MATERIAL NAME REGULATION : Discrete Mathematics : University Questions : R2013 UPDATED ON : June 2017 (Scan the above Q.R code for the direct download of this material)
More informationSimplification by Truth Table and without Truth Table
SUBJECT NAME SUBJECT CODE : MA 6566 MATERIAL NAME REGULATION : Discrete Mathematics : University Questions : R2013 UPDATED ON : April-May 2018 BOOK FOR REFERENCE To buy the book visit : Sri Hariganesh
More informationUnit I (Logic and Proofs)
SUBJECT NAME SUBJECT CODE : MA 6566 MATERIAL NAME REGULATION : Discrete Mathematics : Part A questions : R2013 UPDATED ON : April-May 2018 (Scan the above QR code for the direct download of this material)
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 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 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 informationMathematical Induction Assignments
1 Mathematical Induction Assignments Prove the Following using Principle of Mathematical induction 1) Prove that for any positive integer number n, n 3 + 2 n is divisible by 3 2) Prove that 1 3 + 2 3 +
More informationCSC 344 Algorithms and Complexity. Proof by Mathematical Induction
CSC 344 Algorithms and Complexity Lecture #1 Review of Mathematical Induction Proof by Mathematical Induction Many results in mathematics are claimed true for every positive integer. Any of these results
More information1. a. Give the converse and the contrapositive of the implication If it is raining then I get wet.
VALLIAMMAI ENGINEERING COLLEGE DEPARTMENT OF MATHEMATICS SUB CODE/ TITLE: MA6566 DISCRETE MATHEMATICS QUESTION BANK Academic Year : 015-016 UNIT I LOGIC AND PROOFS PART-A 1. Write the negation of the following
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 informationDiscrete Mathematics. Spring 2017
Discrete Mathematics Spring 2017 Previous Lecture Principle of Mathematical Induction Mathematical Induction: rule of inference Mathematical Induction: Conjecturing and Proving Climbing an Infinite Ladder
More informationGenerating Functions (Revised Edition)
Math 700 Fall 06 Notes Generating Functions (Revised Edition What is a generating function? An ordinary generating function for a sequence (a n n 0 is the power series A(x = a nx n. The exponential generating
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 informationCSCE 222 Discrete Structures for Computing. Dr. Hyunyoung Lee
CSCE 222 Discrete Structures for Computing Sequences and Summations Dr. Hyunyoung Lee Based on slides by Andreas Klappenecker 1 Sequences 2 Sequences A sequence is a function from a subset of the set of
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 informationProblem Set 5 Solutions
Problem Set 5 Solutions Section 4.. Use mathematical induction to prove each of the following: a) For each natural number n with n, n > + n. Let P n) be the statement n > + n. The base case, P ), is true
More informationn=0 xn /n!. That is almost what we have here; the difference is that the denominator is (n + 1)! in stead of n!. So we have x n+1 n=0
DISCRETE MATHEMATICS HOMEWORK 8 SOL Undergraduate Course Chukechen Honors College Zhejiang University Fall-Winter 204 HOMEWORK 8 P496 6. Find a closed form for the generating function for the sequence
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 informationMATH 3012 N Homework Chapter 9
MATH 01 N Homework Chapter 9 February, 017 The recurrence r n+ = r n+1 + r n can be expressed with advancement operators as A A )r n = 0 The quadratic can then be factored using the quadratic formula,
More informationFoundations of Computer Science Lecture 14 Advanced Counting
Foundations of Computer Science Lecture 14 Advanced Counting Sequences with Repetition Union of Overlapping Sets: Inclusion-Exclusion Pigeonhole Principle Last Time To count complex objects, construct
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 information{ 0! = 1 n! = n(n 1)!, n 1. n! =
Summations Question? What is the sum of the first 100 positive integers? Counting Question? In how many ways may the first three horses in a 10 horse race finish? Multiplication Principle: If an event
More informationSome Review Problems for Exam 3: Solutions
Math 3355 Fall 018 Some Review Problems for Exam 3: Solutions I thought I d start by reviewing some counting formulas. Counting the Complement: Given a set U (the universe for the problem), if you want
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 information1 Basic Combinatorics
1 Basic Combinatorics 1.1 Sets and sequences Sets. A set is an unordered collection of distinct objects. The objects are called elements of the set. We use braces to denote a set, for example, the set
More informationName (please print) Mathematics Final Examination December 14, 2005 I. (4)
Mathematics 513-00 Final Examination December 14, 005 I Use a direct argument to prove the following implication: The product of two odd integers is odd Let m and n be two odd integers Since they are odd,
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 informationSail into Summer with Math!
Sail into Summer with Math! For Students Entering Algebra 1 This summer math booklet was developed to provide students in kindergarten through the eighth grade an opportunity to review grade level math
More informationMath 283 Spring 2013 Presentation Problems 4 Solutions
Math 83 Spring 013 Presentation Problems 4 Solutions 1. Prove that for all n, n (1 1k ) k n + 1 n. Note that n means (1 1 ) 3 4 + 1 (). n 1 Now, assume that (1 1k ) n n. Consider k n (1 1k ) (1 1n ) n
More informationCLASS XI Maths : Sample Paper-1
CLASS XI Maths : Sample Paper-1 Allotted Time : 3 Hrs Max. Marks : 100 Instructions 1. This questionnaire consists of 30 questions divided in four sections. Please verify before attempt. 2. Section I consists
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 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 informationGenerating Functions
Semester 1, 2004 Generating functions Another means of organising enumeration. Two examples we have seen already. Example 1. Binomial coefficients. Let X = {1, 2,..., n} c k = # k-element subsets of X
More informationCombinatorics. Problem: How to count without counting.
Combinatorics Problem: How to count without counting. I 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 informationIntroduction to Combinatorial Mathematics
Introduction to Combinatorial Mathematics George Voutsadakis 1 1 Mathematics and Computer Science Lake Superior State University LSSU Math 300 George Voutsadakis (LSSU) Combinatorics April 2016 1 / 57
More informationOutline. We will cover (over the next few weeks) Induction Strong Induction Constructive Induction Structural Induction
Outline We will cover (over the next few weeks) Induction Strong Induction Constructive Induction Structural Induction Induction P(1) ( n 2)[P(n 1) P(n)] ( n 1)[P(n)] Why Does This Work? I P(1) ( n 2)[P(n
More informationSome Review Problems for Exam 3: Solutions
Math 3355 Spring 017 Some Review Problems for Exam 3: Solutions I thought I d start by reviewing some counting formulas. Counting the Complement: Given a set U (the universe for the problem), if you want
More informationGenerating Functions and the Fibonacci Sequence
Department of Mathematics Nebraska Wesleyan University June 14, 01 Fibonacci Sequence Fun Fact: November 3rd is Fibonacci Day! (1, 1,, 3) Definition The Fibonacci sequence is defined by the recurrence
More informationTotal score: /100 points
Points missed: Student's Name: Total score: /100 points East Tennessee State University Department of Computer and Information Sciences CSCI 710 (Tarnoff) Discrete Structures TEST for Spring Semester,
More informationMcGill University Faculty of Science. Solutions to Practice Final Examination Math 240 Discrete Structures 1. Time: 3 hours Marked out of 60
McGill University Faculty of Science Solutions to Practice Final Examination Math 40 Discrete Structures Time: hours Marked out of 60 Question. [6] Prove that the statement (p q) (q r) (p r) is a contradiction
More informationIntroduction to Induction (LAMC, 10/14/07)
Introduction to Induction (LAMC, 10/14/07) Olga Radko October 1, 007 1 Definitions The Method of Mathematical Induction (MMI) is usually stated as one of the axioms of the natural numbers (so-called Peano
More informationUNCORRECTED SAMPLE PAGES. Extension 1. The binomial expansion and. Digital resources for this chapter
15 Pascal s In Chapter 10 we discussed the factoring of a polynomial into irreducible factors, so that it could be written in a form such as P(x) = (x 4) 2 (x + 1) 3 (x 2 + x + 1). In this chapter we will
More informationExam 2 Solutions. x 1 x. x 4 The generating function for the problem is the fourth power of this, (1 x). 4
Math 5366 Fall 015 Exam Solutions 1. (0 points) Find the appropriate generating function (in closed form) for each of the following problems. Do not find the coefficient of x n. (a) In how many ways can
More informationMath 2602 Finite and Linear Math Fall 14. Homework 8: Core solutions
Math 2602 Finite and Linear Math Fall 14 Homework 8: Core solutions Review exercises for Chapter 5 page 183 problems 25, 26a-26b, 29. Section 8.1 on page 252 problems 8, 9, 10, 13. Section 8.2 on page
More informationDiscrete Structures Homework 1
Discrete Structures Homework 1 Due: June 15. Section 1.1 16 Determine whether these biconditionals are true or false. a) 2 + 2 = 4 if and only if 1 + 1 = 2 b) 1 + 1 = 2 if and only if 2 + 3 = 4 c) 1 +
More informationDivisibility in the Fibonacci Numbers. Stefan Erickson Colorado College January 27, 2006
Divisibility in the Fibonacci Numbers Stefan Erickson Colorado College January 27, 2006 Fibonacci Numbers F n+2 = F n+1 + F n n 1 2 3 4 6 7 8 9 10 11 12 F n 1 1 2 3 8 13 21 34 89 144 n 13 14 1 16 17 18
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 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 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 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 informationMath 463/563 Homework #2 - Solutions
Math 463/563 Homework #2 - Solutions 1. How many 5-digit numbers can be formed with the integers 1, 2,..., 9 if no digit can appear exactly once? (For instance 43443 is OK, while 43413 is not allowed.)
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 informationCSCE 222 Discrete Structures for Computing. Review for Exam 2. Dr. Hyunyoung Lee !!!
CSCE 222 Discrete Structures for Computing Review for Exam 2 Dr. Hyunyoung Lee 1 Strategy for Exam Preparation - Start studying now (unless have already started) - Study class notes (lecture slides and
More information1. How many labeled trees are there on n vertices such that all odd numbered vertices are leaves?
1. How many labeled trees are there on n vertices such that all odd numbered vertices are leaves? This is most easily done by Prüfer codes. The number of times a vertex appears is the degree of the vertex.
More informationare the q-versions of n, n! and . The falling factorial is (x) k = x(x 1)(x 2)... (x k + 1).
Lecture A jacques@ucsd.edu Notation: N, R, Z, F, C naturals, reals, integers, a field, complex numbers. p(n), S n,, b(n), s n, partition numbers, Stirling of the second ind, Bell numbers, Stirling of the
More information201-1A5-MT - Mathematics Summer 2015 HOMEWORK 2 Deadline : Sunday, August 30, 2015 at 12 :30.
01-1A5-MT - Mathematics Summer 015 HOMEWORK Deadline : Sunday, August 30, 015 at 1 :30. Instructions : The assignment consists of five questions, each worth 0 points. Only hardcopy submissions of your
More informationDiscrete Math, Spring Solutions to Problems V
Discrete Math, Spring 202 - Solutions to Problems V Suppose we have statements P, P 2, P 3,, one for each natural number In other words, we have the collection or set of statements {P n n N} a Suppose
More informationVALLIAMMAI ENGINEERING COLLEGE SRM Nagar, Kattankulathur
VALLIAMMAI ENGINEERING COLLEGE SRM Nagar, Kattankulathur 603 203. DEPARTMENT OF COMPUTER SCIENCE ENGINEERING SUBJECT QUESTION BANK : MA6566 \ DISCRETE MATHEMATICS SEM / YEAR: V / III year CSE. UNIT I -
More information1. Suppose that a, b, c and d are four different integers. Explain why. (a b)(a c)(a d)(b c)(b d)(c d) a 2 + ab b = 2018.
New Zealand Mathematical Olympiad Committee Camp Selection Problems 2018 Solutions Due: 28th September 2018 1. Suppose that a, b, c and d are four different integers. Explain why must be a multiple of
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 informationDiscrete Mathematics & Mathematical Reasoning Induction
Discrete Mathematics & Mathematical Reasoning Induction Colin Stirling Informatics Colin Stirling (Informatics) Discrete Mathematics (Sections 5.1 & 5.2) Today 1 / 12 Another proof method: Mathematical
More informationRecursive Definitions
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,
More informationFirst Midterm Examination
2015-2016 Fall Semester First Midterm Examination 1) 6 students will sit at a round table. Anıl, Sümeyye and Tahsin are in section 1 and Bora, İpek and Efnan are in section 2. They will sit such that nobody
More informationWhat can you prove by induction?
MEI CONFERENCE 013 What can you prove by induction? Martyn Parker M.J.Parker@keele.ac.uk Contents Contents iii 1 Splitting Coins.................................................. 1 Convex Polygons................................................
More informationPUTNAM PROBLEMS SEQUENCES, SERIES AND RECURRENCES. Notes
PUTNAM PROBLEMS SEQUENCES, SERIES AND RECURRENCES Notes. x n+ = ax n has the general solution x n = x a n. 2. x n+ = x n + b has the general solution x n = x + (n )b. 3. x n+ = ax n + b (with a ) can be
More informationCOMP Intro to Logic for Computer Scientists. Lecture 15
COMP 1002 Intro to Logic for Computer Scientists Lecture 15 B 5 2 J Puzzle: better than nothing Nothing is better than eternal bliss A burger is better than nothing ------------------------------------------------
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 information16.5 Problem Solving with Functions
CHAPTER 16. FUNCTIONS Excerpt from "Introduction to Algebra" 2014 AoPS Inc. Exercises 16.4.1 If f is a function that has an inverse and f (3) = 5, what is f 1 (5)? 16.4.2 Find the inverse of each of the
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 informationRevision Topic 8: Solving Inequalities Inequalities that describe a set of integers or range of values
Revision Topic 8: Solving Inequalities Inequalities that describe a set of integers or range of values The inequality signs: > greater than < less than greater than or equal to less than or equal to can
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 information2016 EF Exam Texas A&M High School Students Contest Solutions October 22, 2016
6 EF Exam Texas A&M High School Students Contest Solutions October, 6. Assume that p and q are real numbers such that the polynomial x + is divisible by x + px + q. Find q. p Answer Solution (without knowledge
More information1. Determine (with proof) the number of ordered triples (A 1, A 2, A 3 ) of sets which satisfy
UT Putnam Prep Problems, Oct 19 2016 I was very pleased that, between the whole gang of you, you solved almost every problem this week! Let me add a few comments here. 1. Determine (with proof) the number
More informationRevision Problems for Examination 1 in Algebra 1
Centre for Mathematical Sciences Mathematics, Faculty of Science Revision Problems for Examination 1 in Algebra 1 Arithmetics 1 Determine a greatest common divisor to the integers a) 5431 and 1345, b)
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 informationSolutions Manual. Selected odd-numbers problems from. Chapter 3. Proof: Introduction to Higher Mathematics. Seventh Edition
Solutions Manual Selected odd-numbers problems from Chapter 3 of Proof: Introduction to Higher Mathematics Seventh Edition Warren W. Esty and Norah C. Esty 5 4 3 2 1 2 Section 3.1. Inequalities Chapter
More informationProblem Sheet 1. You may assume that both F and F are σ-fields. (a) Show that F F is not a σ-field. (b) Let X : Ω R be defined by 1 if n = 1
Problem Sheet 1 1. Let Ω = {1, 2, 3}. Let F = {, {1}, {2, 3}, {1, 2, 3}}, F = {, {2}, {1, 3}, {1, 2, 3}}. You may assume that both F and F are σ-fields. (a) Show that F F is not a σ-field. (b) Let X :
More informationMATH 3012 N Solutions to Review for Midterm 2
MATH 301 N Solutions to Review for Midterm March 7, 017 1. In how many ways can a n rectangular checkerboard be tiled using 1 and pieces? Find a closed formula. If t n is the number of ways to tile the
More informationSequences. 1. Number sequences. 2. Arithmetic sequences. Consider the illustrated pattern of circles:
Sequences 1. Number sequences Consider the illustrated pattern of circles: The first layer has just one blue ball. The second layer has three pink balls. The third layer has five black balls. The fourth
More informationGenerating Functions
Generating Functions Karen Ge May, 07 Abstract Generating functions gives us a global perspective when we need to study a local property. We define generating functions and present its applications in
More informationMath 3U03 Combinatorics
Math 3U03 Combinatorics Martin Bays April 17, 2015 Notes from a course at McMaster University given by Martin Bays in Winter 2015. Released under the Creative Commons Share-alike CC SA licence http://creativecommons.org/licenses/sa/1.0/
More informationMTH 3318 Solutions to Induction Problems Fall 2009
Pat Rossi Instructions. MTH 338 Solutions to Induction Problems Fall 009 Name Prove the following by mathematical induction. Set (): ++3+...+ n n(n+) i n(n+) Step #: Show that the proposition is true for
More informationMini Lecture 2.1 The Addition Property of Equality
Mini Lecture.1 The Addition Property of Equality 1. Identify linear equations in one variable.. Use the addition property of equality to solve equations.. Solve applied problems using formulas. 1. Identify
More informationMathematical Fundamentals
Mathematical Fundamentals Sets Factorials, Logarithms Recursion Summations, Recurrences Proof Techniques: By Contradiction, Induction Estimation Techniques Data Structures 1 Mathematical Fundamentals Sets
More informationClimbing an Infinite Ladder
Section 5.1 Section Summary Mathematical Induction Examples of Proof by Mathematical Induction Mistaken Proofs by Mathematical Induction Guidelines for Proofs by Mathematical Induction Climbing an Infinite
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 informationExamples of Finite Sequences (finite terms) Examples of Infinite Sequences (infinite terms)
Math 120 Intermediate Algebra Sec 10.1: Sequences Defn A sequence is a function whose domain is the set of positive integers. The formula for the nth term of a sequence is called the general term. Examples
More informationFunction Operations and Composition of Functions. Unit 1 Lesson 6
Function Operations and Composition of Functions Unit 1 Lesson 6 Students will be able to: Combine standard function types using arithmetic operations Compose functions Key Vocabulary: Function operation
More informationNotes for Finite Mathematics (WUSTL, Math 220, Summer 2017)
Notes for Finite Mathematics (WUSTL, Math 220, Summer 2017) Mohammad Jabbari April 22, 2018 Contents 0 Prologue 4 1 Counting 7 1.1 Some Notions and Definitions: Sets, Functions, Sequences, One-to-One Correspondences,
More information2017 HSC Mathematics Extension 1 Marking Guidelines
07 HSC Mathematics Extension Marking Guidelines Section I Multiple-choice Answer Key Question Answer A B 3 B 4 C 5 D 6 D 7 A 8 C 9 C 0 B NESA 07 HSC Mathematics Extension Marking Guidelines Section II
More informationCHAPTER 1 POLYNOMIALS
1 CHAPTER 1 POLYNOMIALS 1.1 Removing Nested Symbols of Grouping Simplify. 1. 4x + 3( x ) + 4( x + 1). ( ) 3x + 4 5 x 3 + x 3. 3 5( y 4) + 6 y ( y + 3) 4. 3 n ( n + 5) 4 ( n + 8) 5. ( x + 5) x + 3( x 6)
More informationd(x n, x) d(x n, x nk ) + d(x nk, x) where we chose any fixed k > N
Problem 1. Let f : A R R have the property that for every x A, there exists ɛ > 0 such that f(t) > ɛ if t (x ɛ, x + ɛ) A. If the set A is compact, prove there exists c > 0 such that f(x) > c for all x
More informationPartition of Integers into Distinct Summands with Upper Bounds. Partition of Integers into Even Summands. An Example
Partition of Integers into Even Summands We ask for the number of partitions of m Z + into positive even integers The desired number is the coefficient of x m in + x + x 4 + ) + x 4 + x 8 + ) + x 6 + x
More informationCSE 20. Final Review. CSE 20: Final Review
CSE 20 Final Review Final Review Representation of integers in base b Logic Proof systems: Direct Proof Proof by contradiction Contraposetive Sets Theory Functions Induction Final Review Representation
More informationMath Fall Final Exam. Friday, 14 December Show all work for full credit. The problems are worth 6 points each.
Name: Math 50 - Fall 2007 Final Exam Friday, 4 December 2007 Show all work for full credit. The problems are worth 6 points each.. Find the number of subsets of S = {, 2,... 0} that contain exactly 5 elements,
More information