Lower bounds (problem 1)
Statement
Let be fixed. Is there a sequence such that
as ? We could also consider variants for multiplicative functions with values in . We can handle pretentious, and can also do it assuming -point Chowla or the existence of arbitrarily long strings of 's for . Would a Sudoku-type argument work here? If is allowed to vary with , then we can probably show this as well.
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.