2025 SSMO Team Round Problems/Problem 7
Problem
Let
be the largest integer such that
is divisible by
. The value of
can be written in the form
where
and
are positive integers and
is maximized. Find
.
Solution
As usual, for a prime
and a positive integer
, let
denote the exponent of
in the prime factorization of
. First, we find the value of
. Note that
and
. Since
, we have
. Using an analogous approach, we find that
.
Recall that
. Therefore,
\begin{align*}
n &= \min\{\lfloor \tfrac{10\cdot 20!}{4} \rfloor, \lfloor \tfrac{6\cdot 20!}{2} \rfloor\} \\
&= \min\{50\cdot 19!, 3\cdot 20!\} \\
&= 50\cdot 19!.
\end{align*}
Since
does not divide
, we cannot express
as the product of a positive integer with a factorial greater than
. The answer is
.
~Sedro