Browse · MathNet
PrintEstonian Mathematical Olympiad
Estonia number theory
Problem
All integers from to are written on the edges of a cube so that every edge has exactly one integer. Two robot ants stand in the same vertex of the cube and wish to arrive at the vertex that is furthest away from them. Each ant picks a path consisting of exactly three edges of the cube. They multiply the integers on their path. The product of the integers on the path of the first ant is divisible by , but not by . The sum of the digits of the product of the integers on the path of the second ant is and the integer is not on its path. Find all possible products that either ant can get.
Solution
Since is divisible by , but none of the numbers on the edges of the cube are divisible by , the path of the first ant has to contain two numbers that are divisible by . The only two such numbers are and . Their product is divisible by , but not by . Since , the third number on the path of the first ant has to be divisible by but not by . The numbers on the edges of the cube that are divisible by , but not by , are , and . Since has already been used, the third number on the path of the first ant has to be either or .
For the sum of the digits of the product of the second ant to be , it has to consist of either one two or two ones, in addition to any number of zeroes. Since the product of the three largest numbers on the edges of the cube is , the possible products for the second ant are , , , , , , , and . Of these , and are prime numbers and cannot be the product of three integers that are larger than . The number can also be eliminated, since the only way to write it as a product of three integers larger than one is , which includes the number twice. The numbers and can be eliminated, since and there is no on the edges of the cube, and and there is no on the edges of the cube. This leaves , and .
Now note that and are both divisible by . To get these products, there have to be two numbers on the path of the second ant that are divisible by . The only such numbers are and . Hence we can eliminate , since to get this product the third number would have to be , which is not on the cube. To get the product , the numbers should be , and . To get the product the numbers should be , and .
However, the paths of the two ants can have either , or edges in common, but not exactly edges. Hence the numbers on the path of the second ant cannot be , and , and so the numbers on the path of the second ant have to be , and . This leaves the first ant with the numbers , and , which give a product of .
For the sum of the digits of the product of the second ant to be , it has to consist of either one two or two ones, in addition to any number of zeroes. Since the product of the three largest numbers on the edges of the cube is , the possible products for the second ant are , , , , , , , and . Of these , and are prime numbers and cannot be the product of three integers that are larger than . The number can also be eliminated, since the only way to write it as a product of three integers larger than one is , which includes the number twice. The numbers and can be eliminated, since and there is no on the edges of the cube, and and there is no on the edges of the cube. This leaves , and .
Now note that and are both divisible by . To get these products, there have to be two numbers on the path of the second ant that are divisible by . The only such numbers are and . Hence we can eliminate , since to get this product the third number would have to be , which is not on the cube. To get the product , the numbers should be , and . To get the product the numbers should be , and .
However, the paths of the two ants can have either , or edges in common, but not exactly edges. Hence the numbers on the path of the second ant cannot be , and , and so the numbers on the path of the second ant have to be , and . This leaves the first ant with the numbers , and , which give a product of .
Final answer
First ant: 300; Second ant: 110
Techniques
Factorization techniquesOtherIntegers