ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let AkA_k be the set of positions of digit 11 in the binary expansion of 3k3^k, and let

W={k∈N:Ak does not have a 3-term arithmetic progression}.W=\{k\in\mathbb{N}:A_k\text{ does not have a 3-term arithmetic progression}\}.

Logarithmic exceptional-set conjecture. Under these conditions,

#(W∩[1,N])=O(log⁡N).\#(W\cap[1,N])=O(\log N).

The paper has already proved the weaker estimate Oϵ(Nϵ)O_\epsilon(N^\epsilon) for every ϵ>0\epsilon>0; the logarithmic bound is posed as a further open problem.

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.