benchmarks.wiki / Public workspace

Omni-MATH / From a set of integers {1,...,100}, k integers were deleted. Is it always possible to choose k distinct integers from the remaining set such that their sum is 100 if [b](a) k=9?[/b…

Problem

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

problem

From a set of integers {1,...,100}\{1,...,100\}, kk integers were deleted. Is it always possible to choose kk distinct integers from the remaining set such that their sum is 100100 if [b](a) k=9k=9?[/b] [b](b) k=8k=8?[/b]
Plain-text mathematical notation (without MathML)
From a set of integers {1,...,100}, k integers were deleted. Is it always possible to choose k distinct integers from the remaining set such that their sum is 100 if

[b](a) k=9?[/b]
[b](b) k=8?[/b]
Original LaTeX notation
From a set of integers $\{1,...,100\}$, $k$ integers were deleted. Is it always possible to choose $k$ distinct integers from the remaining set such that their sum is $100$ if

[b](a) $k=9$?[/b]
[b](b) $k=8$?[/b]

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

Official source

initial import