olymmath

AT-OEMO-REG 2017 Problem 4

    Determine all integers n≥2n \geq 2, satisfying n=a2+b2,n=a^2+b^2, where aa is the smallest divisor of nn different from 11 and bb is an arbitrary divisor of nn. Proposed by Walther Janous

    Dataset text AoPS wiki problems. 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 at-oemo-reg/2017/p4 · Tag P742FF8AGT · Edit this page on GitHub · Keys: j next, k previous