Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2508.08996

Unconditional results for Artin-type problems over number fields

Pietro Sgobba
View original source ↗Read source document ↗Export metadata ↓

Abstract

Let $K$ be a number field and let $G$ be a finitely generated subgroup of $K^\times$. For all but finitely many primes $\mathfrak p$ of $K$, the reduction $(G \bmod \mathfrak p)$ generates a well-defined subgroup of the multiplicative group of the residue field at $\mathfrak p$, and we may consider its index. We study the primes of $K$ for which this index lies in a given set of positive integers $S$. In particular, we prove that under certain convergence conditions on series associated to $S$ this problem can be addressed without assuming the Generalized Riemann Hypothesis (GRH), and we provide asymptotic formulas for the corresponding prime-counting functions. Problems of this type are related to Artin's primitive root conjecture, which has been proven under the assumption of GRH (Hooley, 1967).

Explore related subjects

math.NT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Pietro Sgobba. 2025-08-12. Unconditional results for Artin-type problems over number fields. https://arxiv.org/abs/2508.08996

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↗