Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2402.10737

Triples and quadruples of consecutive squares or non-squares in a finite field

Stephen D. Cohen
View original source ↗Read source document ↗Export metadata ↓

Abstract

Let $\F$ be the finite field of odd prime power order $q$, We find explicit expressions for the number of triples $\{\al-1,\al,\al+1 \}$ of consecutive non-zero squares in $\F$ and similarly for the number of triples of consecutive non-square elements. A key ingredient is the evaluation of Jacobsthal sums over general finite fields by Katre and Rajwade. This extends results of Monzingo(1985) to non-prime fields. Curiously, the same machinery alows the evaluation of the number of consecutive quadruples $\{\al -1, \al,\al+1, \al +2\}$ of square and non-squares over $\F$, when $q$ is a power of 5.

Explore related subjects

math.NTmath.AC

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Stephen D. Cohen. 2025-08-06. Triples and quadruples of consecutive squares or non-squares in a finite field. https://arxiv.org/abs/2402.10737

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