Counting Subsets with Repetitions. ICS 6C Sandy Irani
|
|
- Dwight Day
- 5 years ago
- Views:
Transcription
1 Counting Subsets with Repetitions ICS 6C Sandy Irani
2 Multi-sets A Multi-set can have more than one copy of an item. Order doesn t matter The number of elements of each type does matter: {1, 2, 2, 2, 3, 4, 5, 7, 7} {1, 2, 2, 2, 3, 4, 7, 5, 7} {1, 2, 2, 3, 4, 5, 7, 7}
3 Counting Problem with Multi-sets You are purchasing a dozen donuts. The bakery has four varieties of donuts: Chocolate, Glazed, Jelly, Maple Donuts of the same variety are the same. There is an unlimited supply of each variety. (For this problem at least 12 of each variety). How many ways to select the donuts? Order doesn t matter. All that matters is how many of each variety you have in the box when you leave the bakery.
4 Donut Selection Sample selection: C C C G J J J J J J M M 3 chocolate 1 glazed 6 jelly 2 maple
5 Donut Selection Binary encoding that uniquely specifies a selection of donuts: Bijection: Selection of donuts Binary code word Will count the Number of valid binary code words
6 Encoding Donut Selection C C C G J J J J J J M M Select any ordering of the varieties: 1. Chocolate 2. Glazed 3. Jelly 4. Maple
7 Encoding Donut Selection G G G G J J J J J J M M Every code word has 12 0 s and 3 1 s: total of 15 bits
8 Encoding Donut Selection C C C C J J J J J J M M Every code word has 12 0 s and 3 1 s: total of 15 bits Number of donuts Number of varieties - 1
9 Code Words to Donut Selections
10 Donut Selection Bijection: Ways to select 12 donuts from 4 varieties Binary strings with 12 0 s and (4-1) 1 s # of ways to select 12 donuts from 4 varieties
11 Selecting from Varieties The number of ways to select n items from a set of m varieties Items from the same variety are identical There is at least n items from each variety n m m 1 1 (This is still true if n > m, m < n, or m = n)
12 Balls into Bins How many ways to throw n identical balls into m distinct bins? Bin 1 Bin 2 Bin 3 Bin 4 C C G G G G J J J J J M
13 Counting Multisets How many ways to distribute 10 identical prizes to a class with 200 students?
14 Solution to Sums of Variables How many solutions are there to the following equation, where each variable x i is a non-negative integer? x 1 + x 2 + x 3 + x 4 = x 1 = 2 x 2 = 4 x 3 = 5 x 4 = 1
15 Lower Bounds How many ways to select 12 donuts from 4 varieties (choc, glazed, jelly, maple) with the added constraint that there are at least 2 chocolate donuts? First pick the 2 chocolate donuts. Then select the remaining 10 donuts with no restrictions.
16 Solution to Sums of Variables How many solutions are there to the following equation, where each variable x i is a non-negative integer? x 1 + x 2 + x 3 + x 4 = 12 x 2 1 and x 4 3.
17 Balls into Bins How many ways to throw 12 identical balls into 4 distinct bins with at least two in each bin? Bin 1 Bin 2 Bin 3 Bin 4
18 Chocolate Bar Distribution How many ways to distribute 15 identical chocolate bars to 5 kids if each kid gets at least one?
19 Upper Bounds (by complement) How many ways to select 12 donuts from 4 varieties (choc, glazed, jelly, maple) with the added constraint that there are only 5 chocolate donuts available? The number of ways to select 12 donuts from 4 varieties with 5 chocolates The number of ways to select 12 donuts from 4 varieties with no constraints = - The number of ways to select 12 donuts from 4 varieties with NOT( 5 chocolates)
20 Balls into Bins m distinguishable bins n balls At most 1 per bin No limit on number per bin Same number in each bin distinguishable balls indistinguishable balls
21 Balls Into Bins How many ways are there to put 3 indistinguishable balls into 5 distinguishable bins with at most one per bin? Bin 1 Bin 2 Bin 3 Bin 4 Bin 5
22 Balls Into Bins How many ways are there to put 3 distinguishable balls into 5 distinguishable bins with at most one per bin? Bin 1 Bin 2 Bin 3 Bin 4 Bin 5 Bin 1 Bin 2 Bin 3 Bin 4 Bin 5
23 Balls Into Bins How many ways are there to put 3 distinguishable balls into 5 distinguishable bins with no limit on the number of balls per bin? Bin 1 Bin 2 Bin 3 Bin 4 Bin 5
24 Balls into Bins How many ways to throw n identical balls into m distinct bins? Bin 1 Bin 2 Bin 3 Bin 4 Bin 5
25 Balls into Bins How many ways to throw n distinct balls into m distinct bins same number of balls in each bin? Bin 1 Bin 2 Bin 3 Bin 4 Bin 5
26 Balls into Bins How many ways to throw n identical balls into m distinct bins same number of balls in each bin? Bin 1 Bin 2 Bin 3 Bin 4 Bin 5
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 informationDiscrete 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
More informationDiscrete 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 informationCombinatorics: The Fine Art of Counting
Combinatorics: The Fine Art of Counting Week Four Solutions 1. An ice-cream store specializes in super-sized deserts. Their must famous is the quad-cone which has 4 scoops of ice-cream stacked one on top
More informationCISC-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 informationDistinguishable Boxes
Math 10B with Professor Stankova Worksheet, Discussion #5; Thursday, 2/1/2018 GSI name: Roy Zhao Distinguishable Boxes Examples 1. Suppose I am catering from Yali s and want to buy sandwiches to feed 60
More informationMAT104: 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 informationDiscrete 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
More informationDiscrete Mathematics and Probability Theory Spring 2014 Anant Sahai Note 11
EECS 70 Discrete Mathematics and Probability Theory Spring 2014 Anant Sahai Note 11 Counting As we saw in our discussion for uniform discrete probability, being able to count the number of elements of
More informationSection 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 informationWeek 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 informationReview 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 informationMAT3707. 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 informationCS100: 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 informationThe 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
More informationCombinatorics: The Fine Art of Counting
Combinatorics: The Fine Art of Counting Week Four Problems Please read through the entire menu and try to classify each problem into one of the following types: Counting Subsets, Distinct Partitions, Block
More informationThe 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 informationMat 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 informationCS70: 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 informationCSCI 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 informationMath 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 informationIt is important that you show your work. The total value of this test is 220 points.
June 27, 2001 Your name It is important that you show your work. The total value of this test is 220 points. 1. (10 points) Use the Euclidean algorithm to solve the decanting problem for decanters of sizes
More informationLecture 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 informationWeek 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 informationEECS 203 Spring 2016 Lecture 15 Page 1 of 6
EECS 203 Spring 2016 Lecture 15 Page 1 of 6 Counting We ve been working on counting for the last two lectures. We re going to continue on counting and probability for about 1.5 more lectures (including
More informationPOKER (AN INTRODUCTION TO COUNTING)
POKER (AN INTRODUCTION TO COUNTING) LAMC INTERMEDIATE GROUP - 10/27/13 If you want to be a succesful poker player the first thing you need to do is learn combinatorics! Today we are going to count poker
More informationProbability. Key Definitions
1 Probability Key Definitions Probability: The likelihood or chance of something happening (between 0 and 1). Law of Large Numbers: The more data you have, the more true to the probability of the outcome
More informationLecture 2: Sum rule, partition method, difference method, bijection method, product rules
Lecture 2: Sum rule, partition method, difference method, bijection method, product rules References: Relevant parts of chapter 15 of the Math for CS book. Discrete Structures II (Summer 2018) Rutgers
More informationSHORT ANSWER. Write the word or phrase that best completes each statement or answers the question.
MATH 1324 Review for Test 3 SHORT ANSWER. Write the word or phrase that best completes each statement or answers the question. Find the value(s) of the function on the given feasible region. 1) Find the
More informationn! = 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 informationSolutions 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 informationMath 454 Summer 2005 Due Wednesday 7/13/05 Homework #2. Counting problems:
Homewor #2 Counting problems: 1 How many permutations of {1, 2, 3,..., 12} are there that don t begin with 2? Solution: (100%) I thin the easiest way is by subtracting off the bad permutations: 12! = total
More informationThe 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 information1. 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 informationPermutations 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 informationTopics 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 informationDiscrete Mathematics and Probability Theory Spring 2018 Ayazifar and Rao Midterm 2 Solutions
CS 70 Discrete Mathematics and Probability Theory Spring 2018 Ayazifar and Rao Midterm 2 Solutions PRINT Your Name: Oski Bear SIGN Your Name: OS K I PRINT Your Student ID: CIRCLE your exam room: Pimentel
More informationMath 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 information6.4 Permutations and Combinations
Math 141: Business Mathematics I Fall 2015 6.4 Permutations and Combinations Instructor: Yeong-Chyuan Chung Outline Factorial notation Permutations - arranging objects Combinations - selecting objects
More informationPermutations. Example 1. Lecture Notes #2 June 28, Will Monroe CS 109 Combinatorics
Will Monroe CS 09 Combinatorics Lecture Notes # June 8, 07 Handout by Chris Piech, with examples by Mehran Sahami As we mentioned last class, the principles of counting are core to probability. Counting
More information1 Permutations. Example 1. Lecture #2 Sept 26, Chris Piech CS 109 Combinatorics
Chris Piech CS 09 Combinatorics Lecture # Sept 6, 08 Based on a handout by Mehran Sahami As we mentioned last class, the principles of counting are core to probability. Counting is like the foundation
More informationThe 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
More informationProbability 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
More informationLecture 3 Presentations and more Great Groups
Lecture Presentations and more Great Groups From last time: A subset of elements S G with the property that every element of G can be written as a finite product of elements of S and their inverses is
More informationHOMEWORK 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 informationSample 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.
More informationCSC/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 informationMath 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 informationSection 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 informationCounting. 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 informationDiscrete 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 informationReading 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 informationLecture 18 - Counting
Lecture 18 - Counting 6.0 - April, 003 One of the most common mathematical problems in computer science is counting the number of elements in a set. This is often the core difficulty in determining a program
More informationThe 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
More informationChapter 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 informationWell, 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 information12. 6 jokes are minimal.
Pigeonhole Principle Pigeonhole Principle: When you organize n things into k categories, one of the categories has at least n/k things in it. Proof: If each category had fewer than n/k things in it then
More information8.2 Union, Intersection, and Complement of Events; Odds
8.2 Union, Intersection, and Complement of Events; Odds Since we defined an event as a subset of a sample space it is natural to consider set operations like union, intersection or complement in the context
More informationSTATISTICAL 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 informationSolution: This is sampling without repetition and order matters. Therefore
June 27, 2001 Your name It is important that you show your work. The total value of this test is 220 points. 1. (10 points) Use the Euclidean algorithm to solve the decanting problem for decanters of sizes
More informationCSC/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
More informationCS1802 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)
More informationElementary Combinatorics CE 311S
CE 311S INTRODUCTION How can we actually calculate probabilities? Let s assume that there all of the outcomes in the sample space S are equally likely. If A is the number of outcomes included in the event
More informationPermutations 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 informationHistogram equalization
Histogram equalization Contents Background... 2 Procedure... 3 Page 1 of 7 Background To understand histogram equalization, one must first understand the concept of contrast in an image. The contrast is
More informationUCSD CSE 21, Spring 2014 [Section B00] Mathematics for Algorithm and System Analysis
UCSD CSE 21, Spring 2014 [Section B00] Mathematics for Algorithm and System Analysis Lecture 3 Class URL: http://vlsicad.ucsd.edu/courses/cse21-s14/ Lecture 3 Notes Goal for today: CL Section 3 Subsets,
More informationCSE 20 DISCRETE MATH. Fall
CSE 20 DISCRETE MATH Fall 2017 http://cseweb.ucsd.edu/classes/fa17/cse20-ab/ Today's learning goals Define and compute the cardinality of a set. Use functions to compare the sizes of sets. Classify sets
More information1 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 informationSec$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 informationMath Steven Noble. November 22nd. Steven Noble Math 3790
Math 3790 Steven Noble November 22nd Basic ideas of combinations and permutations Simple Addition. If there are a varieties of soup and b varieties of salad then there are a + b possible ways to order
More informationTheory 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 informationDISCRETE 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 informationn r for the number. (n r)!r!
Throughout we use both the notations ( ) n r and C n n! r for the number (n r)!r! 1 Ten points are distributed around a circle How many triangles have all three of their vertices in this 10-element set?
More informationMultiple 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 information5. (1-25 M) How many ways can 4 women and 4 men be seated around a circular table so that no two women are seated next to each other.
A.Miller M475 Fall 2010 Homewor problems are due in class one wee from the day assigned (which is in parentheses. Please do not hand in the problems early. 1. (1-20 W A boo shelf holds 5 different English
More informationDiscrete 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
More informationWill Monroe June 28, with materials by Mehran Sahami and Chris Piech. Combinatorics
Will Monroe June 28, 27 with materials by Mehran Sahami and Chris Piech Combinatorics Review: Course website https://cs9.stanford.edu/ Logistics: Problem Set 4 questions (#: tell me about yourself!) Due:
More informationCombinatorics: The Fine Art of Counting
Combinatorics: The Fine Art of Counting Week 6 Lecture Notes Discrete Probability Note Binomial coefficients are written horizontally. The symbol ~ is used to mean approximately equal. Introduction and
More informationCombinatorics: The Fine Art of Counting
Combinatorics: The Fine Art of Counting Lecture Notes Counting 101 Note to improve the readability of these lecture notes, we will assume that multiplication takes precedence over division, i.e. A / B*C
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.
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 informationUniversal Cycles for Permutations Theory and Applications
Universal Cycles for Permutations Theory and Applications Alexander Holroyd Microsoft Research Brett Stevens Carleton University Aaron Williams Carleton University Frank Ruskey University of Victoria Combinatorial
More informationBlock 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.
More informationChapter 4: The Building Blocks: Binary Numbers, Boolean Logic, and Gates
Chapter 4: The Building Blocks: Binary Numbers, Boolean Logic, and Gates Objectives In this chapter, you will learn about The binary numbering system Boolean logic and gates Building computer circuits
More informationDuke Math Meet Individual Round
1. Trung has 2 bells. One bell rings 6 times per hour and the other bell rings 10 times per hour. At the start of the hour both bells ring. After how much time will the bells ring again at the same time?
More informationPROBABILITY FOR RISK MANAGEMENT. Second Edition
Solutions Manual for PROBABILITY FOR RISK MANAGEMENT Second Edition by Donald G. Stewart, Ph.D. and Matthew J. Hassett, ASA, Ph.D. ACTEX Publications Winsted, Connecticut Copyright 2006, by ACTEX Publications,
More informationPermutation Groups. Every permutation can be written as a product of disjoint cycles. This factorization is unique up to the order of the factors.
Permutation Groups 5-9-2013 A permutation of a set X is a bijective function σ : X X The set of permutations S X of a set X forms a group under function composition The group of permutations of {1,2,,n}
More informationDiscrete Mathematics and Probability Theory Fall 2016 Seshia and Walrand HW 8
CS 70 Discrete Mathematics and Probability Theory Fall 2016 Seshia and Walrand HW 8 1 Sundry Before you start your homewor, write down your team. Who else did you wor with on this homewor? List names and
More informationCombinatorics 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 information50 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 informationFoundations 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 informationUnit 14 Probability. Target 3 Calculate the probability of independent and dependent events (compound) AND/THEN statements
Target 1 Calculate the probability of an event Unit 14 Probability Target 2 Calculate a sample space 14.2a Tree Diagrams, Factorials, and Permutations 14.2b Combinations Target 3 Calculate the probability
More informationJong 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 informationCounting 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 information7.4 Permutations and Combinations
7.4 Permutations and Combinations The multiplication principle discussed in the preceding section can be used to develop two additional counting devices that are extremely useful in more complicated counting
More informationThe quality of the transmission signal The characteristics of the transmission medium. Some type of transmission medium is required for transmission:
Data Transmission The successful transmission of data depends upon two factors: The quality of the transmission signal The characteristics of the transmission medium Some type of transmission medium is
More informationProblem Set 8 Solutions R Y G R R G
6.04/18.06J Mathematics for Computer Science April 5, 005 Srini Devadas and Eric Lehman Problem Set 8 Solutions Due: Monday, April 11 at 9 PM in Room 3-044 Problem 1. An electronic toy displays a 4 4 grid
More informationModule 3 Greedy Strategy
Module 3 Greedy Strategy Dr. Natarajan Meghanathan Professor of Computer Science Jackson State University Jackson, MS 39217 E-mail: natarajan.meghanathan@jsums.edu Introduction to Greedy Technique Main
More information1. The chance of getting a flush in a 5-card poker hand is about 2 in 1000.
CS 70 Discrete Mathematics for CS Spring 2008 David Wagner Note 15 Introduction to Discrete Probability Probability theory has its origins in gambling analyzing card games, dice, roulette wheels. Today
More informationError Detection and Correction: Parity Check Code; Bounds Based on Hamming Distance
Error Detection and Correction: Parity Check Code; Bounds Based on Hamming Distance Greg Plaxton Theory in Programming Practice, Spring 2005 Department of Computer Science University of Texas at Austin
More informationMATHCOUNTS g 42 nd Mock Mathcounts g
MATHCOUNTS 2008-09 g 42 nd Mock Mathcounts g Sprint Round Problems 1-30 Name State DO NOT BEGIN UNTIL YOU ARE INSTRUCTED TO DO SO This section of the competition consists of 30 problems. You will have
More information