s e

U
OTIS Practice Exams: Foxtrot 6

y a l
Evan Chen《陳誼廷》

B ern
Last updated 15 December 2022

Contents

t
This file contains four parts and five problems, divided into three levels.

n
• Mock JMO, on page 2

I
• Mock USAMO, on page 3

,
• Mock TST, on page 4

S
• Solutions to all five problems, starting from page 6 (with a blank page beforehand).

I
To simulate test conditions, print only the page corresponding to the test you are taking.

T
Instructions
Before you start the test, read https://otis.evanchen.cc/exams/mocks/ for the following:

O
• read the handout on olympiad strategy, if you haven’t already;

• download answer sheets on which you’ll write your solutions; and

• register for GradeScope, where you’ll submit your papers.

The time limit is 4.5 hours.

Good luck!

1
 OTIS Mock Olympiad
Exam Foxtrot 06

s e
Mock JMO (4.5 hours)

U
JMO 4. Decide whether that there exists an infinite set S of positive integers with the
property that if we take any finite subset T of S, the sum of the elements of T is not a

l
perfect kth power for any k ≥ 2.

y a
JMO 5. Find the smallest real number M with the following property: given five nonnegative

B ern
real numbers with sum 1, it is possible to arrange them at the vertices of a regular pentagon
such that no two numbers connected by a side of the pentagon have product exceeding M .

t
JMO 6. The incircle of a triangle ABC touches the sides BC and AC at points D and
E, respectively. Suppose P is the point on the shorter arc DE of the incircle such that

n
∠AP E = ∠DP B. The segments AP and BP meet the segment DE at points K and L,

I
respectively. Prove that 2KL = DE.

I S ,
OT

Time limit: 4.5 hours.

Each problem is worth 7 points.
 OTIS Mock Olympiad
Exam Foxtrot 06

s e
Mock USAMO (4.5 hours)

U
USAMO 4. Find the smallest real number M with the following property: given five
nonnegative real numbers with sum 1, it is possible to arrange them at the vertices of

l
a regular pentagon such that no two numbers connected by a side of the pentagon have

y
product exceeding M .

B ern a
USAMO 5. The incircle of a triangle ABC touches the sides BC and AC at points D and
E, respectively. Suppose P is the point on the shorter arc DE of the incircle such that
∠AP E = ∠DP B. The segments AP and BP meet the segment DE at points K and L,
respectively. Prove that 2KL = DE.

nt
USAMO 6. There are 999 scientists. Every two scientists are both interested in exactly

I
one topic and for each topic there are exactly three scientists that are interested in that
topic. Prove that it is possible to choose 250 topics such that every scientist is interested in
at most one of them.

I S ,
OT

Time limit: 4.5 hours.

Each problem is worth 7 points.
 OTIS Mock Olympiad
Exam Foxtrot 06

s e
Mock TST (4.5 hours)

U
TST 4. The incircle of a triangle ABC touches the sides BC and AC at points D and
E, respectively. Suppose P is the point on the shorter arc DE of the incircle such that

l
∠AP E = ∠DP B. The segments AP and BP meet the segment DE at points K and L,

y
respectively. Prove that 2KL = DE.

B ern a
TST 5. Ryan is learning number theory. He doesn’t like negative numbers, so he invents
the dubious function δ : N → N, defined by the relations δ(1) = 1 and
X
δ(n) = δ(d)

t
d|n
d6=n

n
for n > 1. Help Ryan determine the value of

I
∞
X δ(15k )

,
.
15k
k=0

I S
TST 6. There are 999 scientists. Every two scientists are both interested in exactly one
topic and for each topic there are exactly three scientists that are interested in that topic.
Prove that it is possible to choose 250 topics such that every scientist is interested in at

T
most one of them.

O
Time limit: 4.5 hours.
Each problem is worth 7 points.
 se
This page intentionally left blank. Solutions on next page.

l U
y
B ern a
n t
, I
IS
OT
 OTIS Mock Olympiad
Exam Foxtrot 06

s e
Solutions

U
[Brazil 2002/1] Decide whether that there exists an infinite set S of positive integers
with the property that if we take any finite subset T of S, the sum of the elements of T

l
is not a perfect kth power for any k ≥ 2.

y a
Consider the set

B ern
S = 2, 22 · 3, 22 · 32 · 5, 22 · 32 · 52 · 7, 22 · 32 · 52 · 72 · 11, . . . .


Let T ⊆ S be a finite nonempty set, and m its smallest element. Let p be the prime factor
which appears exactly once in m. Then p divides every element of T , and p2 divides every

t
element of T except m. From this it follows that the sum of the elements of T has exactly

n
one factor of p; thus, it cannot be a kth power.

, I
I S
OT
 OTIS Mock Olympiad
Exam Foxtrot 06

s e
Find the smallest real number M with the following property: given five nonnegative
real numbers with sum 1, it is possible to arrange them at the vertices of a regular

U
pentagon such that no two numbers connected by a side of the pentagon have product
exceeding M .

y a l
The answer is M = 1/9, achieved when three of the numbers are 1/3 and the rest are
zero.

B ern
Label the numbers a, b, c, d, e in increasing order. Place them around the pentagon in
the order e, a, d, c, b. Then it is clear that the products of the numbers on the sides follow
the inequalities
ad ≤ ae ≤ be and bc ≤ cd.

t
Thus it suffices to prove that be ≤ 1/9 and cd ≤ 1/9. Using the AM-GM inequality,

n
√
r
3c 3d 3c 3c

I
1 = a + b + c + d + e ≥ 0 + 0 + c + d + d = c + 2d ≥ + ≥2 · = 3 cd,
2 2 2 2

,
so cd ≤ 1/9. Also,
√

