-- The first place can be any one of 20 students. For each of these, -- the second place can be any one of the remaining 19 students. For each of these, -- the third place can be any one of the remaining 18 students. For each of these, -- the fourth place can be any one of the remaining 17 students. So the four places can be assigned in any one of (20 x 19 x 18 x 17) = 116,280 ways.
5! (5 factorial), which is 1 x 2 x 3 x 4 x 5.
Well, honey, to select 5 students from a class of 23, you're looking at a good old-fashioned combination problem. So, the number of ways a teacher can select 5 students from a class of 23 is 23 choose 5, which equals 3,359 ways. So, get those students ready to shine on that bulletin board!
36 x 35/2 ie 630
There are 30 ways of selecting the first student leaving 29 ways to select the second for a total of 30 X 29 = 870 ways
7
20*19*18*17*16 = 1860480 ways.
There are 5040 ways.
53,130 ways.
6,375,600
There are 11880 ways.
They can be selected in 756 ways.
4*3*2*1 = 24 ways.
5! (5 factorial), which is 1 x 2 x 3 x 4 x 5.
7
Well, honey, to select 5 students from a class of 23, you're looking at a good old-fashioned combination problem. So, the number of ways a teacher can select 5 students from a class of 23 is 23 choose 5, which equals 3,359 ways. So, get those students ready to shine on that bulletin board!
27!
333