Counting. Product Rule Example Sum Rule Pigeonhole principle If there are more pigeons than pigeonholes, then there must be at least one pigeonhole.

Slides:



Advertisements
Similar presentations
22C:19 Discrete Math Counting Fall 2011 Sukumar Ghosh.
Advertisements

5.3 Permutations and Combinations
12 April 2009Instructor: Tasneem Darwish1 University of Palestine Faculty of Applied Engineering and Urban Planning Software Engineering Department Introduction.
Counting Chapter 6 With Question/Answer Animations.
Counting Chapter 6 With Question/Answer Animations.
1 Combinatorics Rosen 6 th ed., § , § Combinatorics Count the number of ways to put things together into various combinations.Count the number.
Chapter 6 With Question/Answer Animations. Chapter Summary The Basics of Counting The Pigeonhole Principle Permutations and Combinations Binomial Coefficients.
THE BASIC OF COUNTING Discrete mathematics KNURE, Software department, Ph , N.V. Bilous.
CSE115/ENGR160 Discrete Mathematics 04/17/12
Permutations r-permutation (AKA “ordered r-selection”) An ordered arrangement of r elements of a set of n distinct elements. permutation of a set of n.
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.
CS100 : Discrete Structures
Chapter 1 Fundamental principles of counting 陳彥良 中央大學資管系.
4. Counting 4.1 The Basic of Counting Basic Counting Principles Example 1 suppose that either a member of the faculty or a student in the department is.
Counting Chapter 6 With Question/Answer Animations.
Chapter The Basics of Counting 5.2 The Pigeonhole Principle
The Basics of Counting Section 6.1.
1 Melikyan/DM/Fall09 Discrete Mathematics Ch. 6 Counting and Probability Instructor: Hayk Melikyan Today we will review sections 6.4,
Chapter The Basics of Counting 5.2 The Pigeonhole Principle
Generalized Permutations and Combinations
Chapter 6 With Question/Answer Animations 1. Chapter Summary The Basics of Counting The Pigeonhole Principle Permutations and Combinations Binomial Coefficients.
Permutations and Combinations
Fall 2002CMSC Discrete Structures1 One, two, three, we’re… Counting.
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.
Unit 7 Permutation and Combination IT Disicipline ITD1111 Discrete Mathematics & Statistics STDTLP 1 Unit 7 Permutation and Combination.
Pg. 606 Homework Pg. 631#1 – 3, 5 – 10, 13 – 19 odd #1135#12126 #1370#14220 #151365# #1756x 5 y 3 #1856x 3 y 5 #19240x 4 # x 6 #34expand to.
Ch Counting Principles. Example 1  Eight pieces of paper are numbered from 1-8 and placed in a box. One piece of paper is drawn from the box, its.
CSNB143 – Discrete Structure
The Pigeonhole Principle. The pigeonhole principle Suppose a flock of pigeons fly into a set of pigeonholes to roost If there are more pigeons than pigeonholes,
CS 103 Discrete Structures Lecture 16
Discrete Structures Counting (Ch. 6)
Counting Principles Multiplication rule Permutations Combinations.
Algebra 2/TrigonometryName: __________________________ 12.1, 12.2 Counting Principles NotesDate: ___________________________ Example 1: You are buying.
Counting.
8.6 Counting Principles. Listing Possibilities: Ex 1 Eight pieces of paper are numbered from 1 to 8 and placed in a box. One piece of paper is drawn from.
Chapter 7 – Counting Techniques CSNB 143 Discrete Mathematical Structures.
5.5 Generalized Permutations and Combinations
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.
CS 104: Discrete Mathematics
Discrete Mathematics. Exercises Exercise 1:  There are 18 Computer Science (CS) majors and 325 Business Administration (BA) majors at a college.
Section The Pigeonhole Principle If a flock of 20 pigeons roosts in a set of 19 pigeonholes, one of the pigeonholes must have more than 1 pigeon.
1 DISCRETE STRUCTURES DISCRETE STRUCTURES SSK3003 DR. ALI MAMAT 1.
Chapter 6 With Question/Answer Animations Copyright © McGraw-Hill Education. All rights reserved. No reproduction or distribution without the prior written.
ICS 253: Discrete Structures I Counting and Applications King Fahd University of Petroleum & Minerals Information & Computer Science Department.
Discrete Mathematics and Its Applications Sixth Edition By Kenneth Rosen Chapter 5 Counting 歐亞書局.
Section The Product Rule  Example: How many different license plates can be made if each plate contains a sequence of three uppercase English letters.
COUNTING Discrete Math Team KS MATEMATIKA DISKRIT (DISCRETE MATHEMATICS ) 1.
Section 6.3. Section Summary Permutations Combinations.
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.
Lec 13 – March 10  The Basics of Counting  The Pigeonhole Principle  Permutations and Combinations  Binomial Coefficients and Identities  Generalized.
Counting Chapter 6.
Discrete Mathematics Counting.
CSE15 Discrete Mathematics 04/19/17
ICS 253: Discrete Structures I
Chapter 5, Section 5.1 The Basics of Counting
Generalized Permutations and Combinations
The Pigeonhole Principle
The Pigeonhole Principle
Counting Chapter 6 With Question/Answer Animations
CS 2210 Discrete Structures Counting
CS100: Discrete structures
8.3 Counting Apply the fundamental counting principle
Permutation – The number of ways to ARRANGE ‘n’ items ‘r’ at
The Pigeonhole Principle
With Question/Answer Animations
Presentation transcript:

