Hudson's conjecture on completely multiplicative functions of length three
Statement
Let denote the set of completely multiplicative functions whose maximal run of consecutive values has length . For primes , let be the modified Legendre symbols defined by for and . Let be completely multiplicative functions with for , , for , and . Hudson's conjecture. The set consists precisely of the functions , where and . This is a classification conjecture for the much more difficult length-three case; the supplied text gives no resolution status.
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.