Probability of Occupying Adjacent Seats in a Random Arrangement

  • Thread starter Thread starter JOhnJDC
  • Start date Start date
  • Tags Tags
    Combinations
Click For Summary
SUMMARY

The probability of k people occupying adjacent seats in a row of n seats (where n > k) is calculated using the formula (n-k+1)/(n choose k). This simplifies to [(n-k+1)!k!]/n! through factorial manipulation. The key steps involve recognizing that (n choose k) is expressed as n!/[(n-k)!k!] and that (n-k+1)(n-k)! simplifies to (n-k+1)!. Understanding these factorial relationships is crucial for deriving the final probability expression.

PREREQUISITES
  • Understanding of combinatorial mathematics, specifically "n choose k" notation.
  • Familiarity with factorial notation and operations.
  • Basic probability theory concepts.
  • Knowledge of algebraic manipulation of expressions.
NEXT STEPS
  • Study combinatorial proofs and applications of "n choose k".
  • Learn about factorial simplifications and their properties.
  • Explore advanced probability topics, including conditional probability.
  • Review examples of seating arrangements and their probability calculations.
USEFUL FOR

Students in mathematics or statistics, educators teaching probability theory, and anyone interested in combinatorial problems and their applications in real-world scenarios.

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)!.
 

Similar threads

  • · Replies 6 ·
Replies
6
Views
1K
Replies
5
Views
2K
  • · Replies 20 ·
Replies
20
Views
2K
  • · Replies 15 ·
Replies
15
Views
2K
  • · Replies 29 ·
Replies
29
Views
5K
  • · Replies 3 ·
Replies
3
Views
1K
Replies
1
Views
2K
Replies
1
Views
2K
  • · Replies 6 ·
Replies
6
Views
3K
  • · Replies 5 ·
Replies
5
Views
2K