CMO 2009 Problem 6
- Day 2
Given an integer Prove that there exists a set consisting of pairwisely distinct positive integers such that for any two different non-empty subset of : and are two composites which share no common divisors.
Dataset text AI-MO AoPS. Quoted with source.
Solutions
No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.
Similar problems
These problems have the most words in common with this statement.