easy   Probability

Multisocks

A release-checked easy problem for training Bayes' Theorem, Conditional Probability.

Question

Suppose you have $k \geq 1$ drawers with $r \geq 1$ distinct colors of socks. In drawer $i$, there are $n_{ij}$ socks of color $j$, where $1 \leq i \leq k$ and $1 \leq j \leq r$. One drawer is selected uniformly at random, and a sock from that drawer is selected uniformly at random. The sock is of color $1 \leq j \leq r$. Find the probability that you selected from drawer $i$. Solve this when $k = 3, r = 3, i = 2, j = 2$ and $n_{ij} = i+j$

Practice focus

This Probability problem is tagged Bayes' Theorem, Conditional Probability. State the random variables and conditioning information explicitly, then check the result against boundary cases before opening hints or a solution.

Explore related collections

Reviewed questions in this area

easyBaby BoyReviewed

Probability · SIG, DE Shaw

easyBad BagelReviewed

Probability · SIG, Jane Street