benchmarks.wiki / Public workspace

Omni-MATH / Let n be the answer to this problem. Given n>0, find the number of distinct (i.e. non-congruent), non-degenerate triangles with integer side lengths and perimeter n.

Problem

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

problem

Let nn be the answer to this problem. Given n>0n>0, find the number of distinct (i.e. non-congruent), non-degenerate triangles with integer side lengths and perimeter nn.
Plain-text mathematical notation (without MathML)
Let n be the answer to this problem. Given n>0, find the number of distinct (i.e. non-congruent), non-degenerate triangles with integer side lengths and perimeter n.
Original LaTeX notation
Let $n$ be the answer to this problem. Given $n>0$, find the number of distinct (i.e. non-congruent), non-degenerate triangles with integer side lengths and perimeter $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