0% found this document useful (0 votes)
14 views4 pages

çexiya 2022

The document outlines the problems presented in the Czech and Slovak Mathematical Olympiad for the 2021/2022 season, including various mathematical challenges across different rounds. It covers topics such as filling tables with specific number properties, properties of triangles and circles, sequences of integers, and combinatorial games. Additionally, it provides statistics on contestant performance in the rounds.

Uploaded by

oonurlu29
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
0% found this document useful (0 votes)
14 views4 pages

çexiya 2022

The document outlines the problems presented in the Czech and Slovak Mathematical Olympiad for the 2021/2022 season, including various mathematical challenges across different rounds. It covers topics such as filling tables with specific number properties, properties of triangles and circles, sequences of integers, and combinatorial games. Additionally, it provides statistics on contestant performance in the rounds.

Uploaded by

oonurlu29
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/ 4

Czech and Slovak

2021 / 2022

matematickaolympiada.cz skmo.sk
First Round (take-home part), October 2021

1. Is it possible to fill an n × n table with numbers 1 and 2 such that the sum of the numbers in each
column is a multiple of 5 and the sum of the numbers in each row is a multiple of 7? Solve this:
a) for n = 9, b) for n = 12. (Tomáš Bárta)

2. Let ABCD be a trapezoid (AB k CD) and denote P = BC ∩ AD. Let k1 , k2 be circles with diameters
BC, AD, respectively, and denote P = BC ∩ AD. Prove that the tangents from P to k1 form the same
angle as the tangents from P to k2 . (Patrik Bak )

3. Find all integers n > 2 such that nn−2 is an nth power of some integer. (Patrik Bak )

4. Find all triples (x, y, z) of real numbers such that

xy + 1 = z 2 ,
yz + 2 = x2 ,
zx + 3 = y 2 .

(Tomáš Jurı́k )

5. Let ABC be a scalene triangle, I its incenter and k its circumcircle. Rays BI, CI meet k again at
Sb 6= B, Sc 6= C, respectively. Prove that the tangent to k at A, the line Sb Sc , and the line through I
parallel to BC are concurrent. (Patrik Bak )

6. Consider an infinite sequence a0 , a1 , a2 . . . of integers that satisfies a0 ≥ 2 and an+1 ∈ {2an − 1, 2an + 1}
for all indices n ≥ 0. Prove that any such infinite sequence contains infinitely many composite numbers.
(Martin Melicher, Josef Tkadlec)

First Round (on-site part), December 7th, 2021

1. Find the largest integer d for which a 43 × 47 table can be filled with numbers 1 and 2 such that the
sum of the numbers in each column and in each row is a multiple of d. (Do not forget to show that no
larger d works.) (Tomáš Bárta)

2. Let ABC be an acute triangle and I its incenter. Rays BI, CI meet the circumcircle of triangle ABC
again at S 6= B, T 6= C, respectively. The segment ST meets the sides AB, AC at K, L, respectively.
Prove that AKIL is a rhombus. (Josef Tkadlec)

3. Find all pairs of positive integers a, b such that aa−b = ba . (Jaromı́r Šimša)
Second Round, January 11th, 2022

1. Is it possible to fill the 8 × 8 table with numbers 6 and 7 such that the sum of the numbers in each
column is a multiple of 5 and the sum of the numbers in each row is a multiple of 7? (Josef Tkadlec)

2. Find all triples (x, y, z) of positive real numbers such that

x2 + 2y 2 = x + 2y + 3z,
y 2 + 2z 2 = 2x + 3y + 4z,
z 2 + 2x2 = 3x + 4y + 5z.

(Patrik Bak )

3. Let ABC be an isosceles triangle with base AB and P a point on its C-altitude. Ray AP meets the
circumcircle of the triangle ABC again at Q 6= A. The line through P parallel to AB meets the side BC
at R. Prove that QR bisects the angle AQB. (Jaroslav Švrček )

4. Consider an infinite sequence a0 , a1 , a2 . . . of integers that satisfies

a0 ≥ 1 and an+1 ∈ {2022an − 1, 2022an + 1}

for all indices n ≥ 0. Prove that any such infinite sequence contains infinitely many composite numbers.
(Martin Melicher )

Final Round, March 20th–23rd, 2022

1. In a sequence of 71 nonzero real numbers, each number (apart from the first one and the last one) is
one less than the product of its two neighbors. Prove that the first and the last number are equal.
(Josef Tkadlec)

