Kellner's asymptotic conjecture for large prime factors of Bernoulli-polynomial denominators
Statement
For a positive integer , define
where is the sum of the base- digits of . Let denote the number of distinct prime factors of . Kellner's conjecture. There is an absolute constant such that, as ,
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.