Search arXivSearch

arXiv · 2604.21429

Consecutive non-square non-primitive pairs in a finite field

Abstract

Let $q$ be an odd prime power and write \[ θ_q := \frac{ϕ(q-1)}{q-1}. \] If $θ_q < \tfrac{1}{3}$, or if $θ_q = \tfrac{1}{3}$ and $q \notin \{7,13,19,25,37\}$, then the finite field $\F$ contains a pair of consecutive elements that are both non-square and non-primitive. This extends a result of Jarso and Trudgian for prime fields $\Fp$, where the same conclusion was obtained under the stronger condition $θ_p \le \tfrac{1}{4}$. More generally, let $\ell$ be the least odd prime divisor of $q-1$. If $θ_q \le \tfrac{1}{3}$, then $\F$ contains a pair of consecutive elements that are non-squares and $\ell$th powers, with the sole exceptions $q \in \{7,13,19,25,37,43\}$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Stephen D. Cohen. 2026-04-23. Consecutive non-square non-primitive pairs in a finite field. https://arxiv.org/abs/2604.21429

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Asymptotic density of k-almost primes

Landau's well known asymptotic formula $$N_k(x):=\ \mid\{n\leq x : Ω(n)=k\}\mid \ \sim \left( \frac{x}{\log x} \right) \frac{(\log\log x)^{k-1}}{(k - 1)!}\ \ (x \rightarrow \infty),$$ which also holds for $$π_k(x):=\ \mid\{n\leq x : ω(n)=k\}\mid,$$ is known to be fairly poor for $k > 1$, and when $k$ is allowed to tend to infinity with $x$, the study of $N_k(x)$ and $π_k(x)$ becomes very technical [1, Chapter II.6, $§$ 6.1, p.200]. I hope to show that the method described below provides not only a more accurate approach, but rather increases in its asymptotic accuracy as $k$ tends to infinity.

math.NT

Transcendence Meets Normality: Construction of Transcendentally Normal Numbers

In this work, we study real numbers $x$ for which $p(x)$ is (absolutely) normal for every non-constant integer-valued polynomial $p$. We call such numbers transcendentally normal. We prove that almost every real number is transcendentally normal and provide an explicit construction of such a number, based on Sierpinski's covering method and novel ideas involving the so-called stretch function. In the next step, we transform this construction into an algorithm that computes the digits of a t-normal number recursively in all integer bases. Moreover, we extend our covering approach to construct and compute LIL-normal numbers whose discrepancies are of the order predicted by the law of the iterated logarithm. We also take the opportunity to discuss several interesting open problems.

math.NT