ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Fix some constant C>0C>0 and let nn be large. Let A⊆{2,…,n}A\subseteq \{2,\ldots,n\} be such that (a,b)=1(a,b)=1 for all a≠b∈Aa\neq b\in A and ∑n∈A1n≤C\sum_{n\in A}\frac{1}{n}\leq C. What choice of such an AA minimises the number of integers m≤nm\leq n not divisible by any a∈Aa\in A? Is this minimised by letting n≥q1>q2>⋯n\geq q_1>q_2>\cdots be the consecutive primes in decreasing order and choosing A={q1,…,qk}A=\{q_1,\ldots,q_k\} where kk is maximal such that ∑i=1k1qi≤C?\sum_{i=1}^k\frac{1}{q_i}\leq C?

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.