ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For a prime pp, let sp(n)s_p(n) be the sum of the base-pp digits of nn, let ω(n)\omega(n) count the distinct prime divisors of nn, and define

Dn+=∏p>nsp(n)≥pp(n≥1).\mathbb{D}^+_n=\prod_{\substack{p>\sqrt{n}\\s_p(n)\geq p}}p\qquad(n\geq1).

Kellner's conjecture. The following statements hold: Dn+>1\mathbb{D}^+_n>1, equivalently ω(Dn+)>0\omega(\mathbb{D}^+_n)>0, for n>192n>192, and there exists a constant κ>1\kappa>1 such that

ω(Dn+)∼κnlog⁡nas n→∞.\omega(\mathbb{D}^+_n)\sim\kappa\frac{\sqrt n}{\log n}\qquad\text{as }n\to\infty.

The first assertion with κ=2\kappa=2 was proved by Bordellès et al. for sufficiently large nn, while the asymptotic assertion is not resolved here.

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.