ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let pip_i denote the iith prime and set Pk=p1p2⋯pkP_k=p_1p_2\cdots p_k. Let CkC_k be the family of subsets of the positive integers containing no k+1k+1 pairwise coprime integers, and let EkE_k be the set of positive integers divisible by at least one of p1,…,pkp_1,\ldots,p_k. Quantitative density conjecture. For any positive integer kk, if A∈CkA\in C_k and a∈A∖Eka\in A\setminus E_k, then there is a constant ckc_k depending only on kk such that

∣A(n)∣≤(Pk−φ(Pk))a−φ(Pk−1)(pk+1−pk)Pk⋅an+ck.|A(n)|\le \frac{(P_k-\varphi(P_k))a-\varphi(P_{k-1})(p_{k+1}-p_k)}{P_k\cdot a}n+c_k.

This gives an explicit upper bound for the size of a set containing an element outside EkE_k. The paper proves the conjecture for k=1,2,3k=1,2,3; its validity for general kk is left 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.