Xuan Guo xguo9@student.gsu.edu Lab 9 Xuan Guo xguo9@student.gsu.edu.

Slides:



Advertisements
Similar presentations
Application: The Pigeonhole Principle Lecture 37 Section 7.3 Wed, Apr 4, 2007.
Advertisements

Recursively Defined Functions
The Pigeonhole Principle
Chapter 5 Section 4 The Multiplication Principle.
College of Information Technology & Design
Discrete Structures Chapter 5 Pigeonhole Principle Nurul Amelina Nasharuddin Multimedia Department.
CSE115/ENGR160 Discrete Mathematics 04/10/12
Combinations We should use permutation where order matters
Recursive Definitions Rosen, 3.4 Recursive (or inductive) Definitions Sometimes easier to define an object in terms of itself. This process is called.
1 Discrete Structures – CNS2300 Text Discrete Mathematics and Its Applications (5 th edition) Kenneth H. Rosen Chapter 4 Counting.
Chapter The Basics of Counting 5.2 The Pigeonhole Principle
Fall 2015 COMP 2300 Discrete Structures for Computation
Discrete Maths Objective to introduce some of the counting rules (product, sum, subtraction, division, pigeonhole) through examples , Semester 2,
Counting. Product Rule Example Sum Rule Pigeonhole principle If there are more pigeons than pigeonholes, then there must be at least one pigeonhole.
Chapter The Basics of Counting 5.2 The Pigeonhole Principle
Generalized Permutations and Combinations
Fall 2002CMSC Discrete Structures1 One, two, three, we’re… Counting.
September1999 CMSC 203 / 0201 Fall 2002 Week #8 – 14/16 October 2002 Prof. Marie desJardins.
Dr. Eng. Farag Elnagahy Office Phone: King ABDUL AZIZ University Faculty Of Computing and Information Technology CPCS 222.
ICS 253: Discrete Structures I Counting and Applications King Fahd University of Petroleum & Minerals Information & Computer Science Department.
Sullivan Algebra and Trigonometry: Section 14.2 Objectives of this Section Solve Counting Problems Using the Multiplication Principle Solve Counting Problems.
The Basics of Counting Section 6.1.
Section Section Summary The Product Rule The Sum Rule The Subtraction Rule The Division Rule Examples, Examples, and Examples Tree Diagrams.
CSNB143 – Discrete Structure
CS 103 Discrete Structures Lecture 16
Discrete Structures Counting (Ch. 6)
1 If a task is made up of multiple operations (activities or stages that are independent of each other) the total number of possibilities for the multi-step.
Counting.
CLICK THE NUMBERS IN SEQUENCE
Each small square has sides of length 1 unit. How many distinct paths of length six units are there from A to B? A B..
Section 1.3 Each arrangement (ordering) of n distinguishable objects is called a permutation, and the number of permutations of n distinguishable objects.
1 The Pigeonhole Principle CS 202 Epp section 7.3.
2/24/20161 One, two, three, we’re… Counting. 2/24/20162 Basic Counting Principles Counting problems are of the following kind: “How many different 8-letter.
Introduction Suppose that a password on a computer system consists of 6, 7, or 8 characters. Each of these characters must be a digit or a letter of the.
Section Basic Counting Principles: The Product Rule The Product Rule: A procedure can be broken down into a sequence of two tasks. There are n 1.
1 The Pigeonhole Principle CS 202 Epp section ??? Aaron Bloomfield.
CS 104: Discrete Mathematics
Pigeonhole Principle – Page 1CPTR311 – Discrete Structures CPTR311 Discrete Structures Pigeonhole Principle Reading: Kolman, Section 3.3.
Pigeonhole Principle. If n pigeons fly into m pigeonholes and n > m, then at least one hole must contain two or more pigeons A function from one finite.
Discrete Mathematics. Exercises Exercise 1:  There are 18 Computer Science (CS) majors and 325 Business Administration (BA) majors at a college.
ICS 253: Discrete Structures I Counting and Applications King Fahd University of Petroleum & Minerals Information & Computer Science Department.
Section The Product Rule  Example: How many different license plates can be made if each plate contains a sequence of three uppercase English letters.
Pre-Calculus Section 8.6A Counting Principles. 1. Eight pieces of paper are numbered 1 to 8 and placed in a box. One piece of paper is drawn from the.
COUNTING Discrete Math Team KS MATEMATIKA DISKRIT (DISCRETE MATHEMATICS ) 1.
Discrete Math Section 15.2 Apply the multiplication, addition, and complement principles My wardrobe consists of two pairs of pants and four shirts. How.
Example A standard deck of 52 cards has 13 kinds of cards, with four cards of each of kind, one in each of the four suits, hearts, diamonds, spades, and.
Discrete Mathematics Counting.
The Pigeonhole Principle
ICS 253: Discrete Structures I
Chapter 5, Section 5.1 The Basics of Counting
Counting Methods and Probability Theory
Generalized Permutations and Combinations
The Pigeonhole Principle
Discrete Structures for Computer Science
COCS DISCRETE STRUCTURES
1. In how many ways can six people sit in a six-passenger car?
Counting Chapter 6 With Question/Answer Animations
Recursively Defined Functions
One, two, three, we’re… Counting.
CS100: Discrete structures
Discrete Structures for Computer Science
8.3 Counting Apply the fundamental counting principle
The Pigeonhole Principle
Counting techniques Basic Counting Principles, Pigeonhole Principle, Permutations and Combinations.
Counting Methods and Probability Theory
Representations of Integers
CLICK THE NUMBERS IN SEQUENCE
Warm Up Melanie is choosing an outfit for a job interview. She has four dresses, three blouses, five pairs of pants and three pairs of shoes to choose.
CLICK THE NUMBERS IN SEQUENCE
321 Section Feb. 21 Natalie Linnell.
Presentation transcript:

