Difference between revisions of "2024 SSMO Accuracy Round Problems/Problem 3"

(Created page with "==Problem== Three distinct random integers <math>a</math>, <math>b</math>, and <math>c</math> are selected so that <math>1 \le a, b, c \le 10</math>. Let the probability that...")
 
 
Line 4: Line 4:
  
 
==Solution==
 
==Solution==
 +
Note that <math>1!,2!,\dots,10!</math> have residues <math>1,2,1,4,0,0,\dots</math> when taken modulo 5. We have 2 cases for residues modulo 5: either one is 0, one is 1, and one is 4, or they are all 0. For the first case, we have <math>2</math> ways to choose a <math>1</math>, 1 way to choose a <math>4,</math> <math>6</math> ways to choose a <math>0,</math> and <math>6</math> ways to permute them, giving <math>2\cdot6\cdot6 = 72</math> solutions. For the other case, we have <math>6\cdot5\cdot4 = 120</math> ways to choose the 3 multiples of 5. Thus, the total number of solutions is <math>120+72 = 192,</math> meaning the answer is <cmath>\frac{192}{10 \cdot 9 \cdot 8} = \frac{4}{15}\implies 4+15 = \boxed{19}.</cmath>
 +
 +
~SMO_Team

Latest revision as of 14:31, 10 September 2025

Problem

Three distinct random integers $a$, $b$, and $c$ are selected so that $1 \le a, b, c \le 10$. Let the probability that $5|a!+b!+c!$ be $\frac{m}{n}$, where $\gcd(m,n)=1$. Find $m+n$.

Solution

Note that $1!,2!,\dots,10!$ have residues $1,2,1,4,0,0,\dots$ when taken modulo 5. We have 2 cases for residues modulo 5: either one is 0, one is 1, and one is 4, or they are all 0. For the first case, we have $2$ ways to choose a $1$, 1 way to choose a $4,$ $6$ ways to choose a $0,$ and $6$ ways to permute them, giving $2\cdot6\cdot6 = 72$ solutions. For the other case, we have $6\cdot5\cdot4 = 120$ ways to choose the 3 multiples of 5. Thus, the total number of solutions is $120+72 = 192,$ meaning the answer is \[\frac{192}{10 \cdot 9 \cdot 8} = \frac{4}{15}\implies 4+15 = \boxed{19}.\]

~SMO_Team