Search arXivSearch

arXiv · 2508.08472

Wieferich primes in number fields and the conjectures of Ankeny--Artin--Chowla and Mordell

Abstract

For a prime $p\equiv 1 \,(\bmod{4})$, let \[ \varepsilon = \frac{1}{2}\left( t + u\sqrt{p}\right) \] be the fundamental unit of the real quadratic field $\mathbb{Q}(\sqrt{p})$. In 1951, N. Ankeny, E. Artin, and S. Chowla asked whether $p$ can divide $u$. They suggested that this can never happen and this has since been called the Ankeny--Artin--Chowla (AAC) conjecture. We show that if $\mathfrak{p}$ is the prime above $p$ in $\mathbb{Q}(\sqrt{p})$, then the AAC conjecture is false if and only if \[ \varepsilon^{p-1} \equiv 1\, (\bmod{\mathfrak{p}^2}). \] Thus, the AAC conjecture is related to the existence of number field analogues of Wieferich primes. Therefore, in the second part of this paper, we investigate the infinitude of Wieferich primes in number fields. Subject to Masser's $abc$-conjecture for number fields, we prove that for any fixed $α\in \mathcal{O}_K\setminus\{0\}$ that is not a root of unity, there are infinitely many primes ideals $\mathfrak{p}\subseteq \mathcal{O}_K$ for which \[ α^{N(\mathfrak{p})-1} \not\equiv 1\, (\bmod{\mathfrak{p}^2}). \] Additionally, we show under the weaker assumption that there are finitely many base-$α$ super-Wieferich primes, and that there are infinitely many base-$α$ non-Wieferich primes. In both cases, we obtain the lower bound \[ \#\left\{\text{prime ideals } \mathfrak{p} : N(\mathfrak{p})\leq x \text{ and } α^{N(\mathfrak{p})-1}\not\equiv 1 \,(\bmod{\mathfrak{p}^2})\right\} \gg_{K, α, \varepsilon} \frac{\log x}{\log\log x} \] as $x\to \infty$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Nic Fellini, M. Ram Murty. 2026-02-11. Wieferich primes in number fields and the conjectures of Ankeny--Artin--Chowla and Mordell. https://arxiv.org/abs/2508.08472

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