Day 1 (March 26, 2025).
Time allowed: 270 minutes.
Problem 1. For a positive integer , a set
of positive integers is called a
-Olympic set if it satisfies the following conditions simultaneously:
(i) .
(ii) For every , all positive divisors of
also belong to
.
Find all positive integers such that there is exactly one such
-Olympic set.
Problem 2. Let be a positive integer, and in a country, there are
airports. Between any two airports, there is either a direct flight or not. Given that if there is no direct flight between two airports, the difference in the number of direct flights from these two airports is exactly 2. Determine the minimum possible total number of direct flights.
Problem 3. Let be an acute non-isosceles triangle with altitudes
. From vertex
, drop perpendiculars to the lines
, denoted as
respectively. Let the line
intersect the circumcircle of triangle
again at
, and let the line
intersect the circumcircle of triangle
again at
. Prove that point
has the same power with respect to the two circles
and
.