CS1802 Week 3: Counting Next Week : QUIZ 1 (30 min)

Size: px
Start display at page:

Download "CS1802 Week 3: Counting Next Week : QUIZ 1 (30 min)"

Transcription

1 CS1802 Discrete Structures Recitation Fall 2018 September 25-26, 2018 CS1802 Week 3: Counting Next Week : QUIZ 1 (30 min) Permutations and Combinations i. Evaluate the following expressions. 1. P(10, 4) ( ) ( ) ii. You own 10 pictures. 1. In how many ways can you select and display 4 pictures side by side on a wall? 2. In how many ways can you select 4 pictures to give to your friend Alice on her birthday? 1

2 iii. In a certain country, license plates are strings consisting of six different characters to be selected from the vowels A, E, I, O, U and the digits 0, 1, 2, 3, 4, 5, 6, 7, 8, 9. For example, 3 7 E 4 A 9 is a valid license plate. 1. How many license plates are possible? 2. How many license plates would have been possible if repetitions had been allowed? 3. How many license plates are possible that have exactly one vowel? 4. How many license plates are possible that have exactly two vowels? 5. How many license plates with exactly two vowels would have been possible if repetitions had been allowed? iv. There are 10 different books on a shelf. Four of them are red and the other six are black. How many different arrangements of these books are possible if 1. all red books must be together? 2. no two red books may be next to each other? 2

3 Balls in Bins How many of the integers from 1 to 99,999 have the digit sum 10? For example, 34,201 is such an integer, but 34,202 is not. Binomial Theorem i. What is the coefficient of the term with x 4 in the expansion of (x + y) 7? ii. What is the coefficient of the term with x 4 in the expansion of (x + 2y) 7? iii. What is the coefficient of the term with x 4 in the expansion of (x y) 7? 3

4 Why is Jimmy s solution wrong? Count all passwords of exactly 8 capital letters that have a letter occurring at least 5 times. Examples: SAATARAA, TUUURUUE, ABABABBB. Jimmy s solution: - choose a letter to repeat 26 choices - choose 5 places to put it ( 8 5) choices - fill the other 3 spaces with any 3 letters 26 3 choices Product rule gives 26* ( 8 5) * Why is this incorrect? How can one count correctly? 4

5 Optional, more difficult. Take these home (not to be submitted) i. If we expand the trinomial (x + y + z) 10, what is the coefficient of term x 3 y 2 z 5? ii. (difficulty ) A derangement of n is a permutation that leaves none of these numbers in place. By inspection, the derangements of 123 are 312 and 231. Find the number of derangements of using Inclusion-Exclusion 5

6 iii. (difficulty ) Prove that A + B + A B C A B + A C + B C iv. (difficulty ) In a class of 20 students, each student has at least 14 friends (friends are reciprocal). Show that there are 4 students that form a clique, that is all 4 are pairwise friends. v. (difficulty ) Why is Jimmy s solution wrong? 10 men who are pairs of brothers (a 1 b 1, a 2 b 2, a 3 b 3, a 4 b 4, a 5 b 5 ) are to blind-date 10 women who are pairs of sisters (x 1 y 1, x 2 y 2, x 3 y 3, x 4 y 4, x 5 y 5 ) such that any two brothers do not date two corresponding sisters, that is for example if (a 2, x 4 ) is a date then b 2 cannot date y 4. In how many ways can the dates be arranged? Jimmy s solution: There are 10! ways to arrange the dates without restrictions. There are 5! 2 5 ways to arrange dates that violates the restriction since it comes down to permuting the pairs and then choosing for each pair which brother dates which sister (2 possibilites per 6

7 pair). So the answer is 10! 5! 2 5. Why is this wrong? vi. (difficulty ) Virgil has a solution, also wrong: We need the number of derangements = permutations without fix point for n=5. Examples: 21453, Not a derangement : because 2 is in original position. For n=5 there are D 5 = 44 derangements which can be counted by brute force or by Inclusion-Exclusion (next exercise). Then the answer is 5! (choose a permutation of the 5 men a 1..a 5 ) * 2 5 (choose which sister to date) * D 5 (choose a derangement for brothers b 1..b 5 ). Why is Virgil s solution wrong? 7

