Is 3 ever a seventh power mod a prime $p$ if $p\equiv 1 (7)$

183 Views Asked by At

I had a question asking when is 3 a seventh power modulo a prime $p$ if $p=1(7)$. However, I tried to find just one example using mathematica but I went up to primes in the thousands and I still couldn't find an example, so I began thinking this was a trick question.

We were learning about quadratic reciprocity, but I wasn't sure how to extend what we learned about quadratic powers to seventh powers.

3

There are 3 best solutions below

4
On BEST ANSWER

$3$ is not a seventh power $\pmod{29}$ since: $$ 3^{\frac{29-1}{7}}\equiv 81\equiv -6\not\equiv 1 \pmod{29}.$$ Another way to state the same is that the only seventh powers in $\mathbb{Z}_{/29\mathbb{Z}}^*$ are $\pm 1$ and $\pm 12$.

4
On

Based on what Jack and countinghaus said, I started looking for primes such that $3^{\frac{p-1}{7}}\equiv 1 (p)$ and found actually that $p=757$ works!

Others that work include: 1583, 1597, 2843, 2927.

However, I'm not sure if this will always work.

I know based on what they said, if $3$ is going to be a seventh root then $3^{\frac{p-1}{7}}\equiv 1 (p)$ must be true, but could someone tell me if the converse is true?

0
On

There is much classical work on this and related questions. You can find pointers to the literature from the introduction of Stanislav Jakubec's $ $ Criterion for 3 to be eleventh power, $ $ Acta Mathematica et Informatica Universitatis Ostraviensis (1995), Vol. 03, 1, excerpted below enter image description here enter image description here enter image description here enter image description here