Rmo Handout
Rmo Handout
Rmo Handout
RMO HANDOUT
(Aarav Arora)
I. ALGEBRA
Q1. (VIETNAM/2007) Solve the system of equations
12 2 12 6
1− = , 1+ =
𝑦 + 3𝑥 √𝑥 𝑦 + 3𝑥 √𝑦
Q2. (BELARUS/2005) Find with proof all triples (x, y, z) with x, y, z ∈ (0, 1)
satisfying:
1 1 1 𝑥𝑦 𝑦𝑧 𝑧𝑥
(𝑥 + − 1) (𝑦 + − 1) (𝑧 + − 1) = (1 − )(1 − )(1 − )
2𝑥 2𝑦 2𝑧 𝑧 𝑥 𝑦
Q3. (GREECE/TST/2009) Given that x, y, z > 3. Find all real solutions (x, y,
z) with proof to the equation:
(𝑥 + 2)2 (𝑦 + 4)2 (𝑧 + 6)2
+ + = 36
𝑦+𝑧−2 𝑧+𝑥−4 𝑥+𝑦−6
3
Q10. (KOREA/2000) Let < 𝑎 < 1. Prove that the equation
4
𝑥 3 (𝑥 + 1) = (𝑥 + 𝑎)(2𝑥 + 𝑎)
has 4 distinct real solutions and find these solutions in explicit form.
Q11. (USAMO/TST/2001) Solve the system of equations:
3𝑥 − 𝑦
𝑥+ =3
𝑥2 + 𝑦2
𝑥 + 3𝑦
𝑦− =0
𝑥2 + 𝑦2
Q14. (USAMO/TST/2001) Find all ordered pair of real numbers (x, y) for
which:
(1 + 𝑥)(1 + 𝑥 2 )(1 + 𝑥 4 ) = 1 + 𝑦 7
(1 + 𝑦)(1 + 𝑦 2 )(1 + 𝑦 4 ) = 1 + 𝑥 7
Q20. (APMO/2005) Prove that for every irrational real number a, there are
irrational numbers b and b’ so that a + b and ab’ are both rational while ab and
a + b’ are both irrational.
Q21. (APMO/1995) Determine all sequences of real numbers , ,
, which satisfy:
and
Q23. (JAPAN/TST/2016) Find the smallest positive real such that for any
positive integer and positive reals ,
Q30. (IMO/SL/2006) The sequence of real numbers a0, a1, a2, … is defined
recursively by
𝑎𝑛−𝑘
a0 = -1 and ∑𝑛𝑘=0 = 0 for n ≥ 1.
𝑘+1
Q32. (USAMO/2009)
For let be positive real numbers such that
Prove that .
that
Q1. (CHNMO/2009) Find all ordered pairs (p, q) of two primes such that pq
divides 5p + 5q.
a. (a). ;
b. (b). for all ;
c. (c). given any two indices and (not necessarily distinct) for
which , there is an index such that
Q4. (IRAN/2010) Given that m, n are two relatively prime integers. Prove
that the equation in x, t, y, s, v, r
𝑥 𝑚 𝑛𝑡 + 𝑦 𝑚 𝑛 𝑠 = 𝑣 𝑚 𝑟 𝑛
Q9. (JBMOSL/2023) Find the largest positive integer such that we can find
a set with elements such that, for any
, divides if and only if divides , where denotes the sum of the
digits of .
▪
▪ for each
Q13. (RUSMO/2018) and are given positive integers. Prove that there are
infinitely many positive integers such that doesn't divide .
Q14. (ARGENTINA/2022) Determine all positive integers such that
numbers from to can be sorted in some order with the
property that the number is divisible by , for all
., that is is divides , divides , divides , and so on
until divides .
Q23. (JBMO/2017) Determine all the sets of six consecutive positive integers
such that the product of some two of them added to the product of some other
two of them is equal to the product of the remaining two numbers.
Q24. (JBMO/2019) Find all prime numbers for which there exist positive
integers , , and such that the number
Q30. (BMO/2007) Show that there are infinitely many pairs of positive
integers (m, n) such that
𝑚+1 𝑛+1
+
𝑛 𝑚
is a positive integer.
Q31. (KOREA/2007) Find all ordered pairs (p, q) of two primes, such that pq
divides 𝑝𝑝 + 𝑞 𝑞 + 1.
Q32. (IMO/2003) Let p be a prime number. Prove that there exists a prime
number q such that for every integer n, the number 𝑛𝑝 − 𝑝 is not divisible by
q.
𝑚
Q33. (KOREA/2003) If m is a positive integer and 2𝑚+1 + 1 divides 32 + 1.
Prove that 2𝑚+1 + 1 is a prime number.
.
Q40. (JBMOSL/2020) Find the largest integer ( ), for which there
exists an integer ( ) such that from any collection of consecutive
positive integers one can always choose numbers, which verify the following
conditions:
1. each chosen number is not divisible by , by , nor by ;
2. the positive difference of any two distinct chosen numbers is not divisible by
at least one of the
numbers , , and .
Q45. (JBMO/2018) Find all integers and such that the fifth power
of minus the fifth power of is equal to .
Q46. (JBMO/2015) Find all prime numbers and positive
integers satisfying the equation
Q3. (CMC/2008) It is given that the circle with center O touches the sides AB
and AC of ∆ABC at P and Q respectively, and internally tangent to the
circumcircle of triangle ABC at D. Prove that ∠POQ = 2∠MDC, where M is
the midpoint of PQ.
Q4. (CMC/2010) Given that the incenter of ∆ABC is I, and the circle with
center I touches AC, AB at E, F respectively. M is a point on line segment EF.
Prove that the areas of triangle MAB and MAC are equal if and only if MI ⊥
BC.
Q5. (ESTONIA/TST/2008) A, B are two fixed points on circle W1. The circle
W2 is tangent to AB at B and its center is on W1. The line ADE intersects W2
at D, E, and the line BD intersects W1 again at F. Prove that BE is tangent to
W1 if and only if DF = DB.
Q6. (RUSMO/2008) In triangle ABC, AB > AC, the tangent line at B to the
circumcircle intersects the line AC at P. D is the symmetric point of B with
respect to P, E is the symmetric point of C with respect to line BP. Prove that
the quadrilateral ABED is cyclic.
Q7. (CMC/2010) ABCD is a convex quadrilateral, ∠ABC = ∠ADC, E, F, G, H,
are midpoints of AC, BD, AD, CD respectively. Prove that:
a) EFGH is a cyclic quadrilateral
b) ∠AEF = ∠ACB - ∠ACD
Q19. (CMC/2009) In triangle ABC, AB > AC, AE is the tangent line to the
circumcircle of triangle ABC at A, D is on AB such that AD = AC = AE.
Prove that the line segment DE passes through the incenter of triangle ABC.
Q28. (CMC/2009) Given that the circle with center O touches the line
segment AB at M and touches the semicircle of diameter AB at E. C is a point
on the semicircle such that CD ⊥ AB at D and CD is the tangent line to the
circle with center O at point F. Connect CA, CM. Prove that:
a) A, F, E are collinear
b) AC = AM
c) MC2 = 2.MD.MA
Q29. (THAILAND/2007) Given the point P outside the circle with center O
and PA, PB are tangents to it at A and B. M, N are the mid points of the line
segments AP and AB respectively. The extension of MN intersects the circle
at C, where N is between M and C. PC intersects the circle again at D, and the
extension of ND intersects PB at Q. Prove that quadrilateral MNPQ is a
rhombus.
Q30. (ROMANIA/2008) Let be a triangle and the points
Q37. (CMC/2009) Given the line segments AB, CD, EF are three non-
intersected chords of a circle. When three quadrilaterals are formed by taking
any two chords as a pair of opposite sides, and let M, N, P be the intersection
of two diagonals for these quadrilaterals, Prove that M, N, P are collinear.
Prove that
Q44. (CMC/2010) The inscribed circle of triangle ABC has center I and
touches AC, AB at points E, F respectively. Let M be a point on segment EF.
Prove that the areas of triangle MAB and MAC are equal if and only if MI ⊥
BC.
Q3. (BALKAN/2001) A cube side 3 is divided into 27 unit cubes. The unit
cubes are arbitrarily labelled 1 to 27 (each cube is given a different number). A
move consists of swapping the cube labelled 27 with one of its 6 neighbours. Is
it possible to find a finite sequence of moves at the end of which cube 27 is in
its original position, but cube has moved to the position originally occupied
by (for each )?
Q4. (JBMO/2023) Alice and Bob play the following game on a grid,
taking turns, with Alice starting first. Initially the grid is empty. At their turn,
they choose an integer from to that is not written yet in any of the cells
and choose an empty cell, and place it in the chosen cell. When there is no
empty cell left, Alice computes the sum of the numbers in each row, and her
score is the maximum of these numbers. Bob computes the sum of the
numbers in each column, and his score is the maximum of these numbers.
Alice wins if her score is greater than Bob's score, Bob wins if his score is
greater than Alice's score, otherwise no one wins.
Find if one of the players has a winning strategy, and if so which player has a
winning strategy.
Q5. (USAJMO/2013) Each cell of an board is filled with some
nonnegative integer. Two numbers in the filling are said to be adjacent if their
cells share a common side. (Note that two numbers in cells that share only a
corner are not adjacent). The filling is called a garden if it satisfies the
following two conditions:
(i) The difference between any two adjacent numbers is either or .
(ii) If a number is less than or equal to all of its adjacent numbers, then it is
equal to .
Determine the number of distinct gardens in terms of and
Determine the maximum possible value of the points as the total sum that we
can obtain by the end of the game.
Q9. (CZECH-POLISH-SLOVAK/2022) Let be a positive integer.
Alice and Bob play a game on a board. Initially, all cells are white.
Alice starts and the players alternate. In her turn, Alice can either color one
white cell in red or pass her turn. In his turn, Bob can either color
a square of white cells in blue or pass his turn. Once both players pass,
the game ends and the person who colored more cells wins (a draw can occur).
For each , determine which player (if any) has a winning
strategy.
Q11. (IRAN/2007) Farhad has made a machine. When the machine starts, it
prints some special numbers. The property of this machine is that for every
positive integer , it prints exactly one of the numbers . We know
that the machine prints . Prove that it doesn't print .
Q12. (CANADA/1971) Suppose that people each know exactly one piece of
information, and all pieces are different. Every time person phones
person , tells everything that knows, while tells nothing. What is
the minimum number of phone calls between pairs of people needed for
everyone to know everything? Prove your answer is a minimum
Q16. (IMO/1972) Prove that from a set of ten distinct two-digit numbers (in
the decimal system), it is possible to select two disjoint subsets whose
members have the same sum.
Q17. (USAMO/1973) Three distinct vertices are chosen at random from the
vertices of a given regular polygon of sides. If all such choices are
equally likely, what is the probability that the center of the given polygon lies
in the interior of the triangle determined by the three chosen random points?
Q18. (USAMO/1976)
Q22. (TURKEY/JUNIOR/2020)
There are dwarves in a forest and each one of them owns exactly 3 hats which
are numbered with numbers . Three hats of a dwarf are numbered
with different numbers and there are 3 festivals in this forest in a day. In the
first festival, each dwarf wears the hat which has the smallest value, in the
second festival, each dwarf wears the hat which has the second smallest value
and in the final festival each dwarf wears the hat which has the biggest value.
After that, it is realized that there is no dwarf pair such that both of two
dwarves wear the same value in at least two festivals. Find the maximum value
of number of dwarves.
Q23. (TURKEY/JUNIOR/2015) In an exhibition there are paintings each
of which is made with exactly colors. Find the minimum possible value of if
any paintings have a common color but there is no color that is used in all
paintings.
(a) Prove that there is a sequence of replacements that will make the final
number equal to .
(b) Prove that there is a sequence of replacements that will make the final
number equal to .
Q30. (JBMOSL/2020) Alice and Bob play the following game: starting with
the number written on a blackboard, each player in turn changes the current
number to a number , where is a prime divisor of . Alice goes first
and the players alternate in turn. The game is lost by the one who is forced to
write a number greater than . Assuming perfect play, who will win the
game.
Determine the fewest number of cards Martu's set can have and give an
example for that number.
RWRWRWRW.....
WRWRWRWR.....
RWRWRWRW.....
WRWRWRWR.....
Q40. (CZECH-POLISH-SLOVAK/2017) Let be a fixed positive integer. A
finite sequence of integers is written on a blackboard. Pepa and
Geoff are playing a game that proceeds in rounds as follows.
- In each round, Pepa first partitions the sequence that is currently on the
blackboard into two or more contiguous subsequences (that is, consisting of
numbers appearing consecutively). However, if the number of these
subsequences is larger than , then the sum of numbers in each of them has to
be divisible by .
- Then Geoff selects one of the subsequences that Pepa has formed and wipes
all the other subsequences from the blackboard.
The game finishes once there is only one number left on the board. Prove that
Pepa may choose his moves so that independently of the moves of Geoff, the
game finishes after at most rounds.
(a) Show that, whatever and whatever the initial configuration, the numbers
on the board will eventually not change any more.
Q43. (ICO/2020) In a soccer league with teams every two team have
played exactly once and no game have lead to a draw. The participating teams
are ordered first by their points (3 points for a win, 1 point for a draw, 0 points
for a loss) then by their goal difference (goals scored minus goals against) in a
normal soccer table. Is it possible for the goal difference in such table to be
strictly increasing from the top to the bottom?
Q48. (RUSSIA/2019) There are 5 points on plane. Prove that you can chose
some of them and shift them such that distances between shifted points won't
change and as a result there will be symetric by some line set of 5 points.