benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / Determine all positive integers k for which there exist a positive integer m and a set S of positive integers such that any integer n>m can be written as a sum of distinct elements…

Problem

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

problem

Determine all positive integers kk for which there exist a positive integer mm and a set SS of positive integers such that any integer n>mn>m can be written as a sum of distinct elements of SS in exactly kk ways.
Plain-text mathematical notation (without MathML)
Determine all positive integers k for which there exist a positive integer m and a set S of positive integers such that any integer n>m can be written as a sum of distinct elements of S in exactly k ways.
Original LaTeX notation
Determine all positive integers \(k\) for which there exist a positive integer \(m\) and a set \(S\) of positive integers such that any integer \(n>m\) can be written as a sum of distinct elements of \(S\) in exactly \(k\) ways.

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
57319a10-225d-5cff-b504-9cd9d22e63c8
task_key
test--57319a10-225d-5cff-b504-9cd9d22e63c8
task_revision_id
1
config / split
/ test

Official source

initial import