# Foundations of Computing Discrete Mathematics Solutions to exercises for week 12

Size: px
Start display at page:

Download "Foundations of Computing Discrete Mathematics Solutions to exercises for week 12"

Transcription

1 Foundations of Computing Discrete Mathematics Solutions to exercises for week 12 Agata Murawska November 13, 2013 Exercise (6.1.2). A multiple-choice test contains 10 questions. There are four possible answers for each question 1. a) In how many ways can a student answer the questions on the test if the student answers every question? For each question a student has 4 options from which he chooses one. That makes the number of ways to be equal to 4 10 by product rule. b) In how many ways can a student answer the questions on the test if the student can leave answers blank? Now student has 5 options as he can choose any of the existing options or leave no answer. Again by product rule, the number of ways is equal to Exercise (6.1.12). How many positive integers between 100 and 999 inclusive a) are divisible by 7? Every 7th number is divisible by 7, 1000 div 7 = 142. We have to exclude numbers smaller than 100, there are 100 div 7 = 14 if them. The final answer is therefore = 128. b) are odd? Every 2nd number is odd div div 2 = = 450 c) have the same three decimal digits? It is simplest to just list these numbers: 111, 222, 333, 444, 555, 666, 777, 888 and 999 there are 9 of them. 1 We are assuming there is exactly one correct answer to each question 1

2 d) are not divisible by 4? There are 1000 div div 4 = = 225 numbers divisible by 4 and 900 numbers between 100 and 999 in general, so there are = 675 numbers not divisible by 4. e) are divisible by 3 or 4? There are 1000 div div 4 = 225 numbers divisible by 4 and 1000 div div 3 = = 300 numbers divisible by 3. However, we have counted numbers divisible by 12 in both groups. There are 1000 div div 12 = 83 8 = 75 numbers like that. Finally, there are = 450 numbers divisible by 3 or 4. f) are not divisible by either 3 or 4? We will use the solution from previous step. We know that 450 numbers between 100 and 999 are divisible by 3 or by 4. Therefore, there are =450 numbers not divisible by either 3 or 4. g) are divisible by 3 but not by 4? There are 1000 div div 3 = = 300 numbers divisible by 3. Out of those, 1000 div div 12 = 83 8 = 75 are also divisible by 4 (as they are divisible by 3 4 = 12. So there are = 225 numbers divisible by 3 but not by 4. h) are divisible by 3 and 4? Numbers divisible by 3 and 4 are divisible by 12. There are 1000 div div 12 = 83 8 = 75 such numbers. Exercise (6.2.4). The bowl contains 10 red balls and 10 blue balls. A woman selects balls at random without looking at them. a) How many balls must she select to be sure of having at least three balls of the same color? She must select 5 balls. A justification for this is the following: having only 4 balls, you either have at least 3 of one color or you are in a situation where you have 2 blue balls and 2 red ones. In the latter case, selecting any additional ball gives you three balls of the same color. Therefore, selecting 5 balls is sufficient. Formally, we can use the generalized pigeonhole principle, where balls are objects and colors are boxes. If we put 5 objects into 2 boxes, there is at least one box (so, color of the balls) containing 5 2 = 3 objects. b) How many balls must she select to be sure of having at least three blue balls? 2

3 She must select 13 balls. To see this, consider the (unlikely) scenario that first ten balls she selects are all red. Then she still needs to pick 3 more balls to have three blue ones. Exercise (6.3.8). A group contains n men and n women. How many ways are there to arrange these people in a row if the men and women alternate? We have to fill a row of length 2n in such a way that men and women alternate. Note that we can select order of men and order of women separately. If W is the number of ways in which to order women and M is the number of ways to order men, then the final answer will be 2 W M as the only choice we have once men and women are ordered is whether to start the final row with a man or a woman. Now, it remains to calculate W and M. Notice, that in fact W = M as there are n men and n women to arrange (and we have to use them all). In how many ways can we arrange men? It will be a permutation of length n, therefore by definition, M = P(n, n) = n(n 1)(n 2)... (n n + 1) = n!. Finally, the number of ways to arrange these people is 2 W M = 2 n! n!. Exercise (6.3.12). A coin is flipped 10 times where each flip comes up either heads or tails. How many possible outcomes a) are there in total? Each of 10 coins can come up heads (H) or tails (T ), There are 2 possible outcomes when flipping one coin (H or T ), 4 possible outcomes when flipping 2 coins (HH, HT, T H and T T ) and so on. In particular, for 10 coins there are 2 10 = 1024 possible outcomes. b) contain exactly two heads? If there are exactly two Hs, there are also exactly 8 T s when 10 coins are flipped. This means that different possible outcomes come from the exact order in which these two heads are obtained. We need to choose 2 positions out of 10 for the heads, so by definition of combination we have 10! C(10, 2) = = 45 ways to get exactly 2 heads.2 2! (10 2)! c) contain at most three tails? We will solve this by summing up number of possible outcomes with exactly 0, 1, 2 and 3 tails. For 0 tails, there is only one possible outcome all heads. For 1 tails there are 10 possible outcomes, as the tails can occur in any of the 10 flips. For 2 tails there are 45 possible outcomes (by the same argument as we have used in part b) for exactly 2 heads). For 2 Notice, that if we want to instead choose 8 positions out of 10 for the tails, we get the exact same result. 3

