Conjecture on the extremal divisor count for almost all parameter pairs
Statement
For positive integers and , let denote the extremal divisor-count function studied in the paper: the minimum number of -element subsets that can occur as divisors in an -element set of positive integers.
Divisor-count conjecture. For most values of and , specifically for all but finitely many values of and ,
The source notes that determining for is open because the complementary subsets need not have the same cardinality; the conjecture predicts the displayed value except for finitely many parameter pairs.
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.