benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / ( Dick Gibbs ) 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 b…

Problem

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

problem

( Dick Gibbs ) 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 N/2N/2 .
Plain-text mathematical notation (without MathML)
( Dick Gibbs ) 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
( Dick Gibbs ) 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$ .

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
a7582ea2-9001-59f1-b394-1f97980bb909
task_key
test--a7582ea2-9001-59f1-b394-1f97980bb909
task_revision_id
1
config / split
/ test

Official source

initial import