ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For each natural number nn, let S(n)S(n) denote the number of very odd binary sequences of length nn. For an integer e≥1e\geq 1, consider the level set of lengths satisfying S(n)=2eS(n)=2^e. The infinitude conjecture. For every e≥1e\geq 1, there are infinitely many integers nn such that

S(n)=2e.S(n)=2^e.

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.