benchmarks.wiki

benchmarks.wiki / 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.

question

Let k≥2k \geqslant 2 be an integer. Find the smallest integer n≥k+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.

answer type

Expression

is multiple answer

false

language

English

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.

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. 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

upstream_id / Original problem ID
1997
task_id
465f3a2b-83b2-5cf9-8d8a-57b9ca3c9cf5
task_key
OE~5fTO~5fmaths~5fen~5fCOMP--train--1997
task_revision_id
4
config / split
OE_TO_maths_en_COMP / train

Official source

initial import