AMC AMS AMR ACS ACR ASR MSR MCR MCS CRS

Similar documents
AMC AMS AMR ACS ACR ASR MSR MCR MCS CRS

Combinations AMC AMS AMR ACS ACR ASR MSR MCR MCS CRS

AMC AMS AMR ACS ACR ASR MSR MCR MCS CRS

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

P (5, 3) and as we have seen P (5, 3) = 60.

Combinatorics. Chapter Permutations. Reading questions. Counting Problems. Counting Technique: The Product Rule

PERMUTATION AND COMBINATION

8. Combinatorial Structures

PERMUTATIONS AND COMBINATIONS

We often find the probability of an event by counting the number of elements in a simple sample space.

}, how many different strings of length n 1 exist? }, how many different strings of length n 2 exist that contain at least one a 1

7. Counting Measure. Definitions and Basic Properties

Permutation Enumeration

Ch 9 Sequences, Series, and Probability

CS3203 #5. 6/9/04 Janak J Parekh

Counting and Probability CMSC 250

PERMUTATIONS AND COMBINATIONS

COLLEGE ALGEBRA LECTURES Copyrights and Author: Kevin Pinegar

COMBINATORICS 2. Recall, in the previous lesson, we looked at Taxicabs machines, which always took the shortest path home

1. How many possible ways are there to form five-letter words using only the letters A H? How many such words consist of five distinct letters?

Counting on r-fibonacci Numbers

Extra Practice 1. Name Date. Lesson 1.1: Patterns in Division

Chapter (6) Discrete Probability Distributions Examples

Counting III. Today we ll briefly review some facts you dervied in recitation on Friday and then turn to some applications of counting.

THE LUCAS TRIANGLE RECOUNTED. Arthur T. Benjamin Dept. of Mathematics, Harvey Mudd College, Claremont, CA Introduction

Logarithms APPENDIX IV. 265 Appendix

x y z HD(x, y) + HD(y, z) HD(x, z)

AS Exercise A: The multiplication principle. Probability using permutations and combinations. Multiplication principle. Example.

Roberto s Notes on Infinite Series Chapter 1: Series Section 2. Infinite series

Math 7 Flipped Mastery Self Tester Worksheet Name: Class:. Chapter 1 (Unit 1) Patterns and Relationships - Accommodated 1.1 Patterns In Division /36

2. There are n letter and n addressed envelopes. The probability that all the letters are not kept in the right envelope, is. (c)

lecture notes September 2, Sequential Choice

Discrete Mathematics and Probability Theory Spring 2014 Anant Sahai Note 12

Summary of Random Variable Concepts April 19, 2000

arxiv: v2 [math.co] 15 Oct 2018

x 1 + x x n n = x 1 x 2 + x x n n = x 2 x 3 + x x n n = x 3 x 5 + x x n = x n

Unit 5: Estimating with Confidence

CHAPTER 5 A NEAR-LOSSLESS RUN-LENGTH CODER

HIGHER SECONDARY FIRST YEAR MATHEMATICS. ALGEBRA Creative Questions Time : 1.15 Hrs Marks : 45 Part - I Choose the correct answer 10 1 = 10.

X-Bar and S-Squared Charts

APPLICATION NOTE UNDERSTANDING EFFECTIVE BITS

Combinatorics. ChaPTer a The addition and multiplication principles introduction. The addition principle

On the Number of Permutations on n Objects with. greatest cycle length

You Think You ve Got Problems? Marc Brodie Associate Professor of Mathematics, WJU

Math 140 Introductory Statistics

CS 201: Adversary arguments. This handout presents two lower bounds for selection problems using adversary arguments ëknu73,

POWERS OF 3RD ORDER MAGIC SQUARES

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

H2 Mathematics Pure Mathematics Section A Comprehensive Checklist of Concepts and Skills by Mr Wee Wen Shih. Visit: wenshih.wordpress.

Lecture 4: Frequency Reuse Concepts

Technical Explanation for Counters

Mixed Counting Problems

Cross-Layer Performance of a Distributed Real-Time MAC Protocol Supporting Variable Bit Rate Multiclass Services in WPANs

Optimal Arrangement of Buoys Observable by Means of Radar

General Model :Algorithms in the Real World. Applications. Block Codes

Shuffling Cards. D.J.W. Telkamp. Utrecht University Mathematics Bachelor s Thesis. Supervised by Dr. K. Dajani

Application of Improved Genetic Algorithm to Two-side Assembly Line Balancing

The Multiplication Principle

Procedia - Social and Behavioral Sciences 128 ( 2014 ) EPC-TKS 2013

4.3 COLLEGE ALGEBRA. Logarithms. Logarithms. Logarithms 11/5/2015. Logarithmic Functions

Coat 1. Coat 2. Coat 1. Coat 2

CHAPTER 8 JOINT PAPR REDUCTION AND ICI CANCELLATION IN OFDM SYSTEMS

3. Error Correcting Codes

Data Mining the Online Encyclopedia of Integer Sequences for New Identities Hieu Nguyen

