What Is the Correct Probability Calculation for Sam and Peter's Lineup?

  • Thread starter Thread starter WolfOfTheSteps
  • Start date Start date
  • Tags Tags
    Probability
Click For Summary

Homework Help Overview

The problem involves calculating the probability that exactly k men stand between two specific individuals, Sam and Peter, who are part of a larger group of n men arranged in a line. The discussion centers around the correct interpretation of permutations and combinations in this context.

Discussion Character

  • Exploratory, Conceptual clarification, Mathematical reasoning

Approaches and Questions Raised

  • Participants discuss the initial attempts to derive a probability formula, with one poster expressing confusion over their empirical observations versus the book's formula. Questions arise regarding the distinction between permutations and combinations in the context of arranging individuals in a line.

Discussion Status

The discussion is active, with participants providing insights into the nature of permutations versus combinations. Some guidance has been offered regarding the correct approach to counting arrangements, but there is still a sense of exploration as participants work through the complexities of the problem.

Contextual Notes

There is an indication of frustration due to the perceived complexity of combinatorial problems, and one participant mentions having a background in higher-level mathematics, which highlights the unique challenges posed by this topic.

WolfOfTheSteps
Messages
134
Reaction score
0

Homework Statement



If Sam and Peter are among n men who are arranged at random in a line, what is the probability that exactly k men stand between them?"

Homework Equations



Not sure.

The Attempt at a Solution



This is driving me insane. I listed out the possibilities for n = 3, and it looked to me like Peter and Sam could surround n men

2(n-k-1)

ways. Since there are n! possible lines, I said:

p = 2(n-k-1)/n!

But the book says

p = 2(n-k-1)/n(n-1)

The frustrating thing is that our answers are equal for n=3, but obviously not for higher values of n. I started trying to do it concretely for n=4, but there were so many possibilities that I got too confused.

It's just killing me, because I know the formula I came up with for n=3 was just a guess based on my empirical observation of the outcomes. I don't know how to do this problem "theoretically."

What am I doing wrong?

Thanks.
 
Physics news on Phys.org
n! is the number of permutations, but you need to look at the combinations.
 
EnumaElish said:
n! is the number of permutations, but you need to look at the combinations.

Well, in a line doesn't the ordering matter? So wouldn't it be permutations?

I mean, if the total number of possible lines were n choose n, their would only be 1 possible line!
 
Yes, it's permutations you want. But your 2n(n-k-1) is the number of ways Sam and Peter can stand. There are (n-2) other men that you have to put in line with Sam and Peter before you can divide by n!.
 
  • Haha
Likes   Reactions: WMDhamnekar
Dick said:
Yes, it's permutations you want. But your 2n(n-k-1) is the number of ways Sam and Peter can stand. There are (n-2) other men that you have to put in line with Sam and Peter before you can divide by n!.

Thank you! I finally get it.

Wow, combinatorics is a brain trip. I've taken high level differential equations, geometry, and all kinds of signals stuff in EE, but these counting problems crack my skull like nothing else! They are so deceptive.
 

Similar threads

Replies
2
Views
1K
Replies
1
Views
1K
  • · Replies 22 ·
Replies
22
Views
2K
  • · Replies 7 ·
Replies
7
Views
2K
Replies
3
Views
1K
Replies
5
Views
4K
  • · Replies 9 ·
Replies
9
Views
1K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 1 ·
Replies
1
Views
1K
Replies
1
Views
2K