2000 character limit reached
Primitive Element Pairs with One Prescribed Trace over a Finite Field (1709.05540v2)
Published 16 Sep 2017 in math.NT and math.RA
Abstract: In this article, we establish a sufficient condition for the existence of a primitive element $\alpha \in {\mathbb{F}{qn}}$ such that the element $\alpha+\alpha{-1}$ is also a primitive element of ${\mathbb{F}{qn}},$ and $Tr_{\mathbb{F}{qn}|\mathbb{F}{q}}(\alpha)=a$ for any prescribed $a \in \mathbb{F}q$, where $q=pk$ for some prime $p$ and positive integer $k$. We prove that every finite field $\mathbb{F}{qn}~ (n \geq5),$ contains such primitive elements except for finitely many values of $q$ and $n$. Indeed, by computation, we conclude that there are no actual exceptional pairs $(q,n)$ for $n\geq5.$
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.