Assorted Problems

Valentino Dante
January 8, 2019

Soal-soal dibawah ini diurutkan berdasarkan bidang, lalu (very roughly) berdasarkan kesulitan. Coba
tuliskan solusi dari 1 soal yang Anda suka dari setiap bidang agar saya bisa mengecek penulisannya. Good
luck!
1. (Shortlist) Let ω be the circumcircle of a triangle ABC. Denote by M and N the midpoints of the
sides AB and AC, respectively, and denote by T the midpoint of the arc BC of ω not containing A.
The circumcircles of the triangles AM T and AN T intersect the perpendicular bisectors of AC and AB
at points X and Y , respectively; assume that X and Y lie inside the triangle ABC. The lines M N
and XY intersect at K. Prove that KA = KT .
2. (IMO) A circle with centre O passes through vertices A, C of 4ABC and intersects its sides BA, BC
at distinct points K, N, respectively. The circumcircles of 4ABC and 4KBN intersect at point B
and another point M . Prove that ∠OM B = 90◦ .
3. There are n ants on a stick of length one unit, each facing left or right. At time t = 0, each ant starts
moving with a speed of 1 unit per second in the direction it is facing. If an ant reaches the end of the
stick, it falls off and doesn’t reappear. When two ants moving in opposite directions collide, they both
turn around and continue moving with the same speed (but in the opposite direction). Show that all
ants will fall off the stick in at most 1 second.
4. (Germany) There are stones with a total mass of 9 tons that should be transported by trucks. None
of the stones is heavier than 1 ton and each vehicle has a capacity of 3 tons. Determine the minimum
number of necessary trucks such that the stones can be transported at the same time for sure.
5. (OSP) In the 200 × 200 table in some cells lays red or blue chip. Every chip ”see” other chip, if they
lay in same row or column. Every chip ”see” exactly 5 chips of other color. Find maximum number of
chips in the table.
6. (Shortlist) A sequence of real numbers a1 , a2 , . . . satisfies the relation

an = − max (ai + aj ) for all n > 2017.

i+j=n

Prove that the sequence is bounded, i.e., there is a constant M such that |an | ≤ M for all positive
integers n
7. (IZhO) Find all k > 0 for which a strictly decreasing function g : (0; +∞) → (0; +∞) exists such that
g(x) ≥ kg(x + g(x)) for all positive x.
8. (Shortlist) Let a and b be positive integers such that a! + b! divides a!b!. Prove that 3a ≥ 2b + 2.
√ √
9. (USA TST) Let 3 = 1.b1 b2 b3 . . .(2) be the binary representation of 3. Prove that for any positive
integer n, at least one of the digits bn , bn+1 , . . . , b2n equals 1.
10. (TSTST) Suppose that n and k are positive integers such that

1 = ϕ(ϕ(. . . ϕ( n) . . . )).
| {z }
k times

1
Valentino Dante Assorted Problems

Prove that n ≤ 3k .
Here ϕ(n) denotes Euler’s totient function, i.e. ϕ(n) denotes the number of elements of {1, . . . , n}
which are relatively prime to n. In particular, ϕ(1) = 1.