Search arXivSearch

arXiv · 2412.02523

Density formulas for $p$-adically bounded primes for hypergeometric series with rational and quadratic irrational parameters

Abstract

We study densities of $p$-adically bounded primes for hypergeometric series in two cases: the case of generalized hypergeometric series with rational parameters, and the case of $_2F_1$ with parameters in a quadratic extension of the rational numbers. In the rational case we extend work from $_2F_1$ to $_nF_{n-1}$ for an exact formula giving the density of bounded primes for the series. The density is shown to be one exactly in accordance with the case of finite monodromy as classified by Beukers-Heckmann. In the quadratic irrational case, we obtain an unconditional lower bound on the density of bounded primes. Assuming the normality of the $p$-adic digits of quadratic irrationalities, this lower bound is shown to be an exact formula for the density of bounded primes. In the quadratic irrational case, there is a trivial upper bound of $1/2$ on the density of bounded primes. In the final section of the paper we discuss some results and computations on series that attain this bound. In particular, all such examples we have found are associated to imaginary quadratic fields, though we do not prove this is always the case.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Cameron Franc, Nathan Heisz, Hannah Nardone. 2024-12-03. Density formulas for $p$-adically bounded primes for hypergeometric series with rational and quadratic irrational parameters. https://arxiv.org/abs/2412.02523

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