aabb abab abba baab baba bbaa permutations of these. But, there is a lot of duplicity in this list, each distinct word (such as 6! 3!2!1!

Size: px
Start display at page:

Download "aabb abab abba baab baba bbaa permutations of these. But, there is a lot of duplicity in this list, each distinct word (such as 6! 3!2!1!"

Transcription

1 Introduction to COMBINATORICS In how many ways (permutations) can we arrange n distinct objects in a row?answer: n (n ) (n )... def. = n! EXAMPLE (permuting objects): What is the number of different permutations of n + n n k objects, n (n,...n k ) of them being indistinguishable, e.g. aabb abab abba baab baba bbaa Another EXAMPLE: aaabbc. First consider them distinguishable: a a a b b c. There is 6! permutations of these. But, there is a lot of duplicity in this list, each distinct word (such as babaac) appears!!! times: b a b a a c, b a b a a c, b a b a a c, b a b a a c, b a b a a c, b a b a a c, b a b a a c, b a b a a c, b a b a a c, b a b a a c, b a b a a c, b a b a a c. Dividing 6! by this multiplicity factor yields 6!!!! =60 for the number of distinct words one can create by permuting aaabbc. A shorthand notation ³ 6! for is 6, called multinomial coefficient.!!!,, In general, the answer is (n + n + n n k )! n!n!n!...n k! Selecting out of letters (say a, b, c). There are 4 different answers, depending on:

2 . The order is important, duplication is not allowed: ab, ac, ba, bc, ca, cb. Order irrelevant: ab, ac, bc. Order important again, but now each letter can be used any number of times: aa, ab, ac, ba, bb, bc, ca, cb, cc 4. Order irrelevant: aa, ab ba, ac ca, bb, bc cb, cc Selecting r out of n distinct objects. n (n ) (n )... (n r +)= n! (n r)! P n r. Each unordered selection of r letters will appear, in the previous list, exactly r! times. The answer: n! ³ n (n r)!r! Cn r r called binomial coefficient. Note the symmetry.. When we can use each letter repeatedly, for ordered selection we get n n n... n = n r 4. The last formula is more difficult to derive. Note the each possible result can be represented by... with r dots and n bars. For example, selecting 5 letters from a, b, c, d

3 represents a s and c s. The answer: (n + r )! r!(n )! µ n + r = r Note that the last formula also counts the number of ways to write r as a sum of n non-negative integers, order relevant! Binomial expansion (x + y) n =(x + y)(x + y)...(x + y) =xxx...x + yxx...x yyy...y. Thisisthesum of all possible n-letter words, using a -letter alphabet. How many of them have exactly i x s and n iy s? Well, there is exactly n i such words and, algebraically, they have the same value of x i y n i. Answer: (x + y) n = nx i=0 ³ n i x i y n i Example: ( x ) 4 =+4 x +6 x +4 x + x 4 Extension: ( + x) n =+ ³ n ³ n ³ n x + x + x +... remains true (as a Taylor expansion) even when n is negative and/or non-integer, with the understanding that n i n (n )... (n i+). For example i! ( + x) = x +6x 0x +5x 4... ( + x) = + x + 8 x 6 x + 8 x Multinomial expansion

4 (x + y + z) n =(x + y + z)(x + y + z)...(x + y + z) =xxx...x + yxx...x zzz...z (complete dictionary of all n-letter words composed of x, y and z). How many of them have ix s, jy s and kz s? Well, we know that there are of these, and each of them will be there, exactly once. Thus (x + y + z) n = X i,j,k 0 i+j+k=n ³ n i,j,k µ n x i y j z k i, j, k How many terms does this formula have? We have to choose n symbols from x, y and z, repetition allowed, orderless, i.e. n+. EXAMPLES: (x + y + z) = x + y + z +x y +x z +xy +xz +y z +yz +6xyz (0 terms) Find the coefficient of ut in the expansion of (u + 4t) 5. Solution: The only term containing ut is: ( 5,, )(u) () ( 4t) = 560ut. ( + x 5x ) 7 is a 4-degree polynomial in x. When expressed as such (i.e. when expanded, and terms with like powers of x are combined), what will be the coefficient of x 4? Solution: ( 7 i,j,k )()i (x) j ( 5x ) k is the general term of this expansion. Let us make i j k a table of the exponents which contribute to x 4 : This translates to: ( 7 4 )(x)4 +( 7 4,, )(x) ( 5x )+( 7 )( 5x ) = 680x Partitioning 4

5 n distinct objects are to be divided into several groups of a given size each, e.g. 9 people into teams of size 4, and. Answer: ³ = 9 = 60 -sameasthenumber 4,, of permutations of aaaabbbcc. What is some of the groups are of the same size, and we consider them interchangeable, e.g. divide 9 people into groups of size each, considering and as thesame partitioning.theanswer: ³ 9,, = 80.! Another example: 0 people into groups of 4, groupsof and groups of : ³ 0 4,4,,,,,!!! =6, 08, 047, 000 Circular arrangement When arranging n people around a (circular) table (instead of a row), and we care only about who are the left and right neighbors of each person, the amount of duplicity in the list of the original n! (row) arrangements is n. So, in this sense, there are only n! n distinct circular arrangements of n people. END-OF-CHAPTER EXAMPLES: =(n )!. A team plays a series of 0 games which they can either win (W ), lose (L) or tie (T ). (a) How many possible outcomes (order is important). Answer: 0 = (b) How many of these have exactly 5 wins, 4 losses and tie? Answer: 0 5,4, =60. (c) Sameas(a) ifwedon t care about the order of wins, losses and ties? Answer: =66(only one of these will have 5 wins, 4 losses and tie). 5

6 . A student has to answer 0 true-false questions. (a) In how many distinct ways can this be done? Answer: 0 = (b) How many of these will have exactly 7 correct answers? Answer: 0 7 = (c) At least 7 correct answers? (d) Fewer than? (excludes ): =. 0 = =5.. In how many ways can A s, 4 F s, 4 D s and C s be arranged (a) in a row. Answer:,4,4, = = (b) In how many of these will like letters stay together? Answer: 4! = 4. (c) Repeat (a) with circular arrangement: Answer: = (d) Repeat (b) with circular arrangement: Answer:! = Four couples (Mr&Mrs A, Mr&Mrs B,...) are to be seated at a round table. (a) In how many ways can this be done? Answer: 7! = (b) How many of these have all spouses sit next to each other? Answer:! 4 =96. (Pr =.905%). (c) How many of these have the men and women alternate? Answer: 4 =44(.86%). (d) How many of these have the men (and women) sit together? Answer: (4!) =576 (.4%). 5. In how many ways can we put books onto shelves? 6

7 (a) It the books are treated as identical: Answer: 4 =9 (b) Books as distinct, their order important. Answer: 9! = 4, 589, 45, 600. (c) Books distinct, order irrelevant. Answer: =5, Twelve men can be seated in a row in! = 479, 00, 600 number of ways (trivial). (a) How many of these will have Mr A and Mr B sit next to each other? Answer:! = 79, 8, 600. (b) How many of the original arrangements will have Mr A and Mr B sit apart? Answer:!! = 99, 68, 000. (c) How many of the original arrangements will have exactly 4peoplesitbetween Mr A and Mr B? Answer: 7 0! = 50, 80, Consider 5 distinct letters, U, R, G, F among them. These can be arranged in a row in 5! possible ways. How many of these have F and G next to each other but (at the same time) U and R apart? Answer: 4!! = 49, 448, 499, Consider the standard deck of 5 cards. Deal 5 cards from this deck. This can be done in 5 5 = distinct ways. (a) How many of these will have exactly diamonds? Answer: 9 =, 96. (b) Exactly aces? Answer: 4 48 = (c) Exactly aces and diamonds? Answer: =9, In how many ways can we deal 5 cards each to 4 players? (a) Answer: =

8 (b) So that each gets exactly one ace? Answer: =.47 0 (c) None gets any ace: Answer: = (d) Mr A gets exactly aces, the rest get none. Answer: = (e) (Any) one player gets aces, the other players get none. Answer: = (f) Mr. A gets aces. Answer: = (g) Mr. C gets aces. Clumsy answer: = , or be smart and argue that... (h) At least one player gets aces (regardless of what the others get). More difficult. 0. Roll a die five times. The number of possible (ordered) outcomes is 6 5 =7776. How many of these will have: (a) One pair of identical values(and no other duplicates). Answer: 6 5 5,,, = 600. (b) Two pairs. Answer: 6 4 5,, =800. (c) A triplet: 6 5 5,, =00. (d) Full house (a triplet and a pair): 6 5 5, =00. (e) Four of a kind : , =50. (f) Five of a kind : =6. 8

9 (g) Nothing =70. Note that all these answers properly add up to 7776 (check).. Let us try the same thing with 5 rolls of a die (6 5 = outcomes in total). How many of these will have: (a) A quadruplet, triplets, pairs and singlet: ,,,,, = (b) triplets and pairs: 6 5,,,,, = We will not try to complete this exercise; the full list would consist of 0 possibilities. 9

Discrete Mathematics: Logic. Discrete Mathematics: Lecture 15: Counting

Discrete Mathematics: Logic. Discrete Mathematics: Lecture 15: Counting Discrete Mathematics: Logic Discrete Mathematics: Lecture 15: Counting counting combinatorics: the study of the number of ways to put things together into various combinations basic counting principles

More information

Elementary Combinatorics

Elementary Combinatorics 184 DISCRETE MATHEMATICAL STRUCTURES 7 Elementary Combinatorics 7.1 INTRODUCTION Combinatorics deals with counting and enumeration of specified objects, patterns or designs. Techniques of counting are

More information

Chapter 2. Permutations and Combinations

Chapter 2. Permutations and Combinations 2. Permutations and Combinations Chapter 2. Permutations and Combinations In this chapter, we define sets and count the objects in them. Example Let S be the set of students in this classroom today. Find

More information

Reading 14 : Counting

Reading 14 : Counting CS/Math 240: Introduction to Discrete Mathematics Fall 2015 Instructors: Beck Hasti, Gautam Prakriya Reading 14 : Counting In this reading we discuss counting. Often, we are interested in the cardinality

More information

CIS 2033 Lecture 6, Spring 2017

CIS 2033 Lecture 6, Spring 2017 CIS 2033 Lecture 6, Spring 2017 Instructor: David Dobor February 2, 2017 In this lecture, we introduce the basic principle of counting, use it to count subsets, permutations, combinations, and partitions,

More information

Polynomials - Special Products

Polynomials - Special Products Polynomials - Special Products There are a few shortcuts that we can take when multiplying polynomials. If we can recognize them the shortcuts can help us arrive at the solution much quicker. These shortcuts

More information

Mat 344F challenge set #2 Solutions

Mat 344F challenge set #2 Solutions Mat 344F challenge set #2 Solutions. Put two balls into box, one ball into box 2 and three balls into box 3. The remaining 4 balls can now be distributed in any way among the three remaining boxes. This

More information

50 Counting Questions

50 Counting Questions 50 Counting Questions Prob-Stats (Math 3350) Fall 2012 Formulas and Notation Permutations: P (n, k) = n!, the number of ordered ways to permute n objects into (n k)! k bins. Combinations: ( ) n k = n!,

More information

Topics to be covered

Topics to be covered Basic Counting 1 Topics to be covered Sum rule, product rule, generalized product rule Permutations, combinations Binomial coefficients, combinatorial proof Inclusion-exclusion principle Pigeon Hole Principle

More information

CS 237: Probability in Computing

CS 237: Probability in Computing CS 237: Probability in Computing Wayne Snyder Computer Science Department Boston University Lecture 5: o Independence reviewed; Bayes' Rule o Counting principles and combinatorics; o Counting considered

More information

Permutations and Combinations. Quantitative Aptitude & Business Statistics

Permutations and Combinations. Quantitative Aptitude & Business Statistics Permutations and Combinations Statistics The Fundamental Principle of If there are Multiplication n 1 ways of doing one operation, n 2 ways of doing a second operation, n 3 ways of doing a third operation,

More information

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

November 8, Chapter 8: Probability: The Mathematics of Chance Chapter 8: Probability: The Mathematics of Chance November 8, 2013 Last Time Probability Models and Rules Discrete Probability Models Equally Likely Outcomes Crystallographic notation The first symbol

More information

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

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 Chapter 5 Chapter Summary 5.1 The Basics of Counting 5.2 The Pigeonhole Principle 5.3 Permutations and Combinations 5.5 Generalized Permutations and Combinations Section 5.1 The Product Rule The Product

More information

2. Combinatorics: the systematic study of counting. The Basic Principle of Counting (BPC)

2. Combinatorics: the systematic study of counting. The Basic Principle of Counting (BPC) 2. Combinatorics: the systematic study of counting The Basic Principle of Counting (BPC) Suppose r experiments will be performed. The 1st has n 1 possible outcomes, for each of these outcomes there are

More information

Multiple Choice Questions for Review

Multiple Choice Questions for Review Review Questions Multiple Choice Questions for Review 1. Suppose there are 12 students, among whom are three students, M, B, C (a Math Major, a Biology Major, a Computer Science Major. We want to send

More information

Combinatorial Proofs

Combinatorial Proofs Combinatorial Proofs Two Counting Principles Some proofs concerning finite sets involve counting the number of elements of the sets, so we will look at the basics of counting. Addition Principle: If A

More information

CS100: DISCRETE STRUCTURES. Lecture 8 Counting - CH6

CS100: DISCRETE STRUCTURES. Lecture 8 Counting - CH6 CS100: DISCRETE STRUCTURES Lecture 8 Counting - CH6 Lecture Overview 2 6.1 The Basics of Counting: THE PRODUCT RULE THE SUM RULE THE SUBTRACTION RULE THE DIVISION RULE 6.2 The Pigeonhole Principle. 6.3

More information

Permutations and Combinations

Permutations and Combinations Motivating question Permutations and Combinations A) Rosen, Chapter 5.3 B) C) D) Permutations A permutation of a set of distinct objects is an ordered arrangement of these objects. : (1, 3, 2, 4) is a