Counting

Product Rule

Example

Sum Rule

Pigeonhole principle If there are more pigeons than pigeonholes, then there must be at least one pigeonhole with at least two pigeons in it If k is a positive integer and k + 1 or more objects are placed into k boxes, then there is at least one box containing two or more of the objects.

Example In any group of 27 English words, there must be at least two that begin with the same letter. Among any group of 367 people, there must be at least two with the same birthday. How many students must be in a class to guarantee that at least two students receive the same score on the final exam, if the exam is graded on a scale from 0 to 100 points? Ans.102

THE GENERALIZED PIGEONHOLE PRINCIPLE Among any set of 21 decimal digits there must be 3 that are the same. If N objects are placed into k boxes, then there is at least one box containing at least N / k objects.

Example Among 100 people there are at least 100/ 12 = 9 who were born in the same month. What is the minimum 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? Ans.26

Example How many cards must be selected from a standard deck of 52 cards to guarantee that at least three cards of the same suit are chosen? Ans.9 How many must be selected to guarantee that at least three hearts are selected? Ans. 42

Permutation In how many ways can we select three students from a group of five students to stand in line for a picture? In how many ways can we arrange all five of these students in a line for a picture? Ans. 60 and 120 How many ways are there to select a first-prize winner, a second- prize winner and a third-prize winner from 100 different people who have entered a contest? Ans. P(100,3)

Example Suppose that a saleswoman has to visit eight different cities. She must begin her trip in a specified city but she can visit the other seven cities in any order she wishes. How many possible orders can the saleswoman use when visiting these cities? Solution: There are 7 ! = 7 · 6 · 5 · 4 · 3 · 2 · 1 = 5040 ways for the saleswoman to choose her tour.

Example How many permutations of the letters ABCDEFGH contain the string ABC? Solution: Because the letters ABC must occur as a block, we can find the answer by finding the number of permutations of six objects, namely, the block ABC and the individual letters D, E, F, G, and H. There are 6 ! = 720 permutations of the letters ABCDEFGH in which ABC occurs as a block.

Combination How many different committees of three students can be formed from a group of four students? Ans. 4 How many ways are there to select five players from a 10 member tennis team to make a trip to a match at another school? Ans. C(10,5)=252 A group of 30 people have been trained as astronauts to go on the first mission to Mars. How many ways are there to select a crew of six people to go on this mission? Ans. C(30,6)=593775

Example Suppose that there are 9 faculty members in the math and 11 in the cse 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 members from the math and four from the cse department? Ans. C(9,3)XC(11,4)=27720

Binomial Coefficient

Example

Permutation with repetition How many strings of length r can be formed from the English alphabet? Solution: By the product rule, because there are 26 letters, and because each letter can be used repeatedly, we see that there are 26 r strings of length r. The number of r-permutations of a set of n objects with repetition allowed is n r.

Combination with repetition Suppose that a cookie shop has four different kinds of cookies. How many different ways can six cookies be chosen? Assume that only the type of cookie, and not the individual cookies or the order in which they are chosen, matters.

Summary

THANK YOU