Maths Olympiad Prep

Library / /502 of 520

Geometry Difficulty 6.0 National olympiad Prove it

1. On the coordinate plane, points with integer coordinates form the vertices of unit squares, which are colored in two alternating colors (like a chessboard).

For any pair of positive integers mm and nn, consider a right-angled triangle whose vertices have integer coordinates, with the lengths of the two legs being mm and nn, and the two legs lying on the edges of these unit squares.

Let S1S_{1} be the total area of all the black parts in this triangular region, and S2S_{2} be the total area of all the white parts. Let f(m,n)=S1S2f(m, n)=\left|S_{1}-S_{2}\right|.
(a) When mm and nn are both positive even numbers or both positive odd numbers, calculate the value of f(m,n)f(m, n);
(b) Prove that f(m,n)12max{m,n}f(m, n) \leqslant \frac{1}{2} \max \{m, n\} for all mm and nn;
(c) Prove that there does not exist a constant cc such that the inequality f(m,n)<cf(m, n)<c holds for all mm and nn.

Solution

Solution: (a) Let ABC\triangle A B C be a right-angled triangle, with its vertices having integer coordinates, and the two legs lying on the sides of these square grids. Let A=90,AB=m,AC=n\angle A=90^{\circ}, A B=m, A C=n. Consider the rectangle ABCDA B C D as shown in Figure 1.
For a polygon
PP, let S1(P)S_{1}(P) be the total
area of all the black parts
inside PP, and S2(P)S_{2}(P) be the total area of all the white parts.

When mm and nn are both even or both odd, the black parts of ABCDA B C D are symmetric about the midpoint of the hypotenuse BCB C. Therefore,
S1(ABC)=S1(BCD),S2(ABC)=S2(BCD). \begin{array}{l} S_{1}(A B C)=S_{1}(B C D), \\ S_{2}(A B C)=S_{2}(B C D) . \end{array}

Thus,
f(m,n)=Si(ABC)S2(ABC)!=12S1(ABCD)S2(ABCD); \begin{aligned} f(m, n) & =\mid S_{\mathrm{i}}(A B C)-S_{2}(A B C)! \\ & \left.=-\frac{1}{2} \right\rvert\, S_{1}(A B C D)-S_{2}(A B C D) ; \end{aligned}
When mm and nn are both odd, f(m,n)=12f(m, n)=\frac{1}{2}.
(b) If mm and nn are both even or both odd, the conclusion follows from (a). Hence, we can assume mm is odd and nn is even. As shown in Figure 2, consider the point LL on ABA B such that AL=m1A L=m-1.
Since m1m-1 is even, we have f(m1,n)=0f(m-1, n)=0, i.e.,
S1(ALC)=S2(ALC). Therefore, f(m,n)=S1(ABC)S2(ABC)=S1(LBC)S2(LBC) the area of LBC=n212max{m,n} \begin{array}{l} S_{1}(A L C)=S_{2}(A L C) \text {. Therefore, } \\ f(m, n)=\left|S_{1}(A B C)-S_{2}(A B C)\right| \\ =\left|S_{1}(L B C)-S_{2}(L B C)\right| \\ \leqslant \text { the area of } \triangle L B C =\frac{n}{2} \leqslant \frac{1}{2} \max \{m, n\} \text {. } \\ \end{array}
(c) We calculate the value of f(2k+1,2k)f(2 k+1,2 k). As in (b), consider the point LL on ABA B such that AL=2kA L=2 k. Since f(2k,2k)=0f(2 k, 2 k)=0 and S1(ALC)=S2(ALC)S_{1}(A L C)=S_{2}(A L C), we have
f(2k+1,2k)=S1(LBC)S2(LBC)LBC f(2 k+1,2 k)=\left|S_{1}(L B C)-S_{2}(L B C)\right| \cdot \triangle L B C

The area of LBC\triangle L B C is kk. Without loss of generality, we can assume the diagonal LCL C lies entirely in the black squares
(see Figure 3). Thus, the white part of LBC\triangle L B C consists of several triangles:
BLN2k\triangle B L N_{2 k},
M2k1I2k1N2k1,,M1L1N1, each of which is  \begin{array}{l} \triangle M_{2 k-1} I_{2 k-1} \mid N_{2 k-1}, \cdots, \\ \triangle M_{1} L_{1} N_{1} \text {, each of which is } \end{array}

similar to BAC\triangle B A C. Their total area is
Figure 2
=122k2k+1((2k2k)2+(2k12k)2++(12k)2)=14k(2k+1)(12+22++(2k)2)=4k+112 \begin{array}{l} =\frac{1}{2} \frac{2 k}{2 k+1}\left(\left(\frac{2 k}{2 k}\right)^{2}+\left(\frac{2 k-1}{2 k}\right)^{2}+\cdots+\left(\frac{1}{2 k}\right)^{2}\right) \\ =\frac{1}{4 k(2 k+1)}\left(1^{2}+2^{2}+\cdots+(2 k)^{2}\right) \\ =\frac{4 k+1}{12} \end{array}

Therefore, the total area of the black part is
S1(LBC)=k112(4k+1)=112(8k1). S_{1}(L B C)=k-\frac{1}{12}(4 k+1)=\frac{1}{12}(8 k-1) .

Finally, we get
f(2k+1,2k)=2k16. f(2 k+1,2 k)=\frac{2 k-1}{6} .

This function can take arbitrarily large values.

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: NuminaMath-1.5, licensed Apache-2.0. Statement and solution reproduced as published; topic and difficulty added by this site.