MathDB
Find x,y that gcd(x+y,mn)>1

Source: 8th European Mathematical Cup, Senior Category, Q1

December 26, 2019
number theory

Problem Statement

For positive integers aa and bb, let M(a,b)M(a,b) denote their greatest common divisor. Determine all pairs of positive integers (m,n)(m,n) such that for any two positive integers xx and yy such that xmx\mid m and yny\mid n, M(x+y,mn)>1.M(x+y,mn)>1.
Proposed by Ivan Novak