Where to place x_i's?

Let A A be a convex 61 61- gon. We then place n n points { x i } i = 1 n \{x_i\}_{i=1}^n in the interior of A A . What is the minimum number n n , such that the interior of any triangle, whose vertices are also vertices of A A , will contain at least one of the points x i x_i ?

Details and assumptions

We are free to choose where to place the points x i x_i .

The interior of the polygon does not include the edges of the polygon. The edges of the polygon are known as the boundary of the polygon. It separates the interior from the exterior.


The answer is 59.

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

2 solutions

Jp Delavin
May 20, 2014

Because the diagonals from one vertex divide a convex 61 61 -gon into 59 59 disjoint triangles, at least 59 59 points are needed. It is actually possible to choose exactly 59 59 points so that the condition is satisfied.

Let the vertices of the 61 61 -gon be P 1 , P 2 , . . . , P 61 P_1, P_2, ..., P_{61} . Mark one point on each region bounded by the diagonals P 1 P n \overline{P_1P_n} , P n P 61 \overline{P_nP_{61}} and P n 1 P n + 1 \overline{P_{n-1}P_{n+1}} for all n { 2 , 3 , . . . , 60 } n \in \{ 2,3,...,60 \} . Notice that the triangle P a P n P b P_aP_nP_b if 1 a < n < b 61 1\leq a<n<b\leq61 contains the region bounded by the diagonals P 1 P n \overline{P_1P_n} , P n P 61 \overline{P_nP_{61}} and P n 1 P n + 1 \overline{P_{n-1}P_{n+1}} , which has a marked point in it. Hence, the given construction with 59 59 points satisfies the condition.

This was the only solution submitted.

Calvin Lin Staff - 7 years ago
Calvin Lin Staff
May 13, 2014

Fix 1 vertex. The diagonals from this vertex to all the other vertices, along with the perimeter of A, would determine 59 disjoint triangles. We have to place a point in each of these triangles, and any point in a triangle would not be in any of the other disjoint triangles. Hence, we need at least 59 points.

We will show that 59 points are sufficient. Label the vertices of A A as { A i } i = 1 61 \{A_i\}_{i=1}^{61} in order. Let w i w_i be any point contained in the triangle bounded by the diagonals A 1 A i , A i 1 A i + 1 , A i A 61 A_1 A_i, A_{i-1}A_{i+1}, A_iA_{61} for i = 2 i=2 to 60 60 . This gives us a set of 59 points. Now, given any vertex triangle A p A q A r A_pA_qA_r with 1 p < q < r 61 1\leq p < q < r \leq 61 , notice that it contains the triangle bounded by A 1 A q , A q 1 A q + 1 , A q A 61 A_1 A_q, A_{q-1}A_{q+1}, A_qA_{61} , hence contains w q w_{q} . Thus, n = 59 n=59 is the minimum.

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...