Maths Olympiad Prep

Library / /3 of 9

Number theory Difficulty 4.2 AIME Find the answer Italy

Problem:

How many quadruples of positive integers (a,b,x,y)(a, b, x, y) are there such that x+y=abx+y=a \cdot b and a+b=xya+b=x \cdot y?

Pick one

Solution

Solution:

The answer is (C). If a,b,x,ya, b, x, y are all greater than or equal to 22, then aba+b=xyx+y=aba b \geq a+b = x y \geq x+y = a b, so every inequality must be an equality and the only possible quadruple is (2,2,2,2)(2,2,2,2).

If instead one of the four numbers is equal to 11, say for example b=1b=1, then substituting the equality a=x+ya = x + y into a+1=xya + 1 = x y one obtains (x1)(y1)=2(x-1)(y-1) = 2, from which x=2,y=3x=2, y=3 or vice versa. One solution is thus (a,b,x,y)=(1,5,2,3)(a, b, x, y) = (1,5,2,3), and the others are obtained from this one by swapping the roles of a,ba, b, the roles of x,yx, y, or the roles of the pair (a,b)(a, b) and the pair (x,y)(x, y): one thus obtains eight other solutions, namely (1,5,2,3),(1,5,3,2),(5,1,2,3),(5,1,3,2),(2,3,1,5),(2,3,5,1),(3,2,1,5),(3,2,5,1)(1,5,2,3), (1,5,3,2), (5,1,2,3), (5,1,3,2), (2,3,1,5), (2,3,5,1), (3,2,1,5), (3,2,5,1).

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement translated into English from the original; metadata (topic, difficulty) added by this project.