Difference between revisions of "1999 IMO Problems/Problem 1"
(→Solution) |
(→Solution) |
||
| Line 11: | Line 11: | ||
Now to prove it with some numbers: | Now to prove it with some numbers: | ||
| − | Let <math>S=\left\{ P_{1},P_{2},...,P_{n} \right\}</math>, with <math>n\ge 3</math>, where <math>P_{i}</math> is a vertex of a polygon which we can define their <math>xy</math> coordinates as: <math>P_{i}=\left\langle Rcos\left( \frac{2\pi}{n}i \right),Rsin\left( \frac{2\pi}{n}i \right) \right\rangle</math> | + | Let <math>S=\left\{ P_{1},P_{2},...,P_{n} \right\}</math>, with <math>n\ge 3</math>, where <math>P_{i}</math> is a vertex of a polygon which we can define their <math>xy</math> coordinates as: <math>P_{i}=\left\langle Rcos\left( \frac{2\pi}{n}i \right),Rsin\left( \frac{2\pi}{n}i \right) \right\rangle</math> That should define the vertices of any regular polygon with <math>R</math> being the radius of the circumscircle of the polygon. |
{{alternate solutions}} | {{alternate solutions}} | ||
Revision as of 20:35, 12 November 2023
Problem
Determine all finite sets 
of at least three points in the plane which satisfy the following condition:
For any two distinct points 
and 
in , the perpendicular bisector of the line segment 
is an axis of symmetry of .
Solution
Upon reading this problem and drawing some points, one quickly realizes that the set consists of all the vertices of any regular polygon.
Now to prove it with some numbers:
Let 
, with 
, where 
is a vertex of a polygon which we can define their 
coordinates as: 
That should define the vertices of any regular polygon with 
being the radius of the circumscircle of the polygon.
Alternate solutions are always welcome. If you have a different, elegant solution to this problem, please add it to this page.
