Search arXivSearch

arXiv · 2408.00353

Bounds on the $p$-adic valuation of the factorial, hyperfactorial and superfactorial

Abstract

In this article, we investigate the $p$-adic valuation $ν_p$ of quantities such as the factorial $n!$, the hyperfactorial $H(n)$ or the superfactorial $\mathrm{sf}(n)$. In particular, we obtain simple bounds (both upper and lower) for $ν_p$, using the Legendre-de Polignac formula. Other iterated quantities such as the Berezin function, are also considered. Beyond their recreational character, such quantities, often related to very large numbers, may find applications for cryptography purposes. Finally, lower and upper bounds for the $p$-adic valuation of Stirling numbers of the first kind and Catalan numbers are briefly discussed.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jean-Christophe Pain. 2024-08-01. Bounds on the $p$-adic valuation of the factorial, hyperfactorial and superfactorial. https://arxiv.org/abs/2408.00353

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