Solving the Matching Hats Prob: N Men, No Hats Selected & k Hats Selected

  • Context: Undergrad 
  • Thread starter Thread starter eku_girl83
  • Start date Start date
Click For Summary

Discussion Overview

The discussion revolves around a probability problem involving N men at a party who randomly select hats from a mixed pile. Participants explore the probability of none of the men selecting their own hat and the probability of exactly k men selecting their own hats. The scope includes mathematical reasoning and combinatorial principles.

Discussion Character

  • Exploratory, Mathematical reasoning

Main Points Raised

  • One participant suggests starting with small values of N (1, 2, 3) to identify patterns in the problem.
  • Another participant calculates the probability for N = 4, proposing a formula based on sequential probabilities.
  • A different participant introduces the inclusion-exclusion principle as a method to calculate the probability of none of the men selecting their own hat.

Areas of Agreement / Disagreement

Participants present different approaches and methods to tackle the problem, but there is no consensus on a single solution or method. The discussion remains unresolved with multiple viewpoints on how to proceed.

Contextual Notes

Some participants express a preference for numerical examples over abstract variables, which may influence their understanding of the problem. The application of the inclusion-exclusion principle is mentioned but not fully explored.

Who May Find This Useful

This discussion may be useful for individuals interested in probability theory, combinatorial mathematics, or those seeking to understand the application of the inclusion-exclusion principle in problem-solving.

eku_girl83
Messages
89
Reaction score
0
Suppose that each of N men at a party throws his hat into the center of the room. The hats are first mixed up, and then each man randomly selects a hat. What is the probability that
a)none of the men selects his own hat?
b) exactly k of the men select their own hats?

It's difficult for me to think of this problem in the abstract...I always work better with actual numbers as opposed to variables.

Any help explaining this would be appreciated!
Thanks!
 
Physics news on Phys.org
If you like numbers better, try it for N = 1, and then N = 2, and then N = 3, etc., until you see a pattern.

cookiemonster
 
suppose there are four men, the probability none would select their own hat would
be
[tex]\frac34 * \frac23 *\frac12[/tex]

this problem will be speed up with factorials where
4!= 4*3*2*1
3!= 3*2*1
etc
 
Have you done the inclusion exclusion principle? If so then P(no hats correct) = 1-P(at least one hat correct) and the second of those is easy to work out if you know Inc-exc
 

Similar threads

Replies
1
Views
2K
  • · Replies 2 ·
Replies
2
Views
4K
  • · Replies 4 ·
Replies
4
Views
4K
  • · Replies 1 ·
Replies
1
Views
4K
  • · Replies 13 ·
Replies
13
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 6 ·
Replies
6
Views
3K
  • · Replies 67 ·
3
Replies
67
Views
17K
  • · Replies 1 ·
Replies
1
Views
3K