2024 ISL

1 Algebra
1.1 A1
Determine all real numbers α such that, for every positive integer n, the integer

⌊α⌋ + ⌊2α⌋ + · · · + ⌊nα⌋

is a multiple of n. (Note that ⌊z⌋ denotes the greatest integer less than or equal to
z. For example, ⌊−π⌋ = −4 and ⌊2⌋ = ⌊2.9⌋ = 2.)

1.2 A2
Let n be a positive integer. Find the minimum possible value of

S = 20 x20 + 21 x21 + · · · + 2n x2n ,

where x0 , x1 , . . . , xn are nonnegative integers such that x0 + x1 + · · · + xn = n.

1.3 A3
Decide whether for every sequence (an ) of positive real numbers,
3a1 +3a2 +···+3an 1
(2a1 +2a2 +···+2an )2 < 2024

is true for at least one positive integer n.

1.4 A4
Let Z>0 be the set of all positive integers. Determine all subsets S of {20 , 21 , 22 , . . .}
for which there exists a function f : Z>0 → Z>0 such that

S = {f (a + b) − f (a) − f (b) | a, b ∈ Z>0 }.

1.5 A5
Find all periodic sequence a1 , a2 , . . . of real numbers such that the following con-
ditions hold for all n ≥ 1:

an+2 + a2n = an + a2n+1 and |an+1 − an | ≤ 1.

1
1.6 A6
Let a0 , a1 , a2 , . . . be an infinite strictly increasing sequence of positive integers such
that for each n ≥ 1 we have
 
