benchmarks.wiki / Public workspace

Omni-MATH / Let n be the second smallest integer that can be written as the sum of two positive cubes in two different ways. Compute n.

Problem

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

problem

Let nn be the second smallest integer that can be written as the sum of two positive cubes in two different ways. Compute nn.
Plain-text mathematical notation (without MathML)
Let n be the second smallest integer that can be written as the sum of two positive cubes in two different ways. Compute n.
Original LaTeX notation
Let $n$ be the second smallest integer that can be written as the sum of two positive cubes in two different ways. Compute $n$.

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