Maths Olympiad Prep

Library / /31 of 63

Algebra Difficulty 6.8 National olympiad Prove it Japan

For all quadruples (x,y,z,w)(x, y, z, w) consisting of integers 1x,y,z,w10001 \le x, y, z, w \le 1000, we consider adding up the maximum value of xy+zwxy + zw, xz+ywxz + yw, xw+yzxw + yz and denote the sum by MM. Similarly, for all quadruples (x,y,z,w)(x, y, z, w) consisting of integers 1x,y,z,w10001 \le x, y, z, w \le 1000, we consider adding up the minimum value of xy+zwxy + zw, xz+ywxz + yw, xw+yzxw + yz and denote the sum by mm. Determine the number of positive divisors of MmM - m.

Solution

20412 \boxed{20412}
For 3 real numbers a,b,ca, b, c, the difference of the maximum value and the minimum value of them is ab+bc+ca2\frac{|a-b|+|b-c|+|c-a|}{2}. Using (xy+zw)(xz+yw)=xwyz|(xy + zw) - (xz + yw)| = |x - w||y - z|, we have
Mm=12x,y,z,w=11000(xwyz+xyzw+xzyw). M - m = \frac{1}{2} \sum_{x,y,z,w=1}^{1000} \left( |x - w||y - z| + |x - y||z - w| + |x - z||y - w| \right).
Since
x,y,z,w=11000xwyz=(x,y=11000xy)2=(2d=1999d(1000d))2=(99910001001)29, \sum_{x,y,z,w=1}^{1000} |x - w||y - z| = \left( \sum_{x,y=1}^{1000} |x - y| \right)^2 = \left( 2 \sum_{d=1}^{999} d(1000 - d) \right)^2 = \frac{(999 \cdot 1000 \cdot 1001)^2}{9},
we have
Mm=32(99910001001)29=25355672112132372. M - m = \frac{3}{2} \cdot \frac{(999 \cdot 1000 \cdot 1001)^2}{9} = 2^5 \cdot 3^5 \cdot 5^6 \cdot 7^2 \cdot 11^2 \cdot 13^2 \cdot 37^2.
Therefore, the number of positive divisors of MmM - m is 6673333=204126 \cdot 6 \cdot 7 \cdot 3 \cdot 3 \cdot 3 \cdot 3 = 20412.

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.