Problem 6

If $n^p\equiv p\pmod q$, the cyclic-group criterion for $p$th powers gives $p^k\equiv1\pmod q$. But $p$ has order $p$ and $p\nmid k$, contradiction. Thus $q$ divides none of $n^p-p$.