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. · Discussion

Discussing 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. · Omni-MATH

Posts

Chronological order within this page.

Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.