6

It's equivalent to compute the primes $p$ such that 2 is not a cubic residue mod $p$. Let $p$ be a prime, now the the map $ \rho: \mathbb{F}_p^\times \rightarrow \mathbb{F}_p^\times $ given by $\rho(n)=n^3$, is not a bijection if and only if it has non-trivial kernel, this only happens if $x^2+x+1=0$ has a solution mod $p$. But this is possible only if $ \left( \frac{-3}{p} \right) =1 \Leftrightarrow p= 1 $ mod $3$.

I started computing the primes under $300$ in which $2$ is not a cubic residue and these are: $$7, 13, 19, 37, 61, 67, 73, 79, 97, 103, 139, 151, 163, 181, 193, 199, 211, 241, 271.$$ Approximately $2/3$ of the primes have the desired property, hence I was thinking we needed to use congruences mod $3^n$, for some $n$, but I'm stuck. Does anyone know how to find the answer?

Alessandro
  • 1,484

1 Answers1

4

The primes that are $1 \pmod 3$ for which $2$ is a cubic residue are all of form $$ p= x^2 + 27 y^2 $$ with integers $x,y$

The primes that are $1 \pmod 3$ for which $2$ is not a cubic residue are all of form $$ q= 4u^2 + 2uv + 7 v^2 $$ with integers $u,v,$ and we allow them negative or positive as needed

Will Jagy
  • 146,052