The optimal exponential bound conjecture for the arithmetic function f
Statement
Let be the arithmetic function defined earlier in the paper. Optimal exponential bound conjecture. For every positive integer ,
This conjecture would improve the preceding bound and is described by the authors as very probably true, although they state that proving or disproving it seems difficult.
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.