[Math] Five people get on the elevator that stops at five floors. In how many ways they can get off

combinatorics

Five people get on the elevator that stops at five floors. In how many ways they can get off? For example, one person gets off at the 1st floor, two will get off at the third, and the remaining two at the fifth floor. In how many ways they can get off at different floors? Now, consider that people in elevator have names, say A,B,C,D and E., assuming that, for example, the case A on the 1st floor is different from the case B on the 1st floor. Answer the previous questions with this assumption.

I was told that there are 4 questions, but I'm not really sure about it.

  1. People don't have names and get off
  2. People don't have names and get off at different floors
  3. People have names and get off
  4. People have names and get off at different floors.

Do the names matter?

I think I can answer one question out of 4 – the number of all outcomes should be $5^5=3125$. I am confused about the rest though

Best Answer

  1. This has been answered in other answers: ${9\choose4}$.

  2. Since there are $5$ people and $5$ floors there is just $1$ way for them to get off at different floors: $1$ per floor.

  3. You already found $5^5=3125$.

  4. At each floor exactly one of $A$, $\ldots$, $E$ gets off. This can be done in $5\cdot4\cdot3\cdot2=5!=120$ ways.