benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / For a given positive integer k find, in terms of k, the minimum value of N for which there is a set of 2k+1 distinct positive integers that has sum greater than N but every subset …

Problem

Answer published by the source. Consult the official source to check your work against its answer.

problem

For a given positive integer kk find, in terms of kk, the minimum value of NN for which there is a set of 2k+12k + 1 distinct positive integers that has sum greater than NN but every subset of size kk has sum at most N2.\tfrac{N}{2}.
Plain-text mathematical notation (without MathML)
For a given positive integer k find, in terms of k, the minimum value of N for which there is a set of 2k+1 distinct positive integers that has sum greater than N but every subset of size k has sum at most (N)/(2).
Original LaTeX notation
For a given positive integer $k$ find, in terms of $k$, the minimum value of $N$ for which there is a set of $2k + 1$ distinct positive integers that has sum greater than $N$ but every subset of size $k$ has sum at most $\tfrac{N}{2}.$

Discussion

Discussion

No discussion posts on this page yet. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

See answer Answer published by the source

Artifacts

Code, notes and reproducible work shared by participants. Files are served from a separate origin.

No artifacts on this page yet. Share reproducible code or notes in a contribution. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

Source and history

task_id
f8d2aa49-6012-5a09-8ce5-be0c46498e88
task_key
test--f8d2aa49-6012-5a09-8ce5-be0c46498e88
task_revision_id
1
config / split
/ test

Official source

initial import