English

Partial Factorizations of Products of Binomial Coefficients

Number Theory 2022-12-26 v2

Abstract

Let Gn=k=0n(nk),G_n= \prod_{k=0}^n \binom{n}{k}, the product of the elements of the nn-th row of Pascal's triangle. This paper studies the partial factorizations of GnG_n given by the product G(n,x)G(n,x) of all prime factors pp of GnG_n having pxp \le x, counted with multiplicity. It shows logG(n,αn)fG(α)n2\log G(n, \alpha n) \sim f_G(\alpha)n^2 as nn \to \infty for a limit function fG(α)f_{G}(\alpha) defined for 0α10 \le \alpha \le 1. The main results are deduced from study of functions A(n,x),B(n,x),A(n, x), B(n,x), that encode statistics of the base pp radix expansions of the integer nn (and smaller integers), where the base pp ranges over primes pxp \le x. Asymptotics of A(n,x)A(n,x) and B(n,x)B(n,x) are derived using the prime number theorem with remainder term or conditionally on the Riemann hypothesis.

Keywords

Cite

@article{arxiv.2006.15439,
  title  = {Partial Factorizations of Products of Binomial Coefficients},
  author = {Lara Du and Jeffrey C. Lagarias},
  journal= {arXiv preprint arXiv:2006.15439},
  year   = {2022}
}

Comments

27 pages, 4 figures Submitted to International Journal of Number Theory

R2 v1 2026-06-23T16:40:19.305Z