Kellner's large-prime-factor conjecture for Bernoulli-polynomial denominators
Statement
For a positive integer , let denote the sum of the base- digits of , and define
Let be the largest prime factor of . Kellner's conjecture. For ,
Equivalently, using , one has for every . The source states that this is established, apart from the numerical threshold , 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.