Partial factorizations of products of binomial coefficients

Abstract: Let

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 l e x

, counted with multiplicity. It shows

l o g G (n, a l p h a n) s i m f_{G} (a l p h a) n^{2}

as

n o i n f t y

for a limit function

f_{G} (a l p h a)

defined for

0 l e a l p h a l e 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 l e 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.

Recommendations

Cites work

Cited in

(5)

This page was built for publication: Partial factorizations of products of binomial coefficients