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 Review - Review Exercises - Page 888: 14


$3024$ ways

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: $_{n}P_k=\frac{n!}{(n-k)!}$ ways. In our case, we wish to seat 4 people into 9 seats. Since order matters, we use permutations: $_{9}P_{4}=\frac{9!}{(9-4)!}=\frac{9!}{5!}=\frac{9*8*7*6*5!}{5!}=9\cdot8\cdot7\cdot6=3024$
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.