Dec 7th 2010, 22:59:02
First of all, there wont be a answer like the one in your example (unless we make assumtions like you did in your example), since we have two unknowns.
Ns = Number of seats and Np = Number of passengers
so lets start with the basic, we can, to "dumb" it down abit say that the probability = amount of wanted outcomes/amount of possible outcomes. This is what you showed in your example.
Even if this is basic, we can strech it out to be valid also for more complex contexts.
As for your question, i belive you should turn it around, and calculate how many unwanted outcomes there are.
It would be far to easy to calculate the probability for the following : What is the probability that the last passengers seat ist taken when said person enters the plane, and just assume that the other Np could be assigned randomly like this : n x (n-1) x (n-2) x ... 3 x 2 x 1, but since its not random (they will try to sit in their seat first)
We have to move away from the domain of Combinatorics and into probability.
We know that the passengers can be seated in n! different ways.
This is only true if Ns=Np given by n! / (n-k)! = nPk where P = Permutation , in other words, this assumes the plane is fully booked, your problem does not mention this, so i take we have to make this assumtion to not over complicate the task at hand.
so we have to introduce a new unknown Nr , this is a passenger that sits in her/his designated seat.
n! / n1! x n2! x n3! x ... x nr!
Dont think its entirely correct , but this is my try !
Praetor - disqualified from the human race for being three laps ahead in the second round.