Infinitely many lengths with exactly 2^e very odd sequences
Statement
For each natural number , let denote the number of very odd binary sequences of length . For an integer , consider the level set of lengths satisfying . The infinitude conjecture. For every , there are infinitely many integers such that
This is proposed as a strengthening of the known fact that each such level set is nonempty. The paper explains that the claim would follow from the existence of infinitely many suitable non-Wieferich primes, a statement related to Artin's primitive root conjecture and currently unproved.
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.