2018 Bulgaria National Olympiad

1. Let n be an odd positive integer.Let M be a set of n positive integers ,which

are 2x2 different. A set T ∈ M is called ”good” if the product of its elements
is divisible by the sum of the elements in M , but is not divisible by the square
of the same sum. Given that M is ”good”,how many ”good” subsets of M can
there be?

2. Let ABCD be a cyclic quadrilateral. Let H1 be the orthocentre of triangle

ABC. Point A1 is the image of A after reflection about BH1 . Point B1 is
the image of of B after reflection about AH1 . Let O1 be the circumcentre of
(A1 B1 H1 ). Let H2 be the orthocentre of triangle ABD. Point A2 is the image
of A after reflection about BH2 . Point B2 is the image of of B after reflection
about AH2 . Let O2 be the circumcentre of (A2 B2 H2 ). Lets denote by ℓAB
be the line through O1 and O2 . ℓAD ,ℓBC ,ℓCD are defined analogously. Let
M = ℓAB ∩ ℓBC , N = ℓBC ∩ ℓCD , P = ℓCD ∩ ℓAD ,Q = ℓAD ∩ ℓAB . Prove that
M N P Q is cyclic.

3. Prove that
6 √ 5 √
( ) 3>( ) 2
5 4
.

4. Let ABCD be a quadrilateral ,circumscribed about a circle. Let M be a point

on the side AB. Let I1 ,I2 and I3 be the incentres of triangles AM D, CM D
and BM C respectively. Prove that I1 I2 I3 M is circumscribed.

5. Given a polynomial P (x) = ad xd + . . . + a2 x2 + a0 with positive integers for

coefficients and degree d ≥ 2. Consider the sequence defined by

b1 = a0 , bn+1 = P (bn )

for n ≥ 1 . Prove that for all n ≥ 2 there exists a prime p such that p divides
bn but does not divide b1 b2 . . . bn−1 .

6. On a planet there are M countries and N cities. There are two-way roads
between some of the cities. It is given that:
(1) In each county there are at least three cities;
(2) For each country and each city in the country is connected by roads with
at least half of the other cities in the countries;

www.artofproblemsolving.com/community/c642433
Contributors: Lamp909
 2018 Bulgaria National Olympiad

(3) Each city is connceted with exactly one other city ,that is not in its country;
(4) There are at most two roads between cities from cities in two different
countries;
(5) If two countries contain less than 2M cities in total then there is a road
between them.
N
Prove that there is cycle of lenght at least M + 2.

www.artofproblemsolving.com/community/c642433
Contributors: Lamp909