Scribd
Upload
37 views2 pages

Problem Set 1 Student

The document contains a problem set for the Azerbaijan Math Olympiad 2020-2021, featuring a variety of mathematical problems across different areas including algebra, combinatorics, geometry, and number theory. Each section presents multiple problems that require proof or solution, aimed at challenging participants' mathematical reasoning and problem-solving skills. The problems range from finding functions and proving inequalities to analyzing sequences and properties of geometric figures.

Uploaded by

Emil Khalilov
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
37 views2 pages

Problem Set 1 Student

The document contains a problem set for the Azerbaijan Math Olympiad 2020-2021, featuring a variety of mathematical problems across different areas including algebra, combinatorics, geometry, and number theory. Each section presents multiple problems that require proof or solution, aimed at challenging participants' mathematical reasoning and problem-solving skills. The problems range from finding functions and proving inequalities to analyzing sequences and properties of geometric figures.

Uploaded by

Emil Khalilov
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Azerbaijan Math Olympiad Training 2020-2021

PROBLEM SET 1

Algebra
(1) Find all functions f : R → R such that
f (xf (x) + f (y)) = f 2 (x) + y
for all x, y ∈ R.
(2) Five real numbers are given such that, no matter which three of them we choose, the differ-
ence between the sum of these three numbers and the sum of the remaining two numbers is
positive. Prove that the product of all these 10 differences (corresponding to all the possible
triples of chosen numbers) is less than or equal to the product of the squares of these five
numbers.
(3) Let n ≥ 1 be a positive integer and x1 , x2 , . . . , xn be real numbers such that |xk+1 − xk | ≤ 1
for k = 1, 2, . . . , n − 1. Show that
n n
X X n2 − 1
|xk | − xk ≤ .
4
k=1 k=1

(4) Let p(x) be a polynomial with integer coefficients such that p(0) = 0 and 0 ≤ p(1) ≤ 107 ,
and such that there exist integers a, b satisfying p(a) = 1999 and p(b) = 2001. Determine
the possible values of p(1).
(5) Let a1 , a2 , . . . , an be a sequence of nonnegative real numbers, not all zero. For 1 ≤ k ≤ n,
let
ak−i+1 + ak−i+2 + · · · + ak
mk = max .
1≤i≤k i
Prove that for any α > 0, the number of integers k which satisfy mk > α is less than
a1 +a2 +···+an
α .

Combinatorics
(1) Let n ≥ 2 be a positive integer. Find the number of functions f : {1, 2, . . . , n} → {1, 2, 3, 4, 5}
which have the following property:
|f (k + 1) − f (k)| ≤ 3
for k = 1, 2, . . . , n − 1.
(2) Let a1 , a2 , . . . , a2000 be a sequence of integers each lying in the interval [−1000, 1000]. Suppose
that 2000
P
i=1 ai = 1. Show that the terms in some nonempty subsequence of a1 , a2 , . . . , a2000
sum to zero.
(3) Let G be a graph with n ≥ 4 vertices and m edges. If
√
n( 4n − 3 + 1)
m> ,
4
show that G has a 4-cycle.
(4) There are several cities in a state and a set of roads, where each road connects two cities
and no two roads connect the same pair of cities. It is known that at least 3 roads go out
of every city. Prove that there exists a cyclic path (that is, a path where the last road ends
where the first road begins) such that the number of roads in the path is not divisible by 3.
1
2 PROBLEM SET 1

(5) There are black and white checkers on some squares of a 2n × 2n board, with at most one
checker on each square. First, we remove every black checker that is in the same column
as any white checker. Next, we remove every white checker that is in the same row as any
remaining black checker. Prove that for some color, at most n2 checkers of this color remain.

Geometry
(1) Let ABCD be a quadrilateral with ∠CBD = 2∠ADB, ∠ABD = 2∠CDB, and AB = CB.
Prove that AD = CD.
(2) Let M be the intersection point of the diagonals AC and BD of a convex quadrilateral
ABCD. The bisector of angle ACD hits ray BA at K. If
M A · M C + M A · CD = M B · M D,
prove that ∠BKC = ∠CDB.
(3) The feet of the angle bisectors of triangle ABC are X, Y , and Z. The circumcircle of triangle
XY Z cuts off three segments from lines AB, BC, and CA. Prove that two of these segments’
lengths add up to the third segment’s length.
(4) A line ` is drawn through the orthocenter of acute triangle ABC. Prove that the reflections
of ` across the sides of the triangle are concurrent.
(5) Given a circle Γ, a line d is drawn not intersecting Γ. M, N are two points varying on line d
such that the circle with diameter M N is externally tangent to Γ. Prove that there exists a
point P in the plane such that for any such segment M N , ∠M P N is constant.

Number Theory
(1) Prove that it is not possible to divide any set of 18 consecutive positive integers into two
disjoint sets A and B, such that the product of the elements in A equals the product of the
elements in B.
(2) Define f (n) = n!. Let
a = 0.f (1)f (2)f (3) . . .
In other words, to obtain the decimal representation of a write the decimal representations
of f (1), f (2), f (3), . . . in a row. Is a rational?
(3) Find all positive primes p for which there exist positive integers n, x, y such that
pn = x3 + y 3 .
(4) A sequence p1 , p2 , . . . of prime numbers satisfies the following condition: for n ≥ 3, pn is the
greatest prime divisor of pn−1 + pn−2 + 2000. Prove that the sequence is bounded.
(5) Let p ≥ 3 be a prime number and a1 , a2 , . . . , ap−2 be a sequence of positive integers such
that p does not divide either ak or akk − 1 for all k = 1, 2, . . . , p − 2. Prove that the product
of some terms of the sequence is congruent to 2 modulo p.

You might also like