GeometryDifficulty 6.4National olympiadFind the answer
Since human bodies are 3-dimensional, if one spectator's position is near another spectator's path of view, then the second one's sight will be blocked by the first one. Suppose that for different i,j, if the circle centered at Pi with radius 61 meter intersects with segment KPj, then Aj 's sight will be blocked by Ai, and Aj could not see the entire show. Which of the following statement is true?
Pick one
Solution
The answer is B. For 60 residents, sincesin60π>101sin6π=201, the side length of a regular 60 -gon inscribed in C is not less than 1 meter. Therefore, P1,P2,…,P60 may be all vertices of this polygon. For different i,j, the distance from Pi to KPj is not less than 10sin30π meter. Since sin30π>51sin6π=101, all residents could see the entire show. On the other hand, if there are 800 residents, we draw rays KP1,KP2,…,KP800. If two of them (called KPi,KPj ) coincide, and KPj>KPi, then Aj 's sight line is blocked by Ai. Suppose no two rays coincide, we first prove that if an angle ∠PiKPj satisfies ∠PiKPj≤121(KPi1+KPj1) (the unit of angle is rad, and the unit of length is meter), then the sight line of one of Ai,Aj is blocked by the other. Without loss of generality we suppose KPi≤KPj. Since KPi,KPj≥10, we get that ∠PiKPj≤601, so it is acute. Therefore, the foot point from Pi to KPj is inside segment KPj, and the distance from Pi to KPj is KPisin∠PiKPj<KPi⋅∠PiKPj≤12KPi(KPi1+KPj1)≤61 So, Aj 's sight line is blocked by Ai. Note that KP1,KP2,…,KP800 cut the perigon with vertex K to 800 angles, and their sum is 2π, but the sum of all 121(KPi1+KPj1) is ∑121(KPi1+KPj1)=61i=1∑800KPi1≥61i=1∑800i+991 (from the conclusion of (1)) =61m=100∑899m1≥61m=100∑899(∫mm+1x1dx) (since x1 is a decreasing function) =61∫100900x1dx=3900−100=320>2π Therefore, there exist an angle ∠PiKPj satisfies ∠PiKPj≤121(KPi1+KPj1), and some of the residents could not see the entire show.
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.