lecture30

# lecture30 - Lecture 30 Counting Recurrence Relations...

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

Lecture 30 Counting, Recurrence Relations

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

View Full Document
Announcement Quiz on Friday Topics: Induction (Ch 4) and Counting (Ch 5)
Combinations with repetition A cash box contains \$1, \$2, \$5, \$10, \$20, \$50, and \$100 bills How many ways to select 5 bills if The order of the bills is not important The bills are indistinguishable There are > 5 bills of each type

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

View Full Document
Solution technique Imagine we have a cash box for seven types of bills with a compartment for each type. Represent this using 6 separators 100 | 50 | 20 | 10 | 5 | 2 | 1 For each bill place a * in the corresponding compartment That is: ** | | * | **| | | is the selection of two \$100, one \$20, two \$10 bills
Solution (cont) So the problem has been reduced to the number of ways of arranging six |s and five *s What’s the answer? C(6+5, 5)

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

View Full Document
In general There are C(n+r-1, r) ways of choosing r objects with repetition from n classes (i.e. r-combinations with repetition from a set with n elements)
Other Problems involving indistinguishable objects How many ways of arranging the letters S, U, C, C, E, S, S The answer is not (7!)

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

View Full Document
Distinguishable Objects, Indistinguishable Boxes How many ways to assign four different objects to three identical offices (each office can accommodate up to four people)
This is the end of the preview. Sign up to access the rest of the document.

## This note was uploaded on 10/21/2011 for the course CSCI 2011 taught by Professor Staff during the Spring '08 term at Minnesota.

### Page1 / 31

lecture30 - Lecture 30 Counting Recurrence Relations...

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

View Full Document
Ask a homework question - tutors are online