8 vii. (difficulty ) What is the correct count for this brothers-sisters blind-date question? viii. (difficulty ) Consider an equilateral triangle of side length n, which is divided into unit triangles, as shown. A valid path runs from the triangle in the top row to the middle triangle in the bottom row, such that adjacent triangles in our path share a common edge and the path never travels up (from a lower row to a higher row) or revisits a triangle. An example of one such path is illustrated below for n = 5. Compute the number of paths. Hint: Construct a one-to-one mapping between valid paths and ordered lists of positive integers (a 1, a 2,..., a n ) with a i i. Then count the ordered lists. 8

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

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

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

Math 365 Wednesday 2/20/19 Section 6.1: Basic counting

Math 365 Wednesday 2/20/19 Section 6.1: Basic counting Math 365 Wednesday 2/20/19 Section 6.1: Basic counting Exercise 19. For each of the following, use some combination of the sum and product rules to find your answer. Give an un-simplified numerical answer

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

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

Counting in Algorithms

Counting in Algorithms Counting Counting in Algorithms How many comparisons are needed to sort n numbers? How many steps to compute the GCD of two numbers? How many steps to factor an integer? Counting in Games How many different

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

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

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

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

What is counting? (how many ways of doing things) how many possible ways to choose 4 people from 10?

What is counting? (how many ways of doing things) how many possible ways to choose 4 people from 10? Chapter 5. Counting 5.1 The Basic of Counting What is counting? (how many ways of doing things) combinations: how many possible ways to choose 4 people from 10? how many license plates that start with

More information

CONTENTS CONTENTS PAGES 11.0 CONCEPT MAP A. PERMUTATIONS a EXERCISE A B. COMBINATIONS a EXERCISE B PAST YEAR SPM

CONTENTS CONTENTS PAGES 11.0 CONCEPT MAP A. PERMUTATIONS a EXERCISE A B. COMBINATIONS a EXERCISE B PAST YEAR SPM PROGRAM DIDIK CEMERLANG AKADEMIK SPM ADDITIONAL MATHEMATICS FORM 5 MODULE 11 PERMUTATIONS AND COMBINATIONS 0 CONTENTS CONTENTS PAGES 11.0 CONCEPT MAP 2 11.1 A. PERMUTATIONS 3 11.1a EXERCISE A.1 3 11.2

More information

MAT 115: Finite Math for Computer Science Problem Set 5

MAT 115: Finite Math for Computer Science Problem Set 5 MAT 115: Finite Math for Computer Science Problem Set 5 Out: 04/10/2017 Due: 04/17/2017 Instructions: I leave plenty of space on each page for your computation. If you need more sheet, please attach your

More information

CPCS 222 Discrete Structures I Counting

CPCS 222 Discrete Structures I Counting King ABDUL AZIZ University Faculty Of Computing and Information Technology CPCS 222 Discrete Structures I Counting Dr. Eng. Farag Elnagahy farahelnagahy@hotmail.com Office Phone: 67967 The Basics of counting

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

Jong C. Park Computer Science Division, KAIST

Jong C. Park Computer Science Division, KAIST Jong C. Park Computer Science Division, KAIST Today s Topics Basic Principles Permutations and Combinations Algorithms for Generating Permutations Generalized Permutations and Combinations Binomial Coefficients

More information

Solutions to Problem Set 7

Solutions to Problem Set 7 Massachusetts Institute of Technology 6.4J/8.6J, Fall 5: Mathematics for Computer Science November 9 Prof. Albert R. Meyer and Prof. Ronitt Rubinfeld revised November 3, 5, 3 minutes Solutions to Problem

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

The Art of Counting. Bijections, Double Counting. Peng Shi. September 16, Department of Mathematics Duke University

