Question

A COMPUTER OPERATOR MUST SELECT FOUR JOBS AMOUNG 10 AVAILABLE JOB WAITING TO BE COMPLETED. HOW MANY DIFFERENT ARRANGMENTS CAN BE MADE?

Answer 1

Step-by-step explanation

This is a problem based on permutations. We must select four jobs among ten jobs and see how many arrangments can be made.

The formula for the number of permutations is:

`P(n,r)=(n!)/((n-r)!).`

Where:

• n = total number of jobs = 10,

,

• r = number of jobs to be selected = 4.

Replacing these data in the formula above, we get:

`P(10,4)=(10!)/((10-4)!)=(10!)/(6!)=(10\cdot9\cdot8\cdot7\cdot6!)/(6!)=10\cdot9\cdot8\cdot7=5040.`Answer

5040