06.09.2021 Views

College Algebra & Trigonometry, 2018a

College Algebra & Trigonometry, 2018a

College Algebra & Trigonometry, 2018a

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

312 CHAPTER 7. COMBINATORICS<br />

7.2 Factorial Notation and Permutations<br />

In considering the number of possibilities of various events, particular scenarios<br />

typically emerge in different problems. One of these scenarios is the multiplication<br />

of consecutive whole numbers. For example, given the question of how<br />

many ways there are to seat a given number of people in a row of chairs, there<br />

will obviously not be repetition of the individuals. So, if we wanted to know how<br />

many different ways there are to seat 5 people in a row of five chairs, there would<br />

be 5 choices for the first seat, 4 choices for the second seat, 3 choices for the third<br />

seat and so on.<br />

5 ∗ 4 ∗ 3 ∗ 2 ∗ 1 = 120 choices<br />

In these situations the 1 is sometimes omitted because it doesn’t change the value<br />

of the answer. This process of multiplying consecutive decreasing whole numbers<br />

is called a “factorial.” The notation for a factorial is an exclamation point. So<br />

the problem above could be answered: 5! = 120. By definition, 0! = 1. Although<br />

this may not seem logical intuitively, the definition is based on its application in<br />

permutation problems.<br />

A“permutation” uses factorials for solving situations in which not all of the possibilities<br />

will be selected.<br />

So, for example, if we wanted to know how many ways can first, second and third<br />

place finishes occur in a race with 7 contestants, there would be seven possibilities<br />

for first place, then six choices for second place, then five choices for third place.<br />

So, there are 7 ∗ 6 ∗ 5 = 210 possible ways to accomplish this.<br />

The standard notation for this type of permutation is generally n P r or P (n, r).<br />

This notation represents the number of ways of allocating r distinct elements into<br />

separate positions from a group of n possibilities.<br />

In the example above the expression 7 ∗ 6 ∗ 5 would be represented as 7 P 3 or<br />

P (7, 3).

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!