Chapter 6 Counting Arguments. The Pigeonhole Principle: Pigeonhole principle: let k be a positive integer. Imagine that you are delivering k+1 letters.

Slides:



Advertisements
Similar presentations
4/16/2015 MATH 224 – Discrete Mathematics Counting Basic counting techniques are important in many aspects of computer science. For example, consider the.
Advertisements

Probability Three basic types of probability: Probability as counting
Counting Chapter 6 With Question/Answer Animations.
Probability What Are the Chances?. Section 1 The Basics of Probability Theory Objectives: Be able to calculate probabilities by counting the outcomes.
“The Handshake Problem” Problem Solving Ch 1. Shake Hands with Everyone Some things to think about: How many handshakes occurred? How did you keep track.
1 Counting Problems From Fred Greenleaf’s QR book Compiled by Samuel Marateck.
1 Codes, Ciphers, and Cryptography-Ch 2.3 Michael A. Karls Ball State University.
1 1 PRESENTED BY E. G. GASCON Introduction to Probability Section 7.3, 7.4, 7.5.
Excursions in Modern Mathematics, 7e: Copyright © 2010 Pearson Education, Inc. 15 Chances, Probabilities, and Odds 15.1Random Experiments and.
1 Counting Rules. 2 The probability of a specific event or outcome is a fraction. In the numerator we have the number of ways the specific event can occur.
Combinations and Probability
Probability And Expected Value ————————————
1 Counting Rules. 2 The probability of a specific event or outcome is a fraction. In the numerator we have the number of ways the specific event can occur.
1 Probability Parts of life are uncertain. Using notions of probability provide a way to deal with the uncertainty.
4.1. Fundamental Counting Principal Find the number of choices for each option and multiply those numbers together. Lets walk into TGIF and they are offering.
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.
1 © 2010 Pearson Education, Inc. All rights reserved 10.1 DEFINITION OF A SEQUENCE An infinite sequence is a function whose domain is the set of positive.
1 9/8/2015 MATH 224 – Discrete Mathematics Basic finite probability is given by the formula, where |E| is the number of events and |S| is the total number.
Bell Work Suppose 10 buttons are placed in a bag (5 gray, 3 white, 2 black). Then one is drawn without looking. Refer to the ten buttons to find the probability.
1 9/23/2015 MATH 224 – Discrete Mathematics Basic finite probability is given by the formula, where |E| is the number of events and |S| is the total number.
X of Z: MAJOR LEAGUE BASEBALL ATTENDANCE Rather than solving for z score first, we may be given a percentage, then we find the z score, then we find the.
7 Further Topics in Algebra © 2008 Pearson Addison-Wesley. All rights reserved Sections 7.4–7.7.
Counting. Techniques for counting Rule 1 Suppose we carry out have a sets A 1, A 2, A 3, … and that any pair are mutually exclusive (i.e. A 1  A 2 =
Finding Probability Using Tree Diagrams and Outcome Tables
Basic Counting. This Lecture We will study some basic rules for counting. Sum rule, product rule, generalized product rule Permutations, combinations.
EXIT NEXT Click one of the buttons below or press the enter key BACKTOPICSProbability Mayeen Uddin Khandaker Mayeen Uddin Khandaker Ph.D. Student Ph.D.
Topics to be covered: Produce all combinations and permutations of sets. Calculate the number of combinations and permutations of sets of m items taken.
Copyright © Cengage Learning. All rights reserved. CHAPTER 9 COUNTING AND PROBABILITY.
El primero examen trimestal.  For the function, find a. b. Your answer is a.
Copyright © Ed2Net Learning Inc.1. 2 Warm Up Use the Counting principle to find the total number of outcomes in each situation 1. Choosing a car from.
Discrete Mathematical Structures (Counting Principles)
College Algebra Fifth Edition James Stewart Lothar Redlin Saleem Watson.
College Algebra Sixth Edition James Stewart Lothar Redlin Saleem Watson.
Warm-Up 1. What is Benford’s Law?
Notes on PROBABILITY What is Probability? Probability is a number from 0 to 1 that tells you how likely something is to happen. Probability can be either.
Chapter 6 With Question/Answer Animations 1. Chapter Summary The Basics of Counting The Pigeonhole Principle Permutations and Combinations Binomial Coefficients.
Slide 7- 1 Copyright © 2006 Pearson Education, Inc. Publishing as Pearson Addison-Wesley.
Probability Section 7.1.
Fall 2002CMSC Discrete Structures1 One, two, three, we’re… Counting.
Praxis I Math Review By: Professor Peter Eley. Question 1 Text answers to A scientist has a very sophisticated microscope and laser cutting tool.
1 CSC 321: Data Structures Fall 2013 Counting and problem solving  mappings, bijection rule  sequences, product rule, sum rule  generalized product.
March 10,  Counting  Fundamental Counting principle  Factorials  Permutations and combinations  Probability  Complementary events  Compound.
Homework Homework due now. Reading: relations
7th Probability You can do this! .
Sequences and Summations Section 2.4. Section Summary Sequences. – Examples: Geometric Progression, Arithmetic Progression Recurrence Relations – Example:
Copyright © Ed2Net Learning Inc.1. 2 Warm Up Tell whether each event is dependent or independent 1. Selecting a name from a Chicago telephone book and.
Fundamental Concepts of Algebra
Some other set notation We will use the notation to mean that e is an element of A. We will use the notation to mean that e is not an element of A.
Probability. What is probability? Probability discusses the likelihood or chance of something happening. For instance, -- the probability of it raining.
Copyright © Ed2Net Learning Inc.1. 2 Warm Up Tell whether each event is dependent or independent 1. Selecting a name from a Chicago telephone book and.
 Counting  Fundamental Counting principle  Factorials  Permutations and combinations  Probability  Complementary events  Compound events  Independent.
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.
EXIT NEXT Click one of the buttons below or press the enter key BACKTOPICSEXIT NEXT Click one of the buttons below or press the enter key BACKTOPICS.
Expected Value and Fair Game S-MD.6 (+) Use probabilities to make fair decisions (e.g., drawing by lots, using a random number generator). S-MD.7 (+) Analyze.
Warm Up 1. Gretchen is making dinner. She has tofu, chicken and beef for an entrée, and French fries, salad and corn for a side. If Ingrid has 6 drinks.
Warm Up 1. Ingrid is making dinner. She has tofu, chicken and beef for an entrée, and French fries, salad and corn for a side. If Ingrid has 6 drinks to.
1 What Is Probability?. 2 To discuss probability, let’s begin by defining some terms. An experiment is a process, such as tossing a coin, that gives definite.
ICS 253: Discrete Structures I
The Pigeonhole Principle
What Is Probability?.
CSC 321: Data Structures Fall 2015 Counting and problem solving
Bell Work.
COCS DISCRETE STRUCTURES
BASIC PROBABILITY Probability – the chance of something (an event) happening # of successful outcomes # of possible outcomes All probability answers must.
Probability Probability underlies statistical inference - the drawing of conclusions from a sample of data. If samples are drawn at random, their characteristics.
Warm Up Which of the following are combinations?
Probability 14.1 Experimental Probability 14.2 Principles of Counting
Basic Counting.
Probability Section 19 NOTE: We are skipping Section 18. 2/21/2019
Week 2 Section 2.4, 2.5, 2.6 and section 2.7 Srabasti dutta.
Presentation transcript:

Chapter 6 Counting Arguments

The Pigeonhole Principle: Pigeonhole principle: let k be a positive integer. Imagine that you are delivering k+1 letters to k mailboxes. Then it must be that some mailbox will receive two letters. Counting Arguments

Example: Joe needs to get up at 4am each morning to go to work. He needs to get a pair of matching socks from his drawer without turning on the light and disturbing his wife. He knows that there are socks of three different colours, unpaired and randomly distributed, in the drawer. How many socks should he grab so that he can be sure to have a pair of the same colours? Counting Arguments

Solution: Call the sock colours red, green, and yellow. If Joe grabs three socks then one could be red, one could be green, and one could be yellow. So that will not do. The answer is that Joe should grab four socks (by the pigeonhole principle) Counting Arguments

Example: Suppose that a standard dartboard has radius 10 inches. We throw seven darts at the dartboard. Why is it true that two of the darts will be distance at most 10 inches apart? Counting Arguments

Solution: Examine the dartboard divided into six regions. But there are seven darts. By the pigeonhole principle, two of the darts must land in same region Counting Arguments

Orders and Permutations: Suppose that we have n objects, in how many different orders can they be presented? a1, a2, a3,…, an Counting Arguments

Example: Take n to be 3, in how many different orders can we present these objects? Look at the first position. We can put any of the n objects in that first position, so there are n possibilities for the first position. Next go to the second position. Counting Arguments

A B C, A C B, B A C, B C A, C A B, C B A For the second position one object is used up, so there are n-1 objects remaining. Any one of those n-1 objects can go into the second position. Now examine the third position. There are n-2 can objects remaining ( since two of them are used up). So any of those n- 2 can be in the third position. And so forth Counting Arguments

To count the total number of possible ordering, we multiply together all these counts: Number of permutation of n objects= n.(n-1).(n-2)… This expression is called n factorial, and is written n!. Counting Arguments

Example: In how many different ways can we order five objects? Solution: The number of permutations of five objects is 5!= =120 There are 120 different permutations of 5 objects. Counting Arguments

Choosing and the Binomial Coefficients: Suppose that you have n objects and you are going to choose k of them (0≤k≤n). In how many different ways can you do this? Just to illustrate the idea, take n=3 and k=2. For convenience we have labelled the objects, A, B, C. The different ways that we can choose two from the three are: {A,B}, {A,C}, {B,C} Counting Arguments

This is a very common expression in mathematics, and we give it the name n choose k. We denote this quantity by

Counting Arguments Example: In how many different ways can we choose two objects from among five? Solution: In fact if the five objects are a, b, c. d. and e then the five possible choices of two are: {a,b}, {a,c}, {a,d}, {a,e}, {b,c}, {b,d}, {b,e}, {c,d}, {c,e}, {d,e}.

Counting Arguments Example: How many different 5-card poker hands are there in a standard 52-card deck of cards? Solution: The answer is

Counting Arguments Other Counting Arguments: Mathematical summation notation

Example: Draw a planar grid that is 31 squares wide and 17 squares high. How many different nontrivial (widths and height are positive) rectangles can be drawn, using the lines of the grid to determine the boundaries? Counting Arguments

Solution: The total of rectangles are 31X17=527 We can say

Counting Arguments Geometric Sum:

Counting Arguments Example: Let λ be a real number and k a positive integer. Calculate the sum of the geometric

Counting Arguments Solution:

Counting Arguments So

Counting Arguments Also

Generating Functions Powerful technique of generating functions. Example: Fibonacci sequence 1,1,2,3,5,8,13,21,34,55,…

Solution: We shall use the method of generating function, a powerful technique that is used throughout the mathematical sciences. Generating Functions

A Few Words About Recursion Relations The sequences is list never stops. It is frequently the case that we will have a rule that tells us the value of the jth element of the list in terms of some of the previous elements. This situation is called a recursion. The method of generating functions can sometimes be used to good effect to solve recursions. Generating Functions

Example: A sequence is defined by the rule Use the method of generating functions to find a formula for

Generating Functions

This is the solution to our recursion problem

Generating Functions Use the method of generating functions to find a formula for aj Q1: A sequence is defined by the rule Q2: A sequence is defined by the rule

Generating Functions Exercise (9) Solve the recursion

Probability This is a very common expression in mathematics, and we give it the name n choose k. We denote this quantity by

Probability If we are flipping a coin, then there are two possible outcomes heads and tails

Example: A girl flips a fair coin five times. What is the probability that precisely three of the flips will come up heads? Solution: Each flip has two possible outcomes. So the total number of possible outcomes for five flips is Probability

=32 Now the number of ways that three head flips can occur is the number of ways that three objects can be chosen from five. This is

Probability We conclude that the answer to the question is

Conclude the probability that the girl in the last example will get zero heads, one head, two heads, three heads, four heads, five heads. Add up all these result. The answer should of course be 1. Probability

Example: Eight slips of paper with the letters A, B, C, D, E, F, G, and H written on them are placed into a bin. The eight slips are drawn one by one from the bin. What is the probability that the first four to come out are A, C, E, and H (in some order) Probability

The number of different ways to choose four objects from among eight is Of these different subsets of four, only one will be the set [A,C,E,H]. Thus the probability of the first four slips being the ones that we want will be 1/70

Example: Suppose that you have 37 envelopes and you address 37 letters to go with them. Closing your eyes, you randomly stuff one letter into each envelope. What is the probability that precisely two letters are in the wrong envelopes and all others in the correct envelope? Probability

Exercises (4): There are 20 people sitting in a waiting room. The functionary in charge must choose five of these people to go to the green sanctuary and three of these people to go to the red sanctuary. In how many different ways can she do this? Probability

The rule for forming Pascal’s triangle is this: 1) A 1 goes at the top vertex 2) Each term in each subsequent row is formed by adding together the two numbers that are to the upper left and upper right of the given term. Pascal’s Triangle

