Precalculus: Concepts Through Functions, A Unit Circle Approach to Trigonometry (3rd Edition)

Published by Pearson
ISBN 10: 0-32193-104-1
ISBN 13: 978-0-32193-104-7

Chapter 12 - Counting and Probability - Section 12.2 Permutations and Combinations - 12.2 Assess Your Understanding - Page 875: 37

Answer

$60$

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. The order matters here when choosing the codes, thus we have to use permutations. Thus $_{5}P_{3}=\frac{5!}{(5-3)!}=5\cdot4\cdot3=60$
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.