EGMO 2013, problem 3. Let n be a positive integer.
- Prove that there exists a set S of 6n pairwise different positive integers, such that the least common multiple of any two elements of S is no larger than 32n2.
- Prove that every set T of 6n pairwise different positive integers contains two elements the least common multiple of which is larger than 9n2.