二项式系数乘积的部分因子分解
Partial Factorizations of Products of Binomial Coefficients
摘要:
设$G_n= \prod_{k=0}^n \binom{n}{k},$为帕斯卡三角形第$n$行元素的乘积。本文研究了$G_n$的部分因子分解,它由$G_n$的所有素因子$p$的乘积$G(n,x)$给出,且有$p \le x$,重数.对于为$0 \le α\le 1$定义的极限函数$f_{G}(α)$,它将$\log G(n, αn) \sim f_G(α)n^2$显示为$n \to \infty$。主要结果推导出从研究的功能$A(n, x), B(n,x),$,编码统计的基础$p$基数扩展的整数$n$(和更小的整数),其中基础$p$范围超过素数$p \le x$。利用带余项的素数定理或在黎曼假设的条件下导出了$A(n,x)$和$B(n,x)$的渐近性。
英文摘要:
Let $G_n= \prod_{k=0}^n \binom{n}{k},$ the product of the elements of the $n$-th row of Pascal's triangle. This paper studies the partial factorizations of $G_n$ given by the product $G(n,x)$ of all prime factors $p$ of $G_n$ having $p \le x$, counted with multiplicity. It shows $\log G(n, αn) \sim f_G(α)n^2$ as $n \to \infty$ for a limit function $f_{G}(α)$ defined for $0 \le α\le 1$. The main results are deduced from study of functions $A(n, x), B(n,x),$ that encode statistics of the base $p$ radix expansions of the integer $n$ (and smaller integers), where the base $p$ ranges over primes $p \le x$. Asymptotics of $A(n,x)$ and $B(n,x)$ are derived using the prime number theorem with remainder term or conditionally on the Riemann hypothesis.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。