lecture29 - Lecture 29 Counting, Recurrence Relations...

Info iconThis preview shows pages 1–10. Sign up to view the full content.

View Full Document Right Arrow Icon
Lecture 29 Counting, Recurrence Relations
Background image of page 1

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

View Full DocumentRight Arrow Icon
Announcement Quiz on Friday Topics: Induction (Ch 4) and Counting (Ch 5)
Background image of page 2
The binomial theorem j j n n j n y x j n y x 0 ) (
Background image of page 3

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

View Full DocumentRight Arrow Icon
Pascal’s Identity k n k n k n 1 1 Let’s prove it combinatorially
Background image of page 4
Pascal’s triangle 0 1 2 3 4 5 6 7 8 n =
Background image of page 5

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

View Full DocumentRight Arrow Icon
Pascal’s triangle 0 1 2 3 4 5 6 7 8 n = 1 2 4 8 16 32 64 128 256 sum = = 2 n
Background image of page 6
Permutations and Combinations with repetition In the definition of (standard) permutations and combinations, each item can be used at most once. What happens when we relax this? For example, how many strings of length r can be formed from the English alphabet? Use product rule. Sometimes call “ permutations with repetition”
Background image of page 7

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

View Full DocumentRight Arrow Icon
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
Background image of page 8
Solution technique Imagine we have a cash box for seven
Background image of page 9

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

View Full DocumentRight Arrow Icon
Image of page 10
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 / 24

lecture29 - Lecture 29 Counting, Recurrence Relations...

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

View Full Document Right Arrow Icon
Ask a homework question - tutors are online