24 - Introduction Combinations Discrete Mathematics Andrei...

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

View Full Document Right Arrow Icon
Introduction Combinations Discrete Mathematics Andrei Bulatov
Background image of page 1

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

View Full DocumentRight Arrow Icon
Discrete Mathematics – Combinations 24-2 Previous Lecture Rule of Sum Rule of Product Permutations
Background image of page 2
Discrete Mathematics – Combinations 24-3 Permutations with Repetitions How many different 4-letter words (not necessarily meaningful) can be built permuting the letters of the word COOL? If all letters were distinct then the answer would be the number of all permutations of a 4-element set. However, in words we build we do not distinguish two O. So, words are equal. For each of the words we are interested in, there are two words in which the two O’s are distinguished. Therefore the answer is 1 2 2 1 CLO O and CLO O 12 2 ! 4 =
Background image of page 3

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

View Full DocumentRight Arrow Icon
24-4 Permutations with Repetitions (cntd) Theorem . If there are n objects with indistinguishable objects of a first type, indistinguishable objects of a second type, … , and indistinguishable objects of a type r, where , then there are (linear) arrangements of the given n objects. Each arrangement of this type is called a permutation with repetitions
Background image of page 4
Image of page 5
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 10/14/2011 for the course MACM 101 taught by Professor Pearce during the Spring '08 term at Simon Fraser.

Page1 / 13

24 - Introduction Combinations Discrete Mathematics Andrei...

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

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