Papers
Topics
Authors
Recent
Search
2000 character limit reached

Cubes in finite fields and related permutations

Published 20 May 2021 in math.NT | (2105.09822v1)

Abstract: Let $p=3n+1$ be a prime with $n\in\mathbb{N}={0,1,\cdots}$, and let $g\in\mathbb{Z}$ be a primitive root modulo $p$. Let $0<a_1<\cdots<a_n<p$ be all the cubic residues modulo $p$ in the interval $(0,p)$. Then clearly the sequence $$a_1\ {\rm mod}\ p,\ a_2\ {\rm mod}\ p,\cdots, a_n\ {\rm mod}\ p$$ is a permutation $s_p(g)$ of the sequence $$g3\ {\rm mod}\ p,\ g6\ {\rm mod}\ p,\cdots, g{3n}\ {\rm mod}\ p.$$ In this paper, we shall determine the sign of this permutation.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (2)

Collections

Sign up for free to add this paper to one or more collections.