Scribd
Upload
116 views3 pages

Problem Set 3 Student

The document is a problem set for the Azerbaijan Math Olympiad for the 2020-2021 academic year, containing various mathematical problems across different topics including Algebra, Combinatorics, Geometry, and Number Theory. Each section presents multiple problems that challenge students to apply their mathematical reasoning and problem-solving skills. The problems range from inequalities and function properties to combinatorial configurations and geometric proofs.

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
116 views3 pages

Problem Set 3 Student

The document is a problem set for the Azerbaijan Math Olympiad for the 2020-2021 academic year, containing various mathematical problems across different topics including Algebra, Combinatorics, Geometry, and Number Theory. Each section presents multiple problems that challenge students to apply their mathematical reasoning and problem-solving skills. The problems range from inequalities and function properties to combinatorial configurations and geometric proofs.

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/ 3

Azerbaijan Math Olympiad Training 2020-2021

PROBLEM SET 3

Algebra
(1) Compute the sum
101
X x3i
S=
i=0
1 − 3xi + 3x2i
i
where xi = 101 for i = 0, 1, . . . , 101.
(2) Prove the inequality
sinn (2x) + (sinn x − cosn x)2 ≤ 1.
(3) Let n ≥ 3 be an integer. Prove that for positive numbers x1 ≤ x2 ≤ · · · ≤ xn ,
xn x1 x1 x2 xn−1 xn
+ + ··· + ≥ x1 + x2 + · · · + xn
x2 x3 x1
(4) (a) Prove that for each positive integer n, the number of ordered pairs (x, y) of integers
satisfying
x2 − xy + y 2 = n
is finite and divisible by 6.
(b) Find all ordered pairs (x, y) of integers satisfying
x2 − xy + y 2 = 727.
(5) Let f : R → R be a function such that
|f (x + y) − f (x) − f (y)| ≤ 1
for all x, y ∈ R. Show that there exists a function g : R → R with
|f (x) − g(x)| ≤ 1
for all x ∈ R, and with g(x + y) = g(x) + g(y) for all x, y ∈ R.

Combinatorics
(1) (a) Find a set A of ten positive integers such that no six distinct elements of A have a sum
which is divisible by 6.
(b) Is it possible to find such a set if ”ten” is replaced by ”eleven”?
(2) Find the smallest positive integer n such that if n unit squares of a 1000 × 1000 unit-square
board are colored, then there will exist three colored unit squares whose centers form a right
triangle with legs parallel to the edges of the board.
(3) One hundred points are chosen in the coordinate plane. Show that at most 2025 = 452
rectangles with vertices among these points have sides parallel to the axes.
(4) What is the smallest number of weighings on a balance scale needed to identify the individual
weights of a set of objects known to weigh 1, 3, 32 , . . . , 326 in some order? (The balance scale
reports the weight of the objects in the left pan, minus the weight of the objects in the right
pan.)
1
2 PROBLEM SET 3

(5) A table tennis club wishes to organize a doubles tournament, a series of matches where in
each match one pair of players competes against a pair of two different players. Let a player’s
match number for a tournament be the number of matches he or she participates in. We
are given a set A = {a1 , a2 , . . . , ak } of distinct positive integers all divisible by 6. Find with
proof the minimal number of players among whom we can schedule a doubles tournament
such that
(i) each participant belongs to at most 2 pairs;
(ii) any two different pairs have at most 1 match against each other;
(iii) if two participants belong to the same pair, they never compete against each other; and
(iv) the set of the participants’ match numbers is exactly A.

Geometry
(1) Two intersecting circles C1 and C2 have a common tangent which touches C1 at P and C2
at Q. The two circles intersect at M and N . Prove that the triangles M N P and M N Q
have equal areas.
(2) P, Q, R, S are the midpoints of sides BC, CD, DA, AB, respectively, of convex quadrilateral
ABCD. Prove that
4(AP 2 + BQ2 + CR2 + DS 2 ) ≤ 5(AB 2 + BC 2 + CD2 + DA2 ).
(3) Two circles C1 and C2 intersect at two points P and Q. The common tangent of C1 and
C2 closer to P than to Q touches C1 and C2 at A and B, respectively. The tangent to C1
at P intersects C2 at E (distinct from P ) and the tangent to C2 at P intersects C1 at F
(distinct from P ). Let H and K be two points on the rays AF and BE, respectively, such
that AH = AP , BK = BP . Prove that the five points A, H, Q, K, B lie on the same
(4) Let AA1 , BB1 , CC1 be the altitudes of an acute triangle ABC. The points A2 and C2 on
line A1 C1 are such that line CC1 bisects A2 B1 and line AA1 bisects C2 B1 . Lines A2 B1 and
AA1 meet at K, and lines C2 B1 and CC1 meet at L. Prove that lines KL and AC are
parallel.
(5) Let D be the midpoint of base AB of the isosceles acute triangle ABC. Choose a point
E on AB, and let O be the circumcenter of triangle ACE. Prove that the line through
D perpendicular to DO, the line through E perpendicular to BC, and the line through B
parallel to AC are concurrent.

Number Theory
(1) Find all positive integers N whose only prime divisors are 2 and 5, such that the number
N + 25 is a perfect square.
(2) Does there exist a 30-digit number such that the number obtained by taking any five of its
consecutive digits is divisible by 13?
(3) A positive integer is called monotonic if its digits in base 10, read from left to right, are in
nondecreasing order. Prove that for each n ∈ N, there exists an n-digit monotonic number
which is a perfect square.
(4) Let rad(1) = 1, and for k > 1 let rad(k) equal the product of the prime divisors of k. A
sequence of natural numbers a1 , a2 , . . . with arbitrary first term a1 is defined recursively by
the relation
an+1 = an + rad(an ).
PROBLEM SET 3 3

Show that for any positive integer N , the sequence a1 , a2 , . . . contains some N consecutive
terms in arithmetic progression.
(5) Given the binary representation of an odd positive integer a, determine a simple algorithm
to determine the least positive integer n such that 22000 is a divisor of an − 1.

You might also like