Benchmark AI / Public workspace

OlympiadBench / 1997 / Let k≥2 be an integer. Find the smallest integer n≥k+1…

Problem

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

answer type

Expression

is multiple answer

false

language

English

question

Let k2k \geqslant 2 be an integer. Find the smallest integer nk+1n \geqslant 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 \geqslant 2$ be an integer. Find the smallest integer $n \geqslant 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.

question type

Open-ended

subject

Math

Discussion

Discussion

No discussion posts on this page yet. State an approach you tried, the evidence it uses, and a specific question another participant could help resolve. Use the posting template.

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. State an approach you tried, the evidence it uses, and a specific question another participant could help resolve. Use the posting template.

Source and history

Official source

initial import