Combinatorics

# If there are n1 ways of doing the rst task and n2 ways

This preview shows page 1. Sign up to view the full content.

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

Unformatted text preview: 5ons with indis5nguishable objects •  Algorithms –  Genera5ng combina5ons (1), permuta5ons (2) •  More Examples CSCE 235 Combinatorics 3 Product Rule •  If two events are not mutually exclusive (that is we do them separately), then we apply the product rule •  Theorem: Product Rule Suppose a procedure can be accomplished with two disjoint subtasks. If there are –  n1 ways of doing the ﬁrst task and –  n2 ways of doing the second task, then there are n1.n2 ways of doing the overall procedure CSCE 235 Combinatorics 4 Sum Rule (1) •  If two events are mutually exclusive, that is, they cannot be done at the same 5me, then we must apply the sum rule •  Theorem: Sum Rule. If –  an event e1 can be done in n1 ways, –  an event e2 can be done in n2 ways, and –  e1 and e2 are mutually excl...
View Full Document

## This note was uploaded on 10/31/2013 for the course CSCE 235 taught by Professor Staff during the Spring '08 term at UNL.

Ask a homework question - tutors are online