MATH M118 Lecture Notes - Lecture 4: Cyclic Permutation

96 views4 pages

Document Summary

When there is a group of n objects and we want to find out how many ways we can permute k of these objects we use the notation: p (n,k) A permutation of n objects taken k at a time can be computed by the formula: p (n,k) = Example: for p(11,5), enter 11 2nd npr 5 = . This problem can be solved using the fcp from 3. 1. However, this experiment is also an example of a permutation. That is, we want to find out how many ways we can arrange 10 people in 10 seats. So, there are two ways to solve this problem. Using permutations (3. 2: example b: there are 14 students. Note: all permutation problems can also be solved using fcp. However, not all fcp problems can be solved using permutation. How many ways can a committee of 20 people elect a president, secretary, and a treasurer? (3. 2, exercise #19)

Get access

Grade+20% off
$8 USD/m$10 USD/m
Billed $96 USD annually
Grade+
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class
40 Verified Answers
Class+
$8 USD/m
Billed $96 USD annually
Class+
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class
30 Verified Answers

Related textbook solutions

Related Documents

Related Questions