# Divisors of factorials

Let $p$ be a prime number and $k$ a positive integer. Let $d$ be the smallest positive integer such that $p^k$ divides $d!$. It is true that $d$ is necessarily a multiple of $p$?

-
Moreover, $k \leq p \implies pk|d$. – barak manos Aug 28 '14 at 14:53

Suppose $d!$ is this number. Then $(d-1)!$ is not. Since $p^k$ does not divide $(d-1)!$ but it divides $d! = d \cdot (d-1)!$, then $p$ must divide $d$.

Hope that helps,

-

Yes. If $p$ does not divide $d$, then $(d-1)!$ would also be divisible by $p$ since it has the same number of prime factors $p$ as $d!$ has.

-

Yes. If it didn't then $d!$ would have the same power of $p$ in its factorisation as $(d-1)!$ has, thus $p^k | (d-1)!$ contradicting the minimality.

-