I encountered a number theory problem(I don't know much about number theory) when doing my research:
- I want to know whether or not there are infinitely many primes $p$ satisfying $\gcd\left(\dfrac{p-1}{6},6\right)=1$, such that $6$ is a cubic residue mod $p$, but $2$ and $3$ are not cubic residues mod $p$? If there are, can we give a expression of $p$?
The cleanest way to do this is to take primes given by integer $x,y$ in $$ 7 x^2 + 6 xy + 36 y^2, $$ allowing $x,y$ positive or negative as need be. After that, restrict from that list to $p \equiv 7, 31 \pmod {36}.$