ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let pnp_n denote the nn-th prime. For each n≥1n\geq1, let s(n)s(n) be the smallest integer k≥3k\geq3 such that pn+k−3p_n+k-3 is represented by Fk=x1⋯xk+x1+⋯+xkF_k=x_1\cdots x_k+x_1+\cdots+x_k, and set s(n)=0s(n)=0 if no such kk exists. The sequence begins

0,0,0,0,0,0,0,3,4,3,0,0,4,0,3,0,3,3,0,4,3,3,4,3,4,0,3,5,3,4,3,….0,0,0,0,0,0,0,3,4,3,0,0,4,0,3,0,3,3,0,4,3,3,4,3,4,0,3,5,3,4,3,\ldots.

Finiteness conjecture. The sequence s(n)s(n) contains only finitely many zero terms. This asserts that pn+k−3p_n+k-3 is represented by FkF_k for some k≥3k\geq3 for all but finitely many primes pnp_n.

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.