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

statistics problems

2007-08-30 04:34:26 · 9 answers · asked by BL S 1 in Science & Mathematics Mathematics

9 answers

That would be 11! = 39,916,800. The exclamation point here represents the factorial operation, where n! = n*(n-1)*(n-2)*...*3*2*1. n distinct items can always be ordered in n! ways.

2007-08-30 04:37:25 · answer #1 · answered by DavidK93 7 · 0 0

They can seat in 11! (factorial) ways .

11!=11*10*9*8*7*6*5*4*3*2*1

2007-08-30 04:41:19 · answer #2 · answered by Anonymous · 0 0

The first seat : can be any one of the 11 operators
The second : anyone of the remaining ten
The third : anyone of the remaining nine
...
We have the total number of arrangement is : 11! ( which is 1*2*3*4*...*10*11)

2007-08-30 04:39:52 · answer #3 · answered by Anonymous · 0 0

11! times!

2007-08-30 04:38:47 · answer #4 · answered by Anonymous · 0 0

11!

2007-08-30 04:39:47 · answer #5 · answered by Anonymous · 0 0

multiply 11 by itself 10 times to get the answer I got 25937424601 so a whole lot! over 25 billion

2007-08-30 04:42:26 · answer #6 · answered by Anonymous · 0 0

11! = 11x10x9x8x7x6x5x4x3x2x1 = 39,916,800

2007-08-30 04:40:01 · answer #7 · answered by noturbizniss 1 · 0 0

They can be seated 39,961,800 ways. (11!)

2007-08-30 04:40:29 · answer #8 · answered by Anonymous · 0 0

use permutations 39,916,800

2007-08-30 04:42:35 · answer #9 · answered by SP 2 · 0 0

fedest.com, questions and answers