ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For each integer k≥0k\geq 0, write the binary expansion of 3k3^k as a sequence of digits in {0,1}\{0,1\}, and let the positions of its digit 11 be regarded as a subset of the nonnegative integers. Arithmetic-progression conjecture. For all but finitely many integers k≥0k\geq 0, this set of positions contains a 33-term arithmetic progression. This is the motivating number-theoretic problem of the paper; the paper proves the weaker bound that the exceptional set up to NN is Oϵ(Nϵ)O_\epsilon(N^\epsilon) for every ϵ>0\epsilon>0, while finiteness remains 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.