# 17_Counting - The number of permutations of n objects where...

This preview shows pages 1–8. Sign up to view the full content.

Generalized Permutations and Combinations 10/20/11 Counting with n distinct objects

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
Combinations with repetition Example : Three schools -- A, B and C -- are competing for a grand prize in a science fair competition. There are two judges. Each judge, anonymously, recommends one of the two schools. Calculate the number of ways the judges recommend the schools. The same as the number of 4-bit strings with exactly two 1s. # bit positions = # schools -1 + # of judges Theorem : C(n-1+r,r) is the number of r-combinations of n elements with repetition.
Section 6.5, Problem 9 A bagel shop has eight different types of bagels. How many ways are there to choose

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
Egg Salty Free choice from 7 types (other than salty)
Permutations of indistinguishable objects Example : # of strings obtained by permuting the letters of the word "DISCR" is 5! Alternative calculation:

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
Example 2 : calculate the # of strings obtained by permuting the letters of the word "DISCRETE". Theorem 3, Section 5.5

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: The number of permutations of n objects, where there are n 1 indistinguishable objects of type 1, n 2 indistinguishable objects of type 2, . .., and n k indistinguishable objects of type k such that n 1 +n 2 +...+n k = n, Distributing objects into boxes Many counting problems can be solved by enumerating the ways objects can be placed into boxes, where the order of placing objects within a box does not matter. There are four possibilities. we will look at placing distinguishable objects into distinguishable boxes (DODB) and indistinguishable objects into distinguishable boxes (IODB). Theorem 4. The number of ways to distribute n distinguishable objects into k distinct boxes so that n i objects are placed in box i, i=1, . .., k, and n 1 +...+n k = n, is Distinguishable objects into distinguishable boxes (DODB) Example : count the number of 5-card poker hands for 4 players in a game. Assume that a standard deck of cards is used....
View Full Document

## This note was uploaded on 03/21/2012 for the course CS 3333 taught by Professor Boppana during the Fall '11 term at The University of Texas at San Antonio- San Antonio.

### Page1 / 8

17_Counting - The number of permutations of n objects where...

This preview shows document pages 1 - 8. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online