The Art of Counting. Bijections, Double Counting. Peng Shi. September 16, Department of Mathematics Duke University The Art of Counting Bijections, Double Counting Peng Shi Department of Mathematics Duke University September 16, 2009 What we focus on in this talk? Enumerative combinatorics is a huge branch of mathematics,

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

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

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

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

Chapter 7. Intro to Counting

Chapter 7. Intro to Counting Chapter 7. Intro to Counting 7.7 Counting by complement 7.8 Permutations with repetitions 7.9 Counting multisets 7.10 Assignment problems: Balls in bins 7.11 Inclusion-exclusion principle 7.12 Counting

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

6.1.1 The multiplication rule

6.1.1 The multiplication rule 6.1.1 The multiplication rule 1. There are 3 routes joining village A and village B and 4 routes joining village B and village C. Find the number of different ways of traveling from village A to village

More information

Rosen, Discrete Mathematics and Its Applications, 6th edition Extra Examples

Rosen, Discrete Mathematics and Its Applications, 6th edition Extra Examples Rosen, Discrete Mathematics and Its Applications, 6th edition Extra Examples Section 6.1 An Introduction to Discrete Probability Page references correspond to locations of Extra Examples icons in the textbook.

More information

Section Summary. Finite Probability Probabilities of Complements and Unions of Events Probabilistic Reasoning

Section Summary. Finite Probability Probabilities of Complements and Unions of Events Probabilistic Reasoning Section 7.1 Section Summary Finite Probability Probabilities of Complements and Unions of Events Probabilistic Reasoning Probability of an Event Pierre-Simon Laplace (1749-1827) We first study Pierre-Simon

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

LEVEL I. 3. In how many ways 4 identical white balls and 6 identical black balls be arranged in a row so that no two white balls are together?

LEVEL I. 3. In how many ways 4 identical white balls and 6 identical black balls be arranged in a row so that no two white balls are together? LEVEL I 1. Three numbers are chosen from 1,, 3..., n. In how many ways can the numbers be chosen such that either maximum of these numbers is s or minimum of these numbers is r (r < s)?. Six candidates

More information

Algebra II- Chapter 12- Test Review

Algebra II- Chapter 12- Test Review Sections: Counting Principle Permutations Combinations Probability Name Choose the letter of the term that best matches each statement or phrase. 1. An illustration used to show the total number of A.

More information

Counting: Basics. Four main concepts this week 10/12/2016. Product rule Sum rule Inclusion-exclusion principle Pigeonhole principle

Counting: Basics. Four main concepts this week 10/12/2016. Product rule Sum rule Inclusion-exclusion principle Pigeonhole principle Counting: Basics Rosen, Chapter 5.1-2 Motivation: Counting is useful in CS Application domains such as, security, telecom How many password combinations does a hacker need to crack? How many telephone

More information

Math 3012 Applied Combinatorics Lecture 2

Math 3012 Applied Combinatorics Lecture 2 August 20, 2015 Math 3012 Applied Combinatorics Lecture 2 William T. Trotter trotter@math.gatech.edu The Road Ahead Alert The next two to three lectures will be an integrated approach to material from

More information

Algebra 2 Notes Section 10.1: Apply the Counting Principle and Permutations

Algebra 2 Notes Section 10.1: Apply the Counting Principle and Permutations Algebra 2 Notes Section 10.1: Apply the Counting Principle and Permutations Objective(s): Vocabulary: I. Fundamental Counting Principle: Two Events: Three or more Events: II. Permutation: (top of p. 684)

More information

Midterm practice super-problems

Midterm practice super-problems Midterm practice super-problems These problems are definitely harder than the midterm (even the ones without ), so if you solve them you should have no problem at all with the exam. However be aware that

More information

Probability and Counting Techniques

Probability and Counting Techniques Probability and Counting Techniques Diana Pell (Multiplication Principle) Suppose that a task consists of t choices performed consecutively. Suppose that choice 1 can be performed in m 1 ways; for each

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

