ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For a positive integer nn, define

Pn+=∏p>n, sp(n)≥pp,\mathfrak P_n^+=\prod_{p>\sqrt n,\,s_p(n)\ge p}p,

where sp(n)s_p(n) is the sum of the base-pp digits of nn. Let ω(m)\omega(m) denote the number of distinct prime factors of mm. Kellner's conjecture. There is an absolute constant κ>0\kappa>0 such that, as n→∞n\to\infty,

ω(Pn+)=(κ+o(1))nlog⁡n.\omega(\mathfrak P_n^+)=(\kappa+o(1))\frac{\sqrt n}{\log n}.

This predicts the precise order of growth of the number of large prime factors occurring in the denominator of the Bernoulli polynomial. The source gives no resolution of this asymptotic conjecture.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.