Stronger linear lower-bound conjecture for the theta-function arithmetic sum
Statement
For positive integers and , define
where is the greatest integer less than or equal to , and define
Stronger linear lower-bound conjecture. For each prime ,
This is a further numerical strengthening of the preceding lower bound. The source reports that the primes up to failing have largest value , but gives no proof of the 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.