60-odd years of moscow mathematical
Download 1.08 Mb. Pdf ko'rish
|
Moscow olympiad problems
.
13.1.7-8.5. In a country, one can get from some point A to any other point either by walking, or by calling a cab, waiting for it, and then being driven. Every citizen always chooses the method of transportation that requires the least time. It turns out that the distances and the traveling times are as follows: 1 km takes 10 min; 2 km takes 15 min; 3 km takes 17.5 min. We assume that the speeds of the pedestrian and the cab, and the time spent waiting for cabs, are all constants. How long does it take to reach a point which is 6 km from A? Grades 9 − 10 13.1.9-10.1. Let A be an arbitrary angle; let B and C be acute angles. Is there an angle x such that sin x = sin B · sin C 1 − cos B · cos C · cos A ? OLYMPIAD 14 (1951) 37 13.1.9-10.2. Two triangular pyramids have common base. One pyramid contains the other. Can the sum of the lengths of the edges of the inner pyramid be longer than that of the outer one? 13.1.9-10.3. Arrange 81 weights of 1 2 , 2 2 , . . . , 81 2 (all in grams) into three piles of equal mass. 13.1.9-10.4. Solve the equation q x + 3 − 4 √ x − 1 + q x + 8 − 6 √ x − 1 = 1. 13.1.9-10.5. We are given n circles O 1 , O 2 , . . . , O n , passing through one point O. Let A 1 , . . . , A n denote the second intersection points of O 1 with O 2 , O 2 with O 3 , etc., O n with O 1 , respectively. We choose an arbitrary point B 1 on O 1 and draw a line segment through A 1 and B 1 to the second intersection with O 2 at B 2 , then draw a line segment through A 2 and B 2 to the second intersection with O 3 at B 3 , etc., until we get a point B n on O n . We draw the line segment through B n and A n to the second intersection with O 1 at B n+1 . If B k and A k coincide for some k, we draw the tangent to O k through A k until this tangent intersects O k+1 at B k+1 . Prove that B n+1 coincides with B 1 . Tour 13.2 Grades 7 − 8 13.2.7-8.1. In a convex 13-gon all diagonals are drawn, dividing it into smaller polygons. What is the greatest number of sides can these polygons have? (Cf. Problem 13.2.9-10.1.) 13.2.7-8.2. Prove that 1 2 · 3 4 · 5 6 · 7 8 · · · · · 99 100 < 1 10 . 13.2.7-8.3. A circle is inscribed in a triangle and a square is circumscribed around this circle so that no side of the square is parallel to any side of the triangle. Prove that less than half of the square’s perimeter lies outside the triangle. 13.2.7-8.4*. On a circle, 20 points are chosen. Ten non-intersecting chords without mutual endpoints connect some of the points chosen. How many distinct such arrangements are there? 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