SOLUTION: Can you please explain the answer to this problem: How many different ways can a visiting nurse visit 9 patients if she wants to visit them all in one day.

Algebra ->  Permutations -> SOLUTION: Can you please explain the answer to this problem: How many different ways can a visiting nurse visit 9 patients if she wants to visit them all in one day.      Log On


   



Question 1111258: Can you please explain the answer to this problem:
How many different ways can a visiting nurse visit 9 patients if she wants to visit them all in one day.

Answer by KMST(5328) About Me  (Show Source):
You can put this solution on YOUR website!
There are 9 patients' names in the nurse's to do list.
Let us call the patient at the top of the list patient #1,
let us call the next name in the list patient # 2, and so on.
The nurse could choose to see any of those 9 patients first.
That gives the nurse 9 different choices for the patient seen first,
but for each of those choices, there are 9-1=8 other patients to be seen.
So, after each of the 9 possible choices of first patient to be seen,
the nurse has 8 possible choices for the second patient to be seen.
That gives the nurse 9%2A8 different choices regarding first two patients to be seen.
For each of those cases, there will stll be 9-2=7 patients to be seen after the first two visited,
and, the nurse will have 7 choices for the third patient to be seen..
So far, there were 9%2A8%2A7 possible choices for the order to see the first 3 patients.
As the nurse keeps choosing who to see next, choices multiply.
By the time the nurse chooses one of two remaining patient to see next to last,
the nurse has made one of
9%2A8%2A7%2A6%2A5%2A4%2A3%2A2 choices.
After that, there is just one more patient, who will be seen last.
There are
ways/orders to see the 9 patients.
That is highlight%289%21=%22362%2C880%22%29 for the nurse to see all 9 patients in one day.