Skip to main content
OlympiadHQ

Browse · MathNet

Print

Estonian Mathematical Olympiad

Estonia counting and probability

Problem

In how many ways can one choose 5 numbers from the list so that the product of the chosen numbers is 1?

Remark: Two choices are considered different if one choice contains a number that the other choice does not. The order of numbers is not important.
Solution
Let's first count the choices that include the number . If some three of the remaining numbers were , , and , then the conditions of the problem would be violated, because the denominators of all the fractions in the list are smaller than , and the product of the selected 5 numbers could not be . If instead of , , and some other 3 integers are chosen, their product will be even larger, so the conditions of the problem cannot be met. The situation is similar if 3 fractions are chosen next to the number . Thus, in addition to the number , the choice must include 2 integers and 2 fractions, with the product of the integers equal to the product of the denominators of the fractions. There are exactly 21 ways to choose 2 integers in addition to the number , and the resulting products are in the following table:
345678
26810121416
31215182124
420242832
5303540
64248
756
We see that the numbers and appear in the table 2 times, the remaining numbers are unique. Thus, we get 21 options where the selected integers are the same as the denominators of the selected fractions, and in addition 4 options where the selected integers and the denominators of the selected fractions are not the same, but their product is either or . In total, there are 25 options with the number .

Now we count the options that do not have the number . We have to choose either 3 integers and 2 fractions or 3 fractions and 2 integers. Since, due to symmetry, there are the same number of options of both types, we count the options involving 3 integers and 2 fractions. If were not included in the selection, the product of the selected integers should be at least , but according to the multiplication table, the product of the denominators of any 2 fractions is less than , which is why the condition of the problem cannot be met. Therefore, must be included in the selection. Similarly, we see that either or must also be included in the selection. We get the possibilities Of these 9 products, only and do not appear in the multiplication table above, the product appears there 2 times and the remaining 6 products 1 time. So we get possibilities. There are the same number of possibilities with 3 fractions and 2 integers. So there are possibilities without the number . Hence the total number of possibilities is .

---

Alternative solution.

The list of numbers contains 7 pairs of reciprocals in the form . At most 2 such pairs can occur among the 5 numbers chosen. If there are two pairs of reciprocals in the choice, then the last number must be . To choose 2 pairs from the 7 existing pairs of reciprocals, there are possibilities. If there is one pair of reciprocals in the choice, then the product of the remaining 3 numbers must be . If the integers and are among these 3 numbers, then the last number must be , so the integer is also in the original list. Similarly if the fractions and are among these 3 numbers, then , and must be in the original list. The only such numbers are , , and , , , each of which gives 2 choices for the 3 numbers from the original list. Then there are options for the pair of reciprocal numbers. So in this case there are possibilities. If there are no pairs of reciprocals in the selection, then each integer can appear in the selection at most once, either by itself or in the denominator of the reciprocal. The prime numbers and cannot appear in either role. The prime number only appears as a factor in the numbers and ; if both of them were omitted, there would not be enough numbers left in the selection, so they must both be in the selection, either as and or as and . The product of these numbers is or , respectively. The remaining numbers are , , , and , from which 3 must be chosen. If one does not choose , then it is not possible to get the number or by using each remaining number or its reciprocal as a factor only once. Thus, the number must be in the selection. From the remaining numbers and their reciprocals, the number or can be composed in 4 ways: , , , and . So the total number of choices is .
Final answer
41

Techniques

Enumeration with symmetryFactorization techniquesFractions