Petrik uses the computer program "Three", which converts the numbers written on the display. For one application of this program Petrik chooses 5 numbers from the written ones, and the program increases each of these 5 numbers in 3 times. At the beginning, the following 20 numbers are written on the display: 1, , , ..., . What smallest number of times does Petrik have to use the program to be able to get a set of equal numbers on the display?
Solution
In one operation the product of all written numbers increases in times. At the beginning, this product equals . So, after using it times, the product will be equal to . By that time all numbers would have to become equal, and therefore at least , so in the end the product is at least , where . Then , and , and as , we get . Now let's show how to achieve this by using the program 38 times.
So after 30 uses we have 4 of each of .
So after 36 uses we have 10 of . In the last two moves we make them all equal to .
Looking for a route rather than an archive? The track puts 2,000
problems in a working order, from AMC 10 level to the IMO shortlist.