INMO 2000 Problem 6
For any natural number , let denote the number of non-congruent integer-sided triangles with perimeter (e.g., ). Show that
(a)
(b) .
Dataset text NuminaMath olympiads. Quoted with source.
Solutions
No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.
Similar problems
These problems have the most words in common with this statement.