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 - Chapter Test - Page 889: 10

Answer

$56$

Work Step by Step

If we want to choose $k$ elements out of $n$ regarding the order and not allowing repetition, we can do this with permutations. The permutation formula is: $P(n,k)=\frac{n!}{(n-k)!}$ ways Here, the order matters and so we use permutations: $\require{cancel}P(8,2)=\frac{8!}{(8-2)!}=\frac{8\cdot7\cdot6!}{6!}=\frac{8\cdot7\cdot\cancel{6!}}{\cancel{6!}}=8\cdot7=56$
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.