Math 166: Topics in Contemporary Mathematics II

Similar documents
{ a, b }, { a, c }, { b, c }

Section 5.4 Permutations and Combinations

Section 5.4 Permutations and Combinations

Finite Math - Fall 2016

Poker Hands. Christopher Hayes

Name: Exam 1. September 14, 2017

7.4 Permutations and Combinations

Math-Essentials. Lesson 9-2: Counting Combinations

Fundamentals of Probability

2.5 Sample Spaces Having Equally Likely Outcomes

More Probability: Poker Hands and some issues in Counting

CHAPTER 8 Additional Probability Topics

Principles of Mathematics 12: Explained!

Mat 344F challenge set #2 Solutions

Permutations: The number of arrangements of n objects taken r at a time is. P (n, r) = n (n 1) (n r + 1) =

Permutations and Combinations Section

CISC 1400 Discrete Structures

Slide 1 Math 1520, Lecture 13

Suppose you are supposed to select and carry out oneof a collection of N tasks, and there are T K different ways to carry out task K.

STAT Statistics I Midterm Exam One. Good Luck!

Contemporary Mathematics Math 1030 Sample Exam I Chapters Time Limit: 90 Minutes No Scratch Paper Calculator Allowed: Scientific

Poker: Further Issues in Probability. Poker I 1/29

Block 1 - Sets and Basic Combinatorics. Main Topics in Block 1:

6/24/14. The Poker Manipulation. The Counting Principle. MAFS.912.S-IC.1: Understand and evaluate random processes underlying statistical experiments

Poker: Probabilities of the Various Hands

Chapter 2. Permutations and Combinations

Section : Combinations and Permutations

Mixed Counting Problems

Elementary Combinatorics

MGF 1106: Exam 2 Solutions

Jong C. Park Computer Science Division, KAIST

6) A) both; happy B) neither; not happy C) one; happy D) one; not happy

Permutations. Used when "ORDER MATTERS"

Finite Math Section 6_4 Solutions and Hints

3 The multiplication rule/miscellaneous counting problems

Discrete Structures Lecture Permutations and Combinations

Discrete Finite Probability Probability 1

Poker: Probabilities of the Various Hands

Chapter 5 - Elementary Probability Theory

More with Combinations

POKER (AN INTRODUCTION TO COUNTING)

3 The multiplication rule/miscellaneous counting problems

Counting Poker Hands

Probability. The MEnTe Program Math Enrichment through Technology. Title V East Los Angeles College

CSE 312: Foundations of Computing II Quiz Section #1: Counting (solutions)

Fundamental Counting Principle

The probability set-up

M146 - Chapter 5 Handouts. Chapter 5

Math 42, Discrete Mathematics

Counting (Enumerative Combinatorics) X. Zhang, Fordham Univ.

November 8, Chapter 8: Probability: The Mathematics of Chance

A Probability Work Sheet

Reading 14 : Counting

November 6, Chapter 8: Probability: The Mathematics of Chance

Slide 1 Math 1520, Lecture 15

Tree Diagrams and the Fundamental Counting Principle

Compound Probability. Set Theory. Basic Definitions

November 11, Chapter 8: Probability: The Mathematics of Chance

Math Exam 2 Review. NOTE: For reviews of the other sections on Exam 2, refer to the first page of WIR #4 and #5.

Math Exam 2 Review. NOTE: For reviews of the other sections on Exam 2, refer to the first page of WIR #4 and #5.

Permutations and Combinations

The probability set-up

1. An office building contains 27 floors and has 37 offices on each floor. How many offices are in the building?

4. Are events C and D independent? Verify your answer with a calculation.

Pan (7:30am) Juan (8:30am) Juan (9:30am) Allison (10:30am) Allison (11:30am) Mike L. (12:30pm) Mike C. (1:30pm) Grant (2:30pm)

6.4 Permutations and Combinations

Math 227 Elementary Statistics. Bluman 5 th edition

STAT 430/510 Probability Lecture 3: Space and Event; Sample Spaces with Equally Likely Outcomes

CSE 312: Foundations of Computing II Quiz Section #1: Counting

MULTIPLE CHOICE. Choose the one alternative that best completes the statement or answers the question.

n! = n(n 1)(n 2) 3 2 1

The point value of each problem is in the left-hand margin. You must show your work to receive any credit, except on problems 1 & 2. Work neatly.

Determine whether the given events are disjoint. 4) Being over 30 and being in college 4) A) No B) Yes

Chapter 3: Elements of Chance: Probability Methods

Permutations and Combinations. MATH 107: Finite Mathematics University of Louisville. March 3, 2014

If you roll a die, what is the probability you get a four OR a five? What is the General Education Statistics

Permutations and Combinations

