$p \gt 2$ is a prime, then there are infinite primes $q$ such that $q$ is a quadratic residue modulo $p$.
With Dirichlet's theorem on arithmetic progressions, the problem is easy! How about Without the use of the theorem? Can one find an elementary proof?
p.s. there are several elementary ways(without Dirichlet) to show that there are infinite primes $q$ such that $q$ is a quadratic non-residue modulo $p$
Proof 1 The least $q>0$ quadratic non-residue modulo $p$ is a prime . Consider
$$a_0=q, a_1=q+p,a_2=q+pa_1,a_3=q+pa_1a_2,\dotsc, a_n=q+pa_1a_2\dotsb a_{n-1},\dotsc $$ then $(a_i,a_j)=1$
Proof 2 Only $\dfrac{p-1}2$ quadratic non-residues modulo $p$, so there is a integer $a$ such that $(\dfrac{a^2+1}p)=-1$.
In not, only finite $q_1,q_2,\dotsc, q_n$. then there exists $k\in\Bbb Z$ such that $kq_1q_2\dotsb q_n \equiv a \pmod p$. Consider
$$ (kq_1q_2\dotsb q_n)^2 +1$$