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

A prism with pentagons A1A2A3A4A5A_1A_2A_3A_4A_5 and B1B2B3B4B5B_1B_2B_3B_4B_5 as top and bottom faces is given. Each side of the two pentagons and each of the line-segments AiBjA_iB_j for all i,j=1,,5,i,j=1,\ldots,5, is colored either red or green. Every triangle whose vertices are vertices of the prism and whose sides have all been colored has two sides of a different color. Show that all 10 sides of the top and bottom faces are the same color.

International Mathematical Olympiad 1979 Problem 3

Two circles in a plane intersect. Let AA be one of the points of intersection. Starting simultaneously from AA two points move with constant speeds, each point travelling along its own circle in the same sense. The two points return to A simultaneously after one revolution. Prove that there is a fixed point PP in the plane such that, at any time, the distances from PP to the moving points are equal.

International Mathematical Olympiad 1979 Problem 5

Find all real numbers aa for which there exist non-negative real numbers x1,x2,x3,x4,x5x_1,x_2,x_3,x_4,x_5 satisfying the relations

k=15kxk=a,k=15k3xk=a2,k=15k5xk=a3.\sum_{k=1}^{5}kx_k=a,\quad\sum_{k=1}^{5}k^3x_k=a^2,\quad\sum_{k=1}^{5}k^5x_k=a^3.

International Mathematical Olympiad 1979 Problem 6

Let AA and EE be opposite vertices of a regular octagon. A frog starts jumping at vertex AA. From any vertex of the octagon except E,E, it may jump to either of the two adjacent vertices. When it reaches vertex E,E, the frog stops and stays there. Let ana_n be the number of distinct paths of exactly nn jumps ending at E.E. Prove that a2n1=0,a_{2n-1}=0,

a2n=12(xn1yn1),n=1,2,3,,a_{2n}=\frac{1}{\sqrt{2}}(x^{n-1}-y^{n-1}),\quad n=1,2,3,\cdots,

where x=2+2x=2+\sqrt{2} and y=22.y=2-\sqrt{2}.

Note. A path of nn jumps is a sequence of vertices (P0,,Pn)(P_0,\ldots,P_n) such that

(i) P0=A,Pn=E;P_0=A, P_n=E;

(ii) for every i,0in1,Pii, 0\leq i\leq n-1, P_i is distinct from E;E;

(iii) for every i,0in1,Pii, 0\leq i\leq n-1, P_i and Pi+1P_{i+1} are adjacent.