Maths Olympiad Prep

Library / /4 of 11

Geometry Difficulty 6.3 National olympiad Find the answer

One day, there is a Street Art Show at somewhere, and there are some spectators around. We consider this place as an Euclidean plane. Let KK be the center of the show. And name the spectators by A1,A2,,An,A_{1}, A_{2}, \ldots, A_{n}, \ldots They pick their positions P1,P2,,Pn,P_{1}, P_{2}, \ldots, P_{n}, \ldots one by one. The positions need to satisfy the following three conditions simultaneously. (i) The distance between KK and AnA_{n} is no less than 10 meters, that is, KPn10 mK P_{n} \geq 10 \mathrm{~m} holds for any positive integer nn. (ii) The distance between AnA_{n} and any previous spectator is no less than 1 meter, that is, PmPn1 mP_{m} P_{n} \geq 1 \mathrm{~m} holds for any n2n \geq 2 and any 1mn11 \leq m \leq n-1. (iii) AnA_{n} always choose the position closest to KK that satisfies (i) and (ii), that is, KPnK P_{n} reaches its minimum possible value. If there are more than one point that satisfy (i) and (ii) and have the minimum distance to K,AnK, A_{n} may choose any one of them. For example, A1A_{1} is not restricted by (ii), so he may choose any point on the circle CC which is centered at KK with radius 10 meters. For A2A_{2}, since there are lots of points on CC which are at least 1 meter apart from P1P_{1}, he may choose anyone of them. (1) Which of the following statement is true? (A) There exist positive real numbers c1,c2c_{1}, c_{2} such that for any positive integer nn, no matter how A1,A2,,AnA_{1}, A_{2}, \ldots, A_{n} choose their positions, c1KPnc2c_{1} \leq K P_{n} \leq c_{2} always hold (unit: meter); (B) There exist positive real numbers c1,c2c_{1}, c_{2} such that for any positive integer nn, no matter how A1,A2,,AnA_{1}, A_{2}, \ldots, A_{n} choose their positions, c1nKPnc2nc_{1} \sqrt{n} \leq K P_{n} \leq c_{2} \sqrt{n} always hold (unit: meter); (C) There exist positive real numbers c1,c2c_{1}, c_{2} such that for any positive integer nn, no matter how A1,A2,,AnA_{1}, A_{2}, \ldots, A_{n} choose their positions, c1nKPnc2nc_{1} n \leq K P_{n} \leq c_{2} n always hold (unit: meter); (D) There exist positive real numbers c1,c2c_{1}, c_{2} such that for any positive integer nn, no matter how A1,A2,,AnA_{1}, A_{2}, \ldots, A_{n} choose their positions, c1n2KPnc2n2c_{1} n^{2} \leq K P_{n} \leq c_{2} n^{2} always hold (unit: meter).

A number or a short expression. Spacing and $ signs are ignored.

Solution

The answer is B. Suppose the length of KPnK P_{n} is dnd_{n} meters. We consider the discs centered at P1,P2,,Pn1P_{1}, P_{2}, \ldots, P_{n-1} with radius 1 meter. Use the property of PnP_{n} we get that these discs and the interior of CC cover the disc centered at KK with radius dnd_{n}, so πdn2(n1)π12+π102 \pi \cdot d_{n}^{2} \leq(n-1) \cdot \pi \cdot 1^{2}+\pi \cdot 10^{2} It follows that dnn+99100n=10n d_{n} \leq \sqrt{n+99} \leq \sqrt{100 n}=10 \sqrt{n} On the other hand, we consider the discs centered at P1,P2,,PnP_{1}, P_{2}, \ldots, P_{n} with radius 12\frac{1}{2} meter. Since the distance between any two of P1,P2,,PnP_{1}, P_{2}, \ldots, P_{n} is not less than 1 meter, all these discs do not intersect. Note that every length of KP1,KP2,,KPnK P_{1}, K P_{2}, \ldots, K P_{n} is not more than dnd_{n} meter (If the length of KPmK P_{m} is more than dnd_{n} meter, then AmA_{m} can choose PnP_{n}, which is closer to KK, contradiction.) So all these discs are inside the circle centered at KK with radius dn+12d_{n}+\frac{1}{2}, and π(dn+12)2nπ(12)2 \pi\left(d_{n}+\frac{1}{2}\right)^{2} \geq n \cdot \pi \cdot\left(\frac{1}{2}\right)^{2} So dnn212 d_{n} \geq \frac{\sqrt{n}}{2}-\frac{1}{2} For n=1,d1=10n=1, d_{1}=10; For n2n \geq 2, we have that 12<2n5\frac{1}{2}<\frac{2 \sqrt{n}}{5}, so dn>n22n5=n10 d_{n}>\frac{\sqrt{n}}{2}-\frac{2 \sqrt{n}}{5}=\frac{\sqrt{n}}{10} Therefore, n10dn10n\frac{\sqrt{n}}{10} \leq d_{n} \leq 10 \sqrt{n}, (B) is correct.

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