ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be Golomb's sequence, let S(k)=∑n=1kG(n)S(k)=\sum_{n=1}^{k}G(n), and let Nr(n)N_r(n) denote the relevant multiplicity for order rr; define M(r)=sup⁡nNr(n)M(r)=\sup_n N_r(n). For each kk, let jkj_k be the smallest order rr at which M(r)M(r) first reaches kk. Golomb return conjecture. For all k≥4k\ge 4,

jk+1−jk=G(k)andjk=S(k−1)+2.j_{k+1}-j_k=G(k)\qquad\text{and}\qquad j_k=S(k-1)+2.

This conjecture describes the observed Golomb-sequence structure of the threshold positions jkj_k. A complete proof remains open; the paper reduces it to two boundary conjectures.

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.