MathDB
n -element subset F of {1, . . . , 2n}

Source: Switzerland - 2016 Swiss MO Final Round p9

January 14, 2023
combinatoricsLCMnumber theory

Problem Statement

Let n≥2n \ge 2 be a natural number. For an nn-element subset FF of {1,...,2n}\{1, . . . , 2n\} we define m(F)m(F) as the minimum of all lcm  (x,y)lcm \,\, (x, y) , where xx and yy are two distinct elements of FF. Find the maximum value of m(F)m(F).
Back to ProblemsView on AoPS