MathDB
balkan 2005-4

Source:

May 6, 2005
combinatorics unsolvedcombinatorics

Problem Statement

Let n≥2n \geq 2 be an integer. Let SS be a subset of {1,2,…,n}\{1,2,\dots,n\} such that SS neither contains two elements one of which divides the other, nor contains two elements which are coprime. What is the maximal possible number of elements of such a set SS?
Back to ProblemsView on AoPS