ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let AA be a finite set of nn positive integers, let dk(A)d_k(A) be the number of kk-subsets BB of AA satisfying ∑B∣∑A\sum B\mid\sum A, and let d(k,n)d(k,n) be the maximum of dk(A)d_k(A) over all such sets AA. Modified subset-divisor conjecture. For all but finitely many integer pairs (k,n)(k,n) with 1<k<n1<k<n,

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

This is the paper's corrected form after excluding the infinite families of counterexamples to Huynh's formulation; the paper states that, apart from those families, the conjecture is true.

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.