# Prime problem, Fermats little theorem?

Show that for any prime p either $2^{p} - 1$ is prime or $q = 2^{p} - 1$ behaves like a prime with respect to the base 2 ie $2^{q-1}\equiv{1}$ (mod q)