More information

CSCI 2200 Foundations of Computer Science (FoCS) Solutions for Homework 7

CSCI 2200 Foundations of Computer Science (FoCS) Solutions for Homework 7 CSCI 00 Foundations of Computer Science (FoCS) Solutions for Homework 7 Homework Problems. [0 POINTS] Problem.4(e)-(f) [or F7 Problem.7(e)-(f)]: In each case, count. (e) The number of orders in which a

More information

Counting. Chapter 6. With Question/Answer Animations

Counting. Chapter 6. With Question/Answer Animations . All rights reserved. Authorized only for instructor use in the classroom. No reproduction or further distribution permitted without the prior written consent of McGraw-Hill Education. Counting Chapter

More information

Discrete Structures Lecture Permutations and Combinations

Discrete Structures Lecture Permutations and Combinations Introduction Good morning. Many counting problems can be solved by finding the number of ways to arrange a specified number of distinct elements of a set of a particular size, where the order of these

More information

PERMUTATIONS AND COMBINATIONS

PERMUTATIONS AND COMBINATIONS 8 PERMUTATIONS AND COMBINATIONS FUNDAMENTAL PRINCIPLE OF COUNTING Multiplication Principle : If an operation can be performed in 'm' different ways; following which a second operation can be performed

More information

DISCRETE STRUCTURES COUNTING

