benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / Let S be a subset of {1,2,3,…,12} such that it is impossible to partition S into k disjoint subsets, each of whose elements sum to the same value, for any integer k≥2. Find the max…

Problem

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

problem

Let SS be a subset of {1,2,3,…,12}\{1,2,3, \ldots, 12\} such that it is impossible to partition SS into kk disjoint subsets, each of whose elements sum to the same value, for any integer k≥2k \geq 2. Find the maximum possible sum of the elements of SS.
Plain-text mathematical notation (without MathML)
Let S be a subset of {1,2,3,…,12} such that it is impossible to partition S into k disjoint subsets, each of whose elements sum to the same value, for any integer k≥2. Find the maximum possible sum of the elements of S.
Original LaTeX notation
Let $S$ be a subset of $\{1,2,3, \ldots, 12\}$ such that it is impossible to partition $S$ into $k$ disjoint subsets, each of whose elements sum to the same value, for any integer $k \geq 2$. Find the maximum possible sum of the elements of $S$.

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

task_id
1f5590dc-a80a-553e-aea4-51865d3247cd
task_key
test--1f5590dc-a80a-553e-aea4-51865d3247cd
task_revision_id
1
config / split
/ test

Official source

initial import