olymmath

KMO 2005 Problem 7

    For a positive integer nn , let f(n)f(n) be the number of factors of n2+n+1n^2+n+1 . Show that there are infinitely many integers nn which satisfy f(n)≥f(n+1)f(n) \geq f(n+1) .

    Dataset text AI-MO AoPS. 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 kr-kmo/2005/p7 · Tag 3TX33GN7FW · Edit this page on GitHub · Keys: j next, k previous