MATH 215 DISCRETE MATHEMATICS INSTRUCTOR: P. WENG

Board Question 1. There are 5 Competitors in 100m final. How many ways can gold silver and bronze be awarded? May 27, / 28

Introduction. Firstly however we must look at the Fundamental Principle of Counting (sometimes referred to as the multiplication rule) which states:

The Product Rule The Product Rule: A procedure can be broken down into a sequence of two tasks. There are n ways to do the first task and n

5.8 Problems (last update 30 May 2018)

CHAPTER 2 PROBABILITY. 2.1 Sample Space. 2.2 Events

Unit 5 Radical Functions & Combinatorics

Section 6.4 Permutations and Combinations: Part 1

Unit Nine Precalculus Practice Test Probability & Statistics. Name: Period: Date: NON-CALCULATOR SECTION

Foundations of Computing Discrete Mathematics Solutions to exercises for week 12

Section Summary. Permutations Combinations Combinatorial Proofs

WEEK 7 REVIEW. Multiplication Principle (6.3) Combinations and Permutations (6.4) Experiments, Sample Spaces and Events (7.1)

Combinations Example Five friends, Alan, Cassie, Maggie, Seth and Roger, have won 3 tickets for a concert. They can t afford two more tickets.

Contents 2.1 Basic Concepts of Probability Methods of Assigning Probabilities Principle of Counting - Permutation and Combination 39

Week 1: Probability models and counting

Probability and Statistics. Copyright Cengage Learning. All rights reserved.

Unit 5 Radical Functions & Combinatorics

Finite Math B, Chapter 8 Test Review Name

CSE 21 Mathematics for Algorithm and System Analysis

1) 1) 2) 2) 3) 3) 4) 4) 5) 5) 6) 6) 7) 7) 8) 8) 9) 9) 10) 10) 11) 11) 12) 12)

CSE 312: Foundations of Computing II Quiz Section #2: Inclusion-Exclusion, Pigeonhole, Introduction to Probability (solutions)

AMC AMS AMR ACS ACR ASR MSR MCR MCS CRS

Elementary Combinatorics CE 311S

Transcription:

Math 166: Topics in Contemporary Mathematics II Xin Ma Texas A&M University September 30, 2017 Xin Ma (TAMU) Math 166 September 30, 2017 1 / 11

Last Time Factorials For any natural number n, we define n! = n(n 1)(n 2) 3 2 1 particularly, 0! = 1 Number of Permutations The number of permutations of r distinct objects taken from a set of size n is given by P(n, r) = n(n 1)(n 2) (n r + 1) = n! (n r)! Particularly, P(n, n) = n(n 1)(n 2) 2 1 = n! Xin Ma (TAMU) Math 166 September 30, 2017 2 / 11

Combinations Given the set a, b, c we know that there are P(3, 2) = 6 ways of selecting two of the these at a time when order is important. They are (a, b), (b, a), (a, c), (c, a), (b, c), (c, b). How many ways are there if the order is not important? In this case, (a, b) is the same as (b, a), (a, c) is the same as (c, a) and (b, c) is the same as (c, b). Thus, there are only three ways of selecting two objects when the order doesn t matter and they are (a, b), (a, c) and (b, c). Combinations A combination of the r distinct objects taken form a set having n elements is a selection of r of the objects (without concern for order). Xin Ma (TAMU) Math 166 September 30, 2017 3 / 11

Number of Combinations We know the number of permutations of r objects taken form a set of size n is given by P(n, r). Similarly, we denote the number of the combinations of r objects taken form a set of size n by C(n, r). Xin Ma (TAMU) Math 166 September 30, 2017 4 / 11

Number of Combinations We know the number of permutations of r objects taken form a set of size n is given by P(n, r). Similarly, we denote the number of the combinations of r objects taken form a set of size n by C(n, r). Number of Combinations The number of combinations of r distinct objects taken from a set of size n is given by C(n, r) = P(n, r) r! = n! (r!)(n r)! Xin Ma (TAMU) Math 166 September 30, 2017 4 / 11

Number of Combinations We know the number of permutations of r objects taken form a set of size n is given by P(n, r). Similarly, we denote the number of the combinations of r objects taken form a set of size n by C(n, r). Number of Combinations The number of combinations of r distinct objects taken from a set of size n is given by C(n, r) = P(n, r) r! = n! (r!)(n r)! Example: Find C(7, 3) and C(7, 4). Xin Ma (TAMU) Math 166 September 30, 2017 4 / 11

Number of Combinations We know the number of permutations of r objects taken form a set of size n is given by P(n, r). Similarly, we denote the number of the combinations of r objects taken form a set of size n by C(n, r). Number of Combinations The number of combinations of r distinct objects taken from a set of size n is given by C(n, r) = P(n, r) r! = n! (r!)(n r)! Example: Find C(7, 3) and C(7, 4). Note: By the formula above, we have C(n, r) = C(n, n r). Xin Ma (TAMU) Math 166 September 30, 2017 4 / 11

