Maths Olympiad Prep

Library / China National Olympiad /20 of 33

China National Olympiad

Algebra Difficulty 6.9 National Olympiad Find the answer

Let a=2001a=2001. Consider the set AA of all pairs of integers (m,n)(m,n) with n≠0n\neq0 such that
(i) m<2am<2a;
(ii) 2n∣(2am−m2+n2)2n|(2am-m^2+n^2);
(iii) n2−m2+2mn≤2a(n−m)n^2-m^2+2mn\leq2a(n-m).
For (m,n)∈A(m, n)\in A, let f(m,n)=2am−m2−mnn.f(m,n)=\frac{2am-m^2-mn}{n}.
Determine the maximum and minimum values of ff.

A number or a short expression. Fractions can be typed as 3/2, and spacing doesn't matter.

Solution

Let a=2001 a = 2001 . Consider the set A A of all pairs of integers (m,n)(m, n) with n≠0 n \neq 0 such that:
1. m<2a m < 2a ,
2. 2n∣(2am−m2+n2) 2n \mid (2am - m^2 + n^2) ,
3. n2−m2+2mn≤2a(n−m) n^2 - m^2 + 2mn \leq 2a(n - m) .

For (m,n)∈A(m, n) \in A, let
f(m,n)=2am−m2−mnn. f(m, n) = \frac{2am - m^2 - mn}{n}.
We need to determine the maximum and minimum values of f f .

### Minimum Value of f f
From condition (ii), we have:
2am−m2+n22n=ℓ∈Z  ⟹  n(2ℓ−n)=m(2a−m). \frac{2am - m^2 + n^2}{2n} = \ell \in \mathbb{Z} \implies n(2\ell - n) = m(2a - m).
Thus, m≡n(mod2) m \equiv n \pmod{2} .

Using condition (iii):
ℓ=(2am−2mn)+(n2−m2+2mn)2n≤(2am−2mn)+2a(n−m)2n=a−m. \ell = \frac{(2am - 2mn) + (n^2 - m^2 + 2mn)}{2n} \leq \frac{(2am - 2mn) + 2a(n - m)}{2n} = a - m.

From this, we have:
2ℓ−n<2ℓ≤2a−2m<2a−m. 2\ell - n < 2\ell \leq 2a - 2m < 2a - m.
Using this and the previous equation, we conclude n>m n > m . Also, from condition (iii):
2mn≤2a(n−m)−(n2−m2)  ⟹  (n−m)(2a−n−m). 2mn \leq 2a(n - m) - (n^2 - m^2) \implies (n - m)(2a - n - m).

Thus, 2a−n−m>0 2a - n - m > 0 . Therefore, f(m,n)=m(2a−m−n)n>0 f(m, n) = \frac{m(2a - m - n)}{n} > 0 .

Hence, f(m,n)=2ℓ−(m+n)≡0(mod2) f(m, n) = 2\ell - (m + n) \equiv 0 \pmod{2} and f(m,n)>0 f(m, n) > 0 . Thus, we conclude f(m,n)≥2 f(m, n) \geq 2 and the equality holds for f(2,2000)=2 f(2, 2000) = 2 .

### Maximum Value of f f
Consider:
f(n−2,n)=2a(n−2)−(n−2)2−n(n−2)n=2a+6−2(n+4004n). f(n - 2, n) = \frac{2a(n - 2) - (n - 2)^2 - n(n - 2)}{n} = 2a + 6 - 2\left(n + \frac{4004}{n}\right).

To maximize this, we need to minimize n+4004n n + \frac{4004}{n} . Choosing n∣4004 n \mid 4004 such that n n and 4004n \frac{4004}{n} are as close as possible, we find n=52 n = 52 and m=50 m = 50 satisfy the conditions. Therefore, f(50,52)=3750 f(50, 52) = 3750 .

Since n>m n > m and m≡n(mod2) m \equiv n \pmod{2} , it suffices to prove that for n≥m+4 n \geq m + 4 , f(m,n)<3750 f(m, n) < 3750 :
f(m,n)=(2a−m)mn−m≤(2a−m)mm+4−m=3998−(2(m+4)+16024m+4)≤3998−232048<3640. f(m, n) = \frac{(2a - m)m}{n} - m \leq \frac{(2a - m)m}{m + 4} - m = 3998 - \left(2(m + 4) + \frac{16024}{m + 4}\right) \leq 3998 - 2\sqrt{32048} < 3640.

Thus, the maximum value of f f is 3750 3750 .

### Conclusion
The minimum value of f(m,n) f(m, n) is 2 2 , and the maximum value is 3750 3750 .

The answer is: 2 and 3750\boxed{2 \text{ and } 3750}.

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

Source: Omni-MATH, licensed Apache-2.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.