DISCRETE STRUCTURES COUNTING DISCRETE STRUCTURES COUNTING LECTURE2 The Pigeonhole Principle The generalized pigeonhole principle: If N objects are placed into k boxes, then there is at least one box containing at least N/k of the

More information

COUNTING AND PROBABILITY

COUNTING AND PROBABILITY CHAPTER 9 COUNTING AND PROBABILITY Copyright Cengage Learning. All rights reserved. SECTION 9.2 Possibility Trees and the Multiplication Rule Copyright Cengage Learning. All rights reserved. Possibility

More information

CSE 21 Mathematics for Algorithm and System Analysis

CSE 21 Mathematics for Algorithm and System Analysis CSE 21 Mathematics for Algorithm and System Analysis Unit 1: Basic Count and List Section 3: Set CSE21: Lecture 3 1 Reminder Piazza forum address: http://piazza.com/ucsd/summer2013/cse21/hom e Notes on

More information

Probability Theory. Mohamed I. Riffi. Islamic University of Gaza

Probability Theory. Mohamed I. Riffi. Islamic University of Gaza Probability Theory Mohamed I. Riffi Islamic University of Gaza Table of contents 1. Chapter 1 Probability Properties of probability Counting techniques 1 Chapter 1 Probability Probability Theorem P(φ)

