Proof that $ p^2 \equiv 1 \mod{30} \vee p^2 \equiv 19 \mod{30} $ for $p>5$ Proof that $$ p^2 \equiv 1 \mod{30} \vee p^2 \equiv 19 \mod{30} $$
for $p>5$ and $p$ is prime.
$\newcommand{\Mod}[1]{\ (\mathrm{mod}\ #1)}$
My try
Let show that
$$p^2 - 1 \equiv 0 \Mod{30} \vee p^2 - 1\equiv 18 \Mod{30}$$
Let check $$p^2 -1 = (p-1)(p+1) $$
We know that (for example from here) that this is dividable by $2$ and by $3$ so by $6$
Let consider $5$ cases:
$$\exists_k p=5k \rightarrow \mbox{false because p is prime}$$
$$\exists_k p=5k+1 \rightarrow p^2 - 1 = 5k(5k+2) \rightarrow \mbox{ dividable by 6 and by 5 so we have rest 0}$$
$$\exists_k p=5k+2 \rightarrow p^2 - 1 = (5k+1)(5k+3) \rightarrow \mbox{ ??? }$$
$$\exists_k p=5k+3 \rightarrow p^2 - 1 = (5k+2)(5k+4) \rightarrow \mbox{ ??? }$$
$$\exists_k p=5k+4 \rightarrow p^2 - 1 = (5k+3)(5k+5) \rightarrow \mbox{ dividable by 6 and by 5 so we have rest 0}$$
I have stucked with $???$ cases...

$p^2-1$ is divisible by $2$ and $3$ and leaves remainder $0$ or $3$ when divided by $5$ 
[since if $p\not\equiv0\pmod{5}$ then $p^2\equiv1$ or $4\pmod5$].
In the former case, $p^2-1\equiv0\pmod{30}$; in the latter, $p^2-1\equiv18\pmod {30}.$
