Dividendo
We shall find all natural numbers $n$ s.t.
$(1) \;\; (2n)! \equiv 0 \pmod{n! + 2}$..
By inspection we find that (1) for $n \leq 3$ is satisfies only if $n \in \{2,3\}$.
Assume $n \geq 4$ satisfies (1)
We shall find all natural numbers $n$ s.t.
$(1) \;\; (2n)! \equiv 0 \pmod{n! + 2}$..
By inspection we find that (1) for $n \leq 3$ is satisfies only if $n \in \{2,3\}$.
Assume $n \geq 4$ satisfies (1)