Exercises 1) There are 300 adult people in a room, none of them obese. Explain why two of them must have the same weight (in whole numbers of pounds).

A1) Assuming that everyone is healthy, we may suppose that the weights of people in the room range from 75 pounds to 200 pounds. That is a range of 126 possible value. And each of 300 people will have one such value. So there are 300 letters and 126 mailboxes. It follows that two people will have the same weight. Exercises

2) There are 50 people in a room, none of them obese. Explain why two of them must have the same waist measurement (in whole numbers of inches). Exercises

A2) The waist measurements will be in the range 15 inches to 45 inches. That is a span of 31 values. But there are 50 people. Just as in the last problem, to people will have the same measurement. Exercises

3) Explain why the answer to Exercise 2 changes if the waist measurement is change to whole numbers of millimetres. Exercises

A3) If instead we measure waist size by millimetres, then the range will be from 15X25.4=381 to 45X25.4=1143. That is a span of 763 possible values. Since there are just 50 people, each person could have a different waist measurement in millimeters. Exercises

5) In a standard deck of 52 playing cards, in how many different ways can you form two-of-a-kind? Exercises

A5) Given any particular denomination of card (from two through ace), there are four cards of that kind. There are four different ways to choose three from among those. And 13 different denominations. Hence there are 4X13=52 different ways to form three- of-a-kind. Exercises