More information

Exercises Exercises. 1. List all the permutations of {a, b, c}. 2. How many different permutations are there of the set {a, b, c, d, e, f, g}?

Exercises Exercises. 1. List all the permutations of {a, b, c}. 2. How many different permutations are there of the set {a, b, c, d, e, f, g}? Exercises Exercises 1. List all the permutations of {a, b, c}. 2. How many different permutations are there of the set {a, b, c, d, e, f, g}? 3. How many permutations of {a, b, c, d, e, f, g} end with

More information

JUST THE MATHS UNIT NUMBER PROBABILITY 2 (Permutations and combinations) A.J.Hobson

JUST THE MATHS UNIT NUMBER PROBABILITY 2 (Permutations and combinations) A.J.Hobson JUST THE MATHS UNIT NUMBER 19.2 PROBABILITY 2 (Permutations and combinations) by A.J.Hobson 19.2.1 Introduction 19.2.2 Rules of permutations and combinations 19.2.3 Permutations of sets with some objects

More information

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

November 11, Chapter 8: Probability: The Mathematics of Chance Chapter 8: Probability: The Mathematics of Chance November 11, 2013 Last Time Probability Models and Rules Discrete Probability Models Equally Likely Outcomes Probability Rules Probability Rules Rule 1.

More information

Foundations of Computing Discrete Mathematics Solutions to exercises for week 12

Foundations of Computing Discrete Mathematics Solutions to exercises for week 12 Foundations of Computing Discrete Mathematics Solutions to exercises for week 12 Agata Murawska (agmu@itu.dk) November 13, 2013 Exercise (6.1.2). A multiple-choice test contains 10 questions. There are

More information

IB HL Mathematics Homework 2014

IB HL Mathematics Homework 2014 IB HL Mathematics Homework Counting, Binomial Theorem Solutions 1) How many permutations are there of the letters MATHEMATICS? Using the permutation formula, we get 11!/(2!2!2!), since there are 2 M's,

More information

In this section, we will learn to. 1. Use the Multiplication Principle for Events. Cheesecake Factory. Outback Steakhouse. P.F. Chang s.

In this section, we will learn to. 1. Use the Multiplication Principle for Events. Cheesecake Factory. Outback Steakhouse. P.F. Chang s. Section 10.6 Permutations and Combinations 10-1 10.6 Permutations and Combinations In this section, we will learn to 1. Use the Multiplication Principle for Events. 2. Solve permutation problems. 3. Solve

More information

DISCUSSION #8 FRIDAY MAY 25 TH Sophie Engle (Teacher Assistant) ECS20: Discrete Mathematics

DISCUSSION #8 FRIDAY MAY 25 TH Sophie Engle (Teacher Assistant) ECS20: Discrete Mathematics DISCUSSION #8 FRIDAY MAY 25 TH 2007 Sophie Engle (Teacher Assistant) ECS20: Discrete Mathematics 2 Homework 8 Hints and Examples 3 Section 5.4 Binomial Coefficients Binomial Theorem 4 Example: j j n n

More information

Unit on Permutations and Combinations (Counting Techniques)

Unit on Permutations and Combinations (Counting Techniques) Page 1 of 15 (Edit by Y.M. LIU) Page 2 of 15 (Edit by Y.M. LIU) Unit on Permutations and Combinations (Counting Techniques) e.g. How many different license plates can be made that consist of three digits

More information

Combinatorics and Intuitive Probability

Combinatorics and Intuitive Probability Chapter Combinatorics and Intuitive Probability The simplest probabilistic scenario is perhaps one where the set of possible outcomes is finite and these outcomes are all equally likely. A subset of the

More information

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

November 6, Chapter 8: Probability: The Mathematics of Chance Chapter 8: Probability: The Mathematics of Chance November 6, 2013 Last Time Crystallographic notation Groups Crystallographic notation The first symbol is always a p, which indicates that the pattern

More information

Math 3338: Probability (Fall 2006)

