Building on the same context of this question
Is it possible to enforce constraints on the properties of the generated prime? For example, I'm trying to find a prime $p$ in the range specified in the question on top with the property that $5 \in QR_p$ which mean that there exists a number $x$ such that $x^2 \equiv 5\pmod p$