A SELECTIVE POINTER FORWARDING STRATEGY FOR LOCATION TRACKING IN PERSONAL COMMUNICATION SYSTEMS

A study on the efficient compression algorithm of the voice/data integrated multiplexer

Coat 1. Hat A Coat 2. Coat 1. 0 Hat B Another solution. Coat 2. Hat C Coat 1

Crafting Well-Built Sentences. Varying Sentence Patterns. Breaking the Rules to Create Fluency. Capturing a Smooth and Rhythmic Flow

A generalization of Eulerian numbers via rook placements

A SIMPLE METHOD OF GOAL DIRECTED LOSSY SYNTHESIS AND NETWORK OPTIMIZATION

Hybrid BIST Optimization for Core-based Systems with Test Pattern Broadcasting

Shuffling. Shahrzad Haddadan. March 7, 2013

Sampling Distribution Theory

A New Design of Log-Periodic Dipole Array (LPDA) Antenna

Novel pseudo random number generation using variant logic framework

A SIMPLE METHOD OF GOAL DIRECTED LOSSY SYNTHESIS AND NETWORK OPTIMIZATION

Multiple Contrast Test (MCT) for Dose-response Microarray studies: A Resampling-based Approach

A RULE OF THUMB FOR RIFFLE SHUFFLING

Wavelet Transform. CSEP 590 Data Compression Autumn Wavelet Transformed Barbara (Enhanced) Wavelet Transformed Barbara (Actual)

13 Legislative Bargaining

Fault Diagnosis in Rolling Element Bearing Using Filtered Vibration and Acoustic Signal

A New Space-Repetition Code Based on One Bit Feedback Compared to Alamouti Space-Time Code

Mathematical Explorations of Card Tricks

Compound Controller for DC Motor Servo System Based on Inner-Loop Extended State Observer

Combinatorics and probability

Math 166: Topics in Contemporary Mathematics II

Grade 6 Math Review Unit 3(Chapter 1) Answer Key

Sapana P. Dubey. (Department of applied mathematics,piet, Nagpur,India) I. INTRODUCTION

Single Bit DACs in a Nutshell. Part I DAC Basics

SIDELOBE SUPPRESSION IN OFDM SYSTEMS

DESIGN OF A COFFEE VENDING MACHINE USING SINGLE ELECTRON DEVICES

H(X,Y) = H(X) + H(Y X)

CHAPTER 8 Additional Probability Topics

ADSP ADSP ADSP ADSP. Advanced Digital Signal Processing (18-792) Spring Fall Semester, Department of Electrical and Computer Engineering

BOUNDS FOR OUT DEGREE EQUITABLE DOMINATION NUMBERS IN GRAPHS

Survey of Low Power Techniques for ROMs

Chapter 1. Probability

Test Time Minimization for Hybrid BIST with Test Pattern Broadcasting

Throughput/Delay Analysis of Spectrally Phase- Encoded Optical CDMA over WDM Networks

Simulation of Laser Manipulation of Bloch. Vector in Adiabatic Regime

Transcription:

Sectio 6.5: Combiatios Example Recall our five frieds, Ala, Cassie, Maggie, Seth ad Roger from the example at the begiig of the previous sectio. The have wo tickets for a cocert i Chicago ad everybody would like to go. However, they caot afford two more tickets ad must choose a group of three people from the five to go to the cocert. Ala decides to make a fair decisio o who gets the tickets, by writig the iitials of each possible group of idividuals from the 5 frieds o a separate piece of paper ad puttig all of the pieces of paper i a hat. He will the draw oe piece of paper from the hat at radom to select the lucky group. The order i which the ames of the idividuals is writte is irrelevat. The complete list of the 0 possible groups of size three from the five frieds is show below: AMC AMS AMR ACS ACR ASR MSR MCR MCS CRS Note that for every group o this list, it appears 6! times o the list of possible photographs of three of the five frieds that we saw i the last lecture: AMC AMS AMR ACS ACR ACM ASM ARM ASC ARC CAM MAS MAR CAS CAR CMA MSA MRA CSA CRA M AC SAM RAM SAC RCA MCA SMA RMA SCA RAC ASR MSR MCR MCS CRS ARS MRS MRC MSC CSR SAR SM R RM C CSM RCS SRA SRM RCM CM S RSC RSA M RS CRM SM C SCR RAS M SR CM R SCM SRC Its easy to see that the reaso for this is because every group of three idividuals ca be permuted i! 6 ways to create! differet photographs. Whe selectig a group from the hat to receive the tickets, the order i which the ames of the idividuals appear o the slip of paper is irrelevat. The group AMC is the same as the group CAM, so oly oe of the! permutatios of this group should be i the hat for selectio. Thus the umber of ways to select a subset of three idividuals from the five frieds to receive the three tickets is 60! P (5, )! 5!!!. Ala has listed all Combiatios of the five frieds, take at a time to put i the hat. The umber of such combiatios, which is 0, is deoted by C(5, ). I terms of set theory he has listed all subsets of objects i the set of 5 objects {A, B, C, D, E}. Defiitio A Combiatio of objects take R at a time is a selectio (Sample, Team) of R objects take from amog the. The order i which the objects are chose does ot matter. The key characteristics of a combiatio are. A combiatio selects elemets from a sigle set.. Repetitios are ot allowed.