Sec.on Summary. The Product Rule The Sum Rule The Subtraction Rule (Principle of Inclusion- Exclusion)

Sec.on Summary. The Product Rule The Sum Rule The Subtraction Rule (Principle of Inclusion- Exclusion) Chapter 6 1 Chapter Summary The Basics of Counting The Pigeonhole Principle Permutations and Combinations Binomial Coefficients and Identities Generalized Permutations and Combinations 2 Section 6.1 3

More information

Bayes stuff Red Cross and Blood Example

Bayes stuff Red Cross and Blood Example Bayes stuff Red Cross and Blood Example 42% of the workers at Motor Works are female, while 67% of the workers at City Bank are female. If one of these companies is selected at random (assume a 50-50 chance

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

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

Discrete Mathematics with Applications MATH236

Discrete Mathematics with Applications MATH236 Discrete Mathematics with Applications MATH236 Dr. Hung P. Tong-Viet School of Mathematics, Statistics and Computer Science University of KwaZulu-Natal Pietermaritzburg Campus Semester 1, 2013 Tong-Viet

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

Simple Counting Problems

Simple Counting Problems Appendix F Counting Principles F1 Appendix F Counting Principles What You Should Learn 1 Count the number of ways an event can occur. 2 Determine the number of ways two or three events can occur using

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

Algebra. Recap: Elements of Set Theory.

Algebra. Recap: Elements of Set Theory. January 14, 2018 Arrangements and Derangements. Algebra. Recap: Elements of Set Theory. Arrangements of a subset of distinct objects chosen from a set of distinct objects are permutations [order matters]

More information

THE PIGEONHOLE PRINCIPLE. MARK FLANAGAN School of Electrical and Electronic Engineering University College Dublin

THE PIGEONHOLE PRINCIPLE. MARK FLANAGAN School of Electrical and Electronic Engineering University College Dublin THE PIGEONHOLE PRINCIPLE MARK FLANAGAN School of Electrical and Electronic Engineering University College Dublin The Pigeonhole Principle: If n + 1 objects are placed into n boxes, then some box contains

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

CHAPTER 5 BASIC CONCEPTS OF PERMUTATIONS AND COMBINATIONS

CHAPTER 5 BASIC CONCEPTS OF PERMUTATIONS AND COMBINATIONS CHAPTER 5 BASIC CONCEPTS OF PERMUTATIONS AND COMBINATIONS BASIC CONCEPTS OF PERM UTATIONS AND COM BINATIONS LEARNING OBJECTIVES After reading this Chapter a student will be able to understand difference

More information

HOMEWORK ASSIGNMENT 5

HOMEWORK ASSIGNMENT 5 HOMEWORK ASSIGNMENT 5 MATH 251, WILLIAMS COLLEGE, FALL 2006 Abstract. These are the instructor s solutions. 1. Big Brother The social security number of a person is a sequence of nine digits that are not

More information

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

Outline. Content The basics of counting The pigeonhole principle Reading Chapter 5 IRIS H.-R. JIANG

Outline. Content The basics of counting The pigeonhole principle Reading Chapter 5 IRIS H.-R. JIANG CHAPTER 5 COUNTING Outline 2 Content The basics of counting The pigeonhole principle Reading Chapter 5 Most of the following slides are by courtesy of Prof. J.-D. Huang and Prof. M.P. Frank Combinatorics

More information

JIGSAW ACTIVITY, TASK # Make sure your answer in written in the correct order. Highest powers of x should come first, down to the lowest powers.

JIGSAW ACTIVITY, TASK # Make sure your answer in written in the correct order. Highest powers of x should come first, down to the lowest powers. JIGSAW ACTIVITY, TASK #1 Your job is to multiply and find all the terms in ( 1) Recall that this means ( + 1)( + 1)( + 1)( + 1) Start by multiplying: ( + 1)( + 1) x x x x. x. + 4 x x. Write your answer

More information

Advanced Intermediate Algebra Chapter 12 Summary INTRO TO PROBABILITY

Advanced Intermediate Algebra Chapter 12 Summary INTRO TO PROBABILITY Advanced Intermediate Algebra Chapter 12 Summary INTRO TO PROBABILITY 1. Jack and Jill do not like washing dishes. They decide to use a random method to select whose turn it is. They put some red and blue

More information

CS1800: More Counting. Professor Kevin Gold

CS1800: More Counting. Professor Kevin Gold CS1800: More Counting Professor Kevin Gold Today Dealing with illegal values Avoiding overcounting Balls-in-bins, or, allocating resources Review problems Dealing with Illegal Values Password systems often

More information

PERMUTATIONS AND COMBINATIONS

PERMUTATIONS AND COMBINATIONS PERMUTATIONS AND COMBINATIONS 1. Fundamental Counting Principle Assignment: Workbook: pg. 375 378 #1-14 2. Permutations and Factorial Notation Assignment: Workbook pg. 382-384 #1-13, pg. 526 of text #22

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

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

CSE 312: Foundations of Computing II Quiz Section #2: Inclusion-Exclusion, Pigeonhole, Introduction to Probability (solutions) CSE 31: Foundations of Computing II Quiz Section #: Inclusion-Exclusion, Pigeonhole, Introduction to Probability (solutions) Review: Main Theorems and Concepts Binomial Theorem: x, y R, n N: (x + y) n

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

CS1800 Discrete Structures Fall 2016 Profs. Aslam, Gold, Ossowski, Pavlu, & Sprague 7 November, CS1800 Discrete Structures Midterm Version C

CS1800 Discrete Structures Fall 2016 Profs. Aslam, Gold, Ossowski, Pavlu, & Sprague 7 November, CS1800 Discrete Structures Midterm Version C CS1800 Discrete Structures Fall 2016 Profs. Aslam, Gold, Ossowski, Pavlu, & Sprague 7 November, 2016 CS1800 Discrete Structures Midterm Version C Instructions: 1. The exam is closed book and closed notes.

More information

Section 1.6 The Factor Game

Section 1.6 The Factor Game Section 1.6 The Factor Game Objectives In this section, you will learn to: To successfully complete this section, you need to understand: Play the Factor Game. Factor pairs (1.1) Adding integers (1.3)

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

Problems from 9th edition of Probability and Statistical Inference by Hogg, Tanis and Zimmerman:

Problems from 9th edition of Probability and Statistical Inference by Hogg, Tanis and Zimmerman: Math 22 Fall 2017 Homework 2 Drew Armstrong Problems from 9th edition of Probability and Statistical Inference by Hogg, Tanis and Zimmerman: Section 1.2, Exercises 5, 7, 13, 16. Section 1.3, Exercises,

More information

MAT3707. Tutorial letter 202/1/2017 DISCRETE MATHEMATICS: COMBINATORICS. Semester 1. Department of Mathematical Sciences MAT3707/202/1/2017

MAT3707. Tutorial letter 202/1/2017 DISCRETE MATHEMATICS: COMBINATORICS. Semester 1. Department of Mathematical Sciences MAT3707/202/1/2017 MAT3707/0//07 Tutorial letter 0//07 DISCRETE MATHEMATICS: COMBINATORICS MAT3707 Semester Department of Mathematical Sciences SOLUTIONS TO ASSIGNMENT 0 BARCODE Define tomorrow university of south africa

More information

1. Counting. 2. Tree 3. Rules of Counting 4. Sample with/without replacement where order does/doesn t matter.

1. Counting. 2. Tree 3. Rules of Counting 4. Sample with/without replacement where order does/doesn t matter. Lecture 4 Outline: basics What s to come? Probability A bag contains: What is the chance that a ball taken from the bag is blue? Count blue Count total Divide Today: Counting! Later: Probability Professor

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

INDIAN STATISTICAL INSTITUTE

INDIAN STATISTICAL INSTITUTE INDIAN STATISTICAL INSTITUTE B1/BVR Probability Home Assignment 1 20-07-07 1. A poker hand means a set of five cards selected at random from usual deck of playing cards. (a) Find the probability that it

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

Permutations and Combinations Practice Test

Permutations and Combinations Practice Test Name: Class: Date: Permutations and Combinations Practice Test Multiple Choice Identify the choice that best completes the statement or answers the question. 1. Suppose that license plates in the fictional

More information

Lecture 14. What s to come? Probability. A bag contains:

Lecture 14. What s to come? Probability. A bag contains: Lecture 14 What s to come? Probability. A bag contains: What is the chance that a ball taken from the bag is blue? Count blue. Count total. Divide. Today: Counting! Later: Probability. Professor Walrand.

More information

The Product Rule can be viewed as counting the number of elements in the Cartesian product of the finite sets

The Product Rule can be viewed as counting the number of elements in the Cartesian product of the finite sets Chapter 6 - Counting 6.1 - The Basics of Counting Theorem 1 (The Product Rule). If every task in a set of k tasks must be done, where the first task can be done in n 1 ways, the second in n 2 ways, and

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

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

MATH 215 DISCRETE MATHEMATICS INSTRUCTOR: P. WENG

MATH 215 DISCRETE MATHEMATICS INSTRUCTOR: P. WENG MATH DISCRETE MATHEMATICS INSTRUCTOR: P. WENG Counting and Probability Suggested Problems Basic Counting Skills, Inclusion-Exclusion, and Complement. (a An office building contains 7 floors and has 7 offices

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

Discrete Mathematics. Spring 2017

Discrete Mathematics. Spring 2017 Discrete Mathematics Spring 2017 Previous Lecture Binomial Coefficients Pascal s Triangle The Pigeonhole Principle If a flock of 20 pigeons roosts in a set of 19 pigeonholes, one of the pigeonholes must

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

Counting integral solutions

Counting integral solutions Thought exercise 2.2 20 Counting integral solutions Question: How many non-negative integer solutions are there of x 1 +x 2 +x 3 +x 4 = 10? Thought exercise 2.2 20 Counting integral solutions Question:

More information

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

CSE 312: Foundations of Computing II Quiz Section #2: Inclusion-Exclusion, Pigeonhole, Introduction to Probability CSE 312: Foundations of Computing II Quiz Section #2: Inclusion-Exclusion, Pigeonhole, Introduction to Probability Review: Main Theorems and Concepts Binomial Theorem: Principle of Inclusion-Exclusion

More information

MATH 351 Fall 2009 Homework 1 Due: Wednesday, September 30

MATH 351 Fall 2009 Homework 1 Due: Wednesday, September 30 MATH 51 Fall 2009 Homework 1 Due: Wednesday, September 0 Problem 1. How many different letter arrangements can be made from the letters BOOKKEEPER. This is analogous to one of the problems presented in

More information

6. In how many different ways can you answer 10 multiple-choice questions if each question has five choices?

6. In how many different ways can you answer 10 multiple-choice questions if each question has five choices? Pre-Calculus Section 4.1 Multiplication, Addition, and Complement 1. Evaluate each of the following: a. 5! b. 6! c. 7! d. 0! 2. Evaluate each of the following: a. 10! b. 20! 9! 18! 3. In how many different

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

Counting principles, including permutations and combinations.

Counting principles, including permutations and combinations. Counting principles, including permutations and combinations. The binomial theorem: expansion of (aa + bb) nn, nn εε NN. 1 THE PRODUCT RULE If there are mm different ways of performing an operation and

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

Permutations and Combinations. Combinatorics

Permutations and Combinations. Combinatorics ~ Combinatorics Combinatorics is a branch of mathematics that studies collections of objects that satis@ specified criteria. In particular, it is concerned with "counting" the number of arrangements or

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

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

Principle of Inclusion-Exclusion Notes

Principle of Inclusion-Exclusion Notes Principle of Inclusion-Exclusion Notes The Principle of Inclusion-Exclusion (often abbreviated PIE is the following general formula used for finding the cardinality of a union of finite sets. Theorem 0.1.

More information

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

1. An office building contains 27 floors and has 37 offices on each floor. How many offices are in the building? 1. An office building contains 27 floors and has 37 offices on each floor. How many offices are in the building? 2. A particular brand of shirt comes in 12 colors, has a male version and a female version,

More information

Mathematics. (www.tiwariacademy.com) (Chapter 7) (Permutations and Combinations) (Class XI) Exercise 7.3

Mathematics. (www.tiwariacademy.com) (Chapter 7) (Permutations and Combinations) (Class XI) Exercise 7.3 Question 1: Mathematics () Exercise 7.3 How many 3-digit numbers can be formed by using the digits 1 to 9 if no digit is repeated? Answer 1: 3-digit numbers have to be formed using the digits 1 to 9. Here,

More information

MATH 1324 (Finite Mathematics or Business Math I) Lecture Notes Author / Copyright: Kevin Pinegar

MATH 1324 (Finite Mathematics or Business Math I) Lecture Notes Author / Copyright: Kevin Pinegar MATH 1324 Module 4 Notes: Sets, Counting and Probability 4.2 Basic Counting Techniques: Addition and Multiplication Principles What is probability? In layman s terms it is the act of assigning numerical

More information

Combinatorics problems

Combinatorics problems Combinatorics problems Sections 6.1-6.4 Math 245, Spring 2011 1 How to solve it There are four main strategies for solving counting problems that we will look at: Multiplication principle: A man s wardrobe

More information

CS 3233 Discrete Mathematical Structure Midterm 2 Exam Solution Tuesday, April 17, :30 1:45 pm. Last Name: First Name: Student ID:

CS 3233 Discrete Mathematical Structure Midterm 2 Exam Solution Tuesday, April 17, :30 1:45 pm. Last Name: First Name: Student ID: CS Discrete Mathematical Structure Midterm Exam Solution Tuesday, April 17, 007 1:0 1:4 pm Last Name: First Name: Student ID: Problem No. Points Score 1 10 10 10 4 1 10 6 10 7 1 Total 80 1 This is a closed

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

MC215: MATHEMATICAL REASONING AND DISCRETE STRUCTURES

MC215: MATHEMATICAL REASONING AND DISCRETE STRUCTURES MC215: MATHEMATICAL REASONING AND DISCRETE STRUCTURES Thursday, 4/17/14 The Addition Principle The Inclusion-Exclusion Principle The Pigeonhole Principle Reading: [J] 6.1, 6.8 [H] 3.5, 12.3 Exercises:

More information

CS70: Lecture Review. 2. Stars/Bars. 3. Balls in Bins. 4. Addition Rules. 5. Combinatorial Proofs. 6. Inclusion/Exclusion

CS70: Lecture Review. 2. Stars/Bars. 3. Balls in Bins. 4. Addition Rules. 5. Combinatorial Proofs. 6. Inclusion/Exclusion CS70: Lecture 18. 1. Review. 2. Stars/Bars. 3. Balls in Bins. 4. Addition Rules. 5. Combinatorial Proofs. 6. Inclusion/Exclusion The rules! First rule: n 1 n 2 n 3. Product Rule. k Samples with replacement

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

COUNTING TECHNIQUES. Prepared by Engr. JP Timola Reference: Discrete Math by Kenneth H. Rosen

COUNTING TECHNIQUES. Prepared by Engr. JP Timola Reference: Discrete Math by Kenneth H. Rosen COUNTING TECHNIQUES Prepared by Engr. JP Timola Reference: Discrete Math by Kenneth H. Rosen COMBINATORICS the study of arrangements of objects, is an important part of discrete mathematics. Counting Introduction

More information