ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For a positive integer nn, let sp(n)s_p(n) denote the sum of the base-pp digits of nn, and define

Pn=∏p prime: sp(n)≥pp.\mathfrak P_n=\prod_{p\text{ prime}:\,s_p(n)\ge p}p.

Let P(m)P(m) be the largest prime factor of mm. Kellner's conjecture. For n>192n>192,

P(Pn)>n.P(\mathfrak P_n)>\sqrt n.

Equivalently, using Pn+=∏p>n, sp(n)≥pp\mathfrak P_n^+=\prod_{p>\sqrt n,\,s_p(n)\ge p}p, one has Pn+>1\mathfrak P_n^+>1 for every n>192n>192. The source states that this is established, apart from the numerical threshold 192192, in a stronger form in its Theorem 2.

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.