ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let N(k)N(k) be the number of weakly consecutive sequences of length kk. Minimal-count density conjecture. The value N(k)=2N(k)=2, which is minimal for k>1k>1, occurs for infinitely many kk. Specifically, the density of such kk is

δ=∏p prime(1−log⁡(1+1p)log⁡(p))≈0.19.\delta=\prod_{p\text{ prime}}\left(1-\frac{\log\left(1+\frac1p\right)}{\log(p)}\right)\approx0.19.

The paper presents this as an expectation based on treating the relevant prime conditions as independent; it remains 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.