2. We say that a positive integer k is fair if the number of 2021digit palindromes that are a multiple of k is
the same as the number of 2022digit palindromes that are a multiple of k. Does the set M = {1, 2, . . . , 35}
contain more numbers that are fair or those that are not fair?
(A palindrome is an integer that reads the same forward and backward.) (David Hruška)

3. Given a scalene acute triangle ABC, let M be the midpoints of its side BC and N the midpoint of
the arc BAC of its circumcircle. Let ω be the circle with diameter BC and D, E its intersections with
the bisetor of angle BAC. Points D0 , E 0 lie on ω such that DED0 E 0 is a rectangle. Prove that D0 , E”,
M , N lie on a single circle (Patrik Bak )

4. Let ABCD be a convex quadrilateral with AB = BC = CD and P its intersection of diagonals.


Denote by O1 , O2 the circumcenters of triangles ABP , CDP , respectively. Prove that O1 BCO2 is a
parallelogram. (Patrik Bak )

5. Find all integers n such that 2n + n2 is a square of an integer. (Tomáš Jurı́k )

6. Consider any graph with 50 vertices and 225 edges. We say that a triplet of its (mutually distinct)
vertices is connected if the three vertices determine at least two edges. Determine the smallest and the
largest possible number of connected triples. (Ján Mazák, Josef Tkadlec)
Czech-Polish-Slovak Match, July 1st–4th, 2022
Guest countries: Austria, Ukraine
Institute of Science and Technology Austria (ISTA)

1. Let k ≤ 2022 be a positive integer. Alice and Bob play a game on a 2022 × 2022 board. Initially, all
cells are white. Alice starts and the players alternate. In her turn, Alice can either color one white cell in
red or pass her turn. In his turn, Bob can either color a k × k square of white cells in blue or pass his turn.
Once both players pass, the game ends and the person who colored more cells wins (a draw can occur).
For each 1 ≤ k ≤ 2022, determine which player (if any) has a winning strategy. (David Hruška)

2. Find all functions f : (0, ∞) → (0, ∞) such that


 
y+1 1
f f (x) + = +x+1
f (y) f (y)

for all x, y > 0. (Dominik Burek )

3. Circles Ω1 and Ω2 with different radii intersect at two points, denote one of them by P . A variable
line ` passing through P intersects the arc of Ω1 which is outside of Ω2 at X1 , and the arc of Ω2 which
is outside of Ω1 at X2 . Let R be the point on segment X1 X2 such that X1 P = RX2 . The tangent to Ω1
through X1 meets the tangent to Ω2 through X2 at T . Prove that line RT is tangent to a fixed circle,
independent of the choice of `. (Josef Tkadlec)

4. Given a positive integer n, denote by τ (n) the number of positive divisors of n, and by σ(n) the sum
of all positive divisors of n. Find all positive integers n satisfying
l√ m
σ(n) = τ (n) · n .

(Here, dxe denotes the smallest integer not less than x.) (Michael Reitmeir )

5. Let ABC be a triangle with AB < AC and circumcenter O. The angle bisector of ∠BAC meets the
side BC at D. The line through D perpendicular to BC meets the segment AO at X. Furthermore, let Y
be the midpoint of segment AD. Prove that points B, C, X, Y lie on a single circle. (Karl Czakler )

6. Consider 26 letters A, . . . , Z. A string is a finite sequence consisting of those letters. We say that a
string s is nice if it contains each of the 26 letters at least once, and each permutation of letters A, . . . , Z
occurs in s as a subsequence the same number of times. Prove that:

(a) There exists a nice string.

(b) Any nice string contains at least 2022 letters.

(Here, a permutation π of the 26 letters is a subsequence of a string s = s1 s2 s3 . . . if there exist 26 indices


i1 < i2 < · · · < i26 such that π = si1 si2 . . . si26 .) (Václav Rozhoň)

Statistics.
Second Round: 193 contestants, maximum score (6, 6, 6, 6), mean scores (5.26, 4.42, 1.95, 0.87).
Final Round: 49 contestants, maximum score (7, 7, 7, 7, 7, 7), mean scores (6.04, 4.78, 1.78, 4.82, 3.33, 0.86).
CPS Match: 30 contestants, maximum score (7, 7, 7, 7, 7, 7), mean scores (6.33, 2.17, 0.93, 6.13, 4.27, 0.60).

You might also like