olymmath

SILK-ROAD 2013 Problem 1

    Determine all pairs of positive integers m,n,m, n, satisfying the equality (2m+1;2n+1)=2(m;n)+1(2^{m}+1;2^n+1)=2^{(m;n)}+1 , where (a;b)(a;b) is the greatest common divisor

    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 silk-road/2013/p1 · Tag XJPNN8G9HH · Edit this page on GitHub · Keys: j next, k previous