ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let n\mathbf{n} be a speed vector with gcd⁡(n)=1\gcd(\mathbf{n})=1, and let a suitable time mean a time at which the speeds in n\mathbf{n} form a lonely runner instance. Let kk and n1n_1 be the parameters appearing in the speed vector, let mm be a natural number, and let ⌈⋅⌉\lceil\cdot\rceil denote the ceiling function.

Dyadic-denominator conjecture. For every n\mathbf{n} with gcd⁡(n)=1\gcd(\mathbf{n})=1, there is always a suitable time of the form

m2⌈ln⁡2(n1)+1⌉(k+1)n1\frac{m}{2^{\lceil\ln_{2}(n_1)+1\rceil}(k+1)n_1}

for some natural number mm.

The claim proposes an explicit restricted family of denominators containing a suitable time for every primitive speed vector. It is presented as a continuation of results giving explicit suitable times for known families; its general validity is open.

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.