olymmath

RO-TST 2014 Problem 11

    For every positive integer nn , let σ(n)\sigma(n) denote the sum of all positive divisors of nn ( 11 and nn , inclusive). Show that a positive integer nn , which has at most two distinct prime factors, satisfies the condition σ(n)=2n−2\sigma(n)=2n-2 if and only if n=2k(2k+1+1)n=2^k(2^{k+1}+1) , where kk is a non-negative integer and 2k+1+12^{k+1}+1 is prime.

    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 ro-tst/2014/p11 · Tag VKH2GECWK7 · Edit this page on GitHub · Keys: j next, k previous