Benchmark AI / Public workspace
OlympiadBench / 1694 / Determine the greatest positive integer k that satisfies the following…
Problem
Answer published by the source. Consult the official source to check your work against its answer.
answer type
Numerical
is multiple answer
false
language
English
question
Determine the greatest positive integer that satisfies the following property: The set of positive integers can be partitioned into subsets such that for all integers and all there exist two distinct elements of whose sum is .
Plain-text mathematical notation (without MathML)
Determine the greatest positive integer k that satisfies the following property: The set of positive integers can be partitioned into k subsets A₁,A₂,…,A_(k) such that for all integers n≥15 and all i∈{1,2,…,k} there exist two distinct elements of A_(i) whose sum is n.Original LaTeX notation
Determine the greatest positive integer $k$ that satisfies the following property: The set of positive integers can be partitioned into $k$ subsets $A_{1}, A_{2}, \ldots, A_{k}$ such that for all integers $n \geq 15$ and all $i \in\{1,2, \ldots, k\}$ there exist two distinct elements of $A_{i}$ whose sum is $n$.question type
Open-ended
subject
Math
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
initial import