CONO-SUR 2015 Problem 6
Let . Two subsets and of are said to be friends if the following conditions are true:
- They do not share any elements.
- They both have the same number of elements.
- The product of all elements from equals the product of all elements from .
Prove that there are two subsets of that are friends such that each one of them contains at least elements.
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.