MathDB
INMO 2019 P3

Source:

January 20, 2019
number theory

Problem Statement

Let m,nm,n be distinct positive integers. Prove that gcd(m,n)+gcd(m+1,n+1)+gcd(m+2,n+2)2mn+1.gcd(m,n) + gcd(m+1,n+1) + gcd(m+2,n+2) \le 2|m-n| + 1. Further, determine when equality holds.