olymmath

RMM 2010

Romanian Master of Mathematics 2010.

Day 1

Problem 1

  • Day 1

For a finite non empty set of primes PP , let m(P)m(P) denote the largest possible number of consecutive positive integers, each of which is divisible by at least one member of PP .

(i) Show that ∣P∣≤m(P)|P|\le m(P) , with equality if and only if min⁡(P)>∣P∣\min(P)>|P| .

(ii) Show that m(P)<(∣P∣+1)(2∣P∣−1)m(P)<(|P|+1)(2^{|P|}-1) .

(The number ∣P∣|P| is the size of set PP )

Dan Schwarz, Romania

Answer, solutions and source

Problem 2

  • Day 1

For each positive integer nn , find the largest real number CnC_n with the following property. Given any nn real-valued functions f1(x),f2(x),⋯ ,fn(x)f_1(x), f_2(x), \cdots, f_n(x) defined on the closed interval 0≤x≤10 \le x \le 1 , one can find numbers x1,x2,⋯xnx_1, x_2, \cdots x_n , such that 0≤xi≤10 \le x_i \le 1 satisfying ∣f1(x1)+f2(x2)+⋯fn(xn)−x1x2⋯xn∣≥Cn|f_1(x_1)+f_2(x_2)+\cdots f_n(x_n)-x_1x_2\cdots x_n| \ge C_n

Marko Radovanović, Serbia

Answer, solutions and source

Problem 3

  • Day 1

Let A1A2A3A4A_1A_2A_3A_4 be a quadrilateral with no pair of parallel sides. For each i=1,2,3,4i=1, 2, 3, 4 , define ω1\omega_1 to be the circle touching the quadrilateral externally, and which is tangent to the lines Ai−1Ai,AiAi+1A_{i-1}A_i, A_iA_{i+1} and Ai+1Ai+2A_{i+1}A_{i+2} (indices are considered modulo 44 so A0=A4,A5=A1A_0=A_4, A_5=A_1 and A6=A2A_6=A_2 ). Let TiT_i be the point of tangency of ωi\omega_i with the side AiAi+1A_iA_{i+1} . Prove that the lines A1A2,A3A4A_1A_2, A_3A_4 and T2T4T_2T_4 are concurrent if and only if the lines A2A3,A4A1A_2A_3, A_4A_1 and T1T3T_1T_3 are concurrent.

Pavel Kozhevnikov, Russia

Answer, solutions and source

Day 2

Problem 4

  • Day 2

Determine whether there exists a polynomial f(x1,x2)f(x_1, x_2) with two variables, with integer coefficients, and two points A=(a1,a2)A=(a_1, a_2) and B=(b1,b2)B=(b_1, b_2) in the plane, satisfying the following conditions:

(i) AA is an integer point (i.e a1a_1 and a2a_2 are integers);

(ii) ∣a1−b1∣+∣a2−b2∣=2010|a_1-b_1|+|a_2-b_2|=2010 ;

(iii) f(n1,n2)>f(a1,a2)f(n_1, n_2)>f(a_1, a_2) for all integer points (n1,n2)(n_1, n_2) in the plane other than AA ;

(iv) f(x1,x2)>f(b1,b2)f(x_1, x_2)>f(b_1, b_2) for all integer points (x1,x2)(x_1, x_2) in the plane other than BB .

Massimo Gobbino, Italy

Answer, solutions and source

Problem 5

  • Day 2

Let nn be a given positive integer. Say that a set KK of points with integer coordinates in the plane is connected if for every pair of points R,S∈KR, S\in K , there exists a positive integer ℓ\ell and a sequence R=T0,T1,T2,…,Tℓ=SR=T_0,T_1, T_2,\ldots ,T_{\ell}=S of points in KK , where each TiT_i is distance 11 away from Ti+1T_{i+1} . For such a set KK , we define the set of vectors Δ(K)={RS→∣R,S∈K}\Delta(K)=\{\overrightarrow{RS}\mid R, S\in K\} What is the maximum value of ∣Δ(K)∣|\Delta(K)| over all connected sets KK of 2n+12n+1 points with integer coordinates in the plane?

Grigory Chelnokov, Russia

Answer, solutions and source

Problem 6

  • Day 2

Given a polynomial f(x)f(x) with rational coefficients, of degree d≥2d \ge 2 , we define the sequence of sets f0(Q),f1(Q),…f^0(\mathbb{Q}), f^1(\mathbb{Q}), \ldots as f0(Q)=Qf^0(\mathbb{Q})=\mathbb{Q} , fn+1(Q)=f(fn(Q))f^{n+1}(\mathbb{Q})=f(f^{n}(\mathbb{Q})) for n≥0n\ge 0 . (Given a set SS , we write f(S)f(S) for the set {f(x)∣x∈S})\{f(x)\mid x\in S\}) . Let fω(Q)=⋂n=0∞fn(Q)f^{\omega}(\mathbb{Q})=\bigcap_{n=0}^{\infty} f^n(\mathbb{Q}) be the set of numbers that are in all of the sets fn(Q)f^n(\mathbb{Q}) , n≥0n\geq 0 . Prove that fω(Q)f^{\omega}(\mathbb{Q}) is a finite set.

Dan Schwarz, Romania

Answer, solutions and source