2000 SMT/Advanced Topics Problems/Problem 4

Revision as of 08:38, 24 July 2020 by Orca25 (talk | contribs) (Created page with "==Problem== Five positive integers from <math>1</math> to <math>15</math> are chosen without replacement. What is the probability that their sum is divisible by <math>3?</mat...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Problem

Five positive integers from $1$ to $15$ are chosen without replacement. What is the probability that their sum is divisible by $3?$


Solution

The possibilities for the numbers are:

   all five are divisible by $3$
   three are divisible by $3,$ one is $\equiv 1 \pmod 3$ and one is $\equiv 2\pmod 3$
   two are divisible by $3,$ and the other three are either $\equiv 1\pmod 3$ or $\equiv 2\pmod 3$
   one is divisible by $3,$ two are $\equiv 1\pmod 3$ and two are $\equiv 2\pmod 3$
   four are $\equiv 1\pmod 3$ and one is $\equiv 2\pmod 3$
   four are $\equiv 2\pmod 3$ and one is $\equiv 1\pmod 3$

This gives us $1001$ possible combinations out of $\binom{15}{5}$ or $3003$. So, the probability is $\frac{1001}{3003}=\mathbf{1}{3}.$




Credit

Problem and solution were taken from https://sumo.stanford.edu/old/smt/2000/