olymmath

CWMO 2015 Problem 8

    Let kk be a positive integer, and n=(2k)!n=\left(2^k\right)! .Prove that σ(n)\sigma(n) has at least a prime divisor larger than 2k2^k , where σ(n)\sigma(n) is the sum of all positive divisors of 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 cn-wmo/2015/p8 · Tag M1ZF0C3S5K · Edit this page on GitHub · Keys: j next, k previous