4 10! 3 tails there are C(10, 2) = = 120 possible outcomes. Finally, 3! (10 3)! summing it all up we get = 176 possible outcomes with three or less tails. d) contain the same number of heads and tails? There must be exactly 5 heads and 5 tails. Similarly to the case in part b) we can only choose the 5 positions where the result will be heads. 10! Therefore there are C(10, 5) = = 252 possible outcomes. 5! (10 5)! Exercise (6.3.16). Thirteen people on a softball team show up for a game. a) How many ways are there to choose 10 players to take the field? We choose 10 out of 13 players and we do not care about the order, in which they are chosen. Therefore, we use definition of a combination. There are C(13, 10) = 13! = 286 ways to choose 10 players. 10! 3! b) How many ways there are to assign the 10 positions by selecting players from the 13 people who show up? We can solve this in two ways: We can use the previous solution and notice, that after the 10 players were chosen, we can assign them positions in P(10, 10) = 10! ways, resulting in ! = possibilities We can just choose 10 out of 13 people and assign them positions. This will result in P(13, 10) = 13! = , so the exact same 3! result. c) Of the 13 people who show up, three are women. How many ways are there to choose 10 players to take the field if at least one of these players must be a woman? Again, this part can be solved in two ways: There can be exactly 3, 2 or just 1 woman on the team. The choice of men on the team is independent from the choice of women. For 3 women on the team, we choose men in C(10, 7) = 120 ways (as there are 10 men and 7 slots for them) and there is only one way to choose the women (which is consistent with C(3, 3) = 3! = 1). 0! 3! For 2 women on the team, we choose men in C(10, 8) = 45 ways and women in C(3, 2) = 3 ways, resulting in a total of 45 3 = 135 options. For 1 women on the team, we choose men in C(10, 9) = 10 ways and woman in C(3, 1) = 3 way, resulting in a total of 10 3 = 30 options. Summing up these possibilities, there are = 285 ways to have at least one women on the team. 4

5 From part a) we know that there were a total of 286 ways to have 10 people selected. In the current setting, with 10 men and 3 women there is only one way to get a team with no women in it it is to take all the men. Therefore the remaining 285 ways must be ones where at least one woman is on the team. Exercise (6.5.4). How many ways are there to select five unordered elements from a set with three elements when repetition is allowed? We are asked to find a number of combinations where repetition is allowed. The set contains n = 3 elements and we select r = 5 of them, therefore the number of possible ways of doing that is C(n + r 1, r) = C(7, 5) = 21. Exercise (6.5.14). How many solutions are there to the inequality x 1 + x 2 + x 3 11 where x 1, x 2 and x 3 are nonnegative integers? Using the hint, we will introduce nonnegative integer x 4 such that x 1 + x 2 + x 3 + x 4 = We need to find a way of selecting 11 items from a set of four elements so that there are x 1 items of type one, x 2 items of type two, x 3 items of type three and x 4 items of type four. This is again a number of combinations where repetition is allowed: C( , 11) = C(14, 11) = = Exercise (6.5.26). How many different bit strings can be formed using six 1s and eight 0s? We have 14 boxes to use up in total. We have to select places for objects of one type (e.g. for 1s), then fill the rest of boxes with the 0s. This results in the following number of different bit strings: C(14, 6) = The reasoning follows the solution for example 5. 5

### 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

### 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

### 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

### 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

### 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,

### CSC/MTH 231 Discrete Structures II Spring, Homework 5

