Conjecture on avoiding primes for elementary symmetric Boolean functions
Statement
Let be the elementary symmetric Boolean function of degree in variables, and let denote its exponential sum. Suppose that is a natural number that is not a power of two. Define by
and let be the smallest prime of the form , with a positive integer, such that the sequence avoids . Avoiding-prime conjecture. The prime exists. The existence of such a prime for every non-power-of-two degree would imply the Cusick–Li–Stănică conjecture; the source reports verification for all non-powers of two in the range , but does not state a general proof.
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.