ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let A(n,k)A(n,k) be a set of positive integers not exceeding nn from which one cannot select k+1k+1 pairwise coprime integers, and let E(n,k)E(n,k) be the set of integers not exceeding nn divisible by one of the first kk primes.

Eventual uniqueness conjecture. For every integer k≥3k\ge3, there exists an integer nkn_k such that, for all n≥nkn\ge n_k, if

∣A(n,k)∣≥∣E(n,k)∣,|A(n,k)|\ge |E(n,k)|,

then

A(n,k)=E(n,k).A(n,k)=E(n,k).

This strengthens eventual equality of the extremal size to uniqueness of the extremal set. The paper proves the analogous uniqueness result for k=4k=4 and derives this conjecture from its auxiliary shifted-block conjectures.

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.