benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / Let k≥2 be an integer. Find the smallest integer n≥k+1 with the property that there exists a set of n distinct real numbers such that each of its elements can be written as a sum o…

Problem

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

problem

Let k≥2k\ge2 be an integer. Find the smallest integer n≥k+1n \ge k+1 with the property that there exists a set of nn distinct real numbers such that each of its elements can be written as a sum of kk other distinct elements of the set.
Plain-text mathematical notation (without MathML)
Let k≥2 be an integer. Find the smallest integer n≥k+1 with the property that there exists a set of n distinct real numbers such that each of its elements can be written as a sum of k other distinct elements of the set.
Original LaTeX notation
Let $k\ge2$ be an integer. Find the smallest integer $n \ge k+1$ with the property that there exists a set of $n$ distinct real numbers such that each of its elements can be written as a sum of $k$ other distinct elements of the set.

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
d7f79d82-98f7-5a48-80e7-7851390e75af
task_key
test--d7f79d82-98f7-5a48-80e7-7851390e75af
task_revision_id
1
config / split
/ test

Official source

initial import