For integers $1\le m\le n$, let $s(n,m)$ denote the number of $m$-tuples $(k_1,\ldots,k_m)$ of nonnegative integers satisfying \[ n=\sum_{j=1}^{m}\frac{k_j}{j}. \] We obtain a complete asymptotic expansion for $\log s(n,m)$, uniformly for all $n\ge m$ as $m\to\infty$. The coefficients are given explicitly in terms of limiting prime-block functions arising from the residue structure of the problem. We also determine the full hierarchy of multiplicative corrections in the sparse regime, identifying explicit constants at every fixed order and, in particular, the first correction constants $1/4$ and $(1-\log 2)/4$. The results give uniform two-parameter asymptotics as both the target and the number of allowed reciprocal parts grow.
Let $p(m,n)$ denote the number of partitions of a rectangle $m\times n$ into integer-sided rectangular blocks, where two partitions are indistinguishable if they consist of the same multiset of blocks, regardless of their geometric arrangement. We present an elementary approach to show that, for every fixed positive in...
For a positive integer $n$, let $$S_0(n)=\{1,2,\ldots,\lfloor n/2\rfloor\},\qquad S_{j+1}(n)=\{n\bmod k:k\in S_j(n)\setminus\{0\}\},$$ and put $s_j(n) := |S_j(n)|$. The sets defined above arise naturally in the study of the length of the Pierce series expansion of a rational number. In \cite{Ba-Vu}, Baraskar and Vukusi...
Omkar Baraskar, Prashant Gokhale, Sarvagya Jain et al.· 1 citation
For practical $N$ let $h(N)$ be the least $k$ such that every integer $1\le m\le N$ is a sum of at most $k$ distinct divisors of $N$. We prove $h(n!)\le(2\log2+o(1))\,n/\log n$. This improves the bounds of order $n/(\log n)^{1/2-\varepsilon}$ established in Tenenbaum-Yokota's Lemma 4 and Yokota's 1995 knapsack note. We...
For $N\geq 2$ and $k\geq 1$, let $M_k(N):=\#\{x_1\cdots x_k : x_i\in\{1,\ldots,N\}\text{ for all } i\}$ be the $k$-dimensional multiplication table. Given $N$, Khovanskii's theorem implies that $M_k(N)$ agrees, for all sufficiently large $k$, with a polynomial in $k$ of degree $\pi(N)$. We determine the asymptotic size...
Let $R_N(m)$ count unordered partitions of $m$ into reduced positive fractions whose numerators and denominators are at most $N$, excluding integer parts. Uniformly for $\rho$ in compact positive intervals, $\log R_N(\lfloor\rho N\rfloor)=\sqrt{2\rho}\,N^{3/2}-\kappa(\rho)N^{3/2}/\log N+o(N^{3/2}/\log N)$. The positive...
Let $F_k(n)$ be the number of unordered representations \[ n=p_1^k+p_2^k+\cdots +p_k^k \] by primes, with repetitions allowed. Erd\H{o}s stated that $\limsup_{n\to\infty} F_3(n)=\infty$, but his proof appears not to have been published. A complete unconditional proof is given. The principal input is the classical Hecke...
Yukai Wang, Xu Zhang· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
