olymmath

IOM 2019

International Olympiad of Metropolises 2019.

Other problems

Problem 1

Three prime numbers p,q,rp,q,r and a positive integer nn are given such that the numbers p+nqr,q+nrp,r+npq\frac{p+n}{qr}, \frac{q+n}{rp}, \frac{r+n}{pq} are integers. Prove that p=q=rp=q=r .

Nazar Agakhanov

Problem 2

In a social network with a fixed finite setback of users, each user had a fixed set of followers among the other users. Each user has an initial positive integer rating (not necessarily the same for all users). Every midnight, the rating of every user increases by the sum of the ratings that his followers had just before midnight.

Let mm be a positive integer. A hacker, who is not a user of the social network, wants all the users to have ratings divisible by mm . Every day, he can either choose a user and increase his rating by 1, or do nothing. Prove that the hacker can achieve his goal after some number of days.

Vladislav Novikov

Problem 3

In a non-equilateral triangle ABCABC point II is the incenter and point OO is the circumcenter. A line ss through II is perpendicular to IOIO . Line ℓ\ell symmetric to like BCBC with respect to ss meets the segments ABAB and ACAC at points KK and LL , respectively ( KK and LL are different from AA ). Prove that the circumcenter of triangle AKLAKL lies on the line IOIO .

Dušan Djukić

Problem 4

There are 100 students taking an exam. The professor calls them one by one and asks each student a single person question: "How many of 100 students will have a "passed" mark by the end of this exam?" The students answer must be an integer. Upon receiving the answer, the professor immediately publicly announces the student's mark which is either "passed" or "failed."

After all the students have got their marks, an inspector comes and checks if there is any student who gave the correct answer but got a "failed" mark. If at least one such student exists, then the professor is suspended and all the marks are replaced with "passed." Otherwise no changes are made.

Can the students come up with a strategy that guarantees a "passed" mark to each of them?

Denis Afrizonov

Problem 5

We are given a convex four-sided pyramid with apex SS and base face ABCDABCD such that the pyramid has an inscribed sphere (i.e., it contains a sphere which is tangent to each race). By making cuts along the edges SA,SB,SC,SDSA,SB,SC,SD and rotating the faces SAB,SBC,SCD,SDASAB,SBC,SCD,SDA outwards into the plane ABCDABCD , we unfold the pyramid into the polygon AKBLCMDNAKBLCMDN as shown in the figure. Prove that K,L,M,NK,L,M,N are concyclic.

Tibor Bakos and Géza Kós

Problem 6

Let pp be a prime and let f(x)f(x) be a polynomial of degree dd with integer coefficients. Assume that the numbers f(1),f(2),…,f(p)f(1),f(2),\dots,f(p) leave exactly kk distinct remainders when divided by pp , and 1<k<p1<k<p . Prove that p−1d≤k−1≤(p−1)(1−1d).\frac{p-1}{d}\leq k-1\leq (p-1)\left(1-\frac1d \right) .

Dániel Domán, Gauls Károlyi, and Emil Kiss