S
1 = a + b + c + d + e ≥ 0 + b + b + b + e = 3b + e ≥ 2 3b · e

I
so be ≤ 1/12 < 1/9.

OT
 OTIS Mock Olympiad
Exam Foxtrot 06

s e
[IOM 2018/6] The incircle of a triangle ABC touches the sides BC and AC at points
D and E, respectively. Suppose P is the point on the shorter arc DE of the incircle

U
such that ∠AP E = ∠DP B. The segments AP and BP meet the segment DE at points
K and L, respectively. Prove that 2KL = DE.

y a l
We present two solutions.

B ern
First solution by isogonals (by MarkBcc168) Let ∞ be the point at infinity along
line DE. Let T = DD ∩ P E. Then,
• We are given P A and P B are isogonal with respect to ∠DP E.

t
• The lines P ∞, P T are isogonal too.
• We add a third pair of isogonal lines by letting S ∈ DE such that P S and P F are

n
isogonal lines.

, I T

S
P

I
D
L
S

T
K
E
N

O
M

A F B

By considering triangle P EF which has P A as a symmedian, we know that P (EF ; AT ) = −1.

Since isogonality preserves cross ratio we then have
−1 = P (EF ; AT ) = P (DS; B∞) = (DS; L∞)
so L is the midpoint of DS. Similarly K is the midpoint of ES, as needed.

Second solution by Ptolemy (by Anant Mudgal) Let M and N denote the midpoints
of EF and DF . Then P A and P M are isogonal with respect to ∠EP F as they are a
symmedian/median pair; the same is true for P B and P N . Therefore, we have
4P EK ∼ 4P F N, 4P DL ∼ 4P F M.
 OTIS Mock Olympiad
Exam Foxtrot 06

s e
Thus,

U
FN FM
EK + DL = P E · + PD ·
FP FP

l
1 PE · FD + PD · FE
=

y
2 FP

a
DE
=
2

B ern
the last line by Ptolemy’s theorem. This concludes the proof.

I nt
I S ,
OT
 OTIS Mock Olympiad
Exam Foxtrot 06

s e
[OMO 2015 F30] Ryan is learning number theory. He doesn’t like negative numbers,
so he invents the dubious function δ : N → N, defined by the relations δ(1) = 1 and

U
X
δ(n) = δ(d)

l
d|n

y
d6=n

a
for n > 1. Help Ryan determine the value of

B ern
∞
X δ(15k )
.
15k
k=0

t
Solution by thecmd999: Let an = δ(15n ). Prove some way or another that

n
nan = (12n − 6)an−1 − (4n − 4)an−2

I
for all n ≥ 3.

,
Now use generating functions. Let f = n≥0 an xn . To get nan terms, look at
P

S
X
f0 = nan xn−1 !

I
n≥0

We have

T
nan = 12(n − 1)an−1 − 4(n − 2)an−2 + 6an−1 − 4an−2
so

O
nan xn−1 = 12x(n − 1)an−1 xn−2 − 4x2 (n − 2)an−2 xn−3 + 6an−1 xn−1 − 4xan−2

Summing for all n ≥ 3 yields

f 0 − a1 − 2a2 x = 12x(f 0 − a1 ) − 4x2 f 0 + 6(f − a0 − a1 x) − 4x(f − a0 ).

Compute a0 = 1, a1 = 3, a2 = 26. This differential equation separates as

f0 3 − 2x
=
−1 + 2f 1 − 12x + 4x2
Setting u = −1 + 2f yields
u0 6 − 4x
=
u 1 − 12x + 4x2
Integrating yields
 
1 c
log u = − log(1 − 12x + 4x2 ) + c = log √
2 1 − 12x + 4x2
 OTIS Mock Olympiad
Exam Foxtrot 06

s e
Exponentiating yields
c
u= √

U
1 − 12x + 4x2
Since u = −1 + 2f ,

l
1 c
f= +√

y
2 1 − 12x + 4x2

a
Taking x = 0 yields c + 1
2 = 1, so c = 12 , so

B ern
1 1
f= + √
2 2 1 − 12x + 4x2
δ(15n )
The answer is 1
Plugging 1
in for x yields f 1
7 .
11
P


=f =

t
n≥0 15n 15 15 15

I n
I S ,
OT
 OTIS Mock Olympiad
Exam Foxtrot 06

s e
[Russia 2011/11.3] There are 999 scientists. Every two scientists are both interested in
exactly one topic and for each topic there are exactly three scientists that are interested

U
in that topic. Prove that it is possible to choose 250 topics such that every scientist is
interested in at most one of them.

y a l
Consider a hypergraph G on 999 vertices (the scientists) whose edges all have size 3
(the topics); the condition is that for any pair of vertices exactly one hyperedge contains

B ern
both. Take a maximal set of k disjoint hyperedges and assume for contradiction k ≤ 249;
let S denote these 3k ≤ 747 vertices. Then in the remaining set T of m = 999 − 3k ≥ 250
vertices, the hyperedges for pairs of these vertices must intersect an edge of S.
So, consider all hyperedges
with one vertex in S and two vertices in T , color them red.

t
On the one hand there are m 2 red hyperedges.

n
Claim — Each of our k hyperedges intersects at most m/2 red hyperedges.

I
Proof. Let e = {a, b, c} be one of the k hyperedges. Note that by maximality and problem

,
condition, any two red hyperedges touching e must intersect in exactly one vertex. The rest
is some casework (and requires the fact that m  0).

S
Hence,

I
 
m
km/2 ≥ =⇒ k ≥ m − 1 = 998 − 3k,
2

T
so k ≥ 249.5, contradiction.

Remark. This is another example of taking maximal matchings, this time in the context of

O
3-uniform hypergraphs.