lec19-more-counting - EECS 203, Winter 2007 Discrete...

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

View Full Document Right Arrow Icon

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

View Full DocumentRight Arrow Icon

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

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: EECS 203, Winter 2007 Discrete Mathematics Lecture 19 More on counting March 15 Reading: Rosen [5.5]; Lehman [17] Useful references: A table complied by Bent Petersen: http://oregonstate.edu/ peterseb/mth355/docs/355f2001 counting.pdf . Eric Lehman and Tom Leightons lecture note at MIT: http://theory.lcs.mit.edu/ e lehman/mathcs.pdf . March 15 More on counting, Page 1 19.1 Distributing objects into boxes Objects and boxes can be distinguishable (labeled) or indistinguishable (unlabeled). The number of distributing n objects to m boxes: n dist. objects, m dist. boxes: m n . n indist. objects, m dist. boxes: ( m + n- 1 m- 1 ) . n indist. objects, m indist. boxes: no closed form fomular The number of ways to partition n as sum of natural numbers: partition function p ( n ). March 15 More on counting, Page 2 19.2 Stirling numbers of the second kind n dist. objects, m indist. boxes: m j =1 s ( n,j ) s ( n,j )= # when no empty box: Stirling number of the second...
View Full Document

This note was uploaded on 04/01/2008 for the course EECS 203 taught by Professor Yaoyunshi during the Winter '07 term at University of Michigan.

Page1 / 8

lec19-more-counting - EECS 203, Winter 2007 Discrete...

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

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