Number of Combinations Calculating C(n, r) Using Your Calculator: 1 Input the total number of objects in your set, n 2 Press MATH 3 Scroll to PRB 4 Select ncr (Option 3) 5 Input the number of objects being selected, r 6 Press ENTER Example: Find P(20, 6) and C(20, 6) Xin Ma (TAMU) Math 166 September 30, 2017 5 / 11

Number of Combinations Calculating C(n, r) Using Your Calculator: 1 Input the total number of objects in your set, n 2 Press MATH 3 Scroll to PRB 4 Select ncr (Option 3) 5 Input the number of objects being selected, r 6 Press ENTER Example: Find P(20, 6) and C(20, 6) P(20, 6) = 27907200 and C(20, 6) = 38760. Xin Ma (TAMU) Math 166 September 30, 2017 5 / 11

a. Papa John s pizza has 18 selections for toppings. How many ways are there to order a 3-topping pizza? Xin Ma (TAMU) Math 166 September 30, 2017 6 / 11

a. Papa John s pizza has 18 selections for toppings. How many ways are there to order a 3-topping pizza? By the definition of combination numbers, there are C(18, 3) = 816 many choices. b. How many different 5-card poker hands can be dealt from a standard deck of 52 cards? Xin Ma (TAMU) Math 166 September 30, 2017 6 / 11

a. Papa John s pizza has 18 selections for toppings. How many ways are there to order a 3-topping pizza? By the definition of combination numbers, there are C(18, 3) = 816 many choices. b. How many different 5-card poker hands can be dealt from a standard deck of 52 cards? C(52, 5) = 2598960 c. How many different flushes (5 cards in a same suit) can be dealt from a standard deck of 52 cards? Xin Ma (TAMU) Math 166 September 30, 2017 6 / 11

a. Papa John s pizza has 18 selections for toppings. How many ways are there to order a 3-topping pizza? By the definition of combination numbers, there are C(18, 3) = 816 many choices. b. How many different 5-card poker hands can be dealt from a standard deck of 52 cards? C(52, 5) = 2598960 c. How many different flushes (5 cards in a same suit) can be dealt from a standard deck of 52 cards? We view this as a sequence of two tasks. The first one is to choose a suit (spade, diamond, club and heart). Then choose 5 cards from all cards of the suit, which has C(13, 5) many cases. Therefore, we have 4 C(13, 5) = 5148 many cases. Xin Ma (TAMU) Math 166 September 30, 2017 6 / 11

a. Find the number of poker hands with three queens and two jacks. Xin Ma (TAMU) Math 166 September 30, 2017 7 / 11

a. Find the number of poker hands with three queens and two jacks. We view this as a sequence of two tasks. The first one is to choose 3 queens from 4 queens, which has C(4, 3) = 4 cases. The second one is to choose 2 jacks from 4 jacks, which has C(4, 2) = 6 cases. Therefore, we have 4 6 = 24 cases in total. b. A committee of 15 people need to elect a chair, two associate chairs and three secretaries. How many ways can this be done if no one can hold multiple positions? Xin Ma (TAMU) Math 166 September 30, 2017 7 / 11

a. Find the number of poker hands with three queens and two jacks. We view this as a sequence of two tasks. The first one is to choose 3 queens from 4 queens, which has C(4, 3) = 4 cases. The second one is to choose 2 jacks from 4 jacks, which has C(4, 2) = 6 cases. Therefore, we have 4 6 = 24 cases in total. b. A committee of 15 people need to elect a chair, two associate chairs and three secretaries. How many ways can this be done if no one can hold multiple positions? We view this as a sequence of three tasks. The first one is to choose 1 chair from 15 people. There is C(15, 1). Then we choose two associate chairs from rest 14 people: C(14, 2). At last, we choose 3 people from rest 12 people: C(12, 3). Then in total we have C(15, 1)C(14, 2)C(12, 3) = 300300 ways to do. Xin Ma (TAMU) Math 166 September 30, 2017 7 / 11

a. Find the number of poker hands with three queens and two jacks. We view this as a sequence of two tasks. The first one is to choose 3 queens from 4 queens, which has C(4, 3) = 4 cases. The second one is to choose 2 jacks from 4 jacks, which has C(4, 2) = 6 cases. Therefore, we have 4 6 = 24 cases in total. b. A committee of 15 people need to elect a chair, two associate chairs and three secretaries. How many ways can this be done if no one can hold multiple positions? We view this as a sequence of three tasks. The first one is to choose 1 chair from 15 people. There is C(15, 1). Then we choose two associate chairs from rest 14 people: C(14, 2). At last, we choose 3 people from rest 12 people: C(12, 3). Then in total we have C(15, 1)C(14, 2)C(12, 3) = 300300 ways to do. NOTE: it is similar to permutation. Why we cannot use P(15, 5)? Xin Ma (TAMU) Math 166 September 30, 2017 7 / 11