Math 3338: Probability (Fall 2006) Math 3338: Probability (Fall 2006) Jiwen He Section Number: 10853 http://math.uh.edu/ jiwenhe/math3338fall06.html Probability p.1/7 2.3 Counting Techniques (III) - Partitions Probability p.2/7 Partitioned

More information

MAT104: Fundamentals of Mathematics II Summary of Counting Techniques and Probability. Preliminary Concepts, Formulas, and Terminology

MAT104: Fundamentals of Mathematics II Summary of Counting Techniques and Probability. Preliminary Concepts, Formulas, and Terminology MAT104: Fundamentals of Mathematics II Summary of Counting Techniques and Probability Preliminary Concepts, Formulas, and Terminology Meanings of Basic Arithmetic Operations in Mathematics Addition: Generally

More information

11.3B Warmup. 1. Expand: 2x. 2. Express the expansion of 2x. using combinations. 3. Simplify: a 2b a 2b

11.3B Warmup. 1. Expand: 2x. 2. Express the expansion of 2x. using combinations. 3. Simplify: a 2b a 2b 11.3 Warmup 1. Expand: 2x y 4 2. Express the expansion of 2x y 4 using combinations. 3 3 3. Simplify: a 2b a 2b 4. How many terms are there in the expansion of 2x y 15? 5. What would the 10 th term in

More information

Honors Precalculus Chapter 9 Summary Basic Combinatorics

Honors Precalculus Chapter 9 Summary Basic Combinatorics Honors Precalculus Chapter 9 Summary Basic Combinatorics A. Factorial: n! means 0! = Why? B. Counting principle: 1. How many different ways can a license plate be formed a) if 7 letters are used and each

More information

Unit 5 Radical Functions & Combinatorics

Unit 5 Radical Functions & Combinatorics 1 Unit 5 Radical Functions & Combinatorics General Outcome: Develop algebraic and graphical reasoning through the study of relations. Develop algebraic and numeric reasoning that involves combinatorics.

More information

CISC-102 Fall 2017 Week 8

CISC-102 Fall 2017 Week 8 Week 8 Page! of! 34 Playing cards. CISC-02 Fall 207 Week 8 Some of the following examples make use of the standard 52 deck of playing cards as shown below. There are 4 suits (clubs, spades, hearts, diamonds)

More information

Permutations and Combinations

Permutations and Combinations Permutations and Combinations Rosen, Chapter 5.3 Motivating question In a family of 3, how many ways can we arrange the members of the family in a line for a photograph? 1 Permutations A permutation of

More information

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

n! = n(n 1)(n 2) 3 2 1 A Counting A.1 First principles If the sample space Ω is finite and the outomes are equally likely, then the probability measure is given by P(E) = E / Ω where E denotes the number of outcomes in the event

More information

Solutions - Problems in Probability (Student Version) Section 1 Events, Sample Spaces and Probability. 1. If three coins are flipped, the outcomes are

Solutions - Problems in Probability (Student Version) Section 1 Events, Sample Spaces and Probability. 1. If three coins are flipped, the outcomes are Solutions - Problems in Probability (Student Version) Section 1 Events, Sample Spaces and Probability 1. If three coins are flipped, the outcomes are HTT,HTH,HHT,HHH,TTT,TTH,THT,THH. There are eight outcomes.

More information

Finite Math - Fall 2016

Finite Math - Fall 2016 Finite Math - Fall 206 Lecture Notes - /28/206 Section 7.4 - Permutations and Combinations There are often situations in which we have to multiply many consecutive numbers together, for example, in examples

More information

Review I. October 14, 2008

