AoPS Community 2024 OMpD
Brazilian Olympiad
[Link]/community/c4062389
by PennyLane 31
– Level 3
1 We say that a subset T of {1, 2, . . . , 2024} is kawaii if T has the following properties:
1. T has at least two distinct elements;
2. For any two distinct elements x and y of T , x − y does not divide x + y.
For example, the subset T = {31, 71, 2024} is kawaii, but T = {5, 15, 75} is not kawaii because
15 − 5 = 10 divides 15 + 5 = 20.
What is the largest possible number of elements that a kawaii subset can have?
2 Let ABCDE be a convex pentagon whose vertices lie on a circle Γ. The tangents to Γ at C and
E intersect at X, and the segments CE and AD intersect at Y . Given that CE is perpendicular
to BD, that XY is parallel to BD, that AY = BD, and that ∠BAD = 30◦ , what is the measure
of the angle ∠BDA?
Proposed by João Gilberti Alves Tavares
3 For each positive integer n, let f (n) be the number of ordered triples (a, b, c) such that a, b, c ∈
{1, 2, . . . , n} and that the two roots (possibly equal) of the quadratic equation ax2 + bx + c = 0
are both integers.
(a) Prove that for every positive real number C, there exists a positive integer nC such that for
all integers n ≥ nC , we have f (n) > C · n.
(b) Prove that for every positive real number C, there exists a positive integer nC such that for
2025
all integers n ≥ nC , we have f (n) < C · n 2024 .
4 Lavidópolis is a city with 2024 neighborhoods. Lavi Dopes was elected mayor, and since he saw
that there were no roads in the city, he asked Gil Bento, the monster engineer, to design the city’s
roads according to the following rules:
1. Any two neighborhoods are connected by at most one two-way road;
2. For any two neighborhoods, there is exactly one route from one neighborhood to another,
which may pass through some intermediate neighborhoods, but never passes through the same
neighborhood more than once.
Mayor Lavi Dopes wants to try for re-election, but since he knows nothing about the city and
only shows up during campaign times (he spent all this time stealing... I mean, thinking about
math problems), he wants to find a pair of neighborhoods such that the number of roads that
are part of the route connecting them is maximized among all pairs of neighborhoods. To do
© 2025 AoPS Incorporated 1
AoPS Community 2024 OMpD
this, he starts asking Gil Bento various questions, all in the following manner: he chooses two
of the 2024 neighborhoods, say A and B, and asks:
”Given neighborhoods A and B, how many roads are part of the route connecting A to B?”
Knowing that Gil Bento always answers correctly to each question, determine the minimum
number of questions that Lavi Dopes needs to ask to achieve his goal, regardless of how Gil
Bento has designed the roads of Lavidópolis.
– Level 2
1 Let O, M, P and D be distinct digits from each other, and different from zero, such that O <
M < P < D, and the following equation is true:
OMPD × OM − D = MDDMP − OM
(a) Using estimates, explain why it is impossible for the value of O to be greater than or equal
to 3.
(b) Explain why O cannot be equal to 1.
(c) Is it possible for M to be greater than or equal to 5? Justify.
(d) Determine the values of M , P , and D.
2 Let ABCD be a convex quadrilateral, and M , N , and P be the midpoints of diagonals AC and
BD, and side AD, respectively. Also, suppose that ∠ABC + ∠DCB = 90 and that AB = 6,
CD = 8. Calculate the perimeter of triangle M N P .
3 A confused cockroach is initially at vertex A of a cube ABCDEF GH with edges measuring 1
meter, as shown in the figure. Every second, the cockroach moves 1 meter, always choosing to
go to one of the three adjacent vertices to its current position. For example, after 1 second, the
cockroach could stop at vertex B, D, or E.
(a) In how many ways can the cockroach stop at vertex G after 3 seconds?
(b) Is it possible for the cockroach to stop at vertex A after exactly 2023 seconds?
(c) In how many ways can the cockroach stop at A after exactly 2024 seconds?
Note: One way for the cockroach to stop at a vertex after a certain number of seconds differs
from another way if, at some point, the cockroach is at different vertices in the trajectory. For
example, there are 2 ways for the cockroach to stop at C after 2 seconds: one of them passes
through A, B, C, and the other through A, D, C.
[Link]
2024-10-16_173123.png?ex=671e3b5b\&is=671ce9db\&hm=76962ee2949d8324c2f7022ef63f8b7d3c6fe3
&
4 Let a0 , a1 , a2 , . . . be an infinite sequence of positive integers with the following properties:
- a0 is a given positive integer;
© 2025 AoPS Incorporated 2
AoPS Community 2024 OMpD
- For each integer n ≥ 1, an is the smallest integer greater than an−1 such that an + an−1 is a
perfect square.
For example, if a0 = 3, then a1 = 6, a2 = 10, a3 = 15, and so on.
(a) Let T be the set of numbers of the form ak − al , with k ≥ l ≥ 0 integers.
Prove that, regardless of the value of a0 , the number of positive integers not in T is finite.
(b) Calculate, as a function of a0 , the number of positive integers that are not in T .
– Level U
1 Same as L2 P3
2 Let n be a positive integer, and let A and B be n × n matrices with real coefficients such that
ABBA − BAAB = A − B.
(a) Prove that Tr(A) = Tr(B) and that Tr(A2 ) = Tr(B 2 ).
(b) If BA2 B = A2 B 2 and AB 2 A = B 2 A2 , prove that det A = det B.
Note: Tr(X) denotes the trace of X, which is the sum of the elements on its main diagonal, and
det X denotes the determinant of X.
3 Let f : R → R be a differentiable function such that f (0) = 0 and 0 < f ′ (t) ≤ 1 for all t ∈ [0, 1].
Show that:
Z 1 2 Z 1
f (t) dt ≥ f (t)3 dt.
0 0
4 Let n be a positive integer. Determine the largest possible value of k with the following property:
there exists a bijective function ϕ : [0, 1] → [0, 1]k and a constant C > 0 such that, for all
x, y ∈ [0, 1],
∥ϕ(x) − ϕ(y)∥ ≤ C∥x − y∥k .
Note: ∥ · ∥ denotes the Euclidean norm, that is, ∥(a1 , . . . , an )∥ = a21 + · · · + a2n .
p
© 2025 AoPS Incorporated 3
Art of Problem Solving is an ACS WASC Accredited School.