CSC/MTH 231 Discrete Structures II Spring, 2010 Homework 5 Name 1. A six sided die D (with sides numbered 1, 2, 3, 4, 5, 6) is thrown once. a. What is the probability that a 3 is thrown? b. What is the

### 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

### 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

### 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

### 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

### 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

### 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

### 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

### 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

### 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

### Section 6.1 #16. Question: What is the probability that a five-card poker hand contains a flush, that is, five cards of the same suit?

Section 6.1 #16 What is the probability that a five-card poker hand contains a flush, that is, five cards of the same suit? page 1 Section 6.1 #38 Two events E 1 and E 2 are called independent if p(e 1

### Section : Combinations and Permutations

Section 11.1-11.2: Combinations and Permutations Diana Pell A construction crew has three members. A team of two must be chosen for a particular job. In how many ways can the team be chosen? How many words

### 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

### 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

### Week 1: Probability models and counting

Week 1: Probability models and counting Part 1: Probability model Probability theory is the mathematical toolbox to describe phenomena or experiments where randomness occur. To have a probability model

### 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

### 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

### 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.

### 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

### Discrete Mathematics and Probability Theory Spring 2016 Rao and Walrand Note 13

CS 70 Discrete Mathematics and Probability Theory Spring 2016 Rao and Walrand Note 13 Introduction to Discrete Probability In the last note we considered the probabilistic experiment where we flipped a

### 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

### 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

### 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

### Sample Spaces, Events, Probability

Sample Spaces, Events, Probability CS 3130/ECE 3530: Probability and Statistics for Engineers August 28, 2014 Sets A set is a collection of unique objects. Sets A set is a collection of unique objects.

### Midterm 2 Practice Problems

Midterm 2 Practice Problems May 13, 2012 Note that these questions are not intended to form a practice exam. They don t necessarily cover all of the material, or weight the material as I would. They are

### The next several lectures will be concerned with probability theory. We will aim to make sense of statements such as the following:

CS 70 Discrete Mathematics for CS Fall 2004 Rao Lecture 14 Introduction to Probability The next several lectures will be concerned with probability theory. We will aim to make sense of statements such

### 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

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

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)

### 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

### Math 166: Topics in Contemporary Mathematics II

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

### 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,

### 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

### 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

### The Coin Toss Experiment

Experiments p. 1/1 The Coin Toss Experiment Perhaps the simplest probability experiment is the coin toss experiment. Experiments p. 1/1 The Coin Toss Experiment Perhaps the simplest probability experiment

### 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.

### 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

### 10-1. Combinations. Vocabulary. Lesson. Mental Math. able to compute the number of subsets of size r.

Chapter 10 Lesson 10-1 Combinations BIG IDEA With a set of n elements, it is often useful to be able to compute the number of subsets of size r Vocabulary combination number of combinations of n things

### Most of the time we deal with theoretical probability. Experimental probability uses actual data that has been collected.

AFM Unit 7 Day 3 Notes Theoretical vs. Experimental Probability Name Date Definitions: Experiment: process that gives a definite result Outcomes: results Sample space: set of all possible outcomes Event:

### Junior Circle Meeting 5 Probability. May 2, ii. In an actual experiment, can one get a different number of heads when flipping a coin 100 times?

Junior Circle Meeting 5 Probability May 2, 2010 1. We have a standard coin with one side that we call heads (H) and one side that we call tails (T). a. Let s say that we flip this coin 100 times. i. How

### When a number cube is rolled once, the possible numbers that could show face up are

C3 Chapter 12 Understanding Probability Essential question: How can you describe the likelihood of an event? Example 1 Likelihood of an Event When a number cube is rolled once, the possible numbers that

### 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.

### The topic for the third and final major portion of the course is Probability. We will aim to make sense of statements such as the following:

CS 70 Discrete Mathematics for CS Spring 2006 Vazirani Lecture 17 Introduction to Probability The topic for the third and final major portion of the course is Probability. We will aim to make sense of

### 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

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

Counting (Enumerative Combinatorics) X. Zhang, Fordham Univ. 1 Chance of winning?! What s the chances of winning New York Megamillion Jackpot!! just pick 5 numbers from 1 to 56, plus a mega ball number

### 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

### 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

### Discrete Structures for Computer Science

Discrete Structures for Computer Science William Garrison bill@cs.pitt.edu 6311 Sennott Square Lecture #23: Discrete Probability Based on materials developed by Dr. Adam Lee The study of probability is

