Denominators of Bernoulli polynomials

Abstract: For a positive integer

n

let

m a t h f r a k P_{n} = p r o d_{s_{p} (n) g e p} p,

where

p

runs over all primes and

s_{p} (n)

is the sum of the base

p

digits of

n

. For all

n

we prove that

m a t h f r a k P_{n}

is divisible by all "small" primes with at most one exception. We also show that

m a t h f r a k P_{n}

is large, has many prime factors exceeding

s q r t n

, with the largest one exceeding

n^{20 / 37}

. We establish Kellner's conjecture, which says that the number of prime factors exceeding

s q r t n

grows asymptotically as

k a p p a s q r t n / l o g n

for some constant

k a p p a

with

k a p p a = 2

. Further, we compare the sizes of

m a t h f r a k P_{n}

and

m a t h f r a k P_{n + 1}

, leading to the somewhat surprising conclusion that although

m a t h f r a k P_{n}

tends to infinity with

n

, the inequality

m a t h f r a k P_{n} > m a t h f r a k P_{n + 1}

is more frequent than its reverse.

Recommendations

Cites work

Cited in

(9)

This page was built for publication: Denominators of Bernoulli polynomials