Respuesta :
Given set S = {A, B, C, D, E, F, G, H}
There are 8 elements in set S and we are to choose 3 letters at random, the number of ways to choose such is x. It is simply similar to choosing 5 letters at random, which is also equal to x. Since order doesn't matter, n! / (n-m)! where n = 8 and m = 3, which is 336 ways.
There are 8 elements in set S and we are to choose 3 letters at random, the number of ways to choose such is x. It is simply similar to choosing 5 letters at random, which is also equal to x. Since order doesn't matter, n! / (n-m)! where n = 8 and m = 3, which is 336 ways.
The number of ways to choose 5 letters from S without replacement