Probability of Occupying Adjacent Seats in a Random Arrangement

  • Thread starter Thread starter JOhnJDC
  • Start date Start date
  • Tags Tags
    Combinations
JOhnJDC
Messages
35
Reaction score
0

Homework Statement



If k people are seated in a random manner in a row containing n seats (n>k), what is the probability that the people will occupy k adjacent seats in the row?

I realize that there are n choose k sets of k seats to be occupied, and that there are n-k+1 sets of k adjacent seats. So the probability that I'm looking for is:

(n-k+1)/(n choose k)

What I don't understand is how the above probability simplifies to:

[(n-k+1)!k!]/n!

Can someone please explain? Thanks.

Homework Equations



(nk) = n choose k = n!/[(n-k)!k!]

The Attempt at a Solution



(n-k+1)/(n choose k) = [(n-k+1)(n-k)!k!]/n!

Not sure what to do from here.
 
Physics news on Phys.org
Look at (n-k+1)(n-k)!, can you simplify this product any?
 
Last edited:
Other than finding a quotient, I've never had to manipulate/simplify factorials. Thinking about this again, since the number (n-k+1) is 1 greater than the number (n-k), (n-k)! times (n-k+1) must equal (n-k+1)!.
 
Thread 'Use greedy vertex coloring algorithm to prove the upper bound of χ'
Hi! I am struggling with the exercise I mentioned under "Homework statement". The exercise is about a specific "greedy vertex coloring algorithm". One definition (which matches what my book uses) can be found here: https://people.cs.uchicago.edu/~laci/HANDOUTS/greedycoloring.pdf Here is also a screenshot of the relevant parts of the linked PDF, i.e. the def. of the algorithm: Sadly I don't have much to show as far as a solution attempt goes, as I am stuck on how to proceed. I thought...
Back
Top