### 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

### Course Learning Outcomes for Unit V

UNIT V STUDY GUIDE Counting Reading Assignment See information below. Key Terms 1. Combination 2. Fundamental counting principle 3. Listing 4. Permutation 5. Tree diagrams Course Learning Outcomes for

### 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

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

STAT 430/510 Probability Lecture 3: Space and Event; Sample Spaces with Equally Likely Outcomes Pengyuan (Penelope) Wang May 25, 2011 Review We have discussed counting techniques in Chapter 1. (Principle

### Functional Skills Mathematics

Functional Skills Mathematics Level Learning Resource Probability D/L. Contents Independent Events D/L. Page - Combined Events D/L. Page - 9 West Nottinghamshire College D/L. Information Independent Events

### Counting and Probability Math 2320

Counting and Probability Math 2320 For a finite set A, the number of elements of A is denoted by A. We have two important rules for counting. 1. Union rule: Let A and B be two finite sets. Then A B = A

### 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

### Probability MAT230. Fall Discrete Mathematics. MAT230 (Discrete Math) Probability Fall / 37

Probability MAT230 Discrete Mathematics Fall 2018 MAT230 (Discrete Math) Probability Fall 2018 1 / 37 Outline 1 Discrete Probability 2 Sum and Product Rules for Probability 3 Expected Value MAT230 (Discrete

### W = {Carrie (U)nderwood, Kelly (C)larkson, Chris (D)aughtry, Fantasia (B)arrino, and Clay (A)iken}

UNIT V STUDY GUIDE Counting Course Learning Outcomes for Unit V Upon completion of this unit, students should be able to: 1. Apply mathematical principles used in real-world situations. 1.1 Draw tree diagrams

### 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

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

Block 1 - Sets and Basic Combinatorics Main Topics in Block 1: A short revision of some set theory Sets and subsets. Venn diagrams to represent sets. Describing sets using rules of inclusion. Set operations.

### 7.1 Chance Surprises, 7.2 Predicting the Future in an Uncertain World, 7.4 Down for the Count

7.1 Chance Surprises, 7.2 Predicting the Future in an Uncertain World, 7.4 Down for the Count Probability deals with predicting the outcome of future experiments in a quantitative way. The experiments

### MGF 1106: Exam 2 Solutions

MGF 1106: Exam 2 Solutions 1. (15 points) A coin and a die are tossed together onto a table. a. What is the sample space for this experiment? For example, one possible outcome is heads on the coin and

### Section 5.4 Permutations and Combinations

Section 5.4 Permutations and Combinations Definition: n-factorial For any natural number n, n! n( n 1)( n 2) 3 2 1. 0! = 1 A combination of a set is arranging the elements of the set without regard to

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

Contemporary Mathematics Math 1030 Sample Exam I Chapters 13-15 Time Limit: 90 Minutes No Scratch Paper Calculator Allowed: Scientific Name: The point value of each problem is in the left-hand margin.

### CS 787: Advanced Algorithms Homework 1

CS 787: Advanced Algorithms Homework 1 Out: 02/08/13 Due: 03/01/13 Guidelines This homework consists of a few exercises followed by some problems. The exercises are meant for your practice only, and do

### Lesson Lesson 3.7 ~ Theoretical Probability

Theoretical Probability Lesson.7 EXPLORE! sum of two number cubes Step : Copy and complete the chart below. It shows the possible outcomes of one number cube across the top, and a second down the left

### STAT 430/510 Probability

STAT 430/510 Probability Hui Nie Lecture 1 May 26th, 2009 Introduction Probability is the study of randomness and uncertainty. In the early days, probability was associated with games of chance, such as

### Probability Models. Section 6.2

Probability Models Section 6.2 The Language of Probability What is random? Empirical means that it is based on observation rather than theorizing. Probability describes what happens in MANY trials. Example

### Section 5.4 Permutations and Combinations

Section 5.4 Permutations and Combinations Definition: n-factorial For any natural number n, n! = n( n 1)( n 2) 3 2 1. 0! = 1 A combination of a set is arranging the elements of the set without regard to

### Chapter 4: Introduction to Probability

MTH 243 Chapter 4: Introduction to Probability Suppose that we found that one of our pieces of data was unusual. For example suppose our pack of M&M s only had 30 and that was 3.1 standard deviations below

### PROBABILITY. 1. Introduction. Candidates should able to:

PROBABILITY Candidates should able to: evaluate probabilities in simple cases by means of enumeration of equiprobable elementary events (e.g for the total score when two fair dice are thrown), or by calculation

### 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

### 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

### 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

### The study of probability is concerned with the likelihood of events occurring. Many situations can be analyzed using a simplified model of probability

The study of probability is concerned with the likelihood of events occurring Like combinatorics, the origins of probability theory can be traced back to the study of gambling games Still a popular branch

1 (Before beginning, I d like to thank USAMTS for the template, which I modified to get this template) It would be beneficial to assign each square a value, and then make a few equalities. a b 3 c d e

### If a regular six-sided die is rolled, the possible outcomes can be listed as {1, 2, 3, 4, 5, 6} there are 6 outcomes.

Section 11.1: The Counting Principle 1. Combinatorics is the study of counting the different outcomes of some task. For example If a coin is flipped, the side facing upward will be a head or a tail the

### 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

### Discrete Structures for Computer Science

Discrete Structures for Computer Science William Garrison bill@cs.pitt.edu 6311 Sennott Square Lecture #22: Generalized Permutations and Combinations Based on materials developed by Dr. Adam Lee Counting

### 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?

### I. WHAT IS PROBABILITY?

C HAPTER 3 PROAILITY Random Experiments I. WHAT IS PROAILITY? The weatherman on 10 o clock news program states that there is a 20% chance that it will snow tomorrow, a 65% chance that it will rain and

### Raise your hand if you rode a bus within the past month. Record the number of raised hands.

166 CHAPTER 3 PROBABILITY TOPICS Raise your hand if you rode a bus within the past month. Record the number of raised hands. Raise your hand if you answered "yes" to BOTH of the first two questions. Record

### 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

### Solutions for Exam I, Math 10120, Fall 2016

Solutions for Exam I, Math 10120, Fall 2016 1. Let U = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10} A = {1, 2, 3} B = {2, 4, 6, 8, 10}. C = {4, 5, 6, 7, 8}. Which of the following sets is equal to (A B) C? {1, 2, 3,

### 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.

### Midterm 2 6:00-8:00pm, 16 April

CS70 2 Discrete Mathematics and Probability Theory, Spring 2009 Midterm 2 6:00-8:00pm, 16 April Notes: There are five questions on this midterm. Answer each question part in the space below it, using the

### Class 8 Cubes and Cube Root

ID : in-8-cubes-and-cube-root [1] Class 8 Cubes and Cube Root For more such worksheets visit www.edugain.com Answer the questions (1) Find the value of A if (2) If you subtract a number x from 15 times

### MULTIPLE CHOICE. Choose the one alternative that best completes the statement or answers the question. C) 1 6

Math 300 Exam 4 Review (Chapter 11) Name MULTIPLE CHOICE. Choose the one alternative that best completes the statement or answers the question. Give the probability that the spinner shown would land on

### Intermediate Math Circles November 1, 2017 Probability I

Intermediate Math Circles November 1, 2017 Probability I Probability is the study of uncertain events or outcomes. Games of chance that involve rolling dice or dealing cards are one obvious area of application.

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

Statistics Homework Ch 5 Name MULTIPLE CHOICE. Choose the one alternative that best completes the statement or answers the question. Provide an appropriate response. 1) A coin is tossed. Find the probability

### Probability. Dr. Zhang Fordham Univ.

Probability! Dr. Zhang Fordham Univ. 1 Probability: outline Introduction! Experiment, event, sample space! Probability of events! Calculate Probability! Through counting! Sum rule and general sum rule!

### Finite Math Section 6_4 Solutions and Hints

Finite Math Section 6_4 Solutions and Hints by Brent M. Dingle for the book: Finite Mathematics, 7 th Edition by S. T. Tan. DO NOT PRINT THIS OUT AND TURN IT IN!!!!!!!! This is designed to assist you in

### 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

### Probability (Devore Chapter Two)

Probability (Devore Chapter Two) 1016-351-01 Probability Winter 2011-2012 Contents 1 Axiomatic Probability 2 1.1 Outcomes and Events............................... 2 1.2 Rules of Probability................................

### Discrete mathematics

Discrete mathematics Petr Kovář petr.kovar@vsb.cz VŠB Technical University of Ostrava DiM 470-2301/02, Winter term 2018/2019 About this file This file is meant to be a guideline for the lecturer. Many