60-odd years of moscow mathematical
Download 1.08 Mb. Pdf ko'rish
|
Moscow olympiad problems
Grade 10
24.2.10.1. Prove that for any three infinite sequences of positive integers a 1 , a 2 , . . . , a n , . . . ; b 1 , b 2 , . . . , b n , . . . ; c 1 , c 2 , . . . , c n , . . . . there exist p and q such that a p ≥ a q , b p ≥ b q , c p ≥ c q . 24.2.10.2. 120 squares of side 1 are tossed onto a 20 × 25 rectangle. Prove that a disc of diameter 1 can be placed in the rectangle so that the disc does not intersect any of the squares. 24.2.10.3. See Problem 24.2.9.2. 24.2.10.4. On a plane, the distance from a fixed point P to two vertices, A and B, of an equilateral 4ABC is 2 and 3 units, respectively. Find the maximal possible length of P C. 24.2.10.5. From an arbitrary sequence of 2 k numbers 1 and −1 we get a new sequence by the following operation: each number is multiplied by the one following it, and the last 2 k -th number is multiplied by the 1-st one. We perform the same operation with the sequence obtained, and so on. Prove that eventually we get a sequence consisting entirely of 1’s. Olympiad 25 (1962) Tour 25.1 Grade 7 25.1.7.1. Given a straight line l perpendicular to and intersecting segment AB. For any point M on l we can find a point N such that ∠N AB = 2∠M AB and ∠N BA = 2∠M BA. Prove that the absolute value |AN − BN | does not depend on M . (See Fig. 44.) Figure 44. (Probl. 25.1.7.1) 25.1.7.2. We reflect an equilateral triangle with one marked side through one of its sides. Then we similarly reflect the resulting triangle, etc., until at a certain step the triangle returns to its initial position. Prove that the marked side also returns to its initial position. 25.1.7.3. Let a, b, c, d be the sides of a quadrilateral that is not a rhombus. Prove that from the segments a, b, c, d one can construct a self-intersecting quadrilateral. OLYMPIAD 25 (1962) 71 25.1.7.4. Denote by S(a) the sum of digits of a number a. Prove that if S(a) = S(2a), then a is divisible by 9. 25.1.7.5. On each side of n given cards one of the numbers 1, 2, . . . , n is written so that each number occurs exactly twice. Prove that the cards may be arranged on a table so that all numbers 1, 2, . . . , n face upward. Grade 8 25.1.8.1. On sides AB, BC, CA of an equilateral triangle 4ABC find points X, Y , Z, respectively, so that the area of the triangle formed by lines CX, BZ, AY is one-fourth of the area of 4ABC and so that AX XB = BY Y C = CZ ZA . 25.1.8.2. See Problem 25.1.7.2. 25.1.8.3. Prove that for any integer d there exist integers m and n such that d = n − 2m + 1 m 2 − n . 25.1.8.4. See Problem 25.1.7.4. 25.1.8.5. See Problem 25.1.7.5. Grade 9 25.1.9.1. Given two intersecting segments AA 1 and BB 1 on which lie points M and N , respectively, so that AM = BN . Find positions of M and N for which the length of M N is the shortest. (Cf. Problem 25.1.9.2.7-8.3). 25.1.9.2. A chessman that crosses n squares in one move diagonally and 1 square up (or the other way round) is called a Boo. A Boo stands on a square of an infinite chessboard. What n is required for the Boo to reach any given square? For what n this is impossible? 25.1.9.3. See Problem 25.1.7.4. 25.1.9.4. Given the system of equations: 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