The logarithmic lower-bound conjecture for the Schemmel iteration function R_2
Statement
Let be the function introduced in the paper, and let be an odd integer greater than . The logarithmic lower-bound conjecture.
The conjecture proposes a lower bound for the number of iterations measured by . The paper gives numerical motivation and discusses upper bounds, but does not establish this lower bound.
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.