olymmath

ISL 1979 Problem 77

    By h(n)h(n) , where nn is an integer greater than 11 , let us denote the greatest prime divisor of the number nn . Are there infinitely many numbers nn for which h(n)<h(n+1)<h(n+2)h(n) < h(n+1)< h(n+2) holds?

    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 isl/1979/p77 · Tag NSZY0082BQ · Edit this page on GitHub · Keys: j next, k previous