ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For positive integers kk and nn, let d(k,n)d(k,n) denote the extremal divisor-count function studied in the paper: the minimum number of kk-element subsets that can occur as divisors in an nn-element set of positive integers.

Divisor-count conjecture. For most values of kk and nn, specifically for all but finitely many values of kk and nn,

d(k,n)=(n−1k).d(k,n)=\binom{n-1}{k}.

The source notes that determining d(k,n)d(k,n) for n≠2kn\neq 2k 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 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.