Review I. October 14, 2008 Review I October 14, 008 If you put n + 1 pigeons in n pigeonholes then at least one hole would have more than one pigeon. If n(r 1 + 1 objects are put into n boxes, then at least one of the boxes contains

More information

Section The Multiplication Principle and Permutations

Section The Multiplication Principle and Permutations Section 2.1 - The Multiplication Principle and Permutations Example 1: A yogurt shop has 4 flavors (chocolate, vanilla, strawberry, and blueberry) and three sizes (small, medium, and large). How many different

More information

CSE 312: Foundations of Computing II Quiz Section #2: Combinations, Counting Tricks (solutions)

CSE 312: Foundations of Computing II Quiz Section #2: Combinations, Counting Tricks (solutions) CSE 312: Foundations of Computing II Quiz Section #2: Combinations, Counting Tricks (solutions Review: Main Theorems and Concepts Combinations (number of ways to choose k objects out of n distinct objects,

More information

Introductory Probability

Introductory Probability Introductory Probability Combinations Nicholas Nguyen nicholas.nguyen@uky.edu Department of Mathematics UK Agenda Assigning Objects to Identical Positions Denitions Committee Card Hands Coin Toss Counts

More information

About Permutations and Combinations: Examples

About Permutations and Combinations: Examples About Permutations and Combinations: Examples TABLE OF CONTENTS Basics... 1 Product Rule...1-2 Sum Rule...2 Permutations... 2-3 Combinations... 3-4 Pascal s Triangle... 4 Binomial Theorem.. 4 Pascal s

More information

CHAPTER 8 Additional Probability Topics

CHAPTER 8 Additional Probability Topics CHAPTER 8 Additional Probability Topics 8.1. Conditional Probability Conditional probability arises in probability experiments when the person performing the experiment is given some extra information

More information

CS 237 Fall 2018, Homework SOLUTION

CS 237 Fall 2018, Homework SOLUTION 0//08 hw03.solution.lenka CS 37 Fall 08, Homework 03 -- SOLUTION Due date: PDF file due Thursday September 7th @ :59PM (0% off if up to 4 hours late) in GradeScope General Instructions Please complete

More information

Mathematical Foundations HW 5 By 11:59pm, 12 Dec, 2015

Mathematical Foundations HW 5 By 11:59pm, 12 Dec, 2015 1 Probability Axioms Let A,B,C be three arbitrary events. Find the probability of exactly one of these events occuring. Sample space S: {ABC, AB, AC, BC, A, B, C, }, and S = 8. P(A or B or C) = 3 8. note:

More information

With Question/Answer Animations. Chapter 6

With Question/Answer Animations. Chapter 6 With Question/Answer Animations Chapter 6 Chapter Summary The Basics of Counting The Pigeonhole Principle Permutations and Combinations Binomial Coefficients and Identities Generalized Permutations and

More information

Section Summary. Permutations Combinations Combinatorial Proofs

Section Summary. Permutations Combinations Combinatorial Proofs Section 6.3 Section Summary Permutations Combinations Combinatorial Proofs Permutations Definition: A permutation of a set of distinct objects is an ordered arrangement of these objects. An ordered arrangement

More information

Problem Set 2. Counting

Problem Set 2. Counting Problem Set 2. Counting 1. (Blitzstein: 1, Q3 Fred is planning to go out to dinner each night of a certain week, Monday through Friday, with each dinner being at one of his favorite ten restaurants. i

More information

STAT 430/510 Probability Lecture 1: Counting-1

STAT 430/510 Probability Lecture 1: Counting-1 STAT 430/510 Probability Lecture 1: Counting-1 Pengyuan (Penelope) Wang May 22, 2011 Introduction In the early days, probability was associated with games of chance, such as gambling. Probability is describing

More information

Permutations and Combinations

Permutations and Combinations Permutations and Combinations Introduction Permutations and combinations refer to number of ways of selecting a number of distinct objects from a set of distinct objects. Permutations are ordered selections;

More information

17. Symmetries. Thus, the example above corresponds to the matrix: We shall now look at how permutations relate to trees.

17. Symmetries. Thus, the example above corresponds to the matrix: We shall now look at how permutations relate to trees. 7 Symmetries 7 Permutations A permutation of a set is a reordering of its elements Another way to look at it is as a function Φ that takes as its argument a set of natural numbers of the form {, 2,, n}

More information

4.4: The Counting Rules

4.4: The Counting Rules 4.4: The Counting Rules The counting rules can be used to discover the number of possible for a sequence of events. Fundamental Counting Rule In a sequence of n events in which the first one has k 1 possibilities

More information

Week 3-4: Permutations and Combinations

Week 3-4: Permutations and Combinations Week 3-4: Permutations and Combinations February 20, 2017 1 Two Counting Principles Addition Principle. Let S 1, S 2,..., S m be disjoint subsets of a finite set S. If S = S 1 S 2 S m, then S = S 1 + S

More information

Math Fall 2011 Exam 2 Solutions - November 1, 2011

Math Fall 2011 Exam 2 Solutions - November 1, 2011 Math 365 - Fall 011 Exam Solutions - November 1, 011 NAME: STUDENT ID: This is a closed-book and closed-note examination. Calculators are not allowed. Please show all your work. Use only the paper provided.

More information

13.3 Permutations and Combinations

13.3 Permutations and Combinations 13.3 Permutations and Combinations There are 6 people who want to use an elevator. There is only room for 4 people. How many ways can 6 people try to fill this elevator (one at a time)? There are 6 people

More information

Distribution of Aces Among Dealt Hands

Distribution of Aces Among Dealt Hands Distribution of Aces Among Dealt Hands Brian Alspach 3 March 05 Abstract We provide details of the computations for the distribution of aces among nine and ten hold em hands. There are 4 aces and non-aces

More information

Counting Things Solutions

Counting Things Solutions Counting Things Solutions Tom Davis tomrdavis@earthlink.net http://www.geometer.org/mathcircles March 7, 006 Abstract These are solutions to the Miscellaneous Problems in the Counting Things article at:

More information

With Question/Answer Animations. Chapter 6

With Question/Answer Animations. Chapter 6 With Question/Answer Animations Chapter 6 Chapter Summary The Basics of Counting The Pigeonhole Principle Permutations and Combinations Binomial Coefficients and Identities Generalized Permutations and

More information

Well, there are 6 possible pairs: AB, AC, AD, BC, BD, and CD. This is the binomial coefficient s job. The answer we want is abbreviated ( 4

Well, there are 6 possible pairs: AB, AC, AD, BC, BD, and CD. This is the binomial coefficient s job. The answer we want is abbreviated ( 4 2 More Counting 21 Unordered Sets In counting sequences, the ordering of the digits or letters mattered Another common situation is where the order does not matter, for example, if we want to choose a

More information

Counting Methods and Probability

Counting Methods and Probability CHAPTER Counting Methods and Probability Many good basketball players can make 90% of their free throws. However, the likelihood of a player making several free throws in a row will be less than 90%. You

More information

More Probability: Poker Hands and some issues in Counting

More Probability: Poker Hands and some issues in Counting More Probability: Poker Hands and some issues in Counting Data From Thursday Everybody flipped a pair of coins and recorded how many times they got two heads, two tails, or one of each. We saw that the

More information

3 The multiplication rule/miscellaneous counting problems

3 The multiplication rule/miscellaneous counting problems Practice for Exam 1 1 Axioms of probability, disjoint and independent events 1 Suppose P (A 0, P (B 05 (a If A and B are independent, what is P (A B? What is P (A B? (b If A and B are disjoint, what is

More information

CSE 21: Midterm 1 Solution

CSE 21: Midterm 1 Solution CSE 21: Midterm 1 Solution August 16, 2007 No books, no calculators. Two double-sided 3x5 cards with handwritten notes allowed. Before starting the test, please write your test number on the top-right

More information

Strings. A string is a list of symbols in a particular order.

Strings. A string is a list of symbols in a particular order. Ihor Stasyuk Strings A string is a list of symbols in a particular order. Strings A string is a list of symbols in a particular order. Examples: 1 3 0 4 1-12 is a string of integers. X Q R A X P T is a

More information

Combinatorics. Reading: EC Peter J. Haas. INFO 150 Fall Semester Lecture 14 1/ 28

Combinatorics. Reading: EC Peter J. Haas. INFO 150 Fall Semester Lecture 14 1/ 28 Combinatorics Reading: EC 5.1 5.4 Peter J. Haas INFO 150 Fall Semester 2018 Lecture 14 1/ 28 Combinatorics Introduction Representing Sets Organization in Counting Combinatorial Equivalence Counting Lists

More information

Week 6: Advance applications of the PIE. 17 and 19 of October, 2018

Week 6: Advance applications of the PIE. 17 and 19 of October, 2018 (1/22) MA284 : Discrete Mathematics Week 6: Advance applications of the PIE http://www.maths.nuigalway.ie/ niall/ma284 17 and 19 of October, 2018 1 Stars and bars 2 Non-negative integer inequalities 3

More information

Math 42, Discrete Mathematics

Math 42, Discrete Mathematics c Fall 2018 last updated 10/29/2018 at 18:22:13 For use by students in this class only; all rights reserved. Note: some prose & some tables are taken directly from Kenneth R. Rosen, and Its Applications,

More information

LAMC Junior Circle February 3, Oleg Gleizer. Warm-up

LAMC Junior Circle February 3, Oleg Gleizer. Warm-up LAMC Junior Circle February 3, 2013 Oleg Gleizer oleg1140@gmail.com Warm-up Problem 1 Compute the following. 2 3 ( 4) + 6 2 Problem 2 Can the value of a fraction increase, if we add one to the numerator

More information

UNC Charlotte 2008 Algebra March 3, 2008

UNC Charlotte 2008 Algebra March 3, 2008 March 3, 2008 1. The sum of all divisors of 2008 is (A) 8 (B) 1771 (C) 1772 (D) 3765 (E) 3780 2. From the list of all natural numbers 2, 3,... 999, delete nine sublists as follows. First, delete all even

More information

Permutation Groups. Definition and Notation

Permutation Groups. Definition and Notation 5 Permutation Groups Wigner s discovery about the electron permutation group was just the beginning. He and others found many similar applications and nowadays group theoretical methods especially those

More information

Solutions to Exercises on Page 86

Solutions to Exercises on Page 86 Solutions to Exercises on Page 86 #. A number is a multiple of, 4, 5 and 6 if and only if it is a multiple of the greatest common multiple of, 4, 5 and 6. The greatest common multiple of, 4, 5 and 6 is

More information

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

6/24/14. The Poker Manipulation. The Counting Principle. MAFS.912.S-IC.1: Understand and evaluate random processes underlying statistical experiments The Poker Manipulation Unit 5 Probability 6/24/14 Algebra 1 Ins1tute 1 6/24/14 Algebra 1 Ins1tute 2 MAFS. 7.SP.3: Investigate chance processes and develop, use, and evaluate probability models MAFS. 7.SP.3:

More information

Permutation and Combination

Permutation and Combination BANKERSWAY.COM Permutation and Combination Permutation implies arrangement where order of things is important. It includes various patterns like word formation, number formation, circular permutation etc.

More information

Permutations and Combinations Problems

Permutations and Combinations Problems Permutations and Combinations Problems Permutations and combinations are used to solve problems. Factorial Example 1: How many 3 digit numbers can you make using the digits 1, 2 and 3 without method (1)

More information

(1). We have n different elements, and we would like to arrange r of these elements with no repetition, where 1 r n.

(1). We have n different elements, and we would like to arrange r of these elements with no repetition, where 1 r n. BASIC KNOWLEDGE 1. Two Important Terms (1.1). Permutations A permutation is an arrangement or a listing of objects in which the order is important. For example, if we have three numbers 1, 5, 9, there

More information

Twenty-fourth Annual UNC Math Contest Final Round Solutions Jan 2016 [(3!)!] 4

Twenty-fourth Annual UNC Math Contest Final Round Solutions Jan 2016 [(3!)!] 4 Twenty-fourth Annual UNC Math Contest Final Round Solutions Jan 206 Rules: Three hours; no electronic devices. The positive integers are, 2, 3, 4,.... Pythagorean Triplet The sum of the lengths of the

More information

STATISTICAL COUNTING TECHNIQUES

STATISTICAL COUNTING TECHNIQUES STATISTICAL COUNTING TECHNIQUES I. Counting Principle The counting principle states that if there are n 1 ways of performing the first experiment, n 2 ways of performing the second experiment, n 3 ways

More information

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

CSE 312: Foundations of Computing II Quiz Section #1: Counting (solutions) CSE 31: Foundations of Computing II Quiz Section #1: Counting (solutions Review: Main Theorems and Concepts 1. Product Rule: Suppose there are m 1 possible outcomes for event A 1, then m possible outcomes

More information

Sec 5.1 The Basics of Counting

Sec 5.1 The Basics of Counting 1 Sec 5.1 The Basics of Counting Combinatorics, the study of arrangements of objects, is an important part of discrete mathematics. In this chapter, we will learn basic techniques of counting which has

More information

CSC/MATA67 Tutorial, Week 12

CSC/MATA67 Tutorial, Week 12 CSC/MATA67 Tutorial, Week 12 November 23, 2017 1 More counting problems A class consists of 15 students of whom 5 are prefects. Q: How many committees of 8 can be formed if each consists of a) exactly

More information

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

MULTIPLE CHOICE. Choose the one alternative that best completes the statement or answers the question. More 9.-9.3 Practice Name MULTIPLE CHOICE. Choose the one alternative that best completes the statement or answers the question. Answer the question. ) In how many ways can you answer the questions on

More information

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

CSE 312: Foundations of Computing II Quiz Section #1: Counting CSE 312: Foundations of Computing II Quiz Section #1: Counting Review: Main Theorems and Concepts 1. Product Rule: Suppose there are m 1 possible outcomes for event A 1, then m 2 possible outcomes for

More information

Theory of Probability - Brett Bernstein

Theory of Probability - Brett Bernstein Theory of Probability - Brett Bernstein Lecture 3 Finishing Basic Probability Review Exercises 1. Model flipping two fair coins using a sample space and a probability measure. Compute the probability of

More information

CS1800: Permutations & Combinations. Professor Kevin Gold

CS1800: Permutations & Combinations. Professor Kevin Gold CS1800: Permutations & Combinations Professor Kevin Gold Permutations A permutation is a reordering of something. In the context of counting, we re interested in the number of ways to rearrange some items.

More information

1 Permutations. 1.1 Example 1. Lisa Yan CS 109 Combinatorics. Lecture Notes #2 June 27, 2018

1 Permutations. 1.1 Example 1. Lisa Yan CS 109 Combinatorics. Lecture Notes #2 June 27, 2018 Lisa Yan CS 09 Combinatorics Lecture Notes # June 7, 08 Handout by Chris Piech, with examples by Mehran Sahami As we mentioned last class, the principles of counting are core to probability. Counting is

More information

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

Unit Nine Precalculus Practice Test Probability & Statistics. Name: Period: Date: NON-CALCULATOR SECTION Name: Period: Date: NON-CALCULATOR SECTION Vocabulary: Define each word and give an example. 1. discrete mathematics 2. dependent outcomes 3. series Short Answer: 4. Describe when to use a combination.

More information

9.5 Counting Subsets of a Set: Combinations. Answers for Test Yourself

9.5 Counting Subsets of a Set: Combinations. Answers for Test Yourself 9.5 Counting Subsets of a Set: Combinations 565 H 35. H 36. whose elements when added up give the same sum. (Thanks to Jonathan Goldstine for this problem. 34. Let S be a set of ten integers chosen from

More information

Staircase Rook Polynomials and Cayley s Game of Mousetrap

Staircase Rook Polynomials and Cayley s Game of Mousetrap Staircase Rook Polynomials and Cayley s Game of Mousetrap Michael Z. Spivey Department of Mathematics and Computer Science University of Puget Sound Tacoma, Washington 98416-1043 USA mspivey@ups.edu Phone:

More information

CISC 1400 Discrete Structures

CISC 1400 Discrete Structures CISC 1400 Discrete Structures Chapter 6 Counting CISC1400 Yanjun Li 1 1 New York Lottery New York Mega-million Jackpot Pick 5 numbers from 1 56, plus a mega ball number from 1 46, you could win biggest

More information

Week in Review #5 ( , 3.1)

Week in Review #5 ( , 3.1) Math 166 Week-in-Review - S. Nite 10/6/2012 Page 1 of 5 Week in Review #5 (2.3-2.4, 3.1) n( E) In general, the probability of an event is P ( E) =. n( S) Distinguishable Permutations Given a set of n objects

More information

Sec$on Summary. Permutations Combinations Combinatorial Proofs

Sec$on Summary. Permutations Combinations Combinatorial Proofs Section 6.3 Sec$on Summary Permutations Combinations Combinatorial Proofs 2 Coun$ng ordered arrangements Ex: How many ways can we select 3 students from a group of 5 students to stand in line for a picture?

More information