Kellner's conjecture on the distribution of prime factors of
Kellner's conjecture on the distribution of prime factors of
For a prime , let be the sum of the base- digits of , let count the distinct prime divisors of , and define
Kellner's conjecture. The following statements hold: , equivalently , for , and there exists a constant such that
The first assertion with was proved by Bordellès et al. for sufficiently large , while the asymptotic assertion is not resolved here.
Sources & referencesView supporting material
Primary source
Bernd C. Kellner, “On the finiteness of Bernoulli polynomials whose derivative has only integral coefficients”, arXiv:2310.01325 (2024).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.