60-odd years of moscow mathematical
Download 1.08 Mb. Pdf ko'rish
|
Moscow olympiad problems
ABC
DEF GHKL Is it possible to solve it? (5 points) 57.7.4. There are plenty of red, green and yellow cubes of size 1 × 1 × 1. Is it possible to compose of them a 3 × 3 × 3 cube so that each 3 × 1 × 1 layer has all three colors? (6 points) 57.7.5. On a 4 × 6 board there stand two Ivan’s black chips and two Sergey’s white chips (as on Fig. 98. a)). Each player, in turn, moves any of his chips one step along the vertical. Ivan, though plays black, starts. If after somebody’s move a black chip ocuurs among two white ones along either a horisontal or a diagonal (as on Fig. 98. b)) it is considered killed and should be removed from the board. Ivan’s goal is to lead his chips from the top row to the bottom one. Can Sergey prevent Ivan from getting his goal? (8 points) 1 Problems for the 6-th and 7-th grades were selected by a committee headed by D. Bochina, S. Dorichenko, A. Kovaldzhi and I. Yashchenko; the authors of the other problems are: A. Kovaldzhi (8.2, 8.4, 10.1), D. Botin (8.5), Yu. Chekanov (9.2), G. Galperin (11.4), A. Galochkin (9.5), K. Ignatiev (9.6), A. Kovaldzhi, G. Kondakov (11.1), O. Kryzhanovski (8.6, 10.6), S. Markelov (11.5), I. Nagel (9.4), V. Proizvolov (10.5), G. Shabat (10.2), I. Sharygin (10.4), N. Vasiliev (9.3, 11.3, 11.6); the authors of several problems are anonimous. 140 MOSCOW MATHEMATICAL OLYMPIADS 1 – 59 Figure 98. (Probl. 57.7.5) 57.7.6. In a school the astronomical circle gathered 20 times. Each time there were exactly 5 listeneres and no 2 students met during the circle’s getherings more than once. Prove that at least 20 different students attended the circle. (12 points) Grade 8 57.8.1. A cooperative enterprize gets apple and grape juice in identical cans and produces a mixed drink in equal jars. One can of apple juice suffices for exactly 6 jars of the drink; one can of grape juice suffices for exactly 10 jars of the drink. When they changed the recipe one can of apple juice became sufficient for exactly 5 jars of the drink only. For how many jars of the drink will now suffice one can of the grape juice? (The drink is a pure mixture not diluted with water or preservatives, etc.) 57.8.2. A student did not notice a multiplication sign between two three-digit numbers and wrote one 6-digit number that happened to be 7 times greater than the product of the two three-digit numbers. Find the factors. 57.8.3. In a triangle ABC the bisectors of angles A and C are drawn. Points P and Q are the bases of the perpendiculars dropped from vertex B to these bisectors. Prove that P Q k AC. 57.8.4. Four grasshoppers sit at the vertices of a square. Each minute one of them hops into the point symmetric with respect to another grasshopper. Prove that it it impossible for the grasshoppers to sit at some moment at the vertices of a larger square. 57.8.5. The royal astrologer considers a moment of time favorable if the hour, minute and second hands of the clock are on one side of the dial’s diameter. All other time is considered unfavorable. The hands turn around a common axis uniformly, without jumps. Which kind of time prevails during the full day (24 hours), favorable or unfavorable? 57.8.6. Two play a game on a 19 × 94 checkered board. Each in turn marks a square (of any possible size) along the lines of the mesh and shades it. The one who shades the last cell wins. It is forbidded to shade a cell twice. Who wins if played optimally and what should the strategy be? Grade 9 57.9.1. Is there a nonconvex pentagon no two of whose five diagonals have a common point apart from a vertex? 57.9.2. Kolya has a line segment of length k, Leo has another one, of length l. First, Kolya divides his segment into three parts; then Leo divides his segment into three parts. If it is possible to build two triangles from the six segments obtained, Leo wins; otherwise Kolya wins. Depending on the ratio k l , who, Kolya or Leo, can assure victory and what should the winning strategy be? 57.9.3. Prove that the equation x 2 + y 2 + z 2 = x 3 + y 3 + z 3 has infinitely many solutions in integers. 57.9.4. Two circles intersect at points A and B. To both circles tangents are drawn through A. The tangents intersect the circles at points M and N . The straight lines intersect the circles again at points P and Q (P lies on BM , Q lies on BN ). Prove that M P = N Q. OLYMPIAD 57 (1994) 141 57.9.5. Find the maximal natural number not ending with a 0 such that if we strike out one (not the first) of its figures we get a divisor of the initial number. 57.9.6. During dull lessons students sometimes play “marine battle”. In a 10 × 10 square of checkered paper one should place ships — rectangles — of sizes: one 1 × 4, two 1 × 3, three 1 × 2 and four 1 × 1. The ships should not have common points (even vertices) but can have common points (even edges) with the sides of the square. Prove that a) if one places the ships as listed above (starting with the largest), one can always squeeze all the ships in the square even if one lives the running moment at all times and places each ship without thinking about the other ships’ future; b) if one places the ships in the opposit order (starting with smaller ships), a situation might arize when it is impossible to squeeze in the next ship. (Give an example.) Grade 10 57.10.1. A student did not notice the multiplication sign between two 7-digit numbers and wrote one 14-digit number which turned out to be 3 times the would be product. What are the initial numbers? 57.10.2. An infinite sequence of numbers x n is determined by the formula x n+1 = 1 − |1 − 2x n |, 0 ≤ x 1 ≤ 1. Prove that the sequance is periodic starting from a certian place a) if and b) only if x 1 ∈ Q . 57.10.3. Each of the 1994 Parliament members slapped exactly one of his/her colleagues on the face. Prove that it is possible to compose a Parliament Committee of 665 members none of whom settles disputes with the colleagues in this way. 57.10.4. Let D be a point on side BC of 4ABC. Circles are drawn inside 4ABD and 4ACD; a common outer tangent (distinct from BC) is drawn to the circles; it intersects AD at K. Prove that the length of AK does not depend on the position of D on BC. 57.10.5. Consider an arbitrary polygon, not even necessarily convex one. Recall that a chord of a polygon is a line segment whose endpoints belong to the polygon’s contour while the segment itself lies entirely inside the polygon, the contour included. a) Is there always a chord of the polygon that divides it into parts of equal area? b) Prove that any polygon can be divided by a chord into parts the area of each of them not less than 1 3 of the total area of the polygon. (We always assume that a chord divides the polygon into two parts: the Download 1.08 Mb. Do'stlaringiz bilan baham: |
Ma'lumotlar bazasi mualliflik huquqi bilan himoyalangan ©fayllar.org 2024
ma'muriyatiga murojaat qiling
ma'muriyatiga murojaat qiling