60-odd years of moscow mathematical
Download 1.08 Mb. Pdf ko'rish
|
Moscow olympiad problems
approximately uniformly, i.e., if a string of consecutive cubes is marked at one place of the row and the same
length is then marked at another place (the strings can intersect), then the number of black cubes in the first string differs from the number of black cubes in the second string by not more than 1; and if the first string begins on the left end of the row, then the number of black cubes in it is not greater than that of the second string; and if it terminates the row, then the number of black cubes in it is not less than that of the second string. Prove that if another string of 77 black cubes and 23 white cubes satisfies the same conditions, then the white cubes in it occupy the same places as in the first string. Grade 9 32.2.9.1. Two players play the following game: taking turns, they strike out one number each from the set {1, 2, 3, . . . , 27}, until there are only two numbers left. If the sum of these numbers is divisible by 5, then the first player wins, otherwise the second one wins. Who wins an optimally played game (the player who begins or the second one)? OLYMPIAD 32 (1969) 95 32.2.9.2. On a plane, the circle may be traced around a coin. The Rule allows us to use this coin to draw a circle through one or two given points that are sufficiently close to one another. Three points are given on the plane; they can be covered by the coin, and they are not all on one straight line or on the circle equal to the outer circle of the coin. Using the coin construct a fourth point, such that all four points are vertices of a parallelogram. 32.2.9.3*. There are 2 n−1 different sequences of length n built of 0’s and 1’s so that for any three sequences there exists a number p such that the p-th digit in all three sequences is 1. Prove that there is exactly one place in each sequence that a 1 occupies. 32.2.9.4*. The time of a new presidential election is approaching in the country Anchuria, where Presi- dent Miraflores now rules. There are 20 million voters in the country but only 1 percent supports Miraflores (the Anchurian military). Naturally, Miraflores wants to be reelected but he wants the election to look democratic. A “democratic vote”, according to Miraflores, is like this: all voters are divided into equal groups; each of these groups is again divided into some number of equal groups (the groups of voters may be subdivided at distinct stages of the election into distinct numbers of smaller subgroups); then these groups are divided once again, and so on. A representative from each smallest group — an elector — is elected for voting within the greater group; electors of this greater group elect a new elector for voting in the group which is greater than this one, and so on. And, finally, representatives from the greatest groups elect the President. Acording to the constitution, Miraflores has the right to divide all voters into the groups as he chooses and he instructs his supporters as to how they are to vote. Is it possible for him to organize “democratic” elections so as to be elected? 32.2.9.5. Consider a regular 1000-gon. Its nonintersecting diagonals divide it into triangles. Prove that among these diagonals there are at least 8 of different lengths. Grade 10 32.2.10.1. Two wizards play the following game. Numbers 0, 1, 2, . . . , 1024 are written out. The first wizard strikes out 512 numbers of (s)he chooses. Then the second wizard strikes out 256 of the remaining numbers. Then the first wizard strikes out 128 of the remaining numbers, and so on. The second wizard strikes out one number during the tenth move; two numbers remain. After that the second wizard pays the first wizard the absolute value of the difference between these numbers in roubles as the fee for the instruction in the exciting game. How should the first wizard play to gain as much as possible? How should the second wizard play to lose less? How much will the second wizard have to pay the first wizard if both play optimally? (Cf. Problems 32.2.7.4 and 32.2.9.1). 32.2.10.2. A rigid wire is bent to form an equilateral triangle, and its endpoints are soldered. The Rule allows to bend a piece of the wire between any two of its points in such a way that the bent piece is symmetrical to the original one, with respect to the straight line through these two points (if these points coincide, then any line through them will do). This operation may be repeated. Is it possible to obtain a regular hexagon with the same perimeter in several such operations? (Cf. Problem 32.2.7.3, See Fig. 71) Figure 71. (Probl. 32.2.10.2) 32.2.10.3. See Problem 32.2.7.2 with the circle replaced with a sphere of radius 20 cm, and the numbers of cuts — 32 and 33 — replaced with 65 and 66, respectively. 32.2.10.4. Numbers whose sum equals zero are written on the squares of an 8 × 8 chessboard. Every square is then divided by a vertical and a horizontal line into four square cells. Is it possible to write numbers in these cells so that 96 MOSCOW MATHEMATICAL OLYMPIADS 1 – 59 a) there are zeros in all the cells along the sides of the chessboard; b) the sums of the numbers in the four cells of each square are equal to the number written in the square before; c) the sums of the numbers in the four cells at every vertex of any original square is zero? 32.2.10.5*. Arrange 1969 cubes in a row, some of them (any number between 0 and 1969) white and the rest black, so that the colors are distributed approximately uniformly (see Problem 32.2.8.5). Prove that there exist at least 1970 different arrangements of the cubes which meet this requirement. Olympiad 33 (1970) 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