Browse · MathNet
PrintJapan Mathematical Olympiad
Japan number theory
Problem
Players and wrote down two positive integers each on a black board. The product of the two numbers wrote is twice the sum of the two numbers wrote, and the product of the two numbers wrote is twice the sum of the two numbers wrote, and furthermore, the sum of the two numbers wrote is greater than or equal to the sum of the two numbers wrote. Determine all possible values for the sum of the two numbers wrote. Note that four numbers written down need not be distinct.
Solution
Let be the sum of two numbers the player wrote, and be the sum of the two numbers wrote. If we let be the two numbers wrote, then and , so must be the solutions of the quadratic equation . Similarly, the two numbers wrote down are the solutions of the equation . From this we obtain the fact that the discriminants and of these equations must be perfect squares. Conversely, suppose that is a perfect square, equal to for positive integer , say. Then, we see that from that and that and have the same even-odd parity. Therefore, the two roots , of the equation are positive integers. Similarly, if is a perfect square, we see that the two roots of the equation are positive integers. Thus, we see that the conditions for the problem are equivalent to the following: and are positive integers and both and are perfect squares, and . In the sequel, we determine the pairs satisfying these conditions. Since , we see that if , then must hold. As and have the same even-odd parity, we must have either or . From the former we get and from the latter . Now, suppose is satisfied. Then, we have . Since and have the same even-odd parity, we see that we can write where is an integer greater than 4. Then, we get and we conclude that must hold and these values of yield with corresponding values for respectively. Next suppose is satisfied. Then, we have . Since and have the same even-odd parity, we can write where is an integer greater than 2. Then, we get from which we get , which yield and respectively. Finally, let us consider the case where . If , then we get , which does not satisfy our requirement. So, we must have or . It is easy to check that does not satisfy the requirement, while do. So, we conclude that the possible values that can take to satisfy the requirement of the problem are .
Alternate Solution:
Let us denote by and the two numbers that the players and wrote down, respectively. We may assume that and are satisfied. The conditions of the problems can be stated as
Adding the respective sides of the first two equations, we obtain , which can be transformed into the form First, let us consider the case where . Since , we get , which is transformed to . From this we obtain , , . We find the corresponding values of are , respectively, and the requirement is also satisfied in all of the three cases. We also find that , respectively. When , we can argue in the same way as above, and find the other two are no solutions satisfying the conditions of the problem. Next, we assume that and are satisfied. Then, we have and , and since , we must have and . If , then we get . So, we must have . If , then from , we conclude that or or . When : From , , we get . When : We see there are no pairs satisfying and . When : We get and , which yield . We see that among the possibilities found for above only satisfies the condition . So, the only solution we get for the case is for which . If , then from we see that must be even, and from , must be one of . When : There are no satisfying , . When : Only satisfies , . When : There are no satisfying , . * When : Only satisfies , . Among the possibilities found above, we see that only satisfies the additional condition , and we have in this case. Finally, when , we see that from , we must have or . When , then and , and satisfies the requirements, and we get in this case. If , then we have , , and satisfies the requirements, and we get . Summarizing what we considered above, we get the possible values for the sum of the two numbers wrote to be .
Final answer
[8, 9, 10, 13, 17, 19, 27]
Techniques
Techniques: modulo, size analysis, order analysis, inequalitiesQuadratic functionsVieta's formulasFactorization techniques