Kellner's conjecture on the distribution of prime factors of D^+_n
Statement
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.
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.