English Deutsch Français Italiano Español Português 繁體中文 Bahasa Indonesia Tiếng Việt ภาษาไทย
All categories

How do you do this type of problem?

Five singers are to perfrom at a tanelt show. One insists on being the last performer. If that is so, how many different ways are you able to schedule the appearances?

What is this? How do you solve it?

2007-10-29 14:34:10 · 1 answers · asked by yellowducks 1 in Science & Mathematics Mathematics

*perform at a talent

2007-10-29 14:34:28 · update #1

1 answers

It's simply a matter of arranging the other/first four singers.

All permutations of the four are acceptable, so the answer is just 4!=24.

2007-10-29 20:34:41 · answer #1 · answered by Curt Monash 7 · 0 0

fedest.com, questions and answers