I am reading some post in Suppose that $5\leq q\leq p$ are both prime. Prove that $24|(p^2-q^2)$.
and
Suppose that $p$ ≥ $q$ ≥ $5$ are both prime numbers. Prove that 24 divides ($p^2 − q^2$)
In some of their answer, they mention that some prime $p$ can be expressed as $6k\pm 1$ without proof.
For some few examples i see this, but how i can prove for large $p$?
5, 7, 11, 13, 17, 19, ...
can you give me some proof for this statement?