olymmath

INMO 2000 Problem 6

    For any natural number n,(n≥3)n,(n \geq 3), let f(n)f(n) denote the number of non-congruent integer-sided triangles with perimeter nn (e.g., f(3)=1,f(4)=0,f(7)=2f(3)=1, f(4)=0, f(7)=2 ). Show that

    (a) f(1999)>f(1996)f(1999)>f(1996)

    (b) f(2000)=f(1997)f(2000)=f(1997).

    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.

    Add a solution

    Similar problems

    These problems have the most words in common with this statement.

    Locator in-inmo/2000/p6 · Tag EEHJ88ZVSW · Edit this page on GitHub · Keys: j next, k previous