ESKUH3 Sss Ua J2 S 9 Exz XJ 1 W
ESKUH3 Sss Ua J2 S 9 Exz XJ 1 W
ESKUH3 Sss Ua J2 S 9 Exz XJ 1 W
2 1 1
≤ +
(a + b)(c + d) + (b + c)(a + d) (a + c)(b + d) + 4ac (a + c)(b + d) + 4bd
2
+ 9xyz ≥ 7(x + y + z)
xyz
A3 Prove that for all non-negative real numbers x, y, z, not all equal to 0, the following inequality
holds
2x2 − x + y + z 2y 2 + x − y + z 2z 2 + x + y − z
+ + ≥ 3.
x + y2 + z2 x2 + y + z 2 x2 + y 2 + z
Determine all the triples (x, y, z) for which the equality holds.
r r r r
a b c d
+ + + ≤2
b + c + d2 + a3 c + d + a2 + b3 d + a + b2 + c3 a + b + c2 + d3
a2 b2
a b
3 + ≥ 4c2 + +
b a b a
A6 Find the maximum constant C such that, whenever {an }∞ n=1 is a sequence of positive real num-
bers satisfying an+1 − an = an (an + 1)(an + 2), we have
a2023 − a2020
> C.
a2022 − a2021
AoPS Community 203 JBMO Shortlist
1
an+1 = an +
a2n
for every n = 1, 2, . . . , 249. Let x be the greatest integer which is less than
1 1 1
+ + ... +
a1 a2 a250
C1 Given is a square board with dimensions 2023 × 2023, in which each unit cell is colored blue or
red. There are exactly 1012 rows in which the majority of cells are blue, and exactly 1012 columns
in which the majority of cells are red.
What is the maximal possible side length of the largest monochromatic square?
C2 There are n blocks placed on the unit squares of a n × n chessboard such that there is exactly
one block in each row and each column. Find the maximum value k, in terms of n, such that
however the blocks are arranged, we can place k rooks on the board without any two of them
threatening each other.
(Two rooks are not threatening each other if there is a block lying between them.)
C3 Alice and Bob play the following game on a 100 × 100 grid, taking turns, with Alice starting first.
Initially the grid is empty. At their turn, they choose an integer from 1 to 1002 that is not written
yet in any of the cells and choose an empty cell, and place it in the chosen cell. When there is
no empty cell left, Alice computes the sum of the numbers in each row, and her score is the
maximum of these 100 numbers. Bob computes the sum of the numbers in each column, and
his score is the maximum of these 100 numbers. Alice wins if her score is greater than Bob’s
score, Bob wins if his score is greater than Alice’s score, otherwise no one wins.
Find if one of the players has a winning strategy, and if so which player has a winning strategy.
AoPS Community 2023 JBMO Shortlist
C4 Anna and Bob are playing the following game: The number 2 is initially written on the blackboard.
With Anna playing first, they alternately double the number currently written on the blackboard
or square it.
The person who first writes on the blackboard a number greater than 202310 is the winner. De-
termine which player has a winning strategy.
C5 Consider an increasing sequence of real numbers a1 < a2 < . . . < a2023 such that all pairwise
sums of the elements in the sequence are different. For such a sequence, denote by M the
number of pairs (ai , aj ) such that ai < aj and ai + aj < a2 + a2022 . Find the minimal and the
maximal possible value of M .
G1 Let ABC be a triangle with circumcentre O and circumcircle Ω. Γ is the circle passing through
O, B and tangent to AB at B. Let Γ intersect Ω a second time at P ̸= B. The circle passing
through P, C and tangent to AC at C intersects with Γ at M . Prove that |M P | = |M C|.
G2 Let ABC be a triangle with AB < AC and ω be its circumcircle. The tangent line to ω at A
intersects line BC at D and let E be a point on ω such that BE is parallel to AD. DE intersects
segment AB and ω at F and G, respectively. The circumcircle of BGF intersects BE at N . The
line N F intersects lines AD and EA at S and T , respectively. Prove that DGST is cyclic.
G3 Let A, B, C, D and E be five points lying in this order on a circle, such that AD = BC. The lines
AD and BC meet at a point F . The circumcircles of the triangles CEF and ABF meet again at
the point P .
Prove that the circumcircles of triangles BDF and BEP are tangent to each other.
G4 Let ABCD be a cyclic quadrilateral, for which B and C are acute angles. M and N are the
projections of the vertex B on the lines AC and AD, respectively, P and T are the projections
of the vertex D on the lines AB and AC respectively, Q and S are the intersections of the pairs
of lines M N and CD, and P T and BC, respectively. Prove the following statements:
a) N S ∥ P Q ∥ AC;
b) N P = SQ;
c) N P QS is a rectangle if, and only if, AC is a diamteter of the circumscribed circle of quadri-
lateral ABCD.
G5 Let D, E, F be the points of tangency of the incircle of a given triangle ABC with sides BC, CA, AB,
respectively. Denote by I the incenter of ABC, by M the midpoint of BC and by G the foot of
the perpendicular from M to line EF . Prove that the line ID is tangent to the circumcircle of
the triangle M GI.
G6 Let ABC be an acute triangle with circumcenter O. Let D be the foot of the altitude from A to
BC and let M be the midpoint of OD. The points Ob and Oc are the circumcenters of triangles
AOC and AOB, respectively. If AO = AD, prove that points A, Ob , M and Oc are concyclic.
AoPS Community 2023 JBMO Shortlist
G7 Let D and E be arbitrary points on the sides BC and AC of triangle ABC, respectively. The
circumcircle of △ADC meets for the second time the circumcircle of △BCE at point F . Line
F E meets line AD at point G, while line F D meets line BE at point H. Prove that lines CF, AH
and BG pass through the same point.
N1 Find all pairs (a, b) of positive integers such that a! + b and b! + a are both powers of 5.
N2 A positive integer is called Tiranian if it can be written as x2 + 6xy + y 2 , where x and y are (not
necessarily distinct) positive integers. The integer 362023 is written as the sum of k Tiranian
integers. What is the smallest possible value of k?
N3 Let A be a subset of {2, 3, . . . , 28} such that if a ∈ A, then the residue obtained when we divide
a2 by 29 also belongs to A.
Find the minimum possible value of |A|.
N4 The triangle ABC is sectioned by AD, BE and CF (where D ∈ (BC), E ∈ (CA) and F ∈ (AB))
in seven disjoint polygons named regions. In each one of the nine vertices of these regions we
write a digit, such that each nonzero digit appears exactly once. We assign to each side of a
region the lowest common multiple of the digits at its ends, and to each region the greatest
common divisor of the numbers assigned to its sides.
Find the largest possible value of the product of the numbers assigned to the regions.
N5 Find the largest positive integer k such that we can find a set A ⊆ {1, 2, . . . , 100} with k elements
such that, for any a, b ∈ A, a divides b if and only if s(a) divides s(b), where s(k) denotes the sum
of the digits of k.
Version 2. Let p ̸= 5 be a prime number such that p+1 2 is also a prime. Suppose there exist
p2 +a p2 +b
positive integers a < b such that p+a2 and p+b2 are integers. Show that b = (a − 1)2 + 1.