MathDB
set of elements where for each 2 elements their gcd equals difference

Source: Balkan MO Shortlist 2013 N7 BMO

March 10, 2020
number theorygreatest common divisorDifferenceset

Problem Statement

Two distinct positive integers are called close if their greatest common divisor equals their difference. Show that for any nn, there exists a set SS of nn elements such that any two elements of SS are close.