6) In a standard deck of 52 playing cards, in how many different ways can you form four-of-a-kind. Exercises

A6) The analysis here is similar to the last problem. Given any particular denomination, there is just one way to form four of that kind. And there are 13 different denominations. Thus there are 13 different ways to from four-of-a- kind. Exercises

7) A standard dice used for gambling is a six-side cube, with the sides numbered 1 through 6. You usually roll two dice at a time, and the two face-up values are added together to give your score. What is the likelihood that you will roll a seven? Exercises

A7) The only way to roll a 7 are 1-6, 6- 1, 2-5, 5-2, 4-3, and 3-4 (where we are taking into account that there are two dice, so two ways to realize any particular score). And there are 6X6=36 possible outcomes altogether. So the likelihood is 6/36=1/6 Exercises

8) Refer to the last exercise for terminology. What is the chance that you will roll two dice and get a two? How about a 12? Are there any other values that give this same answer? Why or why not?. Exercises

A8) The only way to get a 2 is 1-1. Thus the chances of getting a 2 are 1/36. Also there is only one way to get a 12. So the chances of getting a 12 are 1/36. Every other value can be achieved in more than one way, so these are the only two values for which the odds are 1/36. Exercises

9) Again refer to Exercise 7 for terminology. Now suppose that you are rolling three dice. Your score is obtained by adding together the three face values. What is your probability of getting a 10? Exercises

A9) The only ways to get a 10 are And the six permutations of each of these. So there are 6X7=42 rolls that give 10. There are 6X6X6=216 possible rolls. Thus the odds are 42/216=7/36. Exercises