MODBasic NumberTheoryBasic Basic

Problem - 4196
Let $n > 4$ be a composite number. Show that $(n-1)!\equiv 0\pmod{n}$.

The solution for this problem is available for $0.99. You can also purchase a pass for all available solutions for $99.

report an error