olymmath

RO-TST 2003

Romanian IMO Team Selection Test 2003.

Other problems

Problem 2

Let ABCABC be a triangle with ∠BAC=60∘\angle BAC=60^\circ . Consider a point PP inside the triangle having PA=1PA=1 , PB=2PB=2 and PC=3PC=3 . Find the maximum possible area of the triangle ABCABC .

Problem 4

Prove that among the elements of the sequence {⌊n2003⌋}n≥1\left\{ \left\lfloor n\sqrt{2003} \right\rfloor \right\}_{n\geq 1} one can find a geometric progression having any number of terms, and having the ratio bigger than kk , where kk can be any positive integer.

Radu Gologan

Problem 5

Let f∈Z[X]f\in\mathbb{Z}[X] be an irreducible polynomial over the ring of integer polynomials, such that ∣f(0)∣|f(0)| is not a perfect square. Prove that if the leading coefficient of ff is 1 (the coefficient of the term having the highest degree in ff ) then f(X2)f(X^2) is also irreducible in the ring of integer polynomials.

Mihai Piticari

Problem 6

At a math contest there are 2n2n students participating. Each of them submits a problem to the jury, which thereafter gives each students one of the 2n2n problems submitted. One says that the contest is fair is there are nn participants which receive their problems from the other nn participants.

Prove that the number of distributions of the problems in order to obtain a fair contest is a perfect square.

Problem 7

Find all integers a,b,m,na,b,m,n , with m>n>1m>n>1 , for which the polynomial f(X)=Xn+aX+bf(X)=X^n+aX+b divides the polynomial g(X)=Xm+aX+bg(X)=X^m+aX+b .

Laurentiu Panaitopol

Problem 8

Two circles ω1\omega_1 and ω2\omega_2 with radii r1r_1 and r2r_2 , r2>r1r_2>r_1 , are externally tangent. The line t1t_1 is tangent to the circles ω1\omega_1 and ω2\omega_2 at points AA and DD respectively. The parallel line t2t_2 to the line t1t_1 is tangent to the circle ω1\omega_1 and intersects the circle ω2\omega_2 at points EE and FF . The line t3t_3 passing through DD intersects the line t2t_2 and the circle ω2\omega_2 in BB and CC respectively, both different of EE and FF respectively. Prove that the circumcircle of the triangle ABCABC is tangent to the line t1t_1 .

Dinu Serbanescu

Problem 9

Let n≥3n\geq 3 be a positive integer. Inside a n×nn\times n array there are placed n2n^2 positive numbers with sum n3n^3 . Prove that we can find a square 2×22\times 2 of 4 elements of the array, having the sides parallel with the sides of the array, and for which the sum of the elements in the square is greater than 3n3n .

Radu Gologan

Problem 10

Let P\mathcal{P} be the set of all primes, and let MM be a subset of P\mathcal{P} , having at least three elements, and such that for any proper subset AA of MM all of the prime factors of the number −1+∏p∈Ap-1+\prod_{p\in A}p are found in MM . Prove that M=PM= \mathcal{P} .

Valentin Vornicu

Problem 11

In a square of side 6 the points A,B,C,DA,B,C,D are given such that the distance between any two of the four points is at least 5. Prove that A,B,C,DA,B,C,D form a convex quadrilateral and its area is greater than 21.

Laurentiu Panaitopol

Problem 12

A word is a sequence of n letters of the alphabet {a, b, c, d}. A word is said to be complicated if it contains two consecutive groups of identic letters. The words caab, baba and cababdc, for example, are complicated words, while bacba and dcbdc are not. A word that is not complicated is a simple word. Prove that the numbers of simple words with n letters is greater than 2n2^n , if n is a positive integer.

Problem 13

A parliament has nn senators. The senators form 10 parties and 10 committees, such that any senator belongs to exactly one party and one committee. Find the least possible nn for which it is possible to label the parties and the committees with numbers from 1 to 10, such that there are at least 11 senators for which the numbers of the corresponding party and committee are equal.

Problem 14

Given is a rhombus ABCDABCD of side 1. On the sides BCBC and CDCD we are given the points MM and NN respectively, such that MC+CN+MN=2MC+CN+MN=2 and 2∠MAN=∠BAD2\angle MAN = \angle BAD . Find the measures of the angles of the rhombus.

Cristinel Mortici

Problem 15

In a plane we choose a cartesian system of coordinates. A point A(x,y)A(x,y) in the plane is called an integer point if and only if both xx and yy are integers. An integer point AA is called invisible if on the segment (OA)(OA) there is at least one integer point. Prove that for each positive integer nn there exists a square of side nn in which all the interior integer points are invisible.

Problem 16

Let ABCDEFABCDEF be a convex hexagon and denote by A′,B′,C′,D′,E′,F′A',B',C',D',E',F' the middle points of the sides ABAB , BCBC , CDCD , DEDE , EFEF and FAFA respectively. Given are the areas of the triangles ABC′ABC' , BCD′BCD' , CDE′CDE' , DEF′DEF' , EFA′EFA' and FAB′FAB' . Find the area of the hexagon.

Kvant Magazine

Problem 17

A permutation σ:{1,2,…,n}→{1,2,…,n}\sigma: \{1,2,\ldots,n\}\to\{1,2,\ldots,n\} is called straight if and only if for each integer kk , 1≤k≤n−11\leq k\leq n-1 the following inequality is fulfilled ∣σ(k)−σ(k+1)∣≤2.|\sigma(k)-\sigma(k+1)|\leq 2. Find the smallest positive integer nn for which there exist at least 2003 straight permutations.

Valentin Vornicu

Problem 18

For every positive integer nn we denote by d(n)d(n) the sum of its digits in the decimal representation. Prove that for each positive integer kk there exists a positive integer mm such that the equation x+d(x)=mx+d(x)=m has exactly kk solutions in the set of positive integers.