Maths Olympiad Prep

Library / /5 of 20

Geometry Difficulty 5.5 AIME, harder Prove it China

Let P0,P1,P2,,PnP_0, P_1, P_2, \dots, P_n be n+1n+1 points on a plane, and the minimum distance between each two points of them is dd (d>0d > 0). Prove
P0P1P0P2P0Pn>(d3)n(n+1)! | P_0 P_1 | \cdot | P_0 P_2 | \cdots | P_0 P_n | > \left( \frac{d}{3} \right)^n \sqrt{(n+1)!}

Solutions — 2

Solution 1

We may assume that P0P1P0P2P0Pn|P_0P_1| \le |P_0P_2| \le \dots \le |P_0P_n|.
At first, we will prove that P0Pk>d3k+1|P_0P_k| > \frac{d}{3}\sqrt{k+1} for any positive integer nn.
Obviously, P0Pkdd3k+1|P_0P_k| \ge d \ge \frac{d}{3}\sqrt{k+1} for k=1,2,,8k = 1, 2, \dots, 8, and the second equality holds only when k=8k = 8. Then we only need to prove that P0Pkdd3k+1|P_0P_k| \ge d \ge \frac{d}{3}\sqrt{k+1} for k9k \ge 9.
Take each PiP_i (i=0,1,2,,ki = 0, 1, 2, \dots, k) as the center to draw a circle with radius d2\frac{d}{2}. Then these circles are either externally tangent to or apart from each other. Take P0P_0 as the center to draw a circle with radius P0Pk+d2|P_0P_k| + \frac{d}{2}. Then the previous k+1k+1 smaller circles are all located in this larger one.
Then π(P0Pk+d2)2>(k+1)π(d2)2\pi(|P_0P_k| + \frac{d}{2})^2 > (k+1)\pi(\frac{d}{2})^2, from which we have P0Pk>d2(k+11)|P_0P_k| > \frac{d}{2}(\sqrt{k+1} - 1).
It is easy to check that k+112>k+13\frac{\sqrt{k+1}-1}{2} > \frac{\sqrt{k+1}}{3} for k9k \ge 9.
Then P0Pk>d3k+1|P_0P_k| > \frac{d}{3}\sqrt{k+1} for k9k \ge 9.
Over all, we have P0Pk>d3k+1|P_0P_k| > \frac{d}{3}\sqrt{k+1} for k9k \ge 9.
Therefore,
P0P1P0P2P0Pn>(d3)n(n+1)! |P_0P_1| \cdot |P_0P_2| \cdots |P_0P_n| > \left(\frac{d}{3}\right)^n \sqrt{(n+1)!}

Solution 2

We may assume P0P1P0P2P0Pn|P_0P_1| \le |P_0P_2| \le \cdots \le |P_0P_n|.
Take each PiP_i (i=0,1,2,,ki = 0, 1, 2, \dots, k) as the center to draw a circle with radius d2\frac{d}{2}. Then these circles are either externally tangent to or apart from each other.
Let QQ be any point on Pi\odot P_i. Since
P0QP0Pi+PiQ=P0Pi+d2P0Pk+12P0Pk=32P0Pk, \begin{aligned} |P_0Q| &\le |P_0P_i| + |P_iQ| = |P_0P_i| + \frac{d}{2} \\ &\le |P_0P_k| + \frac{1}{2} |P_0P_k| = \frac{3}{2} |P_0P_k|, \end{aligned}
we get that the circle with center P0P_0 and radius 32P0Pk\frac{3}{2} |P_0P_k| cover the previous k+1k+1 smaller circles. Then we have π(32P0Pk)2>(k+1)π(d2)2\pi(\frac{3}{2} |P_0P_k|)^2 > (k+1)\pi(\frac{d}{2})^2, and that is
P0Pk>d3k+1(i=0,1,2,,k). | P_0 P_k | > \frac{d}{3} \sqrt{k+1} \quad (i = 0, 1, 2, \dots, k).
Therefore,
P0P1P0P2P0Pn>(d3)n(n+1)! | P_0 P_1 | \cdot | P_0 P_2 | \cdots | P_0 P_n | > \left(\frac{d}{3}\right)^n \sqrt{(n+1)!}

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.