ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For k>1k>1, let Q(k)Q(k) be the number of primitive subsets of 1,2,…,k\\{1,2,\ldots,k\\} and define

g(1)=1,g(k)=Q(k)Q(k−1)−1.g(1)=1,\qquad g(k)=\frac{Q(k)}{Q(k-1)}-1.

Thus g(k)g(k) is the ratio of primitive subsets of 1,2,…,k\\{1,2,\ldots,k\\} that contain kk to those that do not. Submultiplicativity conjecture for gg. The function gg is submultiplicative in the following sense: if (n,m)=1(n,m)=1, then

g(nm)≤g(n)g(m),g(nm)\leq g(n)g(m),

and, for every prime pp,

g(pi+1)≤g(pi).g(p^{i+1})\leq g(p^i).

These inequalities are proposed as conjectural improved upper-bound tools for the exponential growth constant associated with counting primitive sets. The supplied text gives no resolution of this 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.