Solving for modular expression?

Question

I stuck somehow on repetition old math exercises...could someone explain the following expression:

$(n!-1)$ mod $ n $

Thanx

Answer 1

$n | n!$ so $n! \equiv 0 \pmod{n}$ and hence $(n! - 1) \equiv -1 \pmod{n}$.