benchmarks.wiki / Public workspace

Omni-MATH / Find the smallest positive integer n such that the divisors of n can be partitioned into three sets with equal sums.

Problem

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

problem

Find the smallest positive integer nn such that the divisors of nn can be partitioned into three sets with equal sums.
Plain-text mathematical notation (without MathML)
Find the smallest positive integer n such that the divisors of n can be partitioned into three sets with equal sums.
Original LaTeX notation
Find the smallest positive integer $n$ such that the divisors of $n$ can be partitioned into three sets with equal sums.

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