On consecutive primitive elements in a finite field

Bull. Lond. Math. Soc., 2015, vol. 47, pp. 418-426 For $q$ an odd prime power with $q>169$ we prove that there are always three consecutive primitive elements in the finite field $\mathbb{F}_{q}$. Indeed, there are precisely eleven values of $q \leq 169$ for which this is false. For $4\leq n \leq...

Full description

Saved in:
Bibliographic Details
Main Authors: Cohen, Stephen D, Silva, Tomás Oliveira e, Trudgian, Tim
Format: Journal Article
Language:English
Published: 22-10-2014
Subjects:
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Bull. Lond. Math. Soc., 2015, vol. 47, pp. 418-426 For $q$ an odd prime power with $q>169$ we prove that there are always three consecutive primitive elements in the finite field $\mathbb{F}_{q}$. Indeed, there are precisely eleven values of $q \leq 169$ for which this is false. For $4\leq n \leq 8$ we present conjectures on the size of $q_{0}(n)$ such that $q>q_{0}(n)$ guarantees the existence of $n$ consecutive primitive elements in $\mathbb{F}_{q}$, provided that $\mathbb{F}_{q}$ has characteristic at least~$n$. Finally, we improve the upper bound on $q_{0}(n)$ for all $n\geq 3$.
DOI:10.48550/arxiv.1410.6210