Browse · MathNet
Print75th Romanian Mathematical Olympiad
Romania counting and probability
Problem
Let . A subset of the set will be called nice if it has 3 elements, one of them being the arithmetic mean of the other two, and there exists such that .
a) Find how many nice sets have the element .
b) Find how many nice subsets has .
a) Find how many nice sets have the element .
b) Find how many nice subsets has .
Solution
Let . The possible cases are:
I. ;
II. ;
III. - impossible.
a) Since is divisible by , and , it can be any element of the set . We get the nice sets: , , , , , .
b) In case I we get a nice set for every with , that is sets. In case II we get a nice set for every so that , that is sets. Since the equality is impossible for positive integers , there are no common sets for case I and case II. This shows that there are nice sets.
I. ;
II. ;
III. - impossible.
a) Since is divisible by , and , it can be any element of the set . We get the nice sets: , , , , , .
b) In case I we get a nice set for every with , that is sets. In case II we get a nice set for every so that , that is sets. Since the equality is impossible for positive integers , there are no common sets for case I and case II. This shows that there are nice sets.
Final answer
a) 6; b) 630
Techniques
CombinatoricsDivisibility / Factorization