olymmath

RMM 2009

Romanian Master of Mathematics 2009.

Day 1

Problem 1

  • Day 1

For ai∈Z+a_i \in \mathbb{Z}^ + , i=1,…,ki = 1, \ldots, k , and n=∑i=1kain = \sum^k_{i = 1} a_i , let d=gcd⁡(a1,…,ak)d = \gcd(a_1, \ldots, a_k) denote the greatest common divisor of a1,…,aka_1, \ldots, a_k . Prove that dn⋅n!∏i=1k(ai!)\frac {d} {n} \cdot \frac {n!}{\prod\limits^k_{i = 1} (a_i!)} is an integer.

Dan Schwarz, Romania

Answer, solutions and source

Problem 2

  • Day 1

A set SS of points in space satisfies the property that all pairwise distances between points in SS are distinct. Given that all points in SS have integer coordinates (x,y,z)(x,y,z) where 1≤x,y,z≤n,1 \leq x,y, z \leq n, show that the number of points in SS is less than min⁡((n+2)n3,n6).\min \Big((n + 2)\sqrt {\frac {n}{3}}, n \sqrt {6}\Big). Dan Schwarz, Romania

Answer, solutions and source

Problem 3

  • Day 1

Given four points A1,A2,A3,A4A_1, A_2, A_3, A_4 in the plane, no three collinear, such that A1A2⋅A3A4=A1A3⋅A2A4=A1A4⋅A2A3,A_1A_2 \cdot A_3 A_4 = A_1 A_3 \cdot A_2 A_4 = A_1 A_4 \cdot A_2 A_3, denote by OiO_i the circumcenter of △AjAkAl\triangle A_j A_k A_l with {i,j,k,l}={1,2,3,4}.\{i,j,k,l\} = \{1,2,3,4\}. Assuming ∀iAi≠Oi,\forall i A_i \neq O_i , prove that the four lines AiOiA_iO_i are concurrent or parallel.

Nikolai Ivanov Beluhov, Bulgaria

Answer, solutions and source

Day 2

Problem 4

  • Day 2

For a finite set XX of positive integers, let Σ(X)=∑x∈Xarctan⁡1x.\Sigma(X) = \sum_{x \in X} \arctan \frac{1}{x}. Given a finite set SS of positive integers for which Σ(S)<π2,\Sigma(S) < \frac{\pi}{2}, show that there exists at least one finite set TT of positive integers for which S⊂TS \subset T and Σ(S)=π2.\Sigma(S) = \frac{\pi}{2}. Kevin Buzzard, United Kingdom

Answer, solutions and source