olymmath

CGMO 2012 Problem 3

    Find all pairs (a,b)(a,b) of integers satisfying: there exists an integer d≥2d \ge 2 such that an+bn+1a^n + b^n +1 is divisible by dd for all positive integers 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-gmo/2012/p3 · Tag 5W47KSP2W3 · Edit this page on GitHub · Keys: j next, k previous