#CompetitionYearsProblemsYears
1International Mathematical Olympiad1959–2025398
2Middle European Mathematical Olympiad2009–2025160

Overview

YearP1P2P3P4P5P6P7I-1I-2I-3I-4T-1T-2T-3T-4T-5T-6T-7T-8Solved
20250/18
20240/18
20230/18
20220/18
20210/18
20200/10
20190/18
20180/18
20170/6
20160/18
20150/18
20140/6
20130/18
20120/6
20110/18
20100/18
20090/18
20080/6
20070/6
20060/6
20050/6
20040/6
20030/6
20020/6
20010/6
20000/6
19990/6
19980/6
19970/6
19960/6
19950/6
19940/6
19930/6
19920/6
19910/6
19900/6
19890/6
19880/6
19870/6
19860/6
19850/6
19840/6
19830/6
19820/6
19810/6
19790/6
19780/6
19770/6
19760/6
19750/6
19740/6
19730/6
19720/6
19710/6
19700/6
19690/6
19680/6
19670/6
19660/6
19650/6
19640/6
19630/6
19620/7
19610/6
19600/7
19590/6

Problems

2009

Middle European Mathematical Olympiad 2009 Problem T-2

Let a,b,ca, b, c be real numbers such that for every two of the equations x2+ax+b=0,x2+bx+c=0,x2+cx+a=0x^2 + ax + b = 0, \quad x^2 + bx + c = 0, \quad x^2 + cx + a = 0 there is exactly one real number satisfying both of them. Determine all the possible values of a2+b2+c2a^2 + b^2 + c^2.

Middle European Mathematical Olympiad 2009 Problem T-3

The numbers 0,1,2,,n0, 1, 2, \ldots, n (n2n \geqslant 2) are written on a blackboard. In each step we erase an integer which is the arithmetic mean of two different numbers which are still left on the blackboard. We make such steps until no further integer can be erased. Let g(n)g(n) be the smallest possible number of integers left on the blackboard at the end. Find g(n)g(n) for every nn.

Middle European Mathematical Olympiad 2009 Problem T-4

We colour every square of the 2009×20092009 \times 2009 board with one of nn colours (we do not have to use every colour). A colour is called connected if either there is only one square of that colour or any two squares of the colour can be reached from one another by a sequence of moves of a chess queen without intermediate stops at squares having another colour (a chess queen moves horizontally, vertically or diagonally). Find the maximum nn, such that for every colouring of the board at least one colour present at the board is connected.

Middle European Mathematical Olympiad 2009 Problem T-5

Let ABCDABCD be a parallelogram with BAD=60°\measuredangle BAD = 60° and denote by EE the intersection of its diagonals. The circumcircle of the triangle ACDACD meets the line BABA at KAK \neq A, the line BDBD at PDP \neq D and the line BCBC at LCL \neq C. The line EPEP intersects the circumcircle of the triangle CELCEL at points EE and MM. Prove that the triangles KLMKLM and CAPCAP are congruent.

Middle European Mathematical Olympiad 2009 Problem T-6

Suppose that ABCDABCD is a cyclic quadrilateral and CD=DACD = DA. Points EE and FF belong to the segments ABAB and BCBC respectively, and ADC=2EDF\measuredangle ADC = 2\measuredangle EDF. Segments DKDK and DMDM are height and median of the triangle DEFDEF, respectively. LL is the point symmetric to KK with respect to MM. Prove that the lines DMDM and BLBL are parallel.