Primes congruent to five modulo eight from odd squares plus four (source code)

= Primes congruent to five modulo eight from odd squares plus four

There are infinitely many <prime numbers> congruent to five modulo eight. Suppose instead that they form a finite list $q_1,\ldots,q_r$, and put $m=q_1\cdots q_r$, with $m=1$ if the list is empty. Then $m$ is an <odd number> and
$$
N=m^2+4\equiv5\pmod8.
$$
For every <prime factor> $\ell$ of $N$, the <integer> $m$ is nonzero modulo $\ell$ and $(m/2)^2\equiv-1\pmod\ell$. Thus a <square root of minus one modulo a prime> exists for $\ell$, which forces $\ell\equiv1\pmod4$. All <prime factors> are therefore one or five modulo eight. Their <product> is five modulo eight, so at least one <prime factor> is five modulo eight. Yet none of the $q_i$ divides $N$, since $N\equiv4\pmod{q_i}$. This contradicts completeness of the list.