olymmath

TUYMAADA 2009

Tuymaada Olympiad 2009.

Junior

J1

  • Junior

All squares of a 20×2020\times 20 table are empty. Misha* and Sasha** in turn put chips in free squares (Misha* begins). The player after whose move there are four chips on the intersection of two rows and two columns wins. Which of the players has a winning strategy?

Proposed by A. Golovanov

US Name Conversions:

Misha: Naoki Sasha**: Richard*

Answer, solutions and source

J2

  • Junior

P(x)P(x) is a quadratic trinomial. What maximum number of terms equal to the sum of the two preceding terms can occur in the sequence P(1)P(1) , P(2)P(2) , P(3)P(3) , …?\dots?

Proposed by A. Golovanov

Answer, solutions and source

J3

  • Junior

In a cyclic quadrilateral ABCDABCD the sides ABAB and ADAD are equal, CD>AB+BCCD>AB+BC . Prove that ∠ABC>120∘\angle ABC>120^\circ .

Answer, solutions and source

J4

  • Junior

Each of the subsets A1A_1 , A2A_2 , …,\dots, AnA_n of a 2009-element set XX contains at least 4 elements. The intersection of every two of these subsets contains at most 2 elements. Prove that in XX there is a 24-element subset BB containing neither of the sets A1A_1 , A2A_2 , …,\dots, AnA_n .

Answer, solutions and source

J6

  • Junior

MM is the midpoint of base BCBC in a trapezoid ABCDABCD . A point PP is chosen on the base ADAD . The line PMPM meets the line CDCD at a point QQ such that CC lies between QQ and DD . The perpendicular to the bases drawn through PP meets the line BQBQ at KK . Prove that ∠QBC=∠KDA\angle QBC = \angle KDA .

Proposed by S. Berlov

Answer, solutions and source

J8

  • Junior

The sum of several non-negative numbers is not greater than 200, while the sum of their squares is not less than 2500. Prove that among them there are four numbers whose sum is not less than 50.

Proposed by A. Khabrov

Answer, solutions and source

Senior

S1

  • Senior

Three real numbers are given. Fractional part of the product of every two of them is 121\over 2 . Prove that these numbers are irrational.

Proposed by A. Golovanov

Answer, solutions and source

S2

  • Senior

A necklace consists of 100 blue and several red beads. It is known that every segment of the necklace containing 8 blue beads contain also at least 5 red beads. What minimum number of red beads can be in the necklace?

Proposed by A. Golovanov

Answer, solutions and source

S3

  • Senior

On the side ABAB of a cyclic quadrilateral ABCDABCD there is a point XX such that diagonal BDBD bisects CXCX and diagonal ACAC bisects DXDX . What is the minimum possible value of ABCDAB\over CD ?

Proposed by S. Berlov

Answer, solutions and source

S4

  • Senior

Is there a positive integer nn such that among 200th digits after decimal point in the decimal representations of n\sqrt{n} , n+1\sqrt{n+1} , n+2\sqrt{n+2} , …,\ldots, n+999\sqrt{n+999} every digit occurs 100 times?

Proposed by A. Golovanov

Answer, solutions and source

S5

  • Senior

A magician asked a spectator to think of a three-digit number abc‾\overline{abc} and then to tell him the sum of numbers acb‾\overline{acb} , bac‾\overline{bac} , bca‾\overline{bca} , cab‾\overline{cab} , and cba‾\overline{cba} . He claims that when he knows this sum he can determine the original number. Is that so?

Answer, solutions and source

S6

  • Senior

An arrangement of chips in the squares of n×nn\times n table is called sparse if every 2×22\times 2 square contains at most 3 chips. Serge put chips in some squares of the table (one in a square) and obtained a sparse arrangement. He noted however that if any chip is moved to any free square then the arrangement is no more sparce. For what nn is this possible?

Proposed by S. Berlov

Answer, solutions and source

S7

  • Senior

A triangle ABCABC is given. Let B1B_1 be the reflection of BB across the line ACAC , C1C_1 the reflection of CC across the line ABAB , and O1O_1 the reflection of the circumcentre of ABCABC across the line BCBC . Prove that the circumcentre of AB1C1AB_1C_1 lies on the line AO1AO_1 .

Proposed by A. Akopyan

Answer, solutions and source

S8

  • Senior

Determine the maximum number hh satisfying the following condition: for every a∈[0,h]a\in [0,h] and every polynomial P(x)P(x) of degree 99 such that P(0)=P(1)=0P(0)=P(1)=0 , there exist x1,x2∈[0,1]x_1,x_2\in [0,1] such that P(x1)=P(x2)P(x_1)=P(x_2) and x2−x1=ax_2-x_1=a .

Proposed by F. Petrov, D. Rostovsky, A. Khrabrov

Answer, solutions and source