18.07.2014 Views

Romanian Olympiad 2004 Junior BMO Team Selection Tests 1st Test

Romanian Olympiad 2004 Junior BMO Team Selection Tests 1st Test

Romanian Olympiad 2004 Junior BMO Team Selection Tests 1st Test

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

<strong>Romanian</strong> <strong>Olympiad</strong> <strong>2004</strong><br />

<strong>Junior</strong> <strong>BMO</strong> <strong>Team</strong> <strong>Selection</strong> <strong><strong>Test</strong>s</strong><br />

<strong>1st</strong> <strong>Test</strong> - April 7, <strong>2004</strong><br />

1. Find all positive reals a, b, c which fulfill the following relation<br />

4(ab + bc + ca) − 1 ≥ a 2 + b 2 + c 2 ≥ 3(a 3 + b 3 + c 3 ).<br />

Laurenţiu Panaitopol<br />

2. For each positive integer n ≤ 49 we define the numbers a n = 3n + √ n 2 − 1 and<br />

b n = 2( √ n 2 + n + √ n 2 − n). Prove that there exist two integers A, B such that<br />

√<br />

a1 − b 1 + √ a 2 − b 2 + · · · + √ a 49 − b 49 = A + B √ 2.<br />

Titu Andreescu<br />

3. Let V be a point in the exterior of a circle of center O, and let T 1 , T 2 be the points<br />

where the tangents from V touch the circle. Let T be an arbitrary point on the small<br />

arc T 1 T 2 . The tangent in T at the circle intersects the line V T 1 in A, and the lines<br />

T T 1 and V T 2 intersect in B. We denote by M the intersection of the lines T T 1 and<br />

AT 2 .<br />

Prove that the lines OM and AB are perpendicular.<br />

Mircea Fianu<br />

4. In two vertices M, N of a cube the number 1 is written, and in all the other six vertices<br />

the number 0 is written. A movement is defined by choosing a vertex and adding one<br />

unit to the numbers written in the three adiacent vertices 1 .<br />

Prove that there exists a finite set of movements such that in each of the 8 vertices<br />

the same number is written if and only if MN is not a diagonal of a face of the cube.<br />

Dinu Şerbănescu<br />

Work time: 4 hours.<br />

L A TEX(c) <strong>2004</strong> Valentin Vornicu - MathLinks.ro<br />

1 a vertex is adiacent with another vertex if the segment determined by them is a side of the cube


2nd <strong>Test</strong> - May 1, <strong>2004</strong><br />

1. Let ABC be a triangle, having no right angles, and let D be a point on the side BC.<br />

Let E and F be the feet of the perpendicular lines drawn from D to AB and AC<br />

respectively. Let P be the point of intersection between the lines BF and CE. Prove<br />

that AP is the an altitude of the triangle ABC if and only if AD is an interior angle<br />

bisector of the triangle ABC.<br />

Generalization of JBkMO 2002<br />

2. Let ABC be a triangle with side lengths a, b, c, such that a is the longest side. Prove<br />

that ∠BAC = 90 ◦ if and only if<br />

( √ a + b + √ a − b)( √ a + c + √ a − c) = (a + b + c) √ 2.<br />

Virgil Nicula<br />

3. Let A be a 8×8 array with entries from the set {−1, 1} such that any 2×2 sub-square<br />

of the array has the absolute value of the sum of its element equal with 2. Prove that<br />

the array must have at least two identical lines.<br />

Marius Ghergu<br />

4. Find all positive integers n for which there exist distinct positive integers a 1 , a 2 , . . . , a n<br />

such that<br />

1<br />

+ 2 + · · · + n = a 1 + a 2 + · · · + a n<br />

.<br />

a 1 a 2 a n n<br />

Work time: 4 hours.<br />

L A TEX(c) <strong>2004</strong> Valentin Vornicu - MathLinks.ro


3rd <strong>Test</strong> - May 2, <strong>2004</strong><br />

1. At a chess tourney, each player played with all the other players two matches, one<br />

time with the white pieces, and one time with the black pieces. One point was given<br />

for a victory, and 0,5 points were given for a tied game. In the end of the tourney all<br />

the players had the same number of points.<br />

a) Prove that there exist two players with the same number of tied games;<br />

b) Prove that there exist two players which have the same number of lost games when<br />

