Probability Question: Parzen's Modern Probability Theory, Ch.2 Ex.6.1

  • Thread starter Thread starter travis0868
  • Start date Start date
  • Tags Tags
    Probability
travis0868
Messages
8
Reaction score
0
This question is from Parzen (Modern Probability Theory), chapter 2, exercise 6.1

Homework Statement


Suppose that we have M urns, numbered 1 to M and M balls, numbered 1 to M. Let the balls be inserted randomly in the urns, with one ball in each urn. If a ball is put into the urn bearing the same number as the ball, a match is said to have occurred. Show that for j = 1,...,M the conditional probability of a match in the jth urn, given that there are m matches is m/M.

Homework Equations


Probability that there are exactly m matches in M urns is:
(1/m!)* \Sigma^{M-m}_{k=0}(-1)^k * (1/k!)

The Attempt at a Solution


The answer doesn't make sense. Suppose that j = M. The probability that there will be a match in the Mth urn given that there are M-1 matches is 1. Not (M-1)/M.
 
Physics news on Phys.org
I think m is the total number of matches. You may think of it as a referee looking into each urn, then reporting m matches, without disclosing which urns had matches.
 
Thanks a lot, EnumaElish!
 
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