Home Competitions JBMO 2026
JBMO 2026
Junior Balkan Mathematical Olympiad 2026.
Official paper Print the paper
The official paper in 1 language English
Problem 1
Let a , b , c a, b, c a , b , c be positive real numbers such that
a 2 + b 2 + c 2 ≥ 3. a^2 + b^2 + c^2 \geq 3. a 2 + b 2 + c 2 ≥ 3.
Prove that
a 4 a 2 + 2 b + 2 c + b 4 b 2 + 2 c + 2 a + c 4 c 2 + 2 a + 2 b ≥ 3 5 . \frac{a^4}{a^2 + 2b + 2c} + \frac{b^4}{b^2 + 2c + 2a} + \frac{c^4}{c^2 + 2a + 2b} \geq \frac{3}{5}. a 2 + 2 b + 2 c a 4 + b 2 + 2 c + 2 a b 4 + c 2 + 2 a + 2 b c 4 ≥ 5 3 .
Problem 2
Determine all pairs ( a , b ) (a, b) ( a , b ) of positive integers such that
( a + 1 ) divides ( b + 2 ) and b divides 2 a 2 . (a + 1) \text{ divides } (b + 2) \quad \text{and} \quad b \text{ divides } 2a^2. ( a + 1 ) divides ( b + 2 ) and b divides 2 a 2 .
Problem 3
Let n ≥ 3 n \geq 3 n ≥ 3 be an integer. There are n n n colored lamps arranged in a circle. Pressing the button of a lamp once changes its color as follows:
green → \rightarrow → red,
red → \rightarrow → blue,
blue → \rightarrow → green.
Initially, all lamps are colored red. Aladdin makes moves on these lamps. Each move consists of the following three steps:
he chooses a lamp L, without pressing its button;
he presses the button of the clockwise neighbor of L once;
he presses the button of the counterclockwise neighbor of L twice.
For each n n n , determine the maximum possible number of lamps that are colored green simultaneously, after finitely many moves.
Problem 4
Let A B C ABC A B C be a triangle with A B ≠ A C AB \neq AC A B = A C and let I I I be its incenter. Let P P P and Q Q Q be points inside triangle A B C ABC A B C such that P B = P C > Q C = Q B PB = PC > QC = QB P B = P C > QC = QB . Lines B P BP B P and C Q CQ C Q meet at X X X . Suppose that line A I AI A I is tangent to the circumcircle of triangle I P Q IPQ I P Q . Prove that the circumcircles of triangles A B Q , A C P ABQ, ACP A B Q , A C P and P Q X PQX P QX have a common point.