an−1 + an+1 √
an ∈ , an−1 · an+1 .
2
Let b1 , b2 , . . . be an infinite sequence of letters defined as
(
A if an = 21 (an−1 + an+1 )
bn =
G otherwise.
Prove that there exist positive integers n0 and d such that for all n ≥ n0 we have
bn+d = bn .

1.7 A7
Let Q be the set of rational numbers. A function f : Q → Q is called aquaesulian
if the following property holds: for every x, y ∈ Q,

f (x + f (y)) = f (x) + y or f (f (x) + y) = x + f (y).

Show that there exists an integer c such that for any aquaesulian function f there
are at most c different rational numbers of the form f (r) + f (−r) for some rational
number r, and find the smallest possible value of c.

1.8 A8
Let p ̸= q be coprime positive integers. Determine all infinite sequences a1 , a2 , . . .
of positive integers such that the following conditions hold for all n ≥ 1:

max(an , an+1 , . . . , an+p ) − min(an , an+1 , . . . , an+p ) = p

2 Combinatorics
2.1 C1
Let n be a positive integer. A class of n students run n races, in each of which
they are ranked with no draws. A student is eligible for a rating (a, b) for positive
integers a and b if they come in the top b places in at least a of the races. Their
final score is the maximum possible value of a − b across all ratings for which they
are eligible.
Find the maximum possible sum of all the scores of the n students.

2
2.2 C2
Let n be a positive integer. The integers 1, 2, 3, . . . , n2 are to be written in the
cells of an n × n board such that each integer is written in exactly one cell and each
cell contains exactly one integer. For every integer d with d | n, the d-[i]division[/i]
of the board is the division of the board into (n/d)2 nonoverlapping sub-boards,
each of size d × d, such that each cell is contained in exactly one d × d sub-board.
We say that n is a [i]cool number[/i] if the integers can be written on the n × n
board such that, for each integer d with d | n and 1 < d < n, in the d-division of
the board, the sum of the integers written in each d × d sub-board is not a multiple
of d.
Determine all even cool numbers.

2.3 C3
Let n be a positive integer. There are 2n knights sitting at a round table. They
consist of n pairs of partners, each pair of which wishes to shake hands. A pair
can shake hands only when next to each other. Every minute, one pair of adjacent
knights swaps places. Find the minimum number of exchanges of adjacent knights
such that, regardless of the initial arrangement, every knight can meet her partner
and shake hands at some time.

2.4 C4
Turbo the snail plays a game on a board with 2024 rows and 2023 columns. There
are hidden monsters in 2022 of the cells. Initially, Turbo does not know where any
of the monsters are, but he knows that there is exactly one monster in each row
except the first row and the last row, and that each column contains at most one
monster.
Turbo makes a series of attempts to go from the first row to the last row.
On each attempt, he chooses to start on any cell in the first row, then repeatedly
moves to an adjacent cell sharing a common side. (He is allowed to return to a
previously visited cell.) If he reaches a cell with a monster, his attempt ends and
he is transported back to the first row to start a new attempt. The monsters do
not move, and Turbo remembers whether or not each cell he has visited contains a
monster. If he reaches any cell in the last row, his attempt ends and the game is
over.
Determine the minimum value of n for which Turbo has a strategy that guaran-
tees reaching the last row on the n-th attempt or earlier, regardless of the locations
of the monsters.
Proposed by Chus(orz)

2.5 C5
Let N be a positive integer. Geoff and Ceri play a game in which they start by
writing the numbers 1, 2, . . . , N on a board. They then take turns to make a move,

3
starting with Geoff. Each move consists of choosing a pair of integers (k, n), where
k ≥ 0 and n is one of the integers on the board, and then erasing every integer s
on the board such that 2k | n − s. The game continues until the board is empty.
The player who erases the last integer on the board loses.
Determine all values of N for which Geoff can ensure that he wins, no matter
how Ceri plays.

2.6 C6
Let n and T be positive integers. James has 4n marbles with weights 1, 2, . . . , 4n.
He places them on a balance scale, so that both sides have equal weight. Andrew
may move a marble from one side of the scale to the other, so that the absolute
difference in weights of the two sides remains at most T .
Find, in terms of n, the minimum positive integer T such that Andrew may
make a sequence of moves such that each marble ends up on the opposite side of
the scale, regardless of how James initially placed the marbles.

2.7 C7
Let a1 , a2 , a3 , . . . be an infinite sequence of positive integers, and let N be a positive
integer. Suppose that, for each n > N , an is equal to the number of times an−1
appears in the list a1 , a2 , . . . , an−1 .
Prove that at least one of the sequence a1 , a3 , a5 , . . . and a2 , a4 , a6 , . . . is even-
tually periodic.
(An infinite sequence b1 , b2 , b3 , . . . is eventually periodic if there exist positive
integers p and M such that bm+p = bm for all m ≥ M .)

2.8 C8
Let n be a positive integer. Given an n × n board, the unit cell in the top left corner
is initially coloured black, and the other cells are coloured white. We then apply a
series of colouring operations to the board. In each operation, we choose a 2 × 2
square with exactly one cell coloured black and we colour the remaining three cells
of that 2 × 2 square black.
Determine all values of n such that we can colour the whole board black.

3 Geometry
3.1 G1
Let ABCD be a cyclic quadrilateral such that AC < BD < AD and ∠DBA < 90◦ .
Point E lies on the line through D parallel to AB such that E and C lie on opposite
sides of line AD, and AC = DE. Point F lies on the line through A parallel to
CD such that F and C lie on opposite sides of line AD, and BD = AF .
Prove that the perpendicular bisectors of segments BC and EF intersect on
the circumcircle of ABCD.

4
 Proposed by Mykhailo Shtandenko, Ukraine

3.2 G2
Let ABC be a triangle with AB < AC < BC. Let the incenter and incircle of
triangle ABC be I and ω, respectively. Let X be the point on line BC different
from C such that the line through X parallel to AC is tangent to ω. Similarly, let
Y be the point on line BC different from B such that the line through Y parallel
to AB is tangent to ω. Let AI intersect the circumcircle of triangle ABC at
P ̸= A. Let K and L be the midpoints of AC and AB, respectively. Prove that
∠KIL + ∠Y P X = 180◦ .

3.3 G3
Let ABCDE be a convex pentagon and let M be the midpoint of AB. Suppose
that segment AB is tangent to the circumcircle of △CM E at M and that D lies
on the circumcircles of triangles AM E and BM C. Lines AD and M E intersect
at K and lines BD and M C iintersect at L. Ponts P and Q lie on the EC so that
∠P DC = ∠EDQ = ∠ADB. Prove that lines KP, LQ, M D are concurrent.

3.4 G4
Let ABCD be a quadrilateral with AB parallel to CD and AB < CD. Lines AD
and BC intersect at a point P . Point X distinct from C lies on the circumcircle
of triangle ABC such that P C = P X. Point Y distinct from D lies on the
circumcircle of triangle ABD such that P D = P Y . Lines AX and BY intersect
at Q.
Prove that P Q is parallel to AB.

3.5 G5
Given △ABC with incenter I and Ω is the circumcircle of △BIC. Let K be a point
on segment BC such that BAK
\ < KAC. \ The angle bisector of BKA \ intersects
Ω at points W and X such that A and W are on the same side of BC. The angle
bisector of CKA
\ intersects Ω at points Y and Z such that A and Y are on the
same side of BC. Prove that: W
\ AY = ZAX.
\

3.6 G6
Let ABC be an acute triangle with AB < AC, and let Γ be the circumcircle of
ABC. Points X and Y lie on Γ so that XY and BC meet on the external angle
bisector of ∠BAC. Suppose that the tangents to Γ at x and Y intersect at a point
T on the same side of BC as A, and that T X and T Y intersect BC at U and
V , respectively. Let J be the centre of the excircle of triangle T U V opposite the
vertex T .
Prove that AJ bisects ∠BAC.

5
3.7 G7
Let ABC be a triangle with incenter I such that AB < AC < BC. The second
intersections of AI, BI, and CI with the circumcircle of triangle ABC are MA ,
MB , and MC , respectively. Lines AI and BC intersect at D and lines BMC and
CMB intersect at X. Suppose the circumcircle of triangles XMB MC and XBC
intersect again at S ̸= X. Lines BX and CX intersect the circumcircle of triangle
SXMA again at P ̸= X and Q ̸= X, respectively.
Prove that the circumcenter of triangle SID lies on P Q.

3.8 G8
Let ABC be a triangle with AB < AC < BC, and let D be a point in the interior
of segment BC. Let E be a point on the circumcircle of triangle ABC such that
A and E lie on opposite sides of line BC and ∠BAD = ∠EAC. Let I, IB , IC ,
JB , and JC be the incentres of triangles ABC, ABD, ADC, ABE, and AEC,
respectively.
Prove that IB , IC , JB , and JC are concyclic if and only if AI, IB JC , and JB IC
concur.

4 Number Theory
4.1 N1
Find all positive integers n with the following property: for all positive divisors d of
n, we have d + 1 | n or d + 1 is prime.

4.2 N2
Determine all finite, nonempty sets S of positive integers such that for every a, b ∈ S
there exists c ∈ S with a | b + 2c.

4.3 N3
Determine all sequences a1 , a2 , . . . of positive integers such that for any pair of
positive integers m ≤ n, the arithmetic and geometric means
am + am+1 + · · · + an 1
and (am am+1 · · · an ) n−m+1
n−m+1
are both integers.

4.4 N4
Determine all pairs (a, b) of positive integers for which there exist positive integers
g and N such that
gcd(an + b, bn + a) = g

6
holds for all integers n ≥ N. (Note that gcd(x, y) denotes the greatest common
divisor of integers x and y.)

4.5 N5
Let S be a finite nonempty set of prime numbers. Let 1 = b1 < b2 < . . . be the
sequence of all positive integers whose prime divisors all belong to S. Prove that, for
all but finitely many positive integers n, there exist positive integers a1 , a2 , . . . , an
such that  
a1 a2 an 1 1 1
+ + ··· + = + + ··· +
b1 b2 bn b1 b2 bn

4.6 N6
Let n be a positive integer. We say a polynomial P with integer coefficients is
n-good if there exists a polynomial Q of degree 2 with integer coefficients such that
Q(k)(P (k) + Q(k)) is never divisible by n for any integer k.
Determine all integers n such that every polynomial with integer coefficients is
an n-good polynomial.