playing with the white pieces.<br />

2. Let ABC be a triangle with AB = AC and let M be a mobile point of the line BC,<br />

such that B lies between M and C. Prove that the sum of the inradius of the triangle<br />

AMB and the sum of the exradius of the excircle tangent to AC of the triangle AMC<br />

is constant.<br />

3. Let p, q, r be three prime numbers and n a positive integer such that<br />

p n + q n = r 2 .<br />

Prove that n = 1.<br />

Laurenţiu Panaitopol<br />

4. One considers the positive integers a < b ≤ c < d such that ad = bc and √ d − √ a ≤ 1.<br />

Prove that a is a perfect square.<br />

Work time: 4 hours.<br />

L A TEX(c) <strong>2004</strong> Valentin Vornicu - MathLinks.ro


4th <strong>Test</strong> - May 22, <strong>2004</strong><br />

1. Let ABC be a triangle inscribed in the circle C and let M be a point on the arc BC<br />

which does not contain A. The tangents from M to the inscribed circle in the triangle<br />

ABC intersect C in the points N and P .<br />

Prove that if ∠BAC = ∠NMP , then the triangles ABC and MNP are congruent.<br />

2. The real numbers a 1 , a 2 , . . . , a 100 satisfy the relationship<br />

a 2 1 + a 2 2 + · · · + a 2 100 + (a 1 + a 2 + · · · + a 100 ) 2 = 101.<br />

Valentin Vornicu<br />

Prove that |a k | ≤ 10, for all k = 1, 2, . . . , 100.<br />

Dinu Şerbănescu<br />

3. A finite set of positive integers is called isolated if the sum of the numbers in any<br />

given proper subset is co-prime with the sum of the elements of the set.<br />

a) Prove that the set A = {4, 9, 16, 25, 36, 49} is isolated;<br />

b) Determine the composite numbers n for which there exist the positive integers a, b<br />

such that the set<br />

A = {(a + b) 2 , (a + 2b) 2 , . . . , (a + nb) 2 }<br />

is isolated.<br />

Gabriel Dospinescu<br />

4. Consider a regular polygon with 1000 sides, whose vertices are colored with red, yellow,<br />

blue. A move consists of choosing two neighboring vertices, having different colors,<br />

and recoloring them with the third color.<br />

Prove that there exists a finite number of moves such that the resulting polygon is<br />

monocolor.<br />

Marius Ghergu<br />

Work time: 4 hours.<br />

L A TEX(c) <strong>2004</strong> Valentin Vornicu - MathLinks.ro


5th <strong>Test</strong> - May 23, <strong>2004</strong><br />

1. We consider the following triangular array<br />

which is defined by the conditions<br />

0 1 1 2 3 5 8 . . .<br />

0 1 1 2 3 5 . . .<br />

2 3 5 8 13 . . .<br />

4 7 11 18 . . .<br />

12 19 31 . . .<br />

i) on the first two lines, each element, starting with the third one, is the sum of the<br />

preceding two elements;<br />

ii) on the other lines each element is the sum of the two numbers found on the same<br />

column above it.<br />

a) Prove that all the lines satisfy the first condition i);<br />

b) Let a, b, c, d be the first elements of 4 consecutive lines in the array. Find d as a<br />

function of a, b, c.<br />

Dinu Şerbănescu<br />

2. Let M, N, P be the midpoints of the sides BC, CA, AB respectively, of a triangle<br />

ABC. Let G be the centroid of the triangle ABC. Prove that if 4BN 2 = 3AB 2 , and<br />

the quadrilateral BMGP is cyclic, then ABC is an equilateral triangle.<br />

3. Let A be a set of positive integers such that<br />

a) if a ∈ A, the all the positive divisors of a are also in A;<br />

b) if a, b ∈ A, with 1 < a < b, then 1 + ab ∈ A.<br />

Prove that if A has at least 3 elements, then A is the set of all positive integers.<br />

4. Given is a convex polygon with n ≥ 5 sides. Prove that there exist at most<br />

triangles of area 1 with the vertices among the vertices of the polygon.<br />

Valentin Vornicu<br />

n(2n − 5)<br />

3<br />

Andrei Neguţ<br />

Work time: 4 hours.<br />

L A TEX(c) <strong>2004</strong> Valentin Vornicu - MathLinks.ro

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!