2000 character limit reached
Cubes in finite fields and related permutations (2105.09822v1)
Published 20 May 2021 in math.NT
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.