I'm having a lot of trouble with the following exercise:
Let $n\in \mathbb N$, prove that $35|n^{13}-n$.
This is the same as saying that $n^{13}\equiv n \pmod{35}$. The first thing that came to mind was Fermat's little theorem but that only allows us to conclude that $n^{13}\equiv n\pmod{13}$ and using Euler's theorem, we can only conclude that $n^{25}\equiv n\pmod {35}$ if $\gcd(n,35)=1$.
None of these theorems seem to be helping yet they look very similar to what the teacher wants us to prove.
How can this be done?