English
Related papers

Related papers: On the $p$-adic valuation of a hyperfactorial

200 papers

For $k\geqslant 1$, denote by $p_k(n)$ the number of partitions of an integer $n$ into $k$-th powers. In this note, we apply the saddle-point method to provide a new proof for the well-known asymptotic expansion of $p_k(n)$. This approach…

Number Theory · Mathematics 2019-10-08 Gérald Tenenbaum , Jie Wu , Yali Li

We introduce a rigorous arithmetic--spectral construction associating planar geometric objects with additive prime factor statistics. Let $\mathrm{sopfr}(n)$ denote the sum of prime factors of $n$, counted with multiplicity, and define the…

General Mathematics · Mathematics 2026-02-17 Dimitris Vartziotis

The main result of this text is a generalization of Perrin-Riou's p-adic Gross-Zagier formula to the case of Shimura curves over totally real fields. Let $F$ be a totally real field. Let $f$ be a Hilbert modular form over $F$ of parallel…

Number Theory · Mathematics 2016-01-27 Li Ma

Let $\tau$ denote the Ramanujan tau function. One is interested in possible prime values of $\tau$ function. Since $\tau$ is multiplicative and $\tau(n)$ is odd if and only if $n$ is an odd square, we only need to consider $\tau(p^{2n})$…

Number Theory · Mathematics 2024-02-14 Sanoli Gun , Sunil L Naik

We generalize results on the $p$-adic valuations of $S(n,k)$, the Stirling number of the second kind and $s(n,k)$ the Stirling number of the first kind. We have several new estimates for these valuations, along with criteria for when the…

Number Theory · Mathematics 2021-11-18 Arnold Adelberg , Tamas Lengyel

The $T$-adic exponential sum associated to a Laurent polynomial in one variable is studied. An explicit arithmetic polygon is proved to be the generic Newton polygon of the $C$-function of the T-adic exponential sum. It gives the generic…

Number Theory · Mathematics 2009-11-03 Chunlei Liu , Wenxin Liu , Chuanze Niu

By using the Poisson formula for resultants and the variants of chip-firing game on graphs, we provide a combinatorial method for computing a class of of resultants, i.e. the characteristic polynomials of the adjacency tensors of starlike…

Combinatorics · Mathematics 2021-08-31 Yan-Hong Bao , Yi-Zheng Fan , Yi Wang , Ming Zhu

The $p$-adic logarithm appears in many places in number theory. Hence having a good description of the image of the $p$-adic logarithm could be useful, and in particular, to figure out the image of $1 + \mathfrak{m}_K$, where $K$ is an…

Number Theory · Mathematics 2025-08-05 Mabud Ali Sarkar , Absos Ali Shaikh

We study the roots of a random polynomial over the field of p-adic numbers. For a random monic polynomial with coefficients in $\mathbb{Z}_p$, we obtain an asymptotic formula for the factorial moments of the number of roots of this…

Number Theory · Mathematics 2022-04-08 Roy Shmueli

During his lifetime, Ramanujan provided many formulae relating binomial sums to special values of the Gamma function. Based on numerical computations, Van Hamme recently conjectured $p$-adic analogues to such formulae. Using a combination…

Number Theory · Mathematics 2021-02-03 Dermot McCarthy , Robert Osburn

Let $D$ be an open disk of radius $\le 1$ in $\mathbb C$, and let $(\epsilon_n)$ be a sequence of $\pm 1$. We prove that for every analytic function $f: D \to \mathbb C$ without zeros in $D$, there exists a unique sequence $(\alpha_n)$ of…

Number Theory · Mathematics 2012-04-05 Marcin Mazur , Bogdan V. Petrenko

We extend a result by Ikeda and Suriajaya (2025) to find the asymptotic behaviour of the average number of representations of an integer $n$, over multiples of a fixed $q\ge 2$, as a sum of two prime $k$-th powers, for $k\ge 2$.

Number Theory · Mathematics 2026-03-26 Alessandra Migliaccio , Alessandro Zaccagnini

Denote by $p(k)$ the limit, as $n \rightarrow \infty$, of the probability that a random permutation on a set of size $n$ has an invariant set of size $k$. We give an asymptotic formula for $p(k)$, showing that it is asymptotically…

Combinatorics · Mathematics 2026-05-01 Ben Green , Mehtaab Sawhney

We attach to normalized (non-vanishing) arithmetic functions $g$ and $h$ recursively defined polynomials. Let $P_0^{g,h}(x):=1$. Then \begin{equation} P_n^{g,h}(x) := \frac{x}{h(n)} \sum_{k=1}^{n} g(k) \, P_{n-k}^{g,h}(x). \end{equation}…

Number Theory · Mathematics 2020-11-23 Bernhard Heim , Markus Neuhauser

As a continuation of previous work, we establish sum expressions for $p$-adic Hecke $L$-functions of totally real fields in the sense of Delbourgo, assuming a totally real analog of Heegner hypothesis. This is done by finding explicit…

Number Theory · Mathematics 2023-03-01 Luochen Zhao

Consider a strongly $b$-multiplicative sequence and a prime $p$. Studying its $p$-rarefaction consists in characterizing the asymptotic behaviour of the sums of the first terms indexed by the multiples of $p$. The integer values of the…

Number Theory · Mathematics 2016-02-10 Alexandre Aksenov

Let $n$ and $k$ be positive integers, and $f_n(k)$ (resp. $g_n(k)$) be the number of unital subrings (resp. unital irreducible subrings) of $\mathbb{Z}^n$ of index $k$. The numbers $f_n(k)$ are coefficients of certain zeta functions of…

Number Theory · Mathematics 2022-12-01 Hrishabh Mishra , Anwesh Ray

A sharp asymptotic formula for the sum of reciprocals of $\pi(n)$ is derived, where $\pi(x)$ is the number of primes not exceeding $x$. This result improves the previous results of De Koninck--Ivi\'c and L. Panaitopol.

Number Theory · Mathematics 2007-05-23 Aleksandar Ivić

For $k\geq 2$, we give a detailed exposition of the superior $k$-highly composite numbers. We then consider the function \[f_k(n)=\frac{\log d_k(n)\log\log n}{\log k\log n},\quad n\geq 3\] which has a maximum value $\lambda(k)$ at a…

Number Theory · Mathematics 2025-11-25 Lee-Peng Teo

Let c > 0.55. Every large n can be written in the form p +ab, where p is prime, a and b are significantly smaller than x^1/2 and ab is less than n^c. This strengthens a result of Heath-Brown, which has the requirement c>3/4. We introduce…

Number Theory · Mathematics 2020-11-24 Roger Baker , Glyn Harman