Xuan Guo xguo9@student.gsu.edu Lab 9 Xuan Guo xguo9@student.gsu.edu

Question 5 Section 6.1 Six different airlines fly from New York to Denver and seven fly from Denver to San Francisco. How many different pairs of airlines can you choose on which to book a trip from New York to San Francisco via Denver, when you pick an airline for the flight to Denver and an airline for the continuation flight to San Francisco?

Question 5 Section 6.1 Six different airlines fly from New York to Denver and seven fly from Denver to San Francisco. How many different pairs of airlines can you choose on which to book a trip from New York to San Francisco via Denver Solution: 42 The Product Rule: A procedure can be broken down into a sequence of two tasks. There are n1 ways to do the first task and n2 ways to do the second task. Then there are n1∙n2 ways to do the procedure. 6 x 7

Question 29 Section 6.1 How many license plates can be made using either two uppercase English letters followed by four digits or two digits followed by four uppercase English letters?

Question 29 Section 6.1 How many license plates can be made using either two uppercase English letters followed by four digits or two digits followed by four uppercase English letters? Solution: 52,457,600 Product Rule 26 x 26 x 10 x 10 x 10 x 10 10 x 10 x 26 x 26 x 26 x 26

Question 33 Section 6.1 How many strings of eight English letters are there a) that contain no vowels, if letters can be repeated? b)that contain no vowels, if letters cannot be repeated? c) that start with a vowel, if letters can be repeated? d)that start with a vowel, if letters cannot be repeated? e) that contain at least one vowel, if letters can be repeated? f) that contain exactly one vowel, if letters can be repeated? g) that start with X and contain at least one vowel, if letters can be repeated? h)that start and end with X and contain at least one vowel, if letters can be repeated?

Question 33 Section 6.1 How many strings of eight English letters are there a) that contain no vowels, if letters can be repeated? 37,822,859,361 = (26 – 5) ^ 8 b)that contain no vowels, if letters cannot be repeated? 8,204,716,800 = 21 x 20 x 19 x 18 x 17 x 16 x 15 x 14 c) that start with a vowel, if letters can be repeated? 40,159,050,880 = 5 x (26^7) d)that start with a vowel, if letters cannot be repeated? 12,113,640,000 = 5 x 26 x 25 x 24 x 23 x 22 x 21 x 20 e) that contain at least one vowel, if letters can be repeated? 171,004,205,215 = (26^8) – (21^8) f) that contain exactly one vowel, if letters can be repeated? 72,043,541,640 = 5 x (21^7) x 8 g) that start with X and contain at least one vowel, if letters can be repeated? 6,230,721,635 = (26^7) – (21^7) h)that start and end with X and contain at least one vowel, if letters can be repeated? 223,149,655 = (26^6) – (21^6)

Question 1 Section 6.2 Show that in any set of six classes, each regularly once a week on a particular day of the week, there must be two that meet on the same day, assuming that no classes are held on weekends.

Pigeonhole Principle: If k is a positive integer and k + 1 objects are placed into k boxes, then at least one box contains two or more objects.

Question 1 Section 6.2 Show that in any set of six classes, each regularly once a week on a particular day of the week, there must be two that meet on the same day, assuming that no classes are held on weekends. Solution: Because there are six classes, but only five weekdays, the pigeonhole principle shows that at least two classes must be held on the same day.

Question 3 Section 6.1 A drawer contains a dozen brown socks and a dozen black socks, all unmatched. A man takes socks out at random in the dark. a) How many socks must he take out to be sure that he has at least two socks of the same color? b)How many socks must he take out to be sure that he has at least two black socks?

Question 3 Section 6.1 A drawer contains a dozen brown socks and a dozen black socks, all unmatched. A man takes socks out at random in the dark. a) How many socks must he take out to be sure that he has at least two socks of the same color? Solution: 3 Pigeonhole Principle: If k is a positive integer and k + 1 objects are placed into k boxes, then at least one box contains two or more objects.

Question 3 Section 6.1 A drawer contains a dozen brown socks and a dozen black socks, all unmatched. A man takes socks out at random in the dark. b)How many socks must he take out to be sure that he has at least two black socks? Solution: 14