How to disprove that $$n! \mid \left(n! + \frac{n!}{2} + \dots + \frac{n!}{n} \right)$$ This should not be true, since it would imply that there is some $n$ such that the $n$-th partial sum of the harmonic series reaches an integer.
Here is what I tried:
Since $n > 2 $ (Otherwise this would me trivial), then: $$ 2 \mid n! \\ 2 \mid \frac{n!}{2} $$ So that $n > 4 $ (Note that $n$ can't be $4$). Then, by the same reasoning: $$ 4 \mid n! \\ 4 \mid \frac{n!}{4} $$ So that $n > 6 $ But then I get stuck here since $ 6 \mid \frac{n!}{6} $ doesn't necessaily make $n$ larger than 6.
Let $p$ be the largest prime less than $n$. Then $$ \sum_{i = 1}^n \frac{n!}{i} \equiv \frac{n!}{p} \not\equiv 0\mod p $$ Since $n! \equiv 0\mod p$, it cannot divide that sum.
EDIT: The comments tell me I should explain why $i = 2p$ doesn't appear in the sum. Bertrand's postulate says there is a prime $q$ with $p < q < 2p$. Since $p$ is the largest prime less than $n$, we must have $n < q < 2p$.