Submultiplicativity conjecture for the primitive-set ratio function
Statement
For , let be the number of primitive subsets of and define
Thus is the ratio of primitive subsets of that contain to those that do not. Submultiplicativity conjecture for . The function is submultiplicative in the following sense: if , then
and, for every prime ,
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.