Find all integers n≤3 such that there is a set Sn formed by n points of the plane that satisfy the following two conditions: Any three points are not collinear. No point is found inside the circle whose diameter has ends at any two points of Sn. NOTE: The points on the circumference are not considered to be inside the circle.
Problem
Source: Cono Sur 1996, Problem 6
Tags: cono sur, combinatorics, geometry
09.05.2018 02:05
Let the convex polygon of n points by C Then first noticing that a point P is inside the circle with diameter AB ⇔ ∠APB>π2 So convex polygon C satisfies condition so defining the number of vertices of C by m π⋅(m−2)≤m⋅π2 Solving this equation m≤4 Now suppose there exists a point Q inside the polygon. Then making polygon into n−2 triangle, at least one area △ABC posseses Q Then ∠APB+∠BPC+∠CPA=2π Contradiction So n=3,4 Equality holds for regular triangle and square
09.05.2018 02:07
n=3,4,5. Constructions are obvious: take equilateral triangle, square, and square plus center. Suppose n≥6. If convex hull has at least 5 vertices, then its average angle is ≥108∘, so at least one angle is obtuse, clearly a contradiction. Thus convex hull has at most 4 vertices. If convex hull is triangle ABC, then there is a point P inside it. At least one of ∠APB,∠BPC,∠CPA is at least 120∘, or obtuse, contradiction. If convex hull is quadrilateral ABCD, then it has all four right angles (since none are obtuse). Any point P inside ABCD satisfies ∠APB=∠BPC=∠CPD=∠DPA=90∘ for same reason. There is at most one such point, the intersection of circles of diameters AB and BC that is not B, so n≤5. This completes the casework and the proof that n=3,4,5.
09.05.2018 02:30
suli wrote: n=3,4,5. Constructions are obvious: take equilateral triangle, square, and square plus center. But isn't the square plus center not true? Take the diameter that is a diagonal of the square, then the center is in this circle.
14.07.2018 05:02
also here