olymmath

KöMaL 2025 B5450

    Let positive integer dd be called a block-divisor of positive integer nn if d∣nd\mid n and moreover, dd and nd\frac{n}{d} are coprimes. Let B(n)B(n) denote the sum of the block-divisors of nn. Find all positive integers nn such that nn has at most three distinct prime factors and B(n)=2nB(n)=2n.

    Official text KöMaL. 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 hu-komal/2025/b5450 · Tag 6PN2AYVAMN · Edit this page on GitHub · Keys: j next, k previous