Modified maximum subset-divisor conjecture
Statement
Let be a finite set of positive integers, let be the number of -subsets of satisfying , and let be the maximum of over all such sets . Modified subset-divisor conjecture. For all but finitely many integer pairs with ,
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.