benchmarks.wiki / Public workspace

Omni-MATH / 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 inte…

Problem

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

problem

Determine the greatest positive integer kk that satisfies the following property: The set of positive integers can be partitioned into kk subsets A1,A2,…,AkA_1, A_2, \ldots, A_k such that for all integers n≥15n \geq 15 and all i∈{1,2,…,k}i \in \{1, 2, \ldots, k\} there exist two distinct elements of AiA_i whose sum is n.n. [i]
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.

[i]
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.$

[i]

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