Theorem

If $p$ is a prime divisor of $b^{n}-1$ then either 1. $p|(b^{d}-1)$ for some $d|n$ or 2. $p\equiv 1\pmod{n}$ If $p>2$ and $n$ odd, then for 2, we have $p\equiv 1\pmod{2n}$.