olymmath

KURSCHAK 2008 Problem 1

    Denote by d(n)d(n) the number of positive divisors of a positive integer nn . Find the smallest constant cc for which d(n)≤cnd(n)\le c\sqrt n holds for all positive integers nn .

    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 kurschak/2008/p1 · Tag N1R8HB0722 · Edit this page on GitHub · Keys: j next, k previous