ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let pip_i be the ii-th prime, and let FkF_k be the set of integers divisible by at least one of p1,…,pkp_1,\ldots,p_k. Let k≥3k\ge3 and let ll be a positive integer. For an integer aa satisfying

−pk+1+1≤a≤p1p2⋯pk−pk+1,-p_{k+1}+1\le a\le p_1p_2\cdots p_k-p_{k+1},

and (a,p1p2⋯pk)=1(a,p_1p_2\cdots p_k)=1, let Bk,l(a)B_{k,l}(a) be a subset of [−pk+1+1,a][-p_{k+1}+1,a] such that

{p1p2⋯pkl+b:b∈Bk,l(a)}\{p_1p_2\cdots p_kl+b:b\in B_{k,l}(a)\}

contains no k+1k+1 pairwise coprime integers.

Coprime-endpoint bound conjecture. For every such k,l,ak,l,a,

∣Bk,l(a)∣≤∣Fk∩[−pk+1+1,a]∣.|B_{k,l}(a)|\le |F_k\cap[-p_{k+1}+1,a]|.

The coprimality condition on aa is an additional restriction in the paper's auxiliary formulation. It is intended to support the eventual form of Erdős's conjecture.

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.