This website contains problems from math contests. Problems and corresponding tags were obtained from the Art of Problem Solving website.

Tags were heavily modified to better represent problems.

AND:
OR:
NO:

Found problems: 1

The Golden Digits 2024, P2

We are given an infinite set of points in the plane such that any two of them have a distance of at most one. Prove that all the axes of symmetry of this set are concurrent, provided that there are at least two of them. [i]Proposed by David Anghel[/i]