Subsets said to be friends (2015 OMCS #6)
Source:
May 16, 2015
combinatoricsSetsarithmetic
Problem Statement
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.