Maths Olympiad Prep

Library / /23 of 48

, 2019

Algebra Difficulty 6.0 AIME, harder Prove it Greece

Let the set X={1,2,...,8}X = \{1,2,...,8\} and two nonempty disjoint subsets A,BA, B of XX with union the set XX. Let PAP_A be the product of the elements of the set AA and PBP_B be the product of the elements of the set BB. Determine the least possible value of the sum PA+PBP_A + P_B.

Solution

We observe that: PAPB=8!=cP_A \cdot P_B = 8! = c. By symmetry, without loss of generality, we suppose that PAPBP_A \leq P_B, and hence PAcP_A \leq \sqrt{c}. We write
PA+PB=PA+cPA P_A + P_B = P_A + \frac{c}{P_A}
and PA=xP_A = x. We consider the function f(x)=x+cxf(x) = x + \frac{c}{x}, with 1xc1 \leq x \leq \sqrt{c}. The function f(x)f(x) is strictly decreasing, because for 1x<yc1 \leq x < y \leq \sqrt{c} it follows that f(x)>f(y)f(x) > f(y). Indeed, for 1x<yc1 \leq x < y \leq \sqrt{c}, we have xy<0x - y < 0, xyc<0xy - c < 0 and
f(x)f(y)=xy+c(yx)xy=(xy)(xyc)xy>0.() f(x) - f(y) = x - y + \frac{c(y-x)}{xy} = \frac{(x-y)(xy-c)}{xy} > 0. \quad (*)
Since xx is integer and it is not possible to be equal to c\sqrt{c}, the least possible value is the closest integer to c\sqrt{c}. We have 8!=2470=200\lfloor\sqrt{8!}\rfloor = \lfloor24\sqrt{70}\rfloor = 200, and so the closest integer is 248=19224 \cdot 8 = 192. Therefore the least possible value is
f(192)=192+210=402 f(192) = 192 + 210 = 402
and it can be approached, for example for the sets A={4,6,8}A = \{4,6,8\}, B={1,2,3,5,7}B = \{1,2,3,5,7\}.

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 and solution reproduced as published; topic and difficulty added by this site.