Answer:
1. 120 ways
2. 720 ways
Step-by-step explanation:
When the order is important, we have a permutation.
When the order is not important, we have a combination.
Permutations formula:
The number of possible permutations of x elements from a set of n elements is given by the following formula:
[tex]P_{(n,x)} = \frac{n!}{(n-x)!}[/tex]
Combinations formula:
[tex]C_{n,x}[/tex] is the number of different combinations of x objects from a set of n elements, given by the following formula.
[tex]C_{n,x} = \frac{n!}{x!(n-x)!}[/tex]
1. If the jobs are all the same.
Same jobs means that the order is not important. So
3 from a set of 10.
[tex]C_{10,3} = \frac{10!}{3!(10-3)!} = 120[/tex]
120 ways
2. If the jobs are all different.
DIfferent jobs means that the order matters.
[tex]P_{(10,3)} = \frac{10!}{(10-3)!} = 720[/tex]
720 ways