Kikuta–Ruckle conjecture
Statement
Let and . In the KR-Problem, choose nonnegative numbers with to maximize the probability that the sum over a uniformly random -element subset exceeds . Kikuta–Ruckle conjecture. For every and , there is an optimal solution of the form
for some . The conjecture is described as a central claim for the generalized problem; the source gives no resolution.
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.