College Algebra (6th Edition)

Published by Pearson
ISBN 10: 0-32178-228-3
ISBN 13: 978-0-32178-228-1

Chapter 8 - Sequences, Induction, and Probability - Exercise Set 8.6 - Page 770: 77

Answer

See below.

Work Step by Step

If we want to choose $k$ elements out of $n$ regarding the order, not allowing repetition, we can do this in $_{n}P_k=\frac{n!}{(n-k)!}$ ways. So e.g. if we have a competition where $7$ people take part, then the number of possibilities for the order of the top $3$ contestants is $_7P_3$.
Update this answer!

You can help us out by revising, improving and updating this answer.

Update this answer

After you claim an answer you’ll have 24 hours to send in a draft. An editor will review the submission and either publish your submission or provide feedback.