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 769: 37

Answer

See below.

Work Step by Step

The number of ways to select the first performer: $5$ (any of them can be apart from the one who wants to be the last) The number of ways to select the second performer: $4$ (any of them can be apart from the one who wants to be the last and the already selected first singer) The number of ways to select the third performer: $3$ (any of them can be apart from the one who wants to be the last and the already selected first and second singer) The number of ways to select the fourth performer: $2$ (any of them can be apart from the one who wants to be the last and the already selected first and second and third singer) Then the fifth performer is the one who is not the first, second, third, fourth or last. The last singer is fixed. Number of different ways to schedule the appearances:$5\cdot 4\cdot3\cdot2\cdot1\cdot1=24$
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.