VN-TST 2004 Problem 1
Let us consider a set , satisfying the following properties: and from , where denotes number of elements which are relatively prime with . Find the least positive integer for which in every -subset of , having the above mentioned properties there are two distinct elements with greatest common divisor greater than 1.
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.