olymmath

CH-SMO 2022 Problem 7

    Let n>6n > 6 be a perfect number. Let p1a1⋅p2a2⋅...⋅pkakp_1^{a_1} \cdot p_2^{a_2} \cdot ... \cdot p_k^{a_k} be the prime factorisation of nn , where we assume that p1<p2<...<pkp_1 < p_2 <...< p_k and ai>0a_i > 0 for all i=1,...,ki = 1,...,k . Prove that a1a_1 is even.

    Remark: An integer n≥2n \ge 2 is called a perfect number if the sum of its positive divisors, excluding nn itself, is equal to nn . For example, 66 is perfect, as its positive divisors are {1,2,3,6}\{1, 2, 3, 6\} and 1+2+3=61+2+3=6 .

    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 ch-smo/2022/p7 · Tag 4PRFZMP74K · Edit this page on GitHub · Keys: j next, k previous