olymmath

OMM 2005

Mexican Mathematical Olympiad 2005.

Other problems

Problem 1

Let OO be the center of the circumcircle of an acute triangle ABCABC , let PP be any point inside the segment BCBC . Suppose the circumcircle of triangle BPOBPO intersects the segment ABAB at point RR and the circumcircle of triangle COPCOP intersects CACA at point QQ . (i) Consider the triangle PQRPQR , show that it is similar to triangle ABCABC and that OO is its orthocenter. (ii) Show that the circumcircles of triangles BPOBPO , COPCOP , PQRPQR have the same radius.

Problem 2

Given several matrices of the same size. Given a positive integer NN , let's say that a matrix is NN -balanced if the entries of the matrix are integers and the difference between any two adjacent entries of the matrix is less than or equal to NN . (i) Show that every 2N2N -balanced matrix can be written as a sum of two NN -balanced matrices. (ii) Show that every 3N3N -balanced matrix can be written as a sum of three NN -balanced matrices.

Problem 3

Already the complete problem:

Determine all pairs (a,b)(a,b) of integers different from 00 for which it is possible to find a positive integer xx and an integer yy such that xx is relatively prime to bb and in the following list there is an infinity of integers:

→a+xyb\rightarrow \frac{a + xy}{b} , a+xy2b2\frac{a + xy^2}{b^2} , a+xy3b3\frac{a + xy^3}{b^3} , …\ldots , a+xynbn\frac{a + xy^n}{b^n} , …\ldots

One idea?

:arrow: View all the problems from XIX Mexican Mathematical Olympiad

Problem 4

A list of numbers a1,a2,…,ama_1,a_2,\ldots,a_m contains an arithmetic trio ai,aj,aka_i, a_j, a_k if i<j<ki < j < k and 2aj=ai+ak2a_j = a_i + a_k . Let nn be a positive integer. Show that the numbers 1,2,3,…,n1, 2, 3, \ldots, n can be reordered in a list that does not contain arithmetic trios.

Problem 5

Let NN be an integer greater than 11 . A deck has N3N^3 cards, each card has one of NN colors, has one of NN figures and has one of NN numbers (there are no two identical cards). A collection of cards of the deck is "complete" if it has cards of every color, or if it has cards of every figure or of all numbers. How many non-complete collections are there such that, if you add any other card from the deck, the collection becomes complete?

Problem 6

Let ABCABC be a triangle and ADAD be the angle bisector of <BAC<BAC , with DD on BCBC . Let EE be a point on segment BCBC such that BD=ECBD = EC . Through EE draw ll a parallel line to ADAD and let PP be a point in ll inside the triangle. Let GG be the point where BPBP intersects ACAC and FF be the point where CPCP intersects ABAB . Show BF=CGBF = CG .