ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Call a set S⊆{1,…,n}S\subseteq \{1,\ldots,n\} admissible if (a,b)=1(a,b)=1 for all a≠b∈Sa\neq b\in S. Let G(n)=max⁡S⊆{1,…,n}∑a∈SaG(n) = \max_{S\subseteq \{1,\ldots,n\}} \sum_{a\in S}a and H(n)=∑p<np+nπ(n1/2).H(n)=\sum_{p<n}p+ n\pi(n^{1/2}). Is it true that G(n)>H(n)−n1+o(1)?G(n) >H(n)-n^{1+o(1)}? Is it true that, for every k≥2k\geq 2, if nn is sufficiently large then the admissible set which maximises G(n)G(n) contains at least one integer with at least kk prime factors?

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.