. The order i which the selected elemets are arraged is ot sigificat. The umber of such combiatios is deoted by the symbol C(, R) or ( R). We have C(, R) R Example Evaluate C(0, ). ( ) ( R ) R (R ) (R ) P (, R) R!! R!( R)! Example(Choosig a team) How may ways are there to choose a team of 7 people from a class of 40 studets i order to make a team for Bookstore Basketball? Example(Roud Robis) I a soccer touramet with 5 teams, each team must play each other team exactly oce. How may matches must be played? Example(Poker Hads) A poker had cosists of five cards dealt at radom from a stadard deck of 5. How may differet poker hads are possible? Example A stadard deck of cards cosists of hearts, diamods, spades ad clubs. How may poker hads cosist etirely of clubs? Example How may poker hads cosist of red cards oly? Example How may poker hads cosist of kigs ad quees? Example (Quality Cotrol) A factory produces lightbulbs ad ships them i boxes of 50 to their customers. A quality cotrol ispector checks a box by takig out a sample of size 5 ad checkig if ay of those 5 bulbs are defective. If at least oe defective bulb is foud the box is ot shipped, otherwise the box is shipped. How may differet samples of size five ca be take from a box of 50 bulbs? Example If a box of 50 lightbulbs cotais 0 defective lightbulbs ad 0 o-defective lightbulbs, how may samples of size 5 ca be draw from the box so that all of the lightbulbs i the sample are good?

Problems usig a mixture of coutig priciples Example How may poker hads have at least two kigs? Example I the Notre Dame Jugglig club, there are 5 graduate studets ad 7 udergraduate studets. All would like to atted a jugglig performace i Chicago. However, they oly have fudig from Studet Activities for 5 people to atted. The fudig will oly apply if at least three of those attedig are udergraduates. I how may ways ca 5 people be chose to go to the performace so that the fudig will be grated? Example Gio s Pizza Parlor offers three types of crust, types of cheese, 4 vegetable toppigs ad meat toppigs. Pat always chooses oe type of crust, oe type of cheese, vegetable toppigs ad two meat toppigs. how may differet pizzas ca Pat create? Example How may subsets of a set of size 5 have at least 4 elemets? Special Cases ad Formulas It is immediate from our formula C(, R)! R!( R)! that C(, R) C(, R). Thus C(0, ) C(0, 7) ad C(00, 98) C(00, ) etc... By defiitio (for coveiece) 0! ad C(, 0), which makes sese sice there is exactly oe subset with zero elemets i every set. C(, )! ( )!, which makes sese sice there are exactly subsets with oe elemet i a set with elemets. C(, ) C(, 0) which makes sese because... (fiish the setece).

The Biomial Theorem The Biomial theorem says that for ay positive iteger ad two umbers x ad y, we have (x y) x 0 x y For example if 4, the the theorem says that ( ) ( ) 4 4 (x y) 4 x 4 x y 0 ( ) ( ) x y xy x y xy y 4. 4 y. Example (a) Check that the above equatio is true for 4, x, y. (b) Check that the above equatio is true for 4, x, y. Thigs to Note 4 4 (X Y) 4 ( 4 0)x 4 ( 4 )x y ( 4 )x y ( 4 )x y ( 4 4)y 4 Symmetry C(4, ) C(4, ) Powers of x ad y are switched Note how the powers relate to the lower umbers i the coefficiets. Note how the powers decrease o the x s ad icrease o the y s as we move from left to right. Note how the powers i each term of the expressio add to. Note the symmetry i the expasio. ( 4 ) x y is a Term of the expressio ad ( 4 ) is the coefficiet of that term. 4

Note that the sum of the coefficiets of the terms of the expasio of (x y) 4 is equal to the total umber of subsets oe ca make usig a set of size 4. Settig x ad y i the above equatio, we get the formula: 4 0 Applyig the same proof to the geeral case, we get the formula: 0 4 C(, 0) C(, ) C(, ) C(, )... C(, ) for ay coutig umber. Thus the umber of subsets of a set with elemets is. Example A set has te elemets. How may of its subsets have at least two elemets? Example How may tips could you leave at a restaurat, if you have a half-dollar, a oe dollar coi, a two dollar ote ad a five dollar ote? 5

Extra: Taxi Cab Geometry revisited. Recall that the umber of taxi cab routes (always travelig south or east) from A to B is the umber of differet rearragemets of the sequece SSSSEEEEE which is 9! 4!5! C(9, 4) C(9, 5). The sequece SSSSEEEEE is show i red ad the sequece ESSEEESES i blue. A Ca you thik of ay reaso why the umber of routes should equal the umber of ways to choose 4 objects from a set of 9 objects? B 6