A committee of 15 people need to choose a chair, an associate chair and a secretary. How many ways can this be done? Xin Ma (TAMU) Math 166 September 30, 2017 8 / 11

A committee of 15 people need to choose a chair, an associate chair and a secretary. How many ways can this be done? P(15, 3) = 15 14 13 = 2730. Xin Ma (TAMU) Math 166 September 30, 2017 8 / 11

A committee of 15 people need to choose a chair, an associate chair and a secretary. How many ways can this be done? P(15, 3) = 15 14 13 = 2730. By the same way: C(15, 1)C(14, 1)C(13, 1) = 15 14 13 = 2730 = P(15, 3). Xin Ma (TAMU) Math 166 September 30, 2017 8 / 11

A committee of 15 people need to choose a chair, an associate chair and a secretary. How many ways can this be done? P(15, 3) = 15 14 13 = 2730. By the same way: C(15, 1)C(14, 1)C(13, 1) = 15 14 13 = 2730 = P(15, 3). Why we can use permutation for this example? What is the difference between this one and the question above. Xin Ma (TAMU) Math 166 September 30, 2017 8 / 11

A committee of 20 people consists 12 men and 8 women. In how many ways can a subcommittee of 7 be formed if the subcommittee consists of a. any 7 committee members? Xin Ma (TAMU) Math 166 September 30, 2017 9 / 11

A committee of 20 people consists 12 men and 8 women. In how many ways can a subcommittee of 7 be formed if the subcommittee consists of a. any 7 committee members? C(20, 7) = 77520 b. all men? Xin Ma (TAMU) Math 166 September 30, 2017 9 / 11

A committee of 20 people consists 12 men and 8 women. In how many ways can a subcommittee of 7 be formed if the subcommittee consists of a. any 7 committee members? C(20, 7) = 77520 b. all men? C(12, 7) = 792. c. only one woman? Xin Ma (TAMU) Math 166 September 30, 2017 9 / 11

A committee of 20 people consists 12 men and 8 women. In how many ways can a subcommittee of 7 be formed if the subcommittee consists of a. any 7 committee members? C(20, 7) = 77520 b. all men? C(12, 7) = 792. c. only one woman? C(8, 1)C(12, 6) = 7392 Xin Ma (TAMU) Math 166 September 30, 2017 9 / 11

d. at least two women? Xin Ma (TAMU) Math 166 September 30, 2017 10 / 11

d. at least two women? Think about set theory! What we are doing is counting a number n(a) of a set A. Then union law helps a lot to solve problems of this type and it is helpful to realize this to learn section 2.3 Xin Ma (TAMU) Math 166 September 30, 2017 10 / 11

d. at least two women? Think about set theory! What we are doing is counting a number n(a) of a set A. Then union law helps a lot to solve problems of this type and it is helpful to realize this to learn section 2.3 (a) gives the number that we have 77520 many ways to choose such a committee without any restriction. (b) gives the number of ways that the committee has ZERO women. (c) gives the number of ways that the committee has exactly ONE women. Thus, by Union Law we have C(20, 7) C(12, 7) C(8, 1)C(12, 6) = 69336 many ways to choose a committee with at least two women. Xin Ma (TAMU) Math 166 September 30, 2017 10 / 11

Suppose a box contains 9 red balls, 7 blue balls and 8 black balls. How many ways we can pick 7 balls such that there are at least 4 blue balls? Xin Ma (TAMU) Math 166 September 30, 2017 11 / 11

Suppose a box contains 9 red balls, 7 blue balls and 8 black balls. How many ways we can pick 7 balls such that there are at least 4 blue balls? We have two ways: (Venn diagram) 1. C(7, 4)C(17, 3) + C(7, 5)C(17, 2) + C(7, 6)C(17, 1) + C(7, 7) Xin Ma (TAMU) Math 166 September 30, 2017 11 / 11

Suppose a box contains 9 red balls, 7 blue balls and 8 black balls. How many ways we can pick 7 balls such that there are at least 4 blue balls? We have two ways: (Venn diagram) 1. C(7, 4)C(17, 3) + C(7, 5)C(17, 2) + C(7, 6)C(17, 1) + C(7, 7) 2. C(24, 7) C(17, 7) C(17, 6)C(7, 1) C(17, 5)C(7, 2) C(17, 4)C(7, 3) Xin Ma (TAMU) Math 166 September 30, 2017 11 / 11