Let $n$ be an integer greater than $1$. If none of $1!$, $2!$, $\cdots$, $n!$ has the same remainder when being divided by $n$, show that $n$ is a prime.
The solution for this problem is available for $0.99.
You can also purchase a pass for all available solutions for $99.