{"year": "1961", "tier": "T1", "problem_label": "1", "problem_type": null, "exam": "AllSovietUnion", "problem": "Given 12 vertices and 16 edges arranged as follows: \n\n![md5:21705a320698046255d6dc2ebb5e015a](21705a320698046255d6dc2ebb5e015a.jpeg)\n \n\nDraw any curve which does not pass through any vertex. Prove that the curve cannot intersect each edge just once. Intersection means that the curve crosses the edge from one side to the other. For example, a circle which had one of the edges as tangent would not intersect that edge.", "solution": "A- - - - B- - - - C | | | D- - E- - F- - G- - H | | | I- - J- - - - K- - L \n\nIf a curve intersects the boundary of a region R (such as ABFED), then it moves from inside R to outside or vice versa. Hence if R has an odd number of edges (like ABFED) then a curve intersecting all of them just once must have one endpoint inside R. But there are four such regions (ABFED, BCHGF, EFGKJ and the outside of ABCHLKJID) and only two endpoints. Note that we can easily intersect all edges but one. For example, start above AB, then cross successively AB, AD, DI, DE, EF, EJ, IJ, JK, GK, KL, HL, GH, CH, BC, FG.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 1", "solution_match": "# Solution"}} {"year": "1961", "tier": "T1", "problem_label": "2", "problem_type": null, "exam": "AllSovietUnion", "problem": "Given a rectangle ABCD with AC length e and four circles centers A, B, C, D and radii a, b, c, d respectively, satisfying \\(\\mathrm{a + c = b + d< e}\\) . Prove you can inscribe a circle inside the quadrilateral whose sides are the two outer common tangents to the circles center A and C, and the two outer common tangents to the circles center B and D.", "solution": "Let O be the center of the rectangle. Let \\(\\mathrm{r} = (\\mathrm{a} + \\mathrm{c}) / 2 = (\\mathrm{b} + \\mathrm{d}) / 2\\) . The required circle has center O, radius r. Let an outer common tangent touch the circle center A at W, and the circle center C at X. Let P be the midpoint of WX, then OP is parallel to AW and CX and has length r, hence the circle center O touches AW at P. Similarly for the other common tangents.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 2", "solution_match": "# Solution"}} {"year": "1961", "tier": "T1", "problem_label": "3", "problem_type": null, "exam": "AllSovietUnion", "problem": "Prove that any 39 successive natural numbers include at least one whose digit sum is divisible by 11.", "solution": "Let n be the smallest number in the sequence and m the smallest with last digit 0. m and m+10 have different digit sums unless (possibly) the penultimate digit of m is 9, but in that case m+10 and m+20 have different digit sums. So two of m, m+10, m+20 are sure to have different digit sums. Hence at least one has a digit sum not congruent to 1 mod 11. Adding the appropriate final digit gives a number whose digit sum is divisible by 11. This number lies in the range m to m+29 and m<=n+9. Hence the result. n=999981 shows it is best possible.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 3", "solution_match": "# Solution"}} {"year": "1961", "tier": "T1", "problem_label": "4", "problem_type": null, "exam": "AllSovietUnion", "problem": "(a) Arrange 7 stars in the 16 places of a 4 x 4 array, so that no 2 rows and 2 columns contain all the stars. \n(b) Prove this is not possible for <7 stars.", "solution": "(a) \\(* * .\\) \\(* .* .\\) \\(* * .\\) \\(* .* .\\) \n\nPick any two rows. The unpicked stars lie in different columns. \n\n(b) If there is a row with at least 3 stars, pick it. That leaves at most 3 stars, pick the row for one and the columns for the others. Now assume no row has more than 2 stars. 6 stars in <6 rows, so we can pick a row with 2 stars. That leaves 4 stars in 3 rows, so we can pick another row with 2 stars. That leaves 2 stars. Pick their columns. [This glosses over the case of <6 stars. In this case we can add extra stars to make the number up to 6. Now the procedure above deals with the original stars and the extra stars, and in particular with the original stars.]", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 4", "solution_match": "# Solution"}} {"year": "1961", "tier": "T1", "problem_label": "5", "problem_type": null, "exam": "AllSovietUnion", "problem": "(a) Given a quadruple (a, b, c, d) of positive reals, transform to the new quadruple (ab, bc, cd, da). Repeat arbitarily many times. Prove that you can never return to the original quadruple unless a=b=c=d=1. \n(b) Given n a power of 2, and an n-tuple (a₁, a₂, ..., aₙ) transform to a new n-tuple (a₁a₂, a₂a₃, ..., aₙ-₁aₙ, aₙa₁). If all the members of the original n-tuple are 1 or -1, prove that with sufficiently many repetitions you obtain all 1s.", "solution": "(a) Let \\(Q_0\\) be the original quadruple (a, b, c, d) and \\(Q_n\\) the quadruple after n transformations. If abcd>1, then the products form a strictly increasing sequence, so return is impossible. Similarly if abcd<1. So we must have abcd=1. Let the largest of the four values of a quadruple \\(Q\\) be \\(M(Q)\\) . If a member of \\(Q_1\\) is not 1, then \\(M(Q_1) > 1\\) . \\(Q_3\\) consists of the elements of \\(Q_1\\) squared and permuted, so \\(M(Q_3) = M(Q_1)^2\\) . Hence the sequence \\(M(Q_1)\\) , \\(M(Q_3)\\) , \\(M(Q_5)\\) , ... increases without limit. This means no return is possible, because a return would lead to the values cycling.\n\n\n\n(b) After r 0\\) . Now \\(\\mathrm{rm} + \\mathrm{sn} = \\mathrm{mn} / \\mathrm{d} + \\mathrm{nnhk} - \\mathrm{mn} / \\mathrm{d} = \\mathrm{nnhk}\\) , which is a multiple of k. If e divides r, then it also divides \\(\\mathrm{rdhk} = \\mathrm{nhk}\\) . So if e divides r and s, then it\n\n\n\nalso divides s - nhk = - m/d. But n/d and m/d are relatively prime, so e must be 1. Hence r and s are relatively prime.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 9", "solution_match": "# Solution"}} {"year": "1961", "tier": "T1", "problem_label": "10", "problem_type": null, "exam": "AllSovietUnion", "problem": "A and B play the following game with N counters. A divides the counters into 2 piles, each with at least 2 counters. Then B divides each pile into 2 piles, each with at least one counter. B then takes 2 piles according to a rule which both of them know, and A takes the remaining 2 piles. Both A and B make their choices in order to end up with as many counters as possible. There are 3 possibilities for the rule: \n\n\\(R1\\) B takes the biggest heap (or one of them if there is more than one) and the smallest heap (or one of them if there is more than one). \n\n\\(R2\\) B takes the two middling heaps (the two heaps that A would take under \\(R1\\) ). \n\n\\(R3\\) B has the choice of taking either the biggest and smallest, or the two middling heaps. For each rule, how many counters will A get if both players play optimally?", "solution": "Answers: [N/2], [(N+1)/2], [N/2]. \n\nSuppose A leaves piles n, m with n≤m. \n\nUnder \\(R1\\) , B can certainly secure m by dividing the larger pile into 1 and m- 1. He cannot do better, because if b is the biggest of the 4 piles, then the smallest is at most m- b. Hence A's best strategy is to leave [N/2], [(N+1)/2]. \n\nUnder \\(R2\\) , if A leaves a=2, b=N- 2, then B cannot do better than [N/2], because if he divides the larger pile into a,b with a≤b, then he takes a+1. A cannot do better, because if he leaves a,b with 3≤a≤b, then B can divide to leave 1, a- 1, [b/2], [(b+1)/2]. Now if a- 1≥[(b+1)/2], then B takes b≥[(N+1)/2]. If a- 1<[(b+1)/2], then B takes a- 1+[b/2]. But a- 1≥2 and [b/2]≥[(b+1)/2]- 1, so a- 1+[b/2]≥1+[(b+1)/2], or B takes at least as many as A, so B takes at least [(N+1)/2]. \n\nUnder \\(R3\\) , A's best strategy is to divide into [N/2],[(N+1)/2]. We have already shown that B can secure [(N+1)/2] and no more by following \\(R1\\) . He cannot do better under R2, for if he divides so that the biggest pile comes from [N/2], then the smallest does too and so he gets [(N+1)/2]. If he divides so that the biggest and smallest piles come from [(N+1)/2], then he gets only [N/2]. But one of these must apply, because if he divided so that the smaller from [N/2] was smaller than the smaller from [(N+1)/2], and the bigger from [N/2] was smaller than the bigger from [(N+1)/2], then [N/2] would be at least 2 less than [(N+1)/2] (which it is not).", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 10", "solution_match": "# Solution"}} {"year": "1961", "tier": "T1", "problem_label": "11", "problem_type": null, "exam": "AllSovietUnion", "problem": "Given three arbitary infinite sequences of natural numbers, prove that we can find unequal natural numbers m, n such that for each sequence the mth member is not less than the nth member.", "solution": "Given any infinite sequence of natural numbers we can find a non- decreasing subsequence (proof below). So suppose the three sequences are a, b, and c. Take a non- decreasing\n\n\n\nsubsequence of \\(\\mathbf{a}_i\\) . Suppose it is \\(\\mathbf{a}_{i1}\\) , \\(\\mathbf{a}_{i2}\\) , \\(\\mathbf{a}_{i3}\\) , ... . Now consider the infinite sequence \\(\\mathbf{b}_{11}\\) , \\(\\mathbf{b}_{12}\\) , ... . It must have a non- decreasing subsequence. Suppose it is \\(\\mathbf{b}_{11}\\) , \\(\\mathbf{b}_{12}\\) , ... . Now consider the infinite sequence \\(\\mathbf{c}_{j1}\\) , \\(\\mathbf{c}_{j2}\\) , ... . It must have a non- decreasing subsequence \\(\\mathbf{c}_{k1}\\) , \\(\\mathbf{c}_{k2}\\) , ... . Each of the three sub- sequences \\(\\mathbf{a}_{k1}\\) , \\(\\mathbf{a}_{k2}\\) , ... , \\(\\mathbf{b}_{k1}\\) , \\(\\mathbf{b}_{k2}\\) , ... , \\(\\mathbf{c}_{k1}\\) , \\(\\mathbf{c}_{k2}\\) , ... is non- decreasing. So we may take, for example, \\(\\mathrm{m} = \\mathrm{k}2\\) and \\(\\mathrm{n} = \\mathrm{k}1\\) . \n\n[Proof that any infinite sequence of natural numbers has a non- decreasing subsequence: if the original sequence is unbounded, then we can take a strictly increasing subsequence. If not, then since there are only finitely many possible numbers not exceeding the bound, at least one of them must occur infinitely often.]", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 11", "solution_match": "# Solution"}} {"year": "1961", "tier": "T1", "problem_label": "12", "problem_type": null, "exam": "AllSovietUnion", "problem": "120 unit squares are arbitrarily arranged in a \\(20 \\times 25\\) rectangle (both position and orientation is arbitrary). Prove that it is always possible to place a circle of unit diameter inside the rectangle without intersecting any of the squares.", "solution": "If a circle with unit diameter intersects a unit square, then its center must lie inside an area \\(3 + \\pi /4\\) , namely an oval centered on the square and comprising: the original square, area 1; four \\(1 \\times 1 / 2\\) rectangles on the sides, total area 2; and four quarter circles at the corners, total area \\(\\pi /4\\) . So if it does not intersect any of the 120 unit squares, then it must avoid ovals with a total area of \\(120 \\times (3 + \\pi /4) = 454.2\\) . Of course, for many arrangements of the squares, these ovals might overlap substantially, but the worst case would be no overlap. \n\nThe circle is also required to lie inside the rectangle, so its center must lie outside a strip \\(1 / 2\\) wide around the edge, and hence inside an inner \\(19 \\times 24\\) rectangle, area 456. The total area of ovals is less, so they cannot cover it completely and it must be possible to place a circle as required.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 12", "solution_match": "# Solution"}} {"year": "1962", "tier": "T1", "problem_label": "1", "problem_type": null, "exam": "AllSovietUnion", "problem": "ABCD is any convex quadrilateral. Construct a new quadrilateral as follows. Take A' so that A is the midpoint of DA'; similarly, B' so that B is the midpoint of AB'; C' so that C is the midpoint of BC'; and D' so that D is the midpoint of CD'. Show that the area of A'B'C'D' is five times the area of ABCD.", "solution": "Compare the triangles A'B'A and ADB. The base of A'B'A can be taken as A'A, which is the same length as AD. The height of A'B'A is AB' times sin B'A'A', which is twice AB times sin BAD. So area A'B'A = 2 area ADB. Similarly, area B'C'B = 2 area BAC, area C'D'C = 2 area CBD, and area D'A'D = 2 area DCA. So adding, the area A'B'A + area C'D'C = 2 area ABCD, and area B'C'B + area D'A'D = 2 area ABCD. But ABCD = A'B'A + B'C'B + C'D'C + D'A'D + ABCD. Hence result.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 1", "solution_match": "# Solution"}} {"year": "1962", "tier": "T1", "problem_label": "2", "problem_type": null, "exam": "AllSovietUnion", "problem": "Given a fixed circle C and a line L throught the center O of C. Take a variable point P on L and let K be the circle center P through O. Let T be the point where a common tangent to C and K meets K. What is the locus of T?", "solution": "Let the common tangent meet C at S. Let X be the intersection of C and OP lying between O and P. PT = PO, hence \\(\\angle \\mathrm{POT} = \\angle \\mathrm{PTO}\\) , so \\(\\angle \\mathrm{OPT} = 180^{\\circ} - 2\\angle \\mathrm{POT}\\) . But PT and OS are parallel, because both are perpendicular to the common tangent. Hence \\(\\angle \\mathrm{POS} = 2\\angle \\mathrm{POT}\\) , so \\(\\angle \\mathrm{SOT} = \\angle \\mathrm{XOT}\\) . Hence TX is tangent to C, in other words T lies on the (fixed) tangent to C at X. Conversely, it is easy to see that any such point can be obtained (just take P such that PO = PT). Thus the required locus is the pair of tangents to C which are perpendicular to L.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 2", "solution_match": "# Solution"}} {"year": "1962", "tier": "T1", "problem_label": "3", "problem_type": null, "exam": "AllSovietUnion", "problem": "Given integers \\(\\mathrm{a_0}\\) , \\(\\mathrm{a_1}\\) , ..., \\(\\mathrm{a_{100}}\\) , satisfying \\(\\mathrm{a_1 > a_0}\\) , \\(\\mathrm{a_1 > 0}\\) , and \\(\\mathrm{a_{r + 2} = 3}\\) \\(\\mathrm{a_{r + 1}} - 2\\mathrm{a_r}\\) for \\(\\mathrm{r} = 0\\) , 1, ..., 98. Prove \\(\\mathrm{a_{100} > 2^{99}}\\) .", "solution": "An easy induction gives \\(\\mathrm{a_r} = (2^{\\mathrm{r}} - 1)\\mathrm{a_1} - (2^{\\mathrm{r}} - 2)\\mathrm{a_0}\\) for \\(\\mathrm{r} = 2\\) , 3, ..., 100. Hence, in particular, \\(\\mathrm{a_{100} = (2^{100} - 2)(a_1 - a_0) + a_1}\\) . But \\(\\mathrm{a_1}\\) and \\((\\mathrm{a_1} - \\mathrm{a_0})\\) are both at least 1. Hence result.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 3", "solution_match": "# Solution"}} {"year": "1962", "tier": "T1", "problem_label": "4", "problem_type": null, "exam": "AllSovietUnion", "problem": "Prove that there are no integers a, b, c, d such that the polynomial \\(\\mathrm{ax^3 + bx^2 + cx + d}\\) equals 1 at \\(\\mathrm{x = 19}\\) and 2 at \\(\\mathrm{x = 62}\\) .", "solution": "If there were such values, then subtract the equation with \\(\\mathrm{x} = 19\\) from the equation with \\(\\mathrm{x} = 62\\) to get: \\(\\mathrm{a}(62^{3} - 19^{3}) + \\mathrm{b}(62^{2} - 19^{2}) + \\mathrm{c}(62 - 19) = 1\\) . But the left hand side is divisible by 62 - \\(19 = 43\\) , contradiction.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 4", "solution_match": "# Solution"}} {"year": "1962", "tier": "T1", "problem_label": "5", "problem_type": null, "exam": "AllSovietUnion", "problem": "Given an n x n array of numbers. n is odd and each number in the array is 1 or - 1. Prove that the number of rows and columns containing an odd number of - 1s cannot total n.", "solution": "If we change a - 1 to 1, we affect the total number of rows and columns (containing an odd number of - 1s) by 0, 2 or - 2. After changing all the - 1s we have total of 0. Hence the starting total must be even. So it cannot be n.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 5", "solution_match": "# Solution"}} {"year": "1962", "tier": "T1", "problem_label": "6", "problem_type": null, "exam": "AllSovietUnion", "problem": "Given the lengths AB and BC and the fact that the medians to those two sides are perpendicular, construct the triangle ABC.", "solution": "Let M be the midpoint of AB and X the midpoint of MB. Construct the circle center B, radius BC/2 and the circle diameter AX. If they do not intersect (so BCAB) then the construction is not possible. If they intersect at N, then take C so that N is the midpoint of BC. Let CM meet AN at O. Then AO/AN = AM/AX =2/3, so the triangles AOM and ANX are similar. Hence \\(\\angle AOM = \\angle ANX = 90^{\\circ}\\) .", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 6", "solution_match": "# Solution"}} {"year": "1962", "tier": "T1", "problem_label": "7", "problem_type": null, "exam": "AllSovietUnion", "problem": "Given four positive real numbers a, b, c, d such that \\(\\mathrm{abcd} = 1\\) , prove that \\(\\mathrm{a}^{2} + \\mathrm{b}^{2} + \\mathrm{c}^{2} + \\mathrm{d}^{2} + \\mathrm{ab} + \\mathrm{ac} + \\mathrm{ad} + \\mathrm{bc} + \\mathrm{bd} + \\mathrm{cd} \\geq 10\\) .", "solution": "Applying the arithmetic/geometric mean result to the 10 numbers gives the result immediately.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 7", "solution_match": "# Solution"}} {"year": "1962", "tier": "T1", "problem_label": "8", "problem_type": null, "exam": "AllSovietUnion", "problem": "Given a fixed regular pentagon ABCDE with side 1. Let M be an arbitary point inside or on it. Let the distance from M to the closest vertex be \\(\\mathbf{r}_1\\) , to the next closest be \\(\\mathbf{r}_2\\) and so on, so that the distances from M to the five vertices satisfy \\(\\mathbf{r}_1 \\leq \\mathbf{r}_2 \\leq \\mathbf{r}_3 \\leq \\mathbf{r}_4 \\leq \\mathbf{r}_5\\) . Find (a) the locus of M which gives \\(\\mathbf{r}_3\\) the minimum possible value, and (b) the locus of M which gives \\(\\mathbf{r}_3\\) the maximum possible value.", "solution": "Let X be the midpoint of AB and O the center of ABCDE. Suppose M lies inside AXO. Then \\(\\mathrm{ME} = \\mathbf{r}_3\\) . So we maximise \\(\\mathbf{r}_3\\) by taking M at X, with distance 1.5590, and we minimise \\(\\mathbf{r}_3\\) by taking M as the intersection of AO and EB with distance 0.8090. AXO is one of 10 congruent\n\n\n\nareas, so the required loci are (a) the 5 midpoints of the diagonals, and (b) the 5 midpoints of the sides.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 8", "solution_match": "# Solution"}} {"year": "1962", "tier": "T1", "problem_label": "9", "problem_type": null, "exam": "AllSovietUnion", "problem": "Given a number with 1998 digits which is divisible by 9. Let x be the sum of its digits, let y be the sum of the digits of x, and z the sum of the digits of y. Find z.", "solution": "\\(\\mathrm{x}\\leq 9\\) . \\(1998 = 17982\\) . Hence \\(\\mathrm{y}\\leq\\) the greater of \\(1 + 7 + 9 + 9 + 9 = 35\\) and \\(9 + 9 + 9 + 9 = 36\\) . But 9 divides the original number and hence also x, y and z. Hence \\(\\mathrm{z} = 9\\) .", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 9", "solution_match": "# Solution"}} {"year": "1962", "tier": "T1", "problem_label": "10", "problem_type": null, "exam": "AllSovietUnion", "problem": "\\(\\mathrm{AB} = \\mathrm{BC}\\) and M is the midpoint of AC. H is chosen on BC so that MH is perpendicular to BC. P is the midpoint of MH. Prove that AH is perpendicular to BP.", "solution": "Take X on AH so that BX is perpendicular to AH. Extend to meet HM at P'. Let N be the midpoint of AB. A, B, M and X are on the circle center N radius NA (because angles AMB and AXB are 90). Also MN is parallel to BC (because AMN, ACB are similar), so NM is perpendicular to MH, in other words HM is a tangent to the circle. hence P'M. \\(\\mathrm{P'M} = \\mathrm{P'X}\\) . P'B. Triangles P'XH and P'HB are similar (angles at P' same and both have a right angle), so \\(\\mathrm{P'H / P'X} = \\mathrm{P'B / P'H}\\) , so \\(\\mathrm{P'H}\\) . \\(\\mathrm{P'H} = \\mathrm{P'X}\\) . \\(\\mathrm{P'B}\\) . Hence \\(\\mathrm{P'H} = \\mathrm{P'M}\\) and P' coincides with P.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 10", "solution_match": "# Solution"}} {"year": "1962", "tier": "T1", "problem_label": "11", "problem_type": null, "exam": "AllSovietUnion", "problem": "The triangle ABC satisfies \\(0\\leq \\mathrm{AB}\\leq 1\\leq \\mathrm{BC}\\leq 2\\leq \\mathrm{CA}\\leq 3\\) . What is the maximum area it can have?", "solution": "If we ignore the restrictions of CA, then the maximum area is 1, achieved when AB is perpendicular to BC. But in this case CA satisfies the restrictions.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 11", "solution_match": "# Solution"}} {"year": "1962", "tier": "T1", "problem_label": "12", "problem_type": null, "exam": "AllSovietUnion", "problem": "Given unequal integers x, y, z prove that \\(\\left(\\mathrm{x - y}\\right)^{5} + \\left(\\mathrm{y - z}\\right)^{5} + \\left(\\mathrm{z - x}\\right)^{5}\\) is divisible by \\(5(\\mathrm{x - y})(\\mathrm{y - z})(\\mathrm{z - x})\\) .", "solution": "Put \\(\\mathrm{x - y = r}\\) , \\(\\mathrm{y - z = s}\\) . Then \\(\\mathrm{z - x} = - (\\mathrm{r + s})\\) , and \\(\\left(\\mathrm{x - y}\\right)^{5} + \\left(\\mathrm{y - z}\\right)^{5} + \\left(\\mathrm{z - x}\\right)^{5} = \\mathrm{r}^{5} + \\mathrm{s}^{5} - (\\mathrm{r + s})^{5} = - 5\\mathrm{r}^{4}\\mathrm{s} - 10\\mathrm{r}^{3}\\mathrm{s}^{2} - 10\\mathrm{r}^{2}\\mathrm{s}^{3} - 5\\mathrm{rs}^{4} = - 5\\mathrm{rs}(\\mathrm{r + s})(\\mathrm{r}^{2} + \\mathrm{rs} + \\mathrm{s}^{2})\\) .", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 12", "solution_match": "# Solution"}} {"year": "1962", "tier": "T1", "problem_label": "13", "problem_type": null, "exam": "AllSovietUnion", "problem": "Given \\(\\mathrm{a_0}\\) , \\(\\mathrm{a_1}\\) , ..., \\(\\mathrm{a_n}\\) , satisfying \\(\\mathrm{a_0} = \\mathrm{a_n} = 0\\) , and and \\(\\mathrm{a_{k - 1}} - 2\\mathrm{a_k} + \\mathrm{a_{k + 1}}\\geq 0\\) for \\(\\mathrm{k = 0}\\) , 1, ..., n- 1. Prove that all the numbers are negative or zero.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 13", "solution_match": "# Solution"}} {"year": "1962", "tier": "T1", "problem_label": "13", "problem_type": null, "exam": "AllSovietUnion", "problem": "Given \\(\\mathrm{a_0}\\) , \\(\\mathrm{a_1}\\) , ..., \\(\\mathrm{a_n}\\) , satisfying \\(\\mathrm{a_0} = \\mathrm{a_n} = 0\\) , and and \\(\\mathrm{a_{k - 1}} - 2\\mathrm{a_k} + \\mathrm{a_{k + 1}}\\geq 0\\) for \\(\\mathrm{k = 0}\\) , 1, ..., n- 1. Prove that all the numbers are negative or zero.", "solution": "The essential point is that if we plot the values \\(\\mathbf{a}_{\\mathrm{r}}\\) against r, then the curve formed by joining the points is cup shaped. Its two endpoints are on the axis, so the other points cannot be above it. There are many ways of turning this insight into a formal proof. Barry Paul's was neater than mine: \\(\\mathbf{a}_{\\mathrm{r} + 1} - \\mathbf{a}_{\\mathrm{r}} \\geq \\mathbf{a}_{\\mathrm{r}} - \\mathbf{a}_{\\mathrm{r} - 1}\\) . Hence (easy induction) if \\(\\mathbf{a}_{\\mathrm{s}} - \\mathbf{a}_{\\mathrm{s} - 1} > 0\\) , then \\(\\mathbf{a}_{\\mathrm{n}} > \\mathbf{a}_{\\mathrm{s}}\\) . Take \\(\\mathbf{a}_{\\mathrm{s}}\\) to be the first positive, then certainly \\(\\mathbf{a}_{\\mathrm{s}} > \\mathbf{a}_{\\mathrm{s} - 1}\\) , so \\(\\mathbf{a}_{\\mathrm{n}} > 0\\) . Contradiction.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 13", "solution_match": "\nSolution"}} {"year": "1962", "tier": "T1", "problem_label": "14", "problem_type": null, "exam": "AllSovietUnion", "problem": "Given two sets of positive numbers with the same sum. The first set has m numbers and the second n. Prove that you can find a set of less than m+n positive numbers which can be arranged to part fill an m x n array, so that the row and column sums are the two given sets. \n\nExample: row sums 1, 5, 3; column sums 2, 7. Array is: \n\nx5 x1 21", "solution": "Induction on m+n. Trivial for m+n=2. \n\nLet \\(\\mathbf{x}\\) be the largest number in the two given sets. Suppose it is a row total; let y be the largest column total. If \\(\\mathbf{y}< \\mathbf{x}\\) , then replace \\(\\mathbf{x}\\) by \\(\\mathbf{x} - \\mathbf{y}\\) in the set of row totals and remove y from the col totals. By induction find \\(\\leq = \\mathrm{m} + \\mathrm{n} - 2\\) positive numbers in an m x (n- 1) array with the new totals. Adding a col empty except for y in the row totalling \\(\\mathbf{x} - \\mathbf{y}\\) gives the required original set. \n\nIf \\(\\mathbf{y} = \\mathbf{x}\\) , then drop \\(\\mathbf{x}\\) from the row totals and y from the col totals and argue as before. \n\nIf \\(\\mathbf{x}\\) was a col total we interchange rows and cols in the argument.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 14", "solution_match": "# Solution"}} {"year": "1963", "tier": "T1", "problem_label": "1", "problem_type": null, "exam": "AllSovietUnion", "problem": "Given 5 circles. Every 4 have a common point. Prove that there is a point common to all 5.", "solution": "Let the circles be a, b, c, d, e. Let A be a point common to b, c, d, e, let B be a point common to a, c, d, e and so on. If any two of A, B, C, D, E coincide then the coincident point is on all 5 circles. Suppose they are all distinct. Then A, B, C are on d and e. Hence d and e coincide (3 points determine a circle). Hence D is on all 5 circles.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 1", "solution_match": "# Solution"}} {"year": "1963", "tier": "T1", "problem_label": "2", "problem_type": null, "exam": "AllSovietUnion", "problem": "8 players compete in a tournament. Everyone plays everyone else just once. The winner of a game gets 1, the loser 0, or each gets 1/2 if the game is drawn. The final result is that everyone gets a different score and the player placing second gets the same as the total of the four bottom players. What was the result of the game between the player placing third and the player placing seventh?", "solution": "The bottom 4 played 6 games amongst themselves, so their scores must total at least 6. Hence the number 2 player scored at least 6. The maximum score possible is 7, so if the number 2 player scored more than 6, then he must have scored 6 1/2 and the top player 7. But then the top player must have won all his games, and hence the number 2 player lost at least one game and could not have scored 6 1/2. Hence the number 2 player scored exactly 6, and the bottom 4 players lost all their games with the top 4 players. In particular, the number 3 player won against the number 7 player.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 2", "solution_match": "# Solution"}} {"year": "1963", "tier": "T1", "problem_label": "3", "problem_type": null, "exam": "AllSovietUnion", "problem": "(a) The two diagonals of a quadrilateral each divide it into two parts of equal area. Prove it is a parallelogram. \n\n(b) The three main diagonals of a hexagon each divide it into two parts of equal area. Prove they have a common point. [If ABCDEF is a hexagon, then the main diagonals are AD, BE and CF.]", "solution": "(a) Let the quadrilateral be ABCD and let the diagonals AC, BD meet at E. Then area ABC = AC.EB.sin CEB/2, and area ADC = AC.ED.sin CEB/2, so E is the midpoint of BD. Similarly, it is the midpoint of AC. Hence the triangles AEB and CED are congruent, so angle CDE = angle ABE, and hence AB is parallel to CD. Similarly, AD is parallel to BC. \n\n(b) Let the hexagon be ABCDEF. Let BE, CF meet at J, let AD, CF meet at K, and let AD, BE meet at L. Let AK=a, BJ=b, CJ=c, DL=d, EL=e, FK=f. Also let KL=x, JL=y and JK=z. Consider the pair of diagonals AD, BE. They divide the hexagon into 4 parts: the triangles\n\n\n\nALB and DLE, and the quadrilaterals AFEL and BCDL. Since area ALB + area AFEL = area DLE + area BCDL, and area ALB + area BCDL = area DLE + area AFEL, the two triangles must have the same area (add the two inequalities). But area ALB = 1/2 AL.BL.sin ALB, and area DLE = 1/2 DL.EL.sin DLE = 1/2 DL.EL.sin ALB, so AL.BL = DL.EL or de = (a+x)(b+y). Similarly, considering the other two paris of diagonals, we get bc = (e+y)(f+z) and af = (c+z)(d+x). Multiplying the three inequalities gives: abcdef = (a+f)(b+y)(c+z)(d+x)(e+y)(f+z). But x, y, z are non- negative, so they must be zero and hence the three diagonals pass through a common point.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 3", "solution_match": "# Solution"}} {"year": "1963", "tier": "T1", "problem_label": "4", "problem_type": null, "exam": "AllSovietUnion", "problem": "The natural numbers m and n are relatively prime. Prove that the greatest common divisor of \\(\\mathrm{m} + \\mathrm{n}\\) and \\(\\mathrm{m}^2 +\\mathrm{n}^2\\) is either 1 or 2.", "solution": "If d divides \\(\\mathrm{m} + \\mathrm{n}\\) and \\(\\mathrm{m}^2 +\\mathrm{n}^2\\) , then it also divides \\((\\mathrm{m} + \\mathrm{n})^2 - (\\mathrm{m}^2 +\\mathrm{n}^2) = 2\\mathrm{mn}\\) and hence also \\(2\\mathrm{m}(\\mathrm{m} + \\mathrm{n}) - 2\\mathrm{mn} = 2\\mathrm{m}^2\\) and \\(2\\mathrm{n}(\\mathrm{m} + \\mathrm{n}) - 2\\mathrm{mn} = 2\\mathbf{n}^2\\) . But m and n are relatively prime, so \\(\\mathrm{m}^2\\) and \\(\\mathrm{n}^2\\) are also. Hence d must divide 2.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 4", "solution_match": "# Solution"}} {"year": "1963", "tier": "T1", "problem_label": "5", "problem_type": null, "exam": "AllSovietUnion", "problem": "Given a circle c and two fixed points A, B on it. M is another point on c, and K is the midpoint of BM. P is the foot of the perpendicular from K to AM. \n\n(a) prove that KP passes through a fixed point (as M varies); \n(b) find the locus of P.", "solution": "(a) Take Y on the circle so that angle ABY=90. Then AY is a diameter and so angle AMY=90. Take X as the midpoint of BY. Then triangles BXK and BYM are similar, so XK is parallel to YM. Hence XK is perpendicular to AM, and so P is the intersection of XK and AM. In other words, KP always passes through X. \n\n(b) P must lie on the circle diameter AX, and indeed all such points can be obtained (given a point P on the circle, take M as the intersection of AP and the original circle). So the locus of P is the circle diameter AX.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 5", "solution_match": "# Solution"}} {"year": "1963", "tier": "T1", "problem_label": "6", "problem_type": null, "exam": "AllSovietUnion", "problem": "Find the smallest value x such that, given any point inside an equilateral triangle of side 1, we can always choose two points on the sides of the triangle, collinear with the given point and a distance x apart.", "solution": "Answer: 2/3. \n\nLet O be the center of ABC. Let AO meet BC at D, let BO meet CA at E, and let CO meet AB at F. Given any point X inside ABC, it lies in one of the quadrilaterals AEOF, CDOE, BFOD. Without loss of generality, it lies in AEOF. Take the line through X parallel to BC. It meets\n\n\n\nAB in P and AC in Q. Then PQ is shorter than the parallel line MON with M on AB and N on AC, which has length 2/3. If we twist the segment PXQ so that it continues to pass through X, and P remains on AB and Q on AC, then its length will change continuously. Eventually, one end will reach a vertex, whilst the other will be on the opposite side and hence the length of the segment will be at least that of an altitude, which is greater than 2/3. So at some intermediate position its length will be 2/3. \n\nTo show that no value smaller than 2/3 is possible, it is sufficient to show that any segment POQ with P and Q on the sides of the triangle has length at least 2/3. Take P on MB and Q on AN with P, O, Q collinear. Then PQ cos POM = MN - QN cospi/3 + PM cos pi/3. But PM>QN (using the sine rule, PM = OM sinPOM/sinOPM and QN = ON sinQON/sinOQN, but OM=ON, angle POM = angle QON, and angle OQN = angle OPM + pi/3 > angle OPM), and hence PQ > MN sec POM > MN.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 6", "solution_match": "# Solution"}} {"year": "1963", "tier": "T1", "problem_label": "7", "problem_type": null, "exam": "AllSovietUnion", "problem": "(a) A \\(6 \\times 6\\) board is tiled with \\(2 \\times 1\\) dominos. Prove that we can always divide the board into two rectangles each of which is tiled separately (with no domino crossing the dividing line). \n\n#(b) Is this true for an \\(8 \\times 8\\) board?", "solution": "(a) We say a domino bridges two columns if half the domino is in each column. We show that for \\(0 < n < 6\\) the number of dominoes bridging columns n and \\(n+1\\) must be at least 2 and even. \n\nConsider first \\(n = 1\\) . There cannot be 3 dominos entirely in column 1, or it would be separately tiled. So there must be at least one domino bridging columns 1 and 2. The number must be even, because it must equal the number of squares in column 1 (even) less twice the number of dominoes (entirely) in column 1. \n\nNow suppose it is true for \\(n < 5\\) and consider column \\(n + 1\\) . There must be at least one domino bridging columns \\(n + 1\\) and \\(n + 2\\) , or columns 1 thru \\(n + 1\\) would be separately tiled. The number must be even, because it must equal the number of squares in column \\(n + 1\\) (even) less the number bridging n and \\(n + 1\\) (even) less twice the number entirely in the column. \n\nSo in total there are at least \\(5 \\times 2 = 10\\) dominos bridging columns. By the same argument there are at least another 10 bridging rows, but there are only 18 dominoes in total. \n\n(b) No. For example: \n\n1 2 3 3 1 1 2 2 1 2 1 2 2 3 3 1 3 3 1 3 1 2 4 1 1 2 2 3 1 2 4 3 1 3 3 2 2 1 2 3 3 2 1 1 4 1 2 1 3 2 3 2 4 3 3 1 1 1 3 2 1 1 2 2", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 7", "solution_match": "# Solution"}} {"year": "1963", "tier": "T1", "problem_label": "8", "problem_type": null, "exam": "AllSovietUnion", "problem": "Given a set of n different positive reals \\(\\{a_{1}, a_{2}, \\ldots , a_{n}\\}\\) . Take all possible non- empty subsets and form their sums. Prove we get at least \\(\\mathrm{n(n + 1)} / 2\\) different sums.", "solution": "Assume \\(a_{1} < a_{2} < \\ldots < a_{n}\\) . We have the following collection of increasing sums: \n\n\\(a_{1} < a_{2} < \\ldots < a_{n}\\) n sums \\(a_{1} + a_{n} < a_{2} + a_{n} < \\ldots < a_{n - 1} + a_{n}\\) n- 1 sums \\(a_{1} + a_{n - 1} + a_{n} < a_{2} + a_{n - 1} + a_{n} < \\ldots < a_{n - 2} + a_{n - 1} + a_{n}\\) n- 2 sums \n\n\\(a_{1} + a_{2} + \\ldots + a_{n}\\) 1 sum \n\nA total of \\(1 + 2 + \\ldots + n = \\mathrm{n(n + 1)} / 2\\) .", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 8", "solution_match": "# Solution"}} {"year": "1963", "tier": "T1", "problem_label": "9", "problem_type": null, "exam": "AllSovietUnion", "problem": "Given a triangle ABC. Let the line through C parallel to the angle bisector of B meet the angle bisector of A at D, and let the line through C parallel to the angle bisector of A meet the angle bisector of B at E. Prove that if DE is parallel to AB, then \\(\\mathrm{CA} = \\mathrm{CB}\\) .", "solution": "The idea is to find an expression for the perpendicular distance h from D to AB. Let \\(\\gamma = \\angle ACB\\) , \\(\\alpha = \\frac{1}{2}\\angle CAB\\) , and \\(\\beta = \\frac{1}{2}\\angle ABC\\) . We have \\(\\mathrm{h} = \\mathrm{AP}\\) sin \\(\\alpha\\) . \n\nUsing the sine rule on APC, we have \\(\\mathrm{AP} = \\mathrm{AC} \\sin (\\gamma + \\beta) / \\sin (\\alpha + \\beta)\\) , so \\(\\mathrm{h} = \\mathrm{AC} \\sin \\alpha \\sin (\\gamma + \\beta) / \\sin (\\alpha + \\beta)\\) . Similarly, the perpendicular distance k from E to AB is BC sin \\(\\beta \\sin (\\gamma + \\alpha) / \\sin (\\alpha + \\beta)\\) . \n\nWe also have that \\(\\mathrm{AC} / \\mathrm{BC} = \\sin 2\\beta /\\sin 2\\alpha\\) , and hence \\(\\mathrm{h} / \\mathrm{k} = \\sin 2\\beta \\sin \\alpha \\sin (\\gamma + \\beta) / (\\sin 2\\alpha \\sin \\beta \\sin (\\gamma + \\alpha))\\) . Using the fact that \\(\\sin (\\gamma + \\beta) = \\sin (2\\alpha + \\beta)\\) , and the expression for \\(\\sin 20\\) , we get \\(\\mathrm{h} / \\mathrm{k} = (\\sin (2\\alpha + 2\\beta) + \\sin 2\\alpha) / (\\sin (2\\alpha + 2\\beta) + \\sin 2\\beta)\\) and hence \\(\\mathrm{h} = \\mathrm{k}\\) iff the triangle is isosceles. \n\nFor some reason the geometric solution took me longer to find. Let ED meet BC at X. Then XCD and XBE are isosceles, so \\(\\mathrm{BC} = \\mathrm{BX} + \\mathrm{XC} = \\mathrm{DX} + \\mathrm{XE} = \\mathrm{DE}\\) . Similarly, \\(\\mathrm{AC} = \\mathrm{DE}\\) . Hence \\(\\mathrm{AC} = \\mathrm{BC}\\) .", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 9", "solution_match": "# Solution"}} {"year": "1963", "tier": "T1", "problem_label": "10", "problem_type": null, "exam": "AllSovietUnion", "problem": "An infinite arithmetic progression contains a square. Prove it contains infinitely many squares.", "solution": "Let the square be \\(a^{2}\\) and the difference d, so that all numbers of the form \\(a^{2} + \\mathrm{nd}\\) belong to the arithmetic progression (for n a natural number). Take n to be \\(2a + \\mathrm{dr}^{2}\\) , then \\(a^{2} + \\mathrm{nd} = (a + \\mathrm{dr})^{2}\\) .", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 10", "solution_match": "# Solution"}} {"year": "1963", "tier": "T1", "problem_label": "11", "problem_type": null, "exam": "AllSovietUnion", "problem": "Can we label each vertex of a 45- gon with one of the digits 0, 1, ..., 9 so that for each pair of distinct digits i, j one of the 45 sides has vertices labeled i, j?", "solution": "10 x 5 > 45, so some digit \\(\\mathrm{i}_{0}\\) must appear less than 5 times. But each occurrence can give at most 2 edges \\(\\mathrm{i}_{0}\\) , j, so there are at most 8 edges \\(\\mathrm{i}_{0}\\) , j, which is one too few.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 11", "solution_match": "# Solution"}} {"year": "1963", "tier": "T1", "problem_label": "12", "problem_type": null, "exam": "AllSovietUnion", "problem": "Find all real p, q, a, b such that we have \\((2\\mathrm{x} - 1)^{20} - (\\mathrm{ax} + \\mathrm{b})^{20} = (\\mathrm{x}^{2} + \\mathrm{px} + \\mathrm{q})^{10}\\) for all x.", "solution": "Comparing coefficients of \\(\\mathrm{x}^{20}\\) , we must have \\(\\mathrm{a} = (2^{20} - 1)^{1 / 20}\\) (note that we allow either the positive or the negative root). \n\nSet \\(\\mathrm{x} = 1 / 2\\) . Then we must have \\((\\mathrm{ax} + \\mathrm{b})^{20} = 0 = (\\mathrm{x}^{2} + \\mathrm{px} + \\mathrm{q})^{10}\\) , and hence \\(\\mathrm{ax} + \\mathrm{b} = 0\\) and \\(\\mathrm{x}^{2} + \\mathrm{px} + \\mathrm{q} = 0\\) . So \\(\\mathrm{b} = - \\mathrm{a} / 2\\) , and \\(1 / 4 + \\mathrm{p} / 2 + \\mathrm{q} = 0\\) . \n\nSet \\(\\mathrm{x} = 0\\) . Then we get \\(\\mathrm{q}^{10} = 1 - \\mathrm{b}^{20} = 1 / 2^{20}\\) , so \\(\\mathrm{q} = 1 / 4\\) or \\(- 1 / 4\\) , and \\(\\mathrm{p} = - 1\\) or 0 respectively. Comparing the coefficients of \\(\\mathrm{x}^{19}\\) , we must have \\(\\mathrm{p} = - 1\\) and \\(\\mathrm{q} = 1 / 4\\) . So, if there is a solution, then it must be: \\(\\mathrm{a} = (2^{20} - 1)^{1 / 20}\\) , \\(\\mathrm{b} = - \\mathrm{a} / 2\\) , \\(\\mathrm{p} = - 1\\) , \\(\\mathrm{q} = 1 / 4\\) . This is indeed a solution because with these values, the \\(\\mathrm{lhs} = 2^{20}(\\mathrm{x} - 1 / 2)^{20} - (\\mathrm{x} - 1 / 2)^{20}\\mathrm{a}^{20} = (\\mathrm{x} - 1 / 2)^{20} = (\\mathrm{x}^{2} - \\mathrm{x} + 1 / 4)^{10} = \\mathrm{rhs}\\) .", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 12", "solution_match": "# Solution"}} {"year": "1963", "tier": "T1", "problem_label": "13", "problem_type": null, "exam": "AllSovietUnion", "problem": "We place labeled points on a circle as follows. At step 1, take two points at opposite ends of a diameter and label them both 1. At step \\(\\mathrm{n} > 1\\) , place a point at the midpoint of each arc created at step \\(\\mathrm{n} - 1\\) and label it with the sum of the labels at the two adjacent points. What is the total sum of the labels after step \\(\\mathrm{n}\\) ? \n\nFor example, after step 4 we have: 1, 4, 3, 5, 2, 5, 3, 4, 1, 4, 3, 5, 2, 5, 4, 3, 4.", "solution": "Answer: \\(2.3^{\\mathrm{n} - 1}\\) . \n\nTrue for \\(\\mathrm{n} = 1\\) . The new points added at step \\(\\mathrm{n} + 1\\) have twice the sum of the points after step \\(\\mathrm{n}\\) , because each old point contributes to two new points. hence the total after step \\(\\mathrm{n} + 1\\) is three times the total after step \\(\\mathrm{n}\\) .", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 13", "solution_match": "# Solution"}} {"year": "1963", "tier": "T1", "problem_label": "14", "problem_type": null, "exam": "AllSovietUnion", "problem": "Given an isosceles triangle, find the locus of the point P inside the triangle such that the distance from P to the base equals the geometric mean of the distances to the sides.", "solution": "Let the triangle be ABC, with AB=AC. Take the circle through B and C which has AB and AC as tangents. The required locus is the arc BC.\n\n\n\nSuppose P lies on the arc. Let the perpendiculars from P meet BC in L, AB in N and AC in M. Join PB and PC. The triangles PNB and PLC are similar (PNB and PLC are both 90, and NBP \\(=\\) LCP because NB is tangent to the circle). Hence \\(\\mathrm{PN / PL} = \\mathrm{PB / PC}\\) . Similarly, triangles PMC and PLB are similar and hence \\(\\mathrm{PM / PL} = \\mathrm{PC / PB}\\) . Multiplying gives the required result \\(\\mathrm{PL}^2 =\\) PM.PN. \n\nIf P is inside the circle and not on it, take P' as the intersection of the line AP and the arc. We have \\(\\mathrm{PL}< \\mathrm{PL}\\) , but \\(\\mathrm{PM} > \\mathrm{PM}\\) and \\(\\mathrm{PN} > \\mathrm{PN}\\) , hence \\(\\mathrm{PL}^2 < \\mathrm{PM.PN}\\) . Similarly, if P is outside the circle and not on it, then \\(\\mathrm{PL}^2 > \\mathrm{PM.PN}\\) .", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 14", "solution_match": "# Solution"}} {"year": "1964", "tier": "T1", "problem_label": "1", "problem_type": null, "exam": "AllSovietUnion", "problem": "In the triangle ABC, the length of the altitude from A is not less than BC, and the length of the altitude from B is not less than AC. Find the angles.", "solution": "Let k be twice the area of the triangle. Then \\(\\mathrm{k}\\geq \\mathrm{BC}^2\\) , \\(\\mathrm{k}\\geq \\mathrm{AC}^2\\) and \\(\\mathrm{k}\\leq \\mathrm{AC}.\\mathrm{BC}\\) , with equality in the last case only if AC is perpendicular to BC. Hence AC and BC have equal lengths and are perpendicular. So the angles are 90, 45, 45.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 1", "solution_match": "# Solution"}} {"year": "1964", "tier": "T1", "problem_label": "2", "problem_type": null, "exam": "AllSovietUnion", "problem": "If m, k, n are natural numbers and \\(\\mathrm{n} > 1\\) , prove that we cannot have \\(\\mathrm{m(m + 1)} = \\mathrm{k^n}\\) .", "solution": "m and \\(\\mathrm{m + 1}\\) have no common divisors, so each must separately be an nth power. But the difference between the two nth powers is greater than 1 (for \\(\\mathrm{n} > 1\\) ).", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 2", "solution_match": "# Solution"}} {"year": "1964", "tier": "T1", "problem_label": "3", "problem_type": null, "exam": "AllSovietUnion", "problem": "Reduce each of the first billion natural numbers (billion \\(= 10^9\\) ) to a single digit by taking its digit sum repeatedly. Do we get more 1s than 2s?", "solution": "Taking digit sums repeatedly gives the remainder after dividing the number by 9, or 9 if the number is exactly divisible by 9. \\(10^9 - 1 = 9\\mathrm{n}\\) , and for any \\(\\mathrm{r} > = 0\\) the nine consecutive numbers \\(9\\mathrm{r} + 1\\) , \\(9\\mathrm{r} + 2\\) , ..., \\(9\\mathrm{r} + 9\\) include just one number giving remainder 1 and one number giving remainder 2. Hence the numbers up to \\(10^9 - 1\\) give equal numbers of 1s and 2s. \\(10^9\\) itself gives 1, so there is just one more of the 1s than the 2s.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 3", "solution_match": "# Solution"}} {"year": "1964", "tier": "T1", "problem_label": "4", "problem_type": null, "exam": "AllSovietUnion", "problem": "Given n odd and a set of integers \\(\\mathrm{a_1}\\) , \\(\\mathrm{a_2}\\) , ..., \\(\\mathrm{a_n}\\) , derive a new set \\((\\mathrm{a_1} + \\mathrm{a_2}) / 2\\) , \\((\\mathrm{a_2} + \\mathrm{a_3}) / 2\\) , ..., \\((\\mathrm{a_{n - 1}} + \\mathrm{a_n}) / 2\\) , \\((\\mathrm{a_n} + \\mathrm{a_1}) / 2\\) . However many times we repeat this process for a particular starting set we always get integers. Prove that all the numbers in the starting set are equal. \n\nFor example, if we started with 5, 9, 1, we would get 7, 5, 3, and then 6, 4, 5, and then 5, 4, 5, 5.5. The last set does not consist entirely of integers.", "solution": "Let the smallest value be s and suppose it occurs m times (with \\(\\mathrm{m}< \\mathrm{n}\\) ). Then the values in the next stage are all at least s, and at most \\(\\mathrm{m} - 1\\) equal s. So after at most m iterations the smallest value is increased.\n\n\n\nWe can never reach a stage where all the values are equal, because if \\((a_{1} + a_{2}) / 2 = (a_{2} + a_{3}) / 2 =\\) ... \\(= (a_{\\mathrm{n - 1}} + a_{\\mathrm{n}}) / 2 = (a_{\\mathrm{n}} + a_{1}) / 2\\) , then \\(a_{1} + a_{2} = a_{2} + a_{3}\\) and hence \\(a_{1} = a_{3}\\) . Similarly, \\(a_{3} = a_{5}\\) , and so \\(a_{1} =\\) \\(a_{3} = a_{5} = \\ldots = a_{\\mathrm{n}}\\) (n odd). Similarly, \\(a_{2} = a_{4} = \\ldots = a_{\\mathrm{n - 1}}\\) . But we also have \\(a_{\\mathrm{n}} + a_{1} = a_{1} + a_{2}\\) and so \\(a_{2} = a_{\\mathrm{n}}\\) , so that all \\(a_{i}\\) are equal. In other words, if all the values are equal at a particular stage, then they must have been equal at the previous stage, and hence at every stage. \n\nThus if the values do not start out all equal, then the smallest value increases indefinitely. But that is impossible, because the sum of the values is the same at each stage, and hence the smallest value can never exceed \\((a_{1} + \\ldots +a_{\\mathrm{n}}) / \\mathrm{n}\\) . \n\nNote that for n even the argument breaks down because a set of unequal numbers can iterate into a set of equal numbers. For example: 1, 3, 1, 3, ..., 1, 3.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 4", "solution_match": "# Solution"}} {"year": "1964", "tier": "T1", "problem_label": "5", "problem_type": null, "exam": "AllSovietUnion", "problem": "The convex hexagon ABCDEF has all angles equal. Prove that \\(\\mathrm{AB - DE = EF - BC = CD - }\\) FA. \n\n(b) Given six lengths \\(a_{1}\\) , ..., \\(a_{6}\\) satisfying \\(a_{1} - a_{4} = a_{5} - a_{2} = a_{3} - a_{6}\\) , show that you can construct a hexagon with sides \\(a_{1}\\) , ..., \\(a_{6}\\) and equal angles.", "solution": "(a) Extend AB, CD, EF. We get an equilateral triangle with sides AF + AB + BC, BC + CD + DE, ED + EF + FA. Hence AB - DE = CD - FA = EF - BC, as required. \n\n(b) Take an equilateral triangle with sides s, t, u lengths \\(a_{2} + a_{3} + a_{4}\\) , \\(a_{4} + a_{5} + a_{6}\\) , and \\(a_{6} + a_{1} + a_{2}\\) respectively. Construct BC length \\(a_{2}\\) parallel to t with B on u and C on s. Construct DE length \\(a_{4}\\) parallel to u with D on s and E on t. Construct FA length \\(a_{6}\\) parallel to s with F on t and A on u. Then ABCDEF is the required hexagon, with AB = \\(a_{1}\\) , BC = \\(a_{2}\\) etc.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 5", "solution_match": "# Solution"}} {"year": "1964", "tier": "T1", "problem_label": "6", "problem_type": null, "exam": "AllSovietUnion", "problem": "Find all possible integer solutions for \\(\\mathrm{sqrt(x + sqrt(x\\ldots(x + sqrt(x)) \\ldots)) = y}\\) , where there are 1998 square roots.", "solution": "Let \\(s_{1} = \\mathrm{sqrt(x)}\\) , \\(s_{2} = \\mathrm{sqrt(x + s_{1})}\\) , \\(s_{3} = \\mathrm{sqrt(x + s_{2})}\\) and so on. So the equation given is \\(y = s_{1998}\\) . We show first that all \\(s_{\\mathrm{n}}\\) must be integral for \\(1 \\ll n \\ll 1998\\) . \\(y\\) is integral, so \\(s_{1998}\\) is integral. Now suppose \\(s_{\\mathrm{n}}\\) is integral. Then \\(s_{\\mathrm{n - 1}} = s_{\\mathrm{n}}^{2} - x\\) is integral, proving the claim. \n\nSo in particular \\(s_{1}\\) and \\(s_{2}\\) are integers and \\(s_{2}^{2} = s_{1}^{2} + s_{1}\\) . But if \\(s_{1} > 0\\) , then \\(s_{1}^{2} < s_{1}^{2} + s_{1} < (s_{1} + 1)^{2}\\) , which is impossible. Similarly \\(s_{1} < 0\\) is impossible. So the only possible solution is \\(s_{1} = 0\\) and hence \\(x = 0\\) and \\(y = 0\\) .", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 6", "solution_match": "# Solution"}} {"year": "1964", "tier": "T1", "problem_label": "7", "problem_type": null, "exam": "AllSovietUnion", "problem": "ABCD is a convex quadrilateral. A' is the foot of the perpendicular from A to the diagonal BD, B' is the foot of the perpendicular from B to the diagonal AC, and so on. Prove that A'B'C'D' is similar to ABCD.", "solution": "Let the diagonals meet at O. Then \\(\\mathrm{CC^{\\prime}O}\\) is similar to AA'O (because \\(\\mathrm{CC^{\\prime}O = AA^{\\prime}O = 90}\\) , and COC', AOA' are opposite angles), so \\(\\mathrm{A^{\\prime}O / C^{\\prime}O = AO / CO}\\) . Similarly, \\(\\mathrm{B^{\\prime}O / D^{\\prime}O = BO / DO}\\) . AA'O is also similar to BB'O, so \\(\\mathrm{A^{\\prime}O / B^{\\prime}O = AO / BO}\\) . Thus \\(\\mathrm{OA^{\\prime}:OB^{\\prime}:OC^{\\prime}:OD^{\\prime} =}\\) OA:OB:OC:OD. Hence triangles OA'B' and OAB are similar. Likewise OB'C' and OBC, OC'D' and OCD, and OD'A' and ODA. Hence result.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 7", "solution_match": "# Solution"}} {"year": "1964", "tier": "T1", "problem_label": "8", "problem_type": null, "exam": "AllSovietUnion", "problem": "Find all natural numbers n such that \\(\\mathrm{n}^2\\) does not divide n!.", "solution": "Answer: \\(\\mathrm{n} = 4\\) or prime. \n\nIf \\(\\mathrm{n} = \\mathrm{rs}\\) , with \\(1< \\mathrm{r}< \\mathrm{s}\\) , then \\(\\mathrm{r}< \\mathrm{s}< \\mathrm{n}\\) , and hence \\(\\mathrm{rsn} = \\mathrm{n}^2\\) divides n!. Similarly, if \\(\\mathrm{n} = \\mathrm{r}^2\\) with \\(\\mathrm{r} > 2\\) , then \\(\\mathrm{r}< 2\\mathrm{r}< \\mathrm{n}\\) , and hence \\(\\mathrm{n}^2\\) divides n!. This covers all possibilities except \\(\\mathrm{n} = 4\\) or \\(\\mathrm{n} =\\) prime, and it is easy to see that in these cases \\(\\mathrm{n}^2\\) does not divide n!.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 8", "solution_match": "# Solution"}} {"year": "1964", "tier": "T1", "problem_label": "9", "problem_type": null, "exam": "AllSovietUnion", "problem": "Given a lattice of regular hexagons. A bug crawls from vertex A to vertex B along edges of the hexagons, taking the shortest possible path (or one of them). Prove that it travels a distance at least AB/2 in one direction. If it travels exactly AB/2 in one direction, how many edges does it traverse?", "solution": "![md5:675f77deace78f718b28d352bbac53d9](675f77deace78f718b28d352bbac53d9.jpeg)\n \n\nSuppose vertex A is that marked \\* at the bottom left. Without loss of generality, B is in a 60 degree sector as shown. Assume the edges have unit length. The vertices can be partitioned into two sets (marked ° and . in the diagram). Each set forms a skewed lattice with axes at 60 degrees. Any path must alternate between the two lattices. \n\nIf B is on the same lattice as A, then we can give B coordinates (m,n) relative to A and the shortest path from A to B must move m units east and n units east of north. The shortest path between a lattice point and the next lattice point east is evidently one edge in direction 3 followed by one edge in direction 2. Similarly, the shortest path between a lattice point and the next lattice point east of north is one edge in direction 1, followed by one edge in direction 2. So a shortest path from A to B must have \\(\\mathrm{m + n}\\) edges in direction 2. \n\nB is a distance \\(\\sqrt[3]{(m + n / 2)}\\) east of A and a distance \\(3\\mathrm{n} / 2\\) north of A, so \\(\\mathrm{AB}^2 = (3\\mathrm{m}^2 + 3\\mathrm{mn} + 3\\mathrm{n}^2)\\) \\(< (4\\mathrm{m}^2 + 8\\mathrm{mn} + 4\\mathrm{n}^2) = 4(\\mathrm{m} + \\mathrm{n})^2\\) . So in this case the bug must travel more than AB/2 in direction 2.\n\n\n\nNow suppose B is on the other lattice. Let C be the lattice point immediately north of A and D the lattice point in direction 3 from A. Then a shortest path from A to B must either be A to C and then a shortest path from C to B, or A to D and then a shortest path from D to B. Take B to have coordinates (m, n) relative to C or D. \n\nIn the first case, \\(\\mathrm{AB}^2 = (\\sqrt{3} (\\mathrm{m} + \\mathrm{n} / 2))^2 + (3\\mathrm{n} / 2 + 1)^2 = (3\\mathrm{m}^2 + 3\\mathrm{mn} + 3\\mathrm{n}^2) + 3\\mathrm{n} + 1\\) and a shortest path has \\(\\mathrm{m} + \\mathrm{n}\\) units in direction 2. But \\(4(\\mathrm{m} + \\mathrm{n})^2 > (3\\mathrm{m}^2 + 3\\mathrm{mn} + 3\\mathrm{n}^2) + 3\\mathrm{n} + 1\\) , if \\(\\mathrm{m}^2 + \\mathrm{n}^2 + 5\\mathrm{mn} > 3\\mathrm{n} + 1\\) , which is true for m, n at least 1. If \\(\\mathrm{m} = 0\\) and \\(\\mathrm{n} = 1\\) , then a shortest path has 2 units in direction 1 and \\(\\mathrm{AB} = \\sqrt{7} < 4\\) . If \\(\\mathrm{m} = 1\\) and \\(\\mathrm{n} = 0\\) , then \\(\\mathrm{AB} = 2\\) and a shortest path has 1 unit in each direction. So in this case (the only one so far) we have equality. \n\nIt remains to consider the case where the path starts out towards D. In this case \\(\\mathrm{AB}^2 = (\\sqrt{3} (\\mathrm{m} + \\mathrm{n} / 2) + \\sqrt{3} /2)^2 + (3\\mathrm{n} / 2 - 1 / 2)^2 = (3\\mathrm{m}^2 + 3\\mathrm{mn} + 3\\mathrm{n}^2) + 3\\mathrm{m} + 1\\) and a path has \\(\\mathrm{m} + \\mathrm{n}\\) units in direction 2. But \\(4(\\mathrm{m} + \\mathrm{n})^2 > (3\\mathrm{m}^2 + 3\\mathrm{mn} + 3\\mathrm{n}^2) + 3\\mathrm{m} + 1\\) for \\(\\mathrm{m}^2 + \\mathrm{n}^2 + 5\\mathrm{mn} > 3\\mathrm{m} + 1\\) , which is true for m, n at least 1. If \\(\\mathrm{m} = 1\\) , \\(\\mathrm{n} = 0\\) , then a shortest path has 2 units in direction 3 and \\(\\mathrm{AB} = \\sqrt{7} < 4\\) . Finally, if \\(\\mathrm{m} = 0\\) and \\(\\mathrm{n} = 1\\) , then a shortest path has 1 unit in each direction and \\(\\mathrm{AB} = 2\\) . \n\nThus the answer to the final question is 3, because the only cases where the bug travels exactly \\(\\mathrm{AB} / 2\\) in one direction are where it goes to the opposite vertex of a hexagon it is on.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 9", "solution_match": "# Solution"}} {"year": "1964", "tier": "T1", "problem_label": "10", "problem_type": null, "exam": "AllSovietUnion", "problem": "A circle center O is inscribed in ABCD (touching every side). Prove that angle AOB + angle COD equals 180 degrees.", "solution": "Let AB touch the circle at W, BC at X, CD at Y, and DA at Z. Then AO bisects angle ZOW and BO bisects angle XOW. So angle AOB is half angle ZOX. Similarly angle COD is half angle XOZ and hence angle AOB + angle COD equals 180.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 10", "solution_match": "# Solution"}} {"year": "1964", "tier": "T1", "problem_label": "11", "problem_type": null, "exam": "AllSovietUnion", "problem": "The natural numbers a, b, n are such that for every natural number k not equal to b, b - k divides a - \\(\\mathrm{k^n}\\) . Prove that \\(\\mathrm{a} = \\mathrm{b^n}\\) .", "solution": "We have \\(\\mathrm{k^n - a = b^n - a}\\) (mod b - k). Hence \\(\\mathrm{b^n - a = 0}\\) (mod b - k) for every k not equal to b. But if \\(\\mathrm{b^n}\\) does not equal a, then by taking \\(\\mathrm{k - b > b^n - a}\\) we could render the equation false.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 11", "solution_match": "# Solution"}} {"year": "1964", "tier": "T1", "problem_label": "12", "problem_type": null, "exam": "AllSovietUnion", "problem": "How many (algebraically) different expressions can we obtain by placing parentheses in \\(\\mathrm{a_1 / a_2 / ... / a_n?}\\)", "solution": "Answer \\(2^{\\mathrm{n} - 2}\\) . \\(\\mathrm{a_1}\\) must be in the numerator, and \\(\\mathrm{a_2}\\) must be in the denominator, but the other symbols can be in either. This is easily proved by induction.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 12", "solution_match": "# Solution"}} {"year": "1964", "tier": "T1", "problem_label": "13", "problem_type": null, "exam": "AllSovietUnion", "problem": "What is the smallest number of tetrahedrons into which a cube can be partitioned?", "solution": "Answer: 5. \n\nTetrahedral faces are triangular, so each cube face requires at least two tetrahedral faces. So at least 12 tetrahedral faces are needed in all. At most three faces of a tetrahedron can be mutually orthogonal (and no two faces can be parallel), so at most 3 faces from each tetrahedron can contribute towards these 12. So we require at least 4 tetrahedra to provide the cube faces. But these tetrahedra each have volume at most \\(1 / 6\\) ( \\(1 / 3\\) x face area x 1, and face area is at most \\(1 / 2\\) ). So if we have only 4 tetrahedra in total then their total volume is less than the cube's volume. Contradiction. Hence we need at least 5 tetrahedra. \n\nIt can be done with 5: lop off 4 non- adjacent corners to leave a tetrahedron. More precisely, take the cube as ABCDA'B'C'D' with ABCD horizontal, A' directly under A, B' directly under B and so on. Then the five tetrahedra are AA'BD, CC'BC, DD'AC', BB'AC', BDA'C'.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 13", "solution_match": "# Solution"}} {"year": "1964", "tier": "T1", "problem_label": "14", "problem_type": null, "exam": "AllSovietUnion", "problem": "a) Find the smallest square with last digit not 0 which becomes another square (not zero) by the deletion of its last two digits. #(b) Find all squares, not containing the digits 0 or 5, such that if the second digit is deleted the resulting number divides the original one.", "solution": "(a) This one must have slipped through: 121! \n\n(b) Answer: 16,36,121,484. Suppose the number has more than 2 digits. Write it as \\((10\\mathrm{m}+\\) \\(\\mathrm{n})10^{\\mathrm{r}} + \\mathrm{s}\\) , where \\(1< = \\mathrm{m}< = 9\\) \\(0< = \\mathrm{n}< = 9\\) \\(0< = \\mathrm{s}< 10^{\\mathrm{r}}\\) . Then we have \\(\\mathrm{k(m.10^{r} + s) = (10m}\\) \\(+\\mathrm{n})10^{\\mathrm{r}} + \\mathrm{s}\\) , for some \\(\\mathrm{k} > 1\\) \n\ns does not contain the digits 0 or 5, so 5 does not divide s. Hence 5 divides k- 1, and so k must be 6, 11, or 16 (if k was 21 or more, then the rhs would be negative). Since 25 does not divide k- 1, we must have \\(\\mathrm{r} = 1\\) and s is a single digit. \n\nWe look at each possibility for k in turn. \\(\\mathrm{k} = 6\\) gives no solutions. \\(\\mathrm{k} = 11\\) gives about two dozen multiples of 11 from 121 to 891. By inspection the only squares are 121 and 484. \\(\\mathrm{k} =\\) 16 gives 192, which is not a square. \n\nIn addition, there is the possibility of 2 digit solutions, which I had overlooked. It is easiest to check each of the 2 digit squares, thus finding the additional solutions 16, 36.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 14", "solution_match": "# Solution"}} {"year": "1964", "tier": "T1", "problem_label": "15", "problem_type": null, "exam": "AllSovietUnion", "problem": "A circle is inscribed in ABCD. AB is parallel to CD, and BC = AD. The diagonals AC, BD meet at E. The circles inscribed in ABE, BCE, CDE, DAE have radius \\(\\mathrm{r}_1\\) , \\(\\mathrm{r}_2\\) , \\(\\mathrm{r}_3\\) , \\(\\mathrm{r}_4\\) respectively. Prove that \\(1 / \\mathrm{r}_1 + 1 / \\mathrm{r}_3 = 1 / \\mathrm{r}_2 + 1 / \\mathrm{r}_4\\) .", "solution": "A necessary and sufficient condition for ABCD to have an inscribed circle is \\(\\mathrm{AB} + \\mathrm{CD} = \\mathrm{BC}\\) \\(+\\mathrm{AD}\\) . So we have \\(\\mathrm{AB} + \\mathrm{CD} = 2\\mathrm{AD}\\) , which we use repeatedly. Extend DC to X so that BX is parallel to EC. Then \\(\\mathrm{DX} = \\mathrm{AB} + \\mathrm{CD} = 2\\mathrm{AD}\\) and the triangles DEC, AEB, DBX are similar. Let h be the perpendicular distance from AB to CD. The similar triangles give us the heights of DEC and AEB in terms of h. \n\n\\(1 / \\mathrm{r}_1 =\\) perimeter ABE/(2 area ABE) \\(= (\\mathrm{AB} + 2\\mathrm{EB}) / (\\mathrm{AB}.\\mathrm{height}) = (\\mathrm{AB}+\\) 2. BD.AB/(AB+CD))/(AB.h.AB/(AB+CD)) = 2(AD + BD)/(AB.h). Similarly, \\(1 / \\mathrm{r}_3 = 2(\\mathrm{AD}+\\) BD)/(CD.h). \n\nThe area of AED \\(=\\) area ABD - area ABE \\(= 1 / 2\\) AB.h.CD/(2AD), so \\(1 / \\mathrm{r}_2 = 1 / \\mathrm{r}_4 =\\) perimeter ADE/(2 area ADE) \\(= (\\mathrm{AD} + \\mathrm{BD}) / (\\mathrm{h}.\\mathrm{AB}.\\mathrm{CD} / 2\\mathrm{AD})\\) , and \\(1 / \\mathrm{r}_2 + 1 / \\mathrm{r}_4 = 2(\\mathrm{AD} + \\mathrm{BD}) / \\mathrm{h}\\) \\(2\\mathrm{AD} / (\\mathrm{AB}.\\mathrm{CD}) = 2(\\mathrm{AB} + \\mathrm{BD}) / \\mathrm{h}\\) \\((\\mathrm{AB} + \\mathrm{CD}) / (\\mathrm{AB}.\\mathrm{CD}) = 1 / \\mathrm{r}_1 + 1 / \\mathrm{r}_3\\)", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 15", "solution_match": "# Solution"}} {"year": "1965", "tier": "T1", "problem_label": "1", "problem_type": null, "exam": "AllSovietUnion", "problem": "(a) Each of \\(\\mathbf{x}_{1}, \\ldots , \\mathbf{x}_{\\mathrm{n}}\\) is -1, 0 or 1. What is the minimal possible value of the sum of all \\(\\mathbf{x}_{i}\\mathbf{x}_{j}\\) with \\(1 \\leq = \\mathrm{i} < \\mathrm{j} \\leq = \\mathrm{n}\\) ? (b) Is the answer the same if the \\(\\mathbf{x}_{i}\\) are real numbers satisfying \\(0 \\leq = |\\mathbf{x}_{i}| \\leq = 1\\) for \\(1 \\leq = \\mathrm{i} \\leq = \\mathrm{n}\\) ?", "solution": "(a) Answer: \\([- \\mathrm{n} / 2]\\) . \n\nLet \\(\\mathbf{A} = (\\mathbf{x}_{1} + \\ldots + \\mathbf{x}_{\\mathrm{n}})^{2}\\) , \\(\\mathbf{B} = \\mathbf{x}_{1}^{2} + \\ldots + \\mathbf{x}_{\\mathrm{n}}^{2}\\) . Then we must minimize \\(\\mathbf{A} - \\mathbf{B}\\) . For \\(\\mathrm{n}\\) even, we separately minimize \\(\\mathbf{A}\\) and maximize \\(\\mathbf{B}\\) by taking half the \\(\\mathbf{x}\\) 's to be \\(+1\\) and half to be - 1. For \\(\\mathrm{n}\\) odd we can take \\([\\mathrm{n} / 2]\\) \\(\\mathbf{x}\\) 's to be \\(+1\\) , \\([\\mathrm{n} / 2]\\) to be - 1, and one to be 0. That minimizes \\(\\mathbf{A}\\) and gives \\(\\mathbf{B}\\) one less than its maximum. That is the best we can do if we fix \\(\\mathbf{A} = 0\\) , since \\(\\mathbf{A} = 0\\) requires an even number of \\(\\mathbf{x}\\) 's to be non- zero and hence at least one to be zero. If we do not minimize \\(\\mathbf{A}\\) , then since its value must be an integer, its value will be at least 1. In that case, even if \\(\\mathbf{B}\\) is maximized we will not get a lower total. \n\n(b) Answer: \\(-[\\mathrm{n} / 2]\\) . For \\(\\mathrm{n}\\) even, the same argument works. For \\(\\mathrm{n}\\) odd we can clearly get \\(-[\\mathrm{n} / 2]\\) , so it remains to prove that we cannot get a smaller sum. Suppose otherwise, so that \\(\\mathbf{x}_{i}\\) is a minimal sum with sum less than \\(-[\\mathrm{n} / 2]\\) . Let \\(\\mathbf{x}_{\\mathrm{n}} = \\mathbf{x}\\) , then the sum is \\(\\mathbf{x}(\\mathbf{x}_{1} + \\ldots + \\mathbf{x}_{\\mathrm{n - 1}}) + \\mathbf{sum}\\) of terms \\(\\mathbf{x}_{i}\\mathbf{x}_{j}\\) with \\(1 \\leq = \\mathrm{i}, \\mathrm{j} < \\mathrm{n}\\) . But this is less than the sum for \\(\\mathrm{n - 1}\\) , so \\(\\mathbf{x}(\\mathbf{x}_{1} + \\ldots + \\mathbf{x}_{\\mathrm{n - 1}})\\) must be negative, and since it is minimal we must have \\(|\\mathbf{x}| = 1\\) . But the same argument shows that all the terms have modulus 1. We now have a contradiction since we know that the minimum in this case is \\(-[\\mathrm{n} / 2]\\) .", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 1", "solution_match": "# Solution"}} {"year": "1965", "tier": "T1", "problem_label": "2", "problem_type": null, "exam": "AllSovietUnion", "problem": "Two players have a 3 x 3 board. 9 cards, each with a different number, are placed face up in front of the players. Each player in turn takes a card and places it on the board until all the cards have been played. The first player wins if the sum of the numbers in the first and third rows is greater than the sum in the first and third columns, loses if it is less, and draws if the sums are equal. Which player wins and what is the winning strategy?", "solution": "The first player always wins. \n\nLet the board be: \n\n. F . S . S . F . \n\nWe call the squares marked F the F- squares, the squares marked S the S- squares, and the remaining squares the neutral squares. The first player wins if the sum of the two cards on the F- squares exceeds the sum of the two cards on the S- squares. We also call the first player F and the second player S.\n\n\n\nLet the cards be \\(\\mathrm{a_1 > a_2 > \\ldots > a_9}\\) . Let \\(\\mathrm{t_1 = a_1 + a_9}\\) , \\(\\mathrm{t_2 = a_2 + a_8}\\) , \\(\\mathrm{t_3 = a_3 + a_7}\\) , \\(\\mathrm{t_4 = a_4 + a_6}\\) . \n\nIf \\(\\mathrm{t_1 > t_2}\\) , or \\(\\mathrm{t_1 = t_2 > t_3}\\) , or \\(\\mathrm{t_1 = t_2 = t_3 > = t_4}\\) (\\*), then F's strategy is to get a total of \\(\\mathrm{t_1}\\) or better on the F- squares and to force S to a lower score on the S- squares. If (\\*) does not hold, then F's strategy is to force S to \\(\\mathrm{t_1}\\) or lower, and to get a higher score. \n\nIf (\\*) holds, then F starts by playing \\(\\mathrm{a_1}\\) to an F- square. S must play to the remaining F- square, otherwise F will play \\(\\mathrm{a_3}\\) or better to it on his next move and win. So S must play \\(\\mathrm{a_9}\\) to the remaining F- square, giving F a total of \\(\\mathrm{t_1}\\) . \n\nNow if \\(\\mathrm{t_1 > t_2}\\) , then F forces S to \\(\\mathrm{t_2}\\) or worse by playing \\(\\mathrm{a_8}\\) to an S- square. \n\nIf \\(\\mathrm{t_1 = t_2 > t_3}\\) , then F forces S to \\(\\mathrm{t_3}\\) or worse by playing \\(\\mathrm{a_2}\\) to a neutral square. If S plays to an S- square, then he cannot do better than \\(\\mathrm{a_3 + a_8}\\) , which loses. So he plays \\(\\mathrm{a_8}\\) to a neutral square. But now F plays \\(\\mathrm{a_3}\\) to an S- square, and S cannot do better than \\(\\mathrm{t_3}\\) . \n\nIf \\(\\mathrm{t_1 = t_2 = t_3 > t_4}\\) , then F forces S to \\(\\mathrm{t_4}\\) or worse. He starts by playing \\(\\mathrm{a_2}\\) to a neutral square. If does not prevent F playing \\(\\mathrm{a_8}\\) to an S- square on his next move, then he cannot do better than \\(\\mathrm{a_3 + a_8}\\) , which loses. So he must play \\(\\mathrm{a_8}\\) to a neutral square. Now F plays \\(\\mathrm{a_3}\\) to a neutral square. If S does not prevent F playing \\(\\mathrm{a_7}\\) to an S- square on the following move, then he cannot do better than \\(\\mathrm{a_4 + a_7}\\) which loses, so he plays \\(\\mathrm{a_7}\\) to a neutral square. F now plays \\(\\mathrm{a_4}\\) to an S- square. S cannot now do better than \\(\\mathrm{t_4}\\) , which loses. \n\nFinally, if \\(\\mathrm{t_1 = t_2 = t_3 = t_4}\\) , then F proceeds as in the last case except that at the end he plays \\(\\mathrm{a_4}\\) to the last neutral square instead of to an S- square. S now gets \\(\\mathrm{a_5 + a_6}\\) on the S- squares, which loses. \n\nIf (\\*) does not hold, then F starts by playing \\(\\mathrm{a_9}\\) to an S- square. If S does not play to the other S- square, then F will play \\(\\mathrm{a_7}\\) or \\(\\mathrm{a_8}\\) there on his next move and S will lose. So S must play \\(\\mathrm{a_1}\\) to the other square, and gets a total of \\(\\mathrm{t_1}\\) . F now plays to get \\(\\mathrm{t_2}\\) , \\(\\mathrm{t_3}\\) or \\(\\mathrm{t_4}\\) on the F- squares. \n\nIf \\(\\mathrm{t_1 < t_2}\\) , then F plays \\(\\mathrm{a_2}\\) to an F- square and so gets at least \\(\\mathrm{t_2}\\) and wins. \n\nIf \\(\\mathrm{t_1 = t_2 < t_3}\\) , then F plays \\(\\mathrm{a_8}\\) to a neutral square. If S does not prevent F playing \\(\\mathrm{a_2}\\) to an F- square on his next move, then F will get at least \\(\\mathrm{a_2 + a_7}\\) and win. So S must play \\(\\mathrm{a_2}\\) to a neutral square. Now F plays \\(\\mathrm{a_3}\\) to an F- square and so gets at least \\(\\mathrm{t_3}\\) on the F- squares and wins. \n\nFinally, if \\(\\mathrm{t_1 = t_2 = t_3 < t_4}\\) , then F plays as in the previous case, except that at the end he plays \\(\\mathrm{a_7}\\) to a neutral square instead of \\(\\mathrm{a_3}\\) to an F- square. S must prevent F playing \\(\\mathrm{a_3}\\) to an F- square the following move, or F gets at least \\(\\mathrm{a_3 + a_6}\\) and wins. So S plays \\(\\mathrm{a_3}\\) to a neutral square. F now plays \\(\\mathrm{a_4}\\) to an F square and so must get at least \\(\\mathrm{t_4}\\) , which wins.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 2", "solution_match": "# Solution"}} {"year": "1965", "tier": "T1", "problem_label": "3", "problem_type": null, "exam": "AllSovietUnion", "problem": "A circle is circumscribed about the triangle ABC. X is the midpoint of the arc BC (on the opposite side of BC to A), Y is the midpoint of the arc AC, and Z is the midpoint of the arc AB. YZ meets AB at D and YX meets BC at E. Prove that DE is parallel to AC and that DE passes through the center of the inscribed circle of ABC.", "solution": "ZY bisects the angle AYB, so AD/BD = AY/BY. Similarly, XY bisects angle BYC, so CE/BE = CY/BY. But AY = CY. Hence AD/BD = CE/BE. Hence triangles BDE and BAC are similar and DE is parallel to AC. \n\nLet BY intersect AC at W and AX at I. I is the in- center. AI bisects angle BAW, so WI/IB = AW/AB. Now consider the triangles AYW, BYA. Clearly angle AYW = angle BYA. Also angle WAY = angle CAY = angle ABY. Hence the triangles are similar and AW/AY = AB/BY. So AW/AB = AY/BY. Hence WI/IB = AY/BY = AD/BD. So triangles BDI and BAW are similar and DI is parallel to AW and hence to DE. So DE passes through I.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 3", "solution_match": "# Solution"}} {"year": "1965", "tier": "T1", "problem_label": "4", "problem_type": null, "exam": "AllSovietUnion", "problem": "Bus numbers have 6 digits, and leading zeros are allowed. A number is considered lucky if the sum of the first three digits equals the sum of the last three digits. Prove that the sum of all lucky numbers is divisible by 13.", "solution": "The total is made up of numbers of the form abcabc, and pairs of numbers abcxyz, xyzabc. The former is abc.1001 and the sum of the pair is 1001(abc + xyz). So the total is divisible by 1001 and hence by 13.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 4", "solution_match": "# Solution"}} {"year": "1965", "tier": "T1", "problem_label": "5", "problem_type": null, "exam": "AllSovietUnion", "problem": "The beam of a lighthouse on a small rock penetrates to a fixed distance d. As the beam rotates the extremity of the beam moves with velocity v. Prove that a ship with speed at most v/8 cannot reach the rock without being illuminated.", "solution": "Let the lighthouse be at L. Take time \\(t = 0\\) at the moment the boat starts its run, so that at \\(t = 0\\) it is at S a distance d from L, and thereafter it is at a distance less than d. Take A and B a distance d from L so that ALBS is a semicircle with diameter AB and S the midpoint of the arc AB. During the period to \\(t = 2.5\\) pi.d/v the boat has traveled a distance less than d, so it cannot reach AB. But it is a distance less than d from L, so it must be inside the semicircle. But during this period the beam sweeps across from LA to LB and so it must illuminate the boat.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 5", "solution_match": "# Solution"}} {"year": "1965", "tier": "T1", "problem_label": "6", "problem_type": null, "exam": "AllSovietUnion", "problem": "A group of 100 people is formed to patrol the local streets. Every evening 3 people are on duty. Prove that you cannot arrange for every pair to meet just once on duty.", "solution": "Every time a person is on duty he is paired with two other people, so if the arrangement were possible the number of pairs involving a particular person would have to be even. But it is 99.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 6", "solution_match": "# Solution"}} {"year": "1965", "tier": "T1", "problem_label": "7", "problem_type": null, "exam": "AllSovietUnion", "problem": "A tangent to the inscribed circle of a triangle drawn parallel to one of the sides meets the other two sides at X and Y. What is the maximum length XY, if the triangle has perimeter p?", "solution": "Let BC be the side parallel to XY, h the length of the altitude from A, and r the radius of the in- circle. Then XY/BC = (h - 2r)/h. But r.p = h.BC. So XY = (p - 2BC)BC/p = (p²/8 - 2(BC - p/4)²)/p. So the maximum occurs when BC = p/4 and has value p/8.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 7", "solution_match": "# Solution"}} {"year": "1965", "tier": "T1", "problem_label": "8", "problem_type": null, "exam": "AllSovietUnion", "problem": "The \\(\\mathrm{n}^2\\) numbers \\(\\mathbf{x}_{\\mathrm{ij}}\\) satisfy the \\(\\mathrm{n}^3\\) equations: \\(\\mathbf{x}_{\\mathrm{ij}} + \\mathbf{x}_{\\mathrm{jk}} + \\mathbf{x}_{\\mathrm{ki}} = 0\\) . Prove that we can find numbers \\(\\mathbf{a}_1\\) , ..., \\(\\mathbf{a}_{\\mathrm{n}}\\) such that \\(\\mathbf{x}_{\\mathrm{ij}} = \\mathbf{a}_{\\mathrm{i}} - \\mathbf{a}_{\\mathrm{j}}\\) .", "solution": "Taking \\(\\mathrm{i} = \\mathrm{j} = \\mathrm{k}\\) , we have that \\(\\mathbf{x}_{\\mathrm{ii}} = 0\\) . Now taking \\(\\mathrm{j} = \\mathrm{k}\\) , we have that \\(\\mathbf{x}_{\\mathrm{ij}} = - \\mathbf{x}_{\\mathrm{ji}}\\) . Define \\(\\mathbf{a}_{\\mathrm{i}} = \\mathbf{x}_{\\mathrm{i1}}\\) . Then we have \\(\\mathbf{x}_{\\mathrm{i1}} + \\mathbf{x}_{\\mathrm{ij}} + \\mathbf{x}_{\\mathrm{ji}} = 0\\) . Hence \\(\\mathbf{x}_{\\mathrm{ij}} = \\mathbf{a}_{\\mathrm{i}} - \\mathbf{a}_{\\mathrm{j}}\\) .", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 8", "solution_match": "# Solution"}} {"year": "1965", "tier": "T1", "problem_label": "9", "problem_type": null, "exam": "AllSovietUnion", "problem": "Can 1965 points be arranged inside a square with side 15 so that any rectangle of unit area placed inside the square with sides parallel to its sides must contain at least one of the points?", "solution": "Yes. Place a grid of 900 points in 30 equally spaced rows and columns, so that each point is a distance 15/31 from its nearest neighbours (or 15/31 from the edge). This blocks all rectangles except those slimmer than 1/2. Those slimmer than 1/2 must have length at least 2, so we can block them with a smaller set of rows and columns containing more finely spaced points. \n\nLabel the rows 1- 30. In each of the 7 rows 3, 7, 11, 15, 19, 23, 27 place an additional 31 points, so that each of these rows has 61 equally spaced points at a spacing of 15/62. Similarly for the columns. So in total we are placing an additional \\(2.7.31 = 434\\) points. Any rectangle of length \\(>2\\) must encounter one of these rows (or columns) and hence must have width less than 1/4. This blocks any rectangle except those with width \\(< 1 / 4\\) . \n\nIn each of the 3 rows 7, 15, 23 place an additional 62 points, so that each of these rows has 123 equally spaced points at a spacing of 15/124. Similarly for the columns. So in total we are placing an additional \\(2.3.62 = 372\\) points. Any rectangle of length \\(>4\\) must encounter one of these rows (or columns) and hence must have width less than 1/8. This blocks any rectangle except those with width \\(< 1 / 8\\) and hence length \\(>8\\) . \n\nIn row 15 place an additional 124 points, so that it has a total of 247 equally spaced points at a spacing of 15/247. Similarly for column 15. This requires an additional 248 points. Any rectangle which can fit through these gaps has area at most \\(15 \\times 15 / 247 < 1\\) . So we have blocked all rectangles with area 1 or more and used \\(900 + 434 + 372 + 248 = 1954\\) points. \n\nIlan Mayer, who seems to solve these problems effortlessly, came up with a neater arrangement of points. He used narrowly spaced points along widely spaced diagonals: (k/15, k/15) for \\(\\mathrm{k} = 1,2,\\ldots ,224\\) ; ((28\\*n+k)/15, k/15) for \\(\\mathrm{n} = 1,2,\\ldots ,7\\) , \\(\\mathrm{k} = 1,2,\\ldots ,224 - 28\\*n\\) ; (k/15,\n\n\n\n\\((28^{*}\\mathrm{n} + \\mathrm{k}) / 15\\) for \\(\\mathrm{n} = 1,2,\\dots,7\\) \\(\\mathrm{k} = 1,2,\\dots,224 - 28^{*}\\mathrm{n}\\) . The diagonals are spaced 28/15 apart, so the biggest rectangle that can be fitted between two diagonals has sides 15/15 less epsilon and 15/15 less epsilon. For example, take the vertices as \\((14 / 15 + \\mathrm{e},\\mathrm{e})\\) , \\((29 / 15 - \\mathrm{e},\\mathrm{e})\\) , \\((14 / 15 + \\mathrm{e}\\) , \\(15 / 15 - \\mathrm{e})\\) , \\((29 / 15 - \\mathrm{e},15 / 15 - \\mathrm{e})\\) . If one allows a rectangle to touch points (in other words if one took the rectangles to exclude their boundaries) then this does not work - many \\(15\\mathrm{x}1 / 15\\) rectangles will fit. But one can add an additional point on each of the 15 lines, keeping the points on each line evenly spaced. That blocks rectangles without boundary and still has only 1821 points.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 9", "solution_match": "# Solution"}} {"year": "1965", "tier": "T1", "problem_label": "10", "problem_type": null, "exam": "AllSovietUnion", "problem": "Given n real numbers \\(\\mathrm{a_1,a_2,\\ldots,a_n}\\) , prove that you can find n integers \\(\\mathrm{b_1,b_2,\\ldots,b_n}\\) , such that \\(\\mathrm{|a_i - b_i| < 1}\\) and the sum of any subset of the original numbers differs from the sum of the corresponding \\(\\mathrm{b_i}\\) by at most \\((\\mathrm{n} + 1) / 4\\) .", "solution": "We can take all \\(\\mathrm{a_i}\\) to lie in the range (0,1) and all \\(\\mathrm{b_i}\\) to be 0 or 1. The largest positive value of the sum of \\((\\mathrm{a_i - b_i})\\) for any subset is achieved by taking the subset of those i for which \\(\\mathrm{b_i = 0}\\) . Similarly, the largest negative value is achieved by taking those i for which \\(\\mathrm{b_i = 1}\\) . So the worst subset will be one of those two. \n\nIf \\(\\mathrm{a_i< a_j}\\) , then we cannot have \\(\\mathrm{b_i = 1}\\) and \\(\\mathrm{b_j = 0}\\) if the set of \\(\\mathrm{b_i}\\) is to minimise the maximum sum, because swapping them would reduce the sum of a's with \\(\\mathrm{b = 0}\\) and the sum of \\((1 - \\mathrm{a})\\) 's with \\(\\mathrm{b = 1}\\) . So if we order the a's so that \\(\\mathrm{a_1< = a_2< = \\ldots < = a_n}\\) , then a best set of b's is \\(\\mathrm{b_i = 0}\\) for \\(\\mathrm{i< =}\\) some k, and \\(\\mathrm{b_i = 1}\\) for \\(\\mathrm{i > k}\\) . [If some of the \\(\\mathrm{a_i}\\) are equal, then we can find equally good sets of b's do not have this form, but we cannot get a lower maximum sum by departing from this form.] \n\nLet \\(\\mathrm{L_i = a_1 + a_2 + \\ldots + a_i}\\) , and \\(\\mathrm{R_i = a_{i + 1} + a_{i + 2} + \\ldots + a_n}\\) . As we increase i the sums \\(\\mathrm{L_i}\\) increase and the sums \\(\\mathrm{R_i}\\) decrease, so for some k we must have \\(\\mathrm{L_k< R_k}\\) , \\(\\mathrm{L_{k + 1} > = R_{k + 1}}\\) . Either k or \\(\\mathrm{k + 1}\\) must correspond to the optimum choice of b's to minimise the maximum sum. \n\nNow assume that the a's form a maximal set, in other words they are chosen so that the minimum is as large as possible. We show first that in this case \\(\\mathrm{L_{k + 1} = R_k}\\) . Suppose \\(\\mathrm{L_{k + 1}< R_k}\\) . Then we could increase each of \\(\\mathrm{a_{k + 1}}\\) , \\(\\mathrm{a_{k + 2}}\\) , ..., \\(\\mathrm{a_n}\\) by epsilon. This would leave \\(\\mathrm{L_k}\\) unaffected, but slightly increase \\(\\mathrm{L_{k + 1}}\\) and slightly reduce \\(\\mathrm{R_k}\\) . For small epsilon this does not change the value of k, but increases the smaller of \\(\\mathrm{L_{k + 1}}\\) and \\(\\mathrm{R_k}\\) , thus increasing the minimum and contradicting the maximality of the original a's. Similarly, if \\(\\mathrm{L_{k + 1} > R_k}\\) , we could decrease each of \\(\\mathrm{a_1}\\) , \\(\\mathrm{a_2}\\) , ..., \\(\\mathrm{a_{k + 1}}\\) by epsilon, thus slightly increasing \\(\\mathrm{R_k}\\) and reducing \\(\\mathrm{L_{k + 1}}\\) . \n\nSuppose not all of \\(\\mathrm{a_1,a_2,\\ldots,a_{k + 1}}\\) are equal. Take i so that \\(\\mathrm{a_i< a_{i + 1}}\\) . Now increase each of \\(\\mathrm{a_1}\\) , \\(\\mathrm{a_2,\\ldots,a_i}\\) by epsilon and reduce each of \\(\\mathrm{a_{i + 1}}\\) , \\(\\mathrm{a_{i + 2},\\ldots,a_{k + 1}}\\) by epsilon', with epsilon and epsilon' sufficiently small that we do not upset the ordering or change the value of k, and with their relative sizes chosen so that \\(\\mathrm{L_{k + 1}}\\) is increased. \\(\\mathrm{R_k}\\) is also increased, so we contradict the maximality of the a's. Hence all \\(\\mathrm{a_1,a_2,\\ldots,a_{k + 1}}\\) are equal. Similarly, we show that all of \\(\\mathrm{a_{k + 1}}\\) , ..., \\(\\mathrm{a_n}\\) are equal. For if not we can increase slightly \\(\\mathrm{a_{k + 1}}\\) , ..., \\(\\mathrm{a_j}\\) and reduce slightly \\(\\mathrm{a_{j + 1}}\\) , ..., \\(\\mathrm{a_n}\\) to get a contradiction. \n\nSo we have established that all the a's must be equal. Suppose n is odd \\(= 2\\mathrm{m} + 1\\) and that all the a's equal x. Then for the optimum k we have \\((\\mathrm{k + 1})\\mathrm{x} = (2\\mathrm{m} + 1 - \\mathrm{k})(1 - \\mathrm{x})\\) , hence \\(\\mathrm{k + 1} = (2\\mathrm{m} + 2)(1-\\)\n\n\n\nx) and the maximum difference is \\((k + 1)x = (2m + 2)(1 - x)x\\) . This is maximised by taking \\(\\mathrm{x} =\\) \\(1 / 2\\) , \\(\\mathrm{k} = \\mathrm{m}\\) , and is \\((m + 1) / 2 = (n + 1) / 4\\) . If n is even \\(= 2\\mathrm{m}\\) , then for the optimum \\(\\mathrm{k}\\) we have \\((k + 1)x = (2m - k)(1 - x)\\) , so \\(\\mathrm{k} + 1 = (2m + 1)(1 - x)\\) , and the maximum difference is \\((k + 1)x =\\) \\((2m + 1)(1 - x)x\\) . However, in this case we cannot take \\(\\mathrm{x} = 1 / 2\\) , because that would give \\(\\mathrm{k} = \\mathrm{m}\\) - \\(1 / 2\\) which is non- integral, so we take \\(\\mathrm{k} = \\mathrm{m} - 1\\) or m, both of which give a maximum difference of \\(\\mathrm{m(m + 1)} / (2\\mathrm{m + 1}) = \\mathrm{n(n + 2)} / (4\\mathrm{n + 4}) < (\\mathrm{n + 1}) / 4\\) .", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 10", "solution_match": "# Solution"}} {"year": "1965", "tier": "T1", "problem_label": "11", "problem_type": null, "exam": "AllSovietUnion", "problem": "A tourist arrives in Moscow by train and wanders randomly through the streets on foot. After supper he decides to return to the station along sections of street that he has traversed an odd number of times. Prove that this is always possible. [In other words, given a path over a graph from A to B, find a path from B to A consisting of edges that are used an odd number of times in the first path.]", "solution": "Disregard all edges except those used in the path from A to B, and for each of those let the multiplicity be the number of times it was traversed. Let the degree of a vertex be the sum of the multiplicities of its edges. The key is to notice that the degree of every vertex except A and B must be even. For as we traverse the path from A to B we increase the degree by 2 each time we pass through a vertex. But at the start of the path, as we leave A, we only increase its degree by 1. Similarly as we arrive at B for the last time. \n\nNow construct a path from B as follows. Since B has odd degree it must have an edge of odd multiplicity. Suppose the edge connects B to C. Follow that edge and reduce its multiplicity by one, so that B's degree and C's degree are each reduced by one. Now C has odd degree, so it must have an edge of odd multiplicity. Repeat. Since there are only finitely many edges we must eventually be unable to continue the path. But the only way that can happen is if we reach A.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 11", "solution_match": "# Solution"}} {"year": "1965", "tier": "T1", "problem_label": "12", "problem_type": null, "exam": "AllSovietUnion", "problem": "(a) A committee has met 40 times, with 10 members at every meeting. No two people have met more than once at committee meetings. Prove that there are more than 60 people on the committee. \n\n(b) Prove that you cannot make more than 30 subcommittees of 5 members from a committee of 25 members with no two subcommittees having more than one common member.", "solution": "(a) Each meeting involves \\(10.9 / 2 = 45\\) pairs. So after 40 meetings, there have been 1800 pairs. We are told that these are all distinct. But if there are N people on the committee, then there are only N(N-1)/2 pairs available. For N=60, this is only 1770. \n\n(b) A subcommittee of 5 has \\(5.4 / 2 = 10\\) pairs. So 31 subcommittees have 310 pairs, and these are all distinct, since no two people are on more than one subcommittee. But a committee of 25 only has \\(25.24 / 2 = 300\\) pairs available.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 12", "solution_match": "# Solution"}} {"year": "1965", "tier": "T1", "problem_label": "13", "problem_type": null, "exam": "AllSovietUnion", "problem": "Given two relatively prime natural numbers r and s, call an integer good if it can be represented as mr + ns with m, n non- negative integers and bad otherwise. Prove that we can find an integer c, such that just one of k, c - k is good for any k. How many bad numbers are there?", "solution": "Notice that 0 is good and all negative numbers are bad. Take \\(\\mathrm{c} = \\mathrm{rs} - \\mathrm{r} - \\mathrm{s}\\) . First c, is bad. For suppose otherwise: \\(\\mathrm{c} = \\mathrm{mr} + \\mathrm{ns}\\) . Then \\(\\mathrm{mr} + \\mathrm{ns} = (\\mathrm{s - 1})\\mathrm{r} - \\mathrm{s}\\) . Hence \\((\\mathrm{s - 1 - m})\\mathrm{r} = (\\mathrm{n + 1})\\mathrm{s}\\) , so r divides \\(\\mathrm{n + 1}\\) . Say \\(\\mathrm{n + 1 = kr}\\) , and then \\(\\mathrm{s - 1 - m = ks}\\) , so \\(\\mathrm{m} = (1 - \\mathrm{k})\\mathrm{s} - 1\\) . But \\(\\mathrm{n + 1}\\) is positive, so \\(\\mathrm{k} > = 1\\) , and hence m is negative. Contradiction. \n\nIf k is good, then c- k must be bad (otherwise c would be good). Suppose k is bad. Since r and s are relatively prime we can find integers a and b with \\(\\mathrm{ar} + \\mathrm{bs} = 1\\) and hence integers m and n with \\(\\mathrm{mr} + \\mathrm{ns} = \\mathrm{k}\\) . Adding a multiple of sr - rs to both sides if necessary, this gives a pair m, n with \\(\\mathrm{mr} + \\mathrm{ns} = \\mathrm{k}\\) and m non- negative. Now take the pair with the smallest possible nonnegative m. Then \\(\\mathrm{m} < = \\mathrm{s - 1}\\) (for otherwise \\(\\mathrm{m}' = \\mathrm{m - s}\\) , \\(\\mathrm{n}' = \\mathrm{n + r}\\) would be a pair with smaller non- negative m). Also \\(\\mathrm{n} < = - 1\\) , otherwise k would be good. Now \\(\\mathrm{c - k} = (\\mathrm{s - 1 - m})\\mathrm{r} + (\\mathrm{- n - 1})\\mathrm{s}\\) and the coefficients \\(\\mathrm{s - 1 - m}\\) and \\(\\mathrm{- n - 1}\\) are both non- negative, so \\(\\mathrm{c - k}\\) is good. \n\nSo exactly \\((\\mathrm{rs} - \\mathrm{r} - \\mathrm{s} + 1) / 2\\) integers are bad.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 13", "solution_match": "# Solution"}} {"year": "1965", "tier": "T1", "problem_label": "14", "problem_type": null, "exam": "AllSovietUnion", "problem": "A spy- plane circles point A at a distance \\(10\\mathrm{km}\\) with speed \\(1000\\mathrm{km / h}\\) . A missile is fired towards the plane from A at the same speed and moves so that it is always on the line between A and the plane. How long does it take to hit?", "solution": "Answer: 18pi sec. \n\nLet C be the position of the spy- plane at the moment the missile is fired. Let B be the point a quarter of the way around the circle from C (in the direction the spy- plane is moving). Then the missile moves along the semi- circle on diameter AB and hits the plane at B. \n\nTo see this take a point P on the quarter circle and let the line AX meet the semi- circle at Q. Let O be the center of the semicircle. The angle BOQ is twice the angle BAQ, so the arc BP is the same length as the arc BQ. Hence also the arc AQ is the same length as the arc CP.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 14", "solution_match": "# Solution"}} {"year": "1965", "tier": "T1", "problem_label": "15", "problem_type": null, "exam": "AllSovietUnion", "problem": "Prove that the sum of the lengths of the edges of a polyhedron is at least 3 times the greatest distance between two points of the polyhedron.", "solution": "If A and B are at the greatest distance, then they must be vertices. For suppose A is not a vertex. Then there is a segment XY entirely contained in the polyhedron with A as an interior point. But now at least one of angles BAX, BAY must be at least 90. Suppose it is BAX. Then BX is longer than BA. Contradiction.\n\n\n\nTake a plane through A perpendicular to the line AB. Then the polyhedron must lie entirely on one side of the plane, for if Z lay on the opposite side to B, then BZ would be longer than BA. Now move the plane slightly towards B keeping it perpendicular to AB. The intersection of the plane and the polyhedron must be a small polygon. The polygon must have at least 3 vertices, each of which must lie on an edge of the polyhedron starting at A. Select three of these edges. \n\nAs the plane is moved further towards B, the selected vertices may sometimes split into multiple vertices or they may sometimes coalesce. In the former case, just choose one of the daughter vertices. In the latter case, let O be the point of intersection of the plane and AB. Let O' be the point of intersection at the last coalescence (or A if there was none). Then we have three paths along edges, with no edges in common, each of which projects onto O'O and hence has length at least O'O. Now select one or more new vertices to replace any lost through coalescence and repeat.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 15", "solution_match": "# Solution"}} {"year": "1965", "tier": "T1", "problem_label": "16", "problem_type": null, "exam": "AllSovietUnion", "problem": "An alien moves on the surface of a planet with speed not exceeding u. A spaceship searches for the alien with speed v. Prove the spaceship can always find the alien if \\(v > 10u\\) .", "solution": "The spacecraft flies at a constant height, so that it can see a circular spot on the surface. It starts at the north pole and spirals down to the south pole, overlapping its previous track on each circuit. The alien cannot move fast enough to cross the track before the next circuit, so it is trapped inside a reducing area surrounding the south pole. \n\nThe value of 10 is not critical, so we do not have to optimise the details. Take the height above the surface to be half the radius. Then a diameter of the spot subtends an angle 2 cos' \\((1 / 1.5)\\) at the center of the planet. \\(1 / 1.5< 1 / \\sqrt{2}\\) , so the angle is more than 90 degrees. The critical case is evidently when the spacecraft is circling the equator. Using suitable units, we may take the radius of the planet to be 1 and the spaceship speed to be 1. Then the diameter of the spot is \\(\\mathrm{pi} / 2\\) . We take the overlap to be \\(2 / 3\\) , so that each revolution the track advances \\(\\mathrm{pi} / 6\\) . If the planet flew in a circle above the equator, the distance for a revolution would be \\(2\\mathrm{pi}1.5 = 3\\mathrm{pi}\\) . The helical distance must be less than \\(3\\mathrm{pi} + \\mathrm{pi} / 6 = 19\\mathrm{pi} / 6\\) . So the alien can travel a distance \\(19\\mathrm{pi} / 60< 2 / 3\\mathrm{pi} / 2\\) and is thus trapped as claimed.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 16", "solution_match": "# Solution"}} {"year": "1966", "tier": "T1", "problem_label": "1", "problem_type": null, "exam": "AllSovietUnion", "problem": "There are an odd number of soldiers on an exercise. The distance between every pair of soldiers is different. Each soldier watches his nearest neighbour. Prove that at least one soldier is not being watched.", "solution": "The key is to notice that no loops of size greater than two are possible. For suppose we have \\(\\mathrm{A_1}\\) \\(\\mathrm{A}_2\\) ... \\(\\mathrm{A_n}\\) with \\(\\mathrm{A_i}\\) watching \\(\\mathrm{A_{i + 1}}\\) for \\(0< \\mathrm{i}< \\mathrm{n}\\) , and \\(\\mathrm{A_n}\\) watching \\(\\mathrm{A_1}\\) . Then the distance \\(\\mathrm{A_i}\\) \\(\\mathrm{A_i}\\) is greater than the distance \\(\\mathrm{A_iA_{i + 1}}\\) for \\(1< \\mathrm{i}< \\mathrm{n}\\) , and the distance \\(\\mathrm{A_1A_n}\\) is less than the distance \\(\\mathrm{A_1A_2}\\) . Hence the distance \\(\\mathrm{A_1A_n}\\) is less than the distance \\(\\mathrm{A_{n - 1}A_n}\\) and so \\(\\mathrm{A_{n - 1}}\\) is closer to \\(\\mathrm{A_n}\\) than \\(\\mathrm{A_1}\\) . Contradiction. \n\nPick any soldier. Now pick the soldier he is watching, and so on. The total number of soldiers is finite so this process must terminate with some soldier watching his predecessor. If the process terminates after more than two soldiers have been picked, then the penultimate soldier is watched by more than one soldier. But in that case there must be another soldier who is unwatched, because the number of soldiers equals the number of soldiers watching. \n\nIf the process terminates after just two soldiers, then we have a pair of soldiers watching each other. Now repeat on the remaining soldiers. Either we find a soldier watched twice (in which case some other soldier must be unwatched) or all the soldiers pair off, except one, since the total number is odd. But that soldier must be unwatched.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 1", "solution_match": "# Solution"}} {"year": "1966", "tier": "T1", "problem_label": "2", "problem_type": null, "exam": "AllSovietUnion", "problem": "(a) B and C are on the segment AD with \\(\\mathrm{AB} = \\mathrm{CD}\\) . Prove that for any point P in the plane: \\(\\mathrm{PA} + \\mathrm{PD} \\geq \\mathrm{PB} + \\mathrm{PC}\\) . \n\n(b) Given four points A, B, C, D on the plane such that for any point P on the plane we have \\(\\mathrm{PA} + \\mathrm{PD} \\geq \\mathrm{PB} + \\mathrm{PC}\\) . Prove that B and C are on the segment AD with \\(\\mathrm{AB} = \\mathrm{CD}\\) .", "solution": "(a) Suppose the points lie in the order A, B, C, D. If P lies on AD, then the result is trivial, and we have equality if P lies outside the segment AD. So suppose P does not lie on AD. \n\nLet M be the midpoint of AD. Take P' so that P, M, P' are collinear and \\(\\mathrm{PM} = \\mathrm{MP}\\) . Then we wish to prove that \\(\\mathrm{PA} + \\mathrm{AP}' > \\mathrm{PB} + \\mathrm{BP}'\\) . Extend P'B to meet PA at Q. Then \\(\\mathrm{P'A} + \\mathrm{AQ} > \\mathrm{P'Q}\\) , so \\(\\mathrm{P'A} + \\mathrm{AP} > \\mathrm{P'Q} + \\mathrm{QP}\\) . But \\(\\mathrm{QP} + \\mathrm{BQ} > \\mathrm{PB}\\) , so \\(\\mathrm{QP} + \\mathrm{QP}' > \\mathrm{PB} + \\mathrm{PB}'\\) . Hence result. \n\n(b) Let the foot of the perpendicular from B, C onto AD be X, Y respectively. Suppose that N, the midpoint of XY, is on the same side of M, the midpoint of AD, as D. Then take P to be a remote point on the line AD, the opposite side of A to D, so that A, D, M and N are all on the same side of the line PAD from P. Then \\(\\mathrm{PA} + \\mathrm{PD} = 2\\mathrm{PM} < 2\\mathrm{PN} \\leq \\mathrm{PB} + \\mathrm{PC}\\) . \n\nContradiction. So we must have N coincide with M. But we still have \\(\\mathrm{PA} + \\mathrm{PD} = 2\\mathrm{PM} = 2\\mathrm{PN} < \\mathrm{PB} + \\mathrm{PC}\\) , unless both B and C are on the line AD. So we must have B and C on the line AD\n\n\n\nand \\(\\mathrm{AB} = \\mathrm{CD}\\) . It remains to show that B and C are between A and D. Take \\(\\mathrm{P} = \\mathrm{B}\\) . Then if C is not between A and D, we have \\(\\mathrm{PC} > \\mathrm{PD}\\) (or PA), contradiction.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 2", "solution_match": "# Solution"}} {"year": "1966", "tier": "T1", "problem_label": "3", "problem_type": null, "exam": "AllSovietUnion", "problem": "Can both \\(\\mathrm{x}^2 +\\mathrm{y}\\) and \\(\\mathrm{x} + \\mathrm{y}^2\\) be squares for \\(\\mathrm{x}\\) and \\(\\mathrm{y}\\) natural numbers?", "solution": "No. The smallest square greater than \\(\\mathrm{x}^2\\) is \\((\\mathrm{x} + 1)^2\\) , so we must have \\(\\mathrm{y} > 2\\mathrm{x}\\) . Similarly \\(\\mathrm{x} > 2\\mathrm{y}\\) . Contradiction.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 3", "solution_match": "# Solution"}} {"year": "1966", "tier": "T1", "problem_label": "4", "problem_type": null, "exam": "AllSovietUnion", "problem": "A group of children are arranged into two equal rows. Every child in the back row is taller than the child standing in front of him in the other row. Prove that this remains true if each row is rearranged so that the children increase in height from left to right.", "solution": "Rearrange the children in the back row into order, and rearrange the front row in the same way, so that each child stays in front of the same child in the back row. Denote heights in the back row by \\(\\mathrm{a_i}\\) and heights in the front row by \\(\\mathrm{b_i}\\) . So we have \\(\\mathrm{a_1}\\leq \\mathrm{a_2}\\leq \\ldots \\leq \\mathrm{a_n}\\) , and \\(\\mathrm{a_i} > \\mathrm{b_i}\\) for \\(i = 1,2,\\ldots ,\\mathrm{n}\\) . \n\nNow if \\(\\mathrm{i}< \\mathrm{j}\\) , but \\(\\mathrm{b_i} > \\mathrm{b_j}\\) , then we may swap \\(\\mathrm{b_i}\\) and \\(\\mathrm{b_j}\\) and still have each child taller than the child in front of him. For \\(\\mathrm{b_i}< \\mathrm{a_i}< = \\mathrm{a_j}\\) , and \\(\\mathrm{b_j}< \\mathrm{b_i}< \\mathrm{a_i}\\) . By repeated swaps we can get the front row into height order. [For example, identify the shortest child and swap him to the first position, then the next shortest and so on.]", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 4", "solution_match": "# Solution"}} {"year": "1966", "tier": "T1", "problem_label": "5", "problem_type": null, "exam": "AllSovietUnion", "problem": "A rectangle ABCD is drawn on squared paper with its vertices at lattice points and its sides lying along the gridlines. \\(\\mathrm{AD} = \\mathrm{k}\\) AB with \\(\\mathrm{k}\\) an integer. Prove that the number of shortest paths from A to C starting out along AD is \\(\\mathrm{k}\\) times the number starting out along AB.", "solution": "Let ABCD have n lattice points along the side AB. Then it has kn lattice points along the side AD. Let X be the first lattice point along AB after leaving A. A shortest path from X to C must involve a total of \\(\\mathrm{kn} + \\mathrm{n} - 1\\) moves between lattice points, \\(\\mathrm{n} - 1\\) in the direction AB and \\(\\mathrm{kn}\\) in the direction BC. Hence the total number of such paths is \\((\\mathrm{kn} + \\mathrm{n} - 1)! / ((\\mathrm{kn})! (\\mathrm{n} - 1)!)\\) . Similarly, the number of paths starting out along AD is \\((\\mathrm{kn} + \\mathrm{n} - 1)! / ((\\mathrm{kn} - 1)! \\mathrm{n}!)\\) . Let \\(\\mathrm{m} = (\\mathrm{kn} + \\mathrm{n} - 1)! / ((\\mathrm{kn} - 1)! (\\mathrm{n} - 1)!)\\) . Then the number starting along AB is \\(\\mathrm{m} / (\\mathrm{kn})\\) and the number starting along AD is \\(\\mathrm{m} / \\mathrm{n}\\) , which is \\(\\mathrm{k}\\) times larger, as required.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 5", "solution_match": "# Solution"}} {"year": "1966", "tier": "T1", "problem_label": "6", "problem_type": null, "exam": "AllSovietUnion", "problem": "Given non- negative real numbers \\(\\mathrm{a_1}\\) , \\(\\mathrm{a_2}\\) , ..., \\(\\mathrm{a_n}\\) , such that \\(\\mathrm{a_{i - 1}} \\leq \\mathrm{a_i} \\leq 2\\mathrm{a_{i - 1}}\\) for \\(i = 2,3,\\ldots ,\\mathrm{n}\\) . Show that you can form a sum \\(\\mathrm{s} = \\mathrm{b_1a_1} + \\ldots +\\mathrm{b_na_n}\\) with each \\(\\mathrm{b_i} + 1\\) or - 1, so that \\(0 \\leq \\mathrm{s} \\leq \\mathrm{a_1}\\) .", "solution": "We show that you can pick \\(\\mathbf{b}_{\\mathrm{n}}\\) \\(\\mathbf{b}_{\\mathrm{n - 1}}\\) , ..., \\(\\mathbf{b}_{\\mathrm{r}}\\) so that \\(\\mathrm{s}_{\\mathrm{r}} = \\mathrm{b}_{\\mathrm{n}}\\mathrm{a}_{\\mathrm{n}} + \\mathrm{b}_{\\mathrm{n - 1}}\\mathrm{a}_{\\mathrm{n - 1}} + \\ldots +\\mathrm{b}_{\\mathrm{r}}\\mathrm{a}_{\\mathrm{r}}\\) satisfies \\(0< = \\mathrm{s}_{\\mathrm{r}}\\) \\(\\leq = \\mathrm{a}_{\\mathrm{r}}\\) . Induction on r. Trivial for \\(\\mathrm{r} = \\mathrm{n}\\) . Suppose true for r. Then \\(- \\mathrm{a}_{\\mathrm{r - 1}}< = \\mathrm{s}_{\\mathrm{r}} - \\mathrm{a}_{\\mathrm{r - 1}}< = \\mathrm{a}_{\\mathrm{r}} - \\mathrm{a}_{\\mathrm{r - 1}}< =\\) \\(\\mathrm{a}_{\\mathrm{r - 1}}\\) . So with \\(\\mathbf{b}_{\\mathrm{r - 1}} = - 1\\) we have \\(\\left|\\mathbf{s}_{\\mathrm{r - 1}}\\right|< = \\mathbf{a}_{\\mathrm{r - 1}}\\) . If necessary, we change the sign of all \\(\\mathbf{b}_{\\mathrm{n}}\\) \\(\\mathbf{b}_{\\mathrm{n - 1}}\\) , ..., \\(\\mathbf{b}_{\\mathrm{r - 1}}\\) and obtain \\(\\mathbf{s}_{\\mathrm{r - 1}}\\) as required. So the result is true for all \\(\\mathrm{r} > = 1\\) and hence for \\(\\mathrm{r} = 1\\)", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 6", "solution_match": "# Solution"}} {"year": "1966", "tier": "T1", "problem_label": "7", "problem_type": null, "exam": "AllSovietUnion", "problem": "Prove that you can always draw a circle radius A/P inside a convex polygon with area A and perimeter P.", "solution": "Draw a rectangle width A/P on the inside of each side. The rectangles at each vertex must overlap since the angle at the vertex is less than 180. The total area of the rectangles is A, so the area covered must be less than A. Hence we can find a point not in any of the rectangles. But this point must be a distance more than A/P from each side, so we can use it as the center of the required circle.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 7", "solution_match": "# Solution"}} {"year": "1966", "tier": "T1", "problem_label": "8", "problem_type": null, "exam": "AllSovietUnion", "problem": "A graph has at least three vertices. Given any three vertices A, B, C of the graph we can find a path from A to B which does not go through C. Prove that we can find two disjoint paths from A to B. \n\n[A graph is a finite set of vertices such that each pair of distinct vertices has either zero or one edges joining the vertices. A path from A to B is a sequence of vertices \\(\\mathrm{A_1}\\) , \\(\\mathrm{A_2}\\) , ..., \\(\\mathrm{A_n}\\) such that \\(\\mathrm{A = A_1}\\) , \\(\\mathrm{B = A_n}\\) and there is an edge between \\(\\mathrm{A_i}\\) and \\(\\mathrm{A_{i + 1}}\\) for \\(\\mathrm{i} = 1\\) , 2, ..., n- 1. Two paths from A to B are disjoint if the only vertices they have in common are A and B.]", "solution": "Take any path from A to B. Suppose it is \\(\\mathrm{A = A_0}\\) , \\(\\mathrm{A_1}\\) , ..., \\(\\mathrm{A_n = B}\\) . We show by induction on r that we can find two disjoint paths from A to \\(\\mathrm{A_r}\\) . If \\(\\mathrm{r} = 1\\) , then take any vertex C distinct from A and \\(\\mathrm{A_1}\\) . Take any path from \\(\\mathrm{A_1}\\) to C which does not go through A. Now take any path from C to A which does not go through \\(\\mathrm{A_1}\\) . Joining these two paths together gives a path p from A to \\(\\mathrm{A_1}\\) which does not involve the edge \\(\\mathrm{AA_1}\\) . Then p and the edge \\(\\mathrm{AA_1}\\) are the required disjoint paths. \n\nSuppose now we have two disjoint paths \\(\\mathrm{A}\\) , \\(\\mathrm{B_1}\\) , \\(\\mathrm{B_2}\\) , ..., \\(\\mathrm{B_s}\\) , \\(\\mathrm{A_r}\\) and \\(\\mathrm{A}\\) , \\(\\mathrm{B_t}\\) , \\(\\mathrm{B_{t - 1}}\\) , ..., \\(\\mathrm{B_{s + 1}}\\) , \\(\\mathrm{A_r}\\) and we wish to find two disjoint paths joining A and \\(\\mathrm{A_{r + 1}}\\) . Take a path between A and \\(\\mathrm{A_{r + 1}}\\) which does not include \\(\\mathrm{A_r}\\) . If it also avoids all of \\(\\mathrm{B_1}\\) , ..., \\(\\mathrm{B_t}\\) , then we are home, because it is disjoint from the alternative path \\(\\mathrm{A}\\) , \\(\\mathrm{B_1}\\) , \\(\\mathrm{B_2}\\) , ..., \\(\\mathrm{B_s}\\) , \\(\\mathrm{A_r}\\) , \\(\\mathrm{A_{r + 1}}\\) . If not, let \\(\\mathrm{B_i}\\) be the first of the B's on the path as we move from \\(\\mathrm{A_{r + 1}}\\) to A. This allows us to construct two disjoint paths from A to \\(\\mathrm{A_{r + 1}}\\) . One path goes from A to \\(\\mathrm{B_i}\\) and then from \\(\\mathrm{B_i}\\) to \\(\\mathrm{A_{r + 1}}\\) . The other path goes around the other way to \\(\\mathrm{A_r}\\) and then along the edge to \\(\\mathrm{A_{r + 1}}\\) . [Explicitly, if \\(\\mathrm{i} \\leq = \\mathrm{s}\\) , then the paths are A, \\(\\mathrm{B_1}\\) , \\(\\mathrm{B_2}\\) , ..., \\(\\mathrm{B_i}\\) , ..., (new path) ... \\(\\mathrm{A_{r + 1}}\\) and A, \\(\\mathrm{B_t}\\) , \\(\\mathrm{B_{t - 1}}\\) , ..., \\(\\mathrm{A_r}\\) , \\(\\mathrm{A_{r + 1}}\\) . If \\(\\mathrm{i} > \\mathrm{s}\\) , then the paths are A, \\(\\mathrm{B_t}\\) , \\(\\mathrm{B_{t - 1}}\\) , ..., \\(\\mathrm{B_i}\\) , ..., (new path) ... \\(\\mathrm{A_{r + 1}}\\) and A, \\(\\mathrm{B_1}\\) , ..., \\(\\mathrm{B_s}\\) , \\(\\mathrm{A_r}\\) , \\(\\mathrm{A_{r + 1}}\\) .] Hence, by induction, there are two disjoint paths from A to B.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 8", "solution_match": "# Solution"}} {"year": "1966", "tier": "T1", "problem_label": "9", "problem_type": null, "exam": "AllSovietUnion", "problem": "Given a triangle ABC. Suppose the point P in space is such that PH is the smallest of the four altitudes of the tetrahedron PABC. What is the locus of H for all possible P?", "solution": "Answer: the triangle DEF with FAE parallel to BC, DBF parallel to CA and DCE parallel to AB. \n\nLet \\(\\alpha\\) be the angle between planes ABC and PBC. Let h be the perpendicular distance from H to the line BC, and let \\(\\mathrm{h}_{\\mathrm{A}}\\) be the perpendicular distance from A to the line BC. Then \\(\\mathrm{PH} = \\mathrm{h}\\) tan \\(\\alpha\\) , and the altitude from A to PBC is \\(\\mathrm{h}_{\\mathrm{A}}\\) sin \\(\\alpha\\) . Hence if PH is shorter than the altitude from A we require that \\(\\mathrm{h}< \\mathrm{h}_{\\mathrm{A}}\\cos \\alpha < \\mathrm{h}_{\\mathrm{A}}\\) . Similar arguments apply for B and C. So if PH is the shortest then H lies within triangle DEF. \n\nIf H does lie within DEF, then if we make \\(\\alpha\\) sufficiently small we will have \\(\\mathrm{h}< \\mathrm{h}_{\\mathrm{A}}\\cos \\alpha\\) and hence PH will be shorter than the altitude from A. Similarly we can make PH sufficiently short that PH is less than the altitudes from B and C. Hence the inside of DEF is the required locus.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 9", "solution_match": "# Solution"}} {"year": "1966", "tier": "T1", "problem_label": "10", "problem_type": null, "exam": "AllSovietUnion", "problem": "Given 100 points on the plane. Prove that you can cover them with a collection of circles whose diameters total less than 100 and the distance between any two of which is more than 1. [The distance between circles radii r and s with centers a distance d apart is the greater of 0 and d - r - s.]", "solution": "If we have two circles diameters d and \\(\\mathrm{d}'\\) , the distance between which is less than 1, then they are contained in a circle diameter \\(\\mathrm{d} + \\mathrm{d}' + 1\\) . [If the line through the centers cuts the circles in A, B, A', B', then take a circle diameter AB'.] So start with 100 circles of diameter 1/1000 each. If any pair is a distance \\(\\leq = 1\\) apart, then replace them by a single circle, increasing the total diameter by 1. Repeat until all the circles are a distance \\(>1\\) apart. We must end up with at least one circle, so the total increase is at most 99. Hence the final total diameter is at most 99 1/10.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 10", "solution_match": "# Solution"}} {"year": "1966", "tier": "T1", "problem_label": "11", "problem_type": null, "exam": "AllSovietUnion", "problem": "The distance from A to B is d kilometers. A plane P is flying with constant speed, height and direction from A to B. Over a period of 1 second the angle PAB changes by \\(\\alpha\\) degrees and the angle PBA by \\(\\beta\\) degrees. What is the minimal speed of the plane?", "solution": "Answer: \\(20\\pi \\mathrm{d}\\sqrt{(\\alpha\\beta)}\\) kilometers per hour. \n\nLet the plane be at height h and a (horizontal) distance y from A. Let the angle PAB be \\(\\theta + \\alpha\\) and the angle PBA be \\(\\phi\\) . After 1 second, the angle PAB is \\(\\theta\\) and the angle PBA is \\(\\phi + \\beta\\) . We have immediately that:\n\n\n\n\\[\\mathrm{h / y = tan(\\theta + \\alpha),h / (d - y) = tan\\phi,h / (y + x) = tan\\theta,h / (d - y - x) = tan(\\phi + \\beta).}\\] \n\nEliminating \\(\\theta\\) , we obtain: \\(\\mathrm{h / y = (tan\\alpha + tan\\theta) / (1 - tan\\alpha tan\\theta) = (a(y + x) + h) / (y + x - ah)}\\) , where \\(\\mathrm{a} = \\mathrm{tan}\\alpha\\) . Hence \\(\\mathrm{x} = \\mathrm{a}(\\mathrm{h}^{2} + \\mathrm{y}^{2}) / (\\mathrm{h} - \\mathrm{ay})\\) . Similarly, eliminating \\(\\phi\\) , we obtain \\(\\mathrm{x} = \\mathrm{b}(\\mathrm{h}^{2} + (\\mathrm{d} - \\mathrm{y})^{2}) / (\\mathrm{h} + (\\mathrm{d} - \\mathrm{y})\\mathrm{b})\\) . \n\nAt this point I do not see how to make further progress without approximating. But approximating seems reasonable, since \\(\\alpha\\) and \\(\\beta\\) , are certainly small, at least when expressed in radians. For example, typical values might be 10,000 ft for h and more than 10 miles for y or d- y and 500 mph for the aircraft speed. That gives \\(\\mathrm{x} = 0.14\\) miles, so \\(\\mathrm{x / y} = 0.014\\) and \\(\\mathrm{x / h} = 0.07\\) . So, let us neglect \\(\\mathrm{a / h}\\) , \\(\\mathrm{b / h}\\) , \\(\\mathrm{a / y}\\) etc. Then we get the simplified expressions: \\(\\mathrm{x} = \\mathrm{a}(\\mathrm{h}^{2} + \\mathrm{y}^{2}) / \\mathrm{h} = \\mathrm{b}(\\mathrm{h}^{2} + (\\mathrm{d} - \\mathrm{y})^{2}) / \\mathrm{h}\\) . \n\nIf \\(\\mathrm{a} = \\mathrm{b}\\) , then we quickly obtain \\(\\mathrm{y} = \\mathrm{d} / 2\\) , \\(\\mathrm{h} = \\mathrm{d} / 2\\) , \\(\\mathrm{x} = \\mathrm{ad}\\) . Assume \\(\\mathrm{a} > \\mathrm{b}\\) . Then we can solve for \\(\\mathrm{h}\\) , substitute back in and obtain an expression for \\(\\mathrm{x}\\) in terms of \\(\\mathrm{y}\\) . It is convenient to divide through by \\(\\mathrm{d}\\) and to write \\(\\mathrm{X} = \\mathrm{x} / \\mathrm{d}\\) , \\(\\mathrm{Y} = \\mathrm{y} / \\mathrm{d}\\) . Note that since we are assuming \\(\\mathrm{a} > \\mathrm{b}\\) , we require \\(\\mathrm{Y} < 1 / (1 + \\sqrt{(\\mathrm{a} / \\mathrm{b})})\\) . After some manipulation we obtain: \\(\\mathrm{X} = \\mathrm{ab}(1 - 2\\mathrm{Y}) / \\sqrt{((\\mathrm{a} - \\mathrm{b})(\\mathrm{b}(1 - \\mathrm{Y})^{2} - \\mathrm{a}\\mathrm{Y}^{2})}\\) . Differentiating, we find that there is a minimum at \\(\\mathrm{Y} = \\mathrm{b} / (\\mathrm{a} + \\mathrm{b})\\) , which is in the allowed range, and that the minimum value of \\(\\mathrm{X}\\) is \\(\\sqrt{(\\mathrm{ab})}\\) . By symmetry, we obtain the same result for \\(\\mathrm{a} < \\mathrm{b}\\) and we notice that it is also true for \\(\\mathrm{a} = \\mathrm{b}\\) . So in all cases we have that the minimum value of \\(\\mathrm{x}\\) is \\(\\mathrm{d}\\sqrt{(\\mathrm{ab})}\\) . \n\nWe are assuming \\(\\alpha\\) and \\(\\beta\\) are small, so we may take \\(\\mathrm{a} = \\alpha\\) , \\(\\mathrm{b} = \\beta\\) . However, the question specified that \\(\\alpha\\) and \\(\\beta\\) were measured in degrees, so to obtain the final answer we must convert, giving: \\(\\mathrm{x} = \\mathrm{d}(\\pi / 180) \\sqrt{(\\alpha\\beta)}\\) , and hence \\(\\mathrm{speed} = 20\\pi \\mathrm{d}\\sqrt{(\\alpha\\beta)}\\) kilometers per hour.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 11", "solution_match": "# Solution"}} {"year": "1966", "tier": "T1", "problem_label": "12", "problem_type": null, "exam": "AllSovietUnion", "problem": "Two players alternately choose the sign for one of the numbers 1, 2, ..., 20. Once a sign has been chosen it cannot be changed. The first player tries to minimize the final absolute value of the total and the second player to maximize it. What is the outcome (assuming both players play perfectly)? \n\nExample: the players might play successively: 1, 20, - 19, 18, - 17, 16, - 15, 14, - 13, 12, - 11, 10, - 9, 8, - 7, 6, - 5, 4, - 3, 2. Then the outcome is 12. However, in this example the second player played badly!", "solution": "Answer: 30. \n\nThe second player can play the following strategy: (1) if the first player plays \\(2\\mathrm{n} - 1\\) for \\(1< = \\mathrm{n}\\) \\(< = 9\\) , then he replies \\(2\\mathrm{n}\\) with the opposite sign; (2) if the first player plays \\(2\\mathrm{n}\\) for \\(1< = \\mathrm{n}< = 9\\) then he replies \\(2\\mathrm{n} - 1\\) with the opposite sign; (3) if the first player plays 19 or 20, then he plays the other with the same sign. This secures a score of at least 39 (from (3) ) less \\(9\\mathrm{x}1\\) (from (1) and (2) ). So he can ensure a score of at least 30. \n\nThe first player can play the following strategy: (1) he opens with 1; (2) if the second player plays \\(2\\mathrm{n}\\) for \\(1\\leq \\mathrm{n}< = 9\\) , then he replies with \\(2\\mathrm{n} + 1\\) with the opposite sign; (3) if the second player plays \\(2\\mathrm{n} + 1\\) for \\(1< = \\mathrm{n}< = 9\\) , then he replies with \\(2\\mathrm{n}\\) with the opposite sign; (4) if any of these replies are impossible, or if the second player plays 20, then he replies with the highest\n\n\n\nnumber available with the opposite sign. If the second player does not play 20 until the last move, then this strategy ensures a score of at most 1 (from (1) ) + 9 x 1 (from (2) and (3) ) + \\(20 = 30\\) . Now suppose that the second player plays 20, a1, a2, ..., an (where \\(1 \\leq n \\leq 9\\) ) which require a reply under (4). The reason a1 required a move under (4) was that a1- 1 or a1+1 was the 1st player's response to 20. Similarly, the reason a2 required a move under (4) was that a2- 1 or a2+1 was the 1st player's response to a2, and so on. Thus the increment to the absolute value from these moves is at most \\(120 - a_1 + 11 + |a_1 - a_2 + 11 + \\ldots + |a_{n - 1} - a_n + 11 + |a_n| = 20 + n\\) . The increment from the moves under (2) and (3) is \\((9 - n) \\times 1\\) , and the increment from the move under (1) is 1. Hence the maximum absolute value is 30. \n\nSince the 1st player has a strategy to do no worse than 30 and the 2nd player has a strategy to do no worse than 30, these strategies must actually be optimal.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 12", "solution_match": "# Solution"}} {"year": "1967", "tier": "T1", "problem_label": "1", "problem_type": null, "exam": "AllSovietUnion", "problem": "In the acute- angled triangle ABC, AH is the longest altitude (H lies on BC), M is the midpoint of AC, and CD is an angle bisector (with D on AB). \n\n(a) If \\(\\mathrm{AH}< = \\mathrm{BM}\\) , prove that the angle \\(\\mathrm{ABC}< = 60\\) . \n\n(b) If \\(\\mathrm{AH} = \\mathrm{BM} = \\mathrm{CD}\\) , prove that ABC is equilateral.", "solution": "As usual let a, b, c be the lengths of BC, CA, AB respectively and let A, B, C denote the angles BAC, ABC, BCA respectively. We use trigonometry and try to express the quantities of interest in terms of a, b and C. \n\n(a) Since AH is the longest altitude, BC must be the shortest side (use area = side x altitude/2). So \\(\\mathrm{b}^2 > = \\mathrm{a}^2\\) , and \\(\\mathrm{c}^2 > = \\mathrm{a}^2\\) . Using the formula \\(\\mathrm{c}^2 = \\mathrm{a}^2 + \\mathrm{b}^2 - 2\\mathrm{ab}\\cos \\mathrm{C}\\) , we deduce that \\(\\mathrm{b}^2 > = 2\\mathrm{ab}\\cos \\mathrm{C}\\) . Hence \\(2\\mathrm{b}^2 > = \\mathrm{a}^2 + 2\\mathrm{ab}\\cos \\mathrm{C}\\) . After a little manipulation this gives: \\(\\mathrm{a}^2 + \\mathrm{b}^2 - 2\\mathrm{ab}\\cos \\mathrm{C} > = 4 / 3(\\mathrm{a}^2 + \\mathrm{b}^2 /4 - \\mathrm{ab}\\cos \\mathrm{C})\\) or \\(\\mathrm{c}^2 > = 4 / 3\\mathrm{BM}^2\\) . But we are given that \\(\\mathrm{BM} > = \\mathrm{AH} = \\mathrm{b}\\) sin C, so \\((\\mathrm{b}^2\\sin^2\\mathrm{C}) / \\mathrm{c}^2 < = 3 / 4\\) . But the sine formula gives \\(\\sin \\mathrm{B} = (\\mathrm{b}\\sin \\mathrm{C}) / \\mathrm{c}\\) , so \\(\\sin^2\\mathrm{C} < = 3 / 4\\) . The triangle is acute- angled, hence \\(\\mathrm{B}< = 60\\) degrees. \n\n(b) The angle bisector theorem gives \\(\\mathrm{AD / BD} = \\mathrm{b / a}\\) , hence \\(\\mathrm{AD / AB} = \\mathrm{b / (a + b)}\\) , so \\(\\mathrm{AD} = \\mathrm{bc / (a + b)}\\) . Hence, using the sine formula, \\(\\mathrm{CD / sin A} = \\mathrm{AD / (sin C / 2)}\\) . So \\(\\mathrm{CD} = \\mathrm{bc}\\) sin \\(\\mathrm{A / ((a + b)}\\) sin \\(\\mathrm{C / 2)} = \\mathrm{ba}\\) sin \\(\\mathrm{C / ((a + b)}\\) sin \\(\\mathrm{C / 2)}\\) , using the sine formula again. But we are given that \\(\\mathrm{CD}\\geq\\) \\(\\mathrm{AH} = \\mathrm{b}\\) sin C, so \\(\\mathrm{a / ((a + b)}\\) sin \\(\\mathrm{C / 2)}\\geq 1\\) . But a is the shortest side, so \\(\\mathrm{a / (a + b)}\\leq 1 / 2\\) and hence sin \\(\\mathrm{C / 2}< 1 / 2\\) . The triangle is acute- angled, so \\(\\mathrm{C / 2}\\leq 30\\) degrees, and \\(\\mathrm{C}\\leq 60\\) degrees. BC is the shortest side, so A is the smallest angle and hence \\(\\mathrm{A}\\leq 60\\) degrees. Also since \\(\\mathrm{AH}\\leq \\mathrm{BM}\\) , \\(\\mathrm{B}\\leq\\) 60 degrees. But the angles sum to 180 degrees, so they must all be 60 degrees and hence the triangle is equilateral.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 1", "solution_match": "# Solution"}} {"year": "1967", "tier": "T1", "problem_label": "2", "problem_type": null, "exam": "AllSovietUnion", "problem": "(a) The digits of a natural number are rearranged and the resultant number is added to the original number. Prove that the answer cannot be 99 ... 9 (1999 nines). \n\n(b) The digits of a natural number are rearranged and the resultant number is added to the original number to give \\(10^{10}\\) . Prove that the original number was divisible by 10.", "solution": "(a) Let the digits of the original number be \\(\\mathrm{a_1}\\) , \\(\\mathrm{a_2}\\) , ... and the rearranged digits be \\(\\mathrm{b_1}\\) , \\(\\mathrm{b_2}\\) , ... Suppose that in the addition there is a carry, in other words \\(\\mathrm{a_1 + b_1 > 9}\\) for some i. Take the largest such i. Then the resulting digit in that position cannot be a 9. Contradiction. So there cannot be any carries. Hence each pair \\(\\mathrm{a_1 + b_1 = 9}\\) . Let n be the total number of digits 0, 1, 2, 3, and 4 in the number. Then each of these must be paired with a digit 5, 6, 7, 8 or 9. So the total number of digits 5, 6, 7, 8 and 9 must also be n, and hence the number must have an even number of digits. But we are told that the answer and hence the original number has an odd number of digits.\n\n\n\n(b) In the addition the carry can never be 2, because that would require the previous carry to be at least 2, and the first carry cannot be 2. So all carries are 0 or 1. If a carry is 1, then all subsequent carries must also be 1. If the first carry is 0, then the corresponding digits must be 0 and hence the original number is divisible by 10. If it is not, then all carries are 1 and hence after the first carry all the digit pairs sum to 9. But arguing as in (a), this means that there must be an even number of digits, excluding the last (where we have a digit sum 10), and hence an odd number of digits in the original number. But \\(10^{10}\\) has an odd number of digits and hence the original number had an even number of digits. Contradiction.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 2", "solution_match": "# Solution"}} {"year": "1967", "tier": "T1", "problem_label": "3", "problem_type": null, "exam": "AllSovietUnion", "problem": "Four lighthouses are arbitarily placed in the plane. Each has a stationary lamp which illuminates an angle of 90 degrees. Prove that the lamps can be rotated so that at least one lamp is visible from every point of the plane.", "solution": "Take a north direction, arbitary except that no points are aligned north- south or east- west. Take the two most northerly points. Point the lamp for the more easterly of these two in the direction SW (so that it covers directions S to W). Point the lamp for the other in the direction SE. For the other two points, point the lamp for the more easterly in the direction NW, and the lamp for the other in the direction NE. \n\nClearly the lamps cover all directions, the only possible problem is uncovered strips. However, the two lamps pointing N are below the two lamps pointing S, and the two lamps pointing E are west of the two lamps pointing W, so there are no uncovered strips.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 3", "solution_match": "# Solution"}} {"year": "1967", "tier": "T1", "problem_label": "4", "problem_type": null, "exam": "AllSovietUnion", "problem": "(a) Can you arrange the numbers 0, 1, ..., 9 on the circumference of a circle, so that the difference between every pair of adjacent numbers is 3, 4 or 5? For example, we can arrange the numbers 0, 1, ..., 6 thus: 0, 3, 6, 2, 5, 1, 4. \n\n(b) What about the numbers 0, 1, ..., 13?", "solution": "No. Each of the numbers 0, 1, 8, 9 can only be adjacent to 3, 4, 5 or 6. But they can only accommodate 3 numbers, not 4. \n\n0, 3, 7, 10, 13, 9, 12, 8, 11, 6, 2, 5, 1, 4 is a solution for 13. \n\nIn passing, there are obviously no solutions for 4 or 5. There is just the one solution for 6 (given in the question). For 7 there are 5 solutions: 0, 3, 6, 1, 5, 2, 7, 4; 0, 3, 6, 1, 4, 7, 2, 5; 0, 3, 6, 2, 7, 4, 1, 5; 0, 3, 7, 4, 1, 6, 2, 5; 0, 4, 1, 6, 3, 7, 1, 5. For 8 there is the solution 0, 3, 7, 2, 6, 1, 5, 8, 4, and maybe others.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 4", "solution_match": "# Solution"}} {"year": "1967", "tier": "T1", "problem_label": "5", "problem_type": null, "exam": "AllSovietUnion", "problem": "Prove that there exists a number divisible by \\(5^{1000}\\) with no zero digit.", "solution": "We first find a multiple of \\(5^{1000}\\) which has no zeros in the last 1000 digits. Suppose that we have a multiple n.5 \\(^{1000}\\) whose last zero is in place r (treating the last place as place 0, the next to last as place 1 and so on). Then \\(\\mathrm{n}(10^{\\mathrm{r}} + 1)\\) has the same digits in places 0 to r- 1 and a nonzero digit in place r, and hence no zeros in places 0 to r. So repeating, we find a multiple n.5 \\(^{1000}\\) with no zeros in the last 1000 digits. \n\nNow let m be the remainder when n is divided by \\(2^{1000}\\) , so \\(\\mathrm{n} = \\mathrm{k}.2^{1000} + \\mathrm{m}\\) , and hence m.5 \\(^{1000} = \\mathrm{n}.5^{1000} - \\mathrm{k}.10^{1000}\\) . So m.5 \\(^{1000}\\) has the same last 1000 digits as n.5 \\(^{1000}\\) . But it has less than 1001 digits, and hence it has exactly 1000 digits and no zeros.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 5", "solution_match": "# Solution"}} {"year": "1967", "tier": "T1", "problem_label": "6", "problem_type": null, "exam": "AllSovietUnion", "problem": "Find all integers x, y satisfying \\(\\mathrm{x}^{2} + \\mathrm{x} = \\mathrm{y}^{4} + \\mathrm{y}^{3} + \\mathrm{y}^{2} + \\mathrm{y}\\) .", "solution": "The only solutions are \\(\\mathrm{x},\\mathrm{y} = - 1,1 - ;0, - 1,0;0,0; - 6,2;\\) or 5,2. \n\n\\((\\mathrm{y}^{2} + \\mathrm{y} / 2 - 1 / 2)(\\mathrm{y}^{2} + \\mathrm{y} / 2 + 1 / 2) = \\mathrm{y}^{4} + \\mathrm{y}^{3} + 1 / 4\\mathrm{y}^{2} - 1 / 4< \\mathrm{y}^{4} + \\mathrm{y}^{3} + \\mathrm{y}^{2} + \\mathrm{y}\\) except for \\(- 1< = \\mathrm{y}< =\\) \\(- 1 / 3\\) . Also \\((\\mathrm{y}^{2} + \\mathrm{y} / 2)(\\mathrm{y}^{2} + \\mathrm{y} / 2 + 1) = \\mathrm{y}^{4} + \\mathrm{y}^{3} + 5 / 4\\mathrm{y}^{2} + \\mathrm{y} / 2\\) which is greater than \\(\\mathrm{y}^{4} + \\mathrm{y}^{3} + \\mathrm{y}^{2}+\\) y unless \\(0< = \\mathrm{y}< = 2\\) \n\nBut no integers are greater than \\(\\mathrm{y}^{2} + \\mathrm{y} / 2 - 1 / 2\\) and less than \\(\\mathrm{y}^{2} + \\mathrm{y} / 2\\) . So the only possible solutions have y in the range - 1 to 2. Checking these 4 cases, we find the solutions listed.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 6", "solution_match": "# Solution"}} {"year": "1967", "tier": "T1", "problem_label": "7", "problem_type": null, "exam": "AllSovietUnion", "problem": "What is the maximum possible length of a sequence of natural numbers \\(\\mathrm{x}_{1}, \\mathrm{x}_{2}, \\mathrm{x}_{3}, \\ldots\\) such that \\(\\mathrm{x}_{i} \\leq 1998\\) for \\(i \\geq = 1\\) , and \\(\\mathrm{x}_{i} = |\\mathrm{x}_{i - 1} - \\mathrm{x}_{i - 2}|\\) for \\(i \\geq 3\\) .", "solution": "Answer 2998. \n\nThe sequence is completely determined by its first two elements. If the largest element of the sequence is n, then it must occur as one of the first two elements. Because \\(\\mathrm{x}_{3}\\) and \\(\\mathrm{x}_{4}\\) are both smaller than the largest of the first two elements and hence all subsequent elements are too. \n\nLet \\(\\mathrm{f}(\\mathrm{n}, \\mathrm{m})\\) be the length of the sequence with \\(\\mathrm{x}_{1} = \\mathrm{n}\\) , \\(\\mathrm{x}_{2} = \\mathrm{m}\\) . It is straightforward to verify by induction that \\(\\mathrm{f}(1,2\\mathrm{n}) = \\mathrm{f}(2\\mathrm{n} - 1,2\\mathrm{n}) = 3\\mathrm{n} + 1\\) , \\(\\mathrm{f}(2\\mathrm{n},1) = \\mathrm{f}(2\\mathrm{n},2\\mathrm{n} - 1) = 3\\mathrm{n}\\) , \\(\\mathrm{f}(2\\mathrm{n},2\\mathrm{n} + 1) = 3\\mathrm{n} + 3\\) , \\(\\mathrm{f}(1,2\\mathrm{n} + 1) = \\mathrm{f}(2\\mathrm{n} + 1,1) = 3\\mathrm{n} + 2\\) , \\(\\mathrm{f}(2\\mathrm{n} + 1,2\\mathrm{n}) = 3\\mathrm{n} + 1\\) . A rather more fiddly induction then shows that these are the best possible lengths. Hence the longest sequence with no element more than 1998 is that starting 1, 1998 which has length 2998.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 7", "solution_match": "# Solution"}} {"year": "1967", "tier": "T1", "problem_label": "8", "problem_type": null, "exam": "AllSovietUnion", "problem": "499 white rooks and a black king are placed on a \\(1000 \\times 1000\\) chess board. The rook and king moves are the same as in ordinary chess, except that taking is not allowed and the king is allowed to remain in check. No matter what the initial situation and no matter how white\n\n\n\nmoves, the black king can always: \n\n(a) get into check (after some finite number of moves); \n(b) move so that apart from some initial moves, it is always in check after its move; \n(c) move so that apart from some initial moves, it is always in check (even just after white has moved). \n\nProve or disprove each of (a) - (c).", "solution": "(a) True. Black moves to one end of a main diagonal and then moves along the diagonal to the opposite end. Each of the 499 rooks is in some row. Since black moves through each row, every rook must change row. But each of the rooks is also in some column and so every rook must also change column. A rook cannot change row and column in the same move, so white must make at least 998 moves before black reaches the opposite end of the diagonal. But it cannot start until black is two moves from its starting position, because if it moves a rook into row (or column) one or two earlier, then black is checked or can move into check. So it has only 997 moves available, which is one too few. \n\n(b) False. Suppose the contrary, that after move n, the king is always in check after its move. Let the corners of the board be A, B, C, D. After move n, white moves all its rooks inside a square side 23 at corner A. The king must now be in the 23 rows between A and B or in the 23 columns between A and D. Suppose the latter. Then white moves all its rooks inside a square side 23 at corner B. This should take 499 moves. However, it could take longer if black used his king to obstruct the move. The worst case would be 3 x 23 additional moves (the king can only obstruct one row of 23 rooks, and each rook in the obstructed row could take 4 moves instead of one to reach its destination.). During this period the king must remain in the 23 rows from A to B or the 23 columns from A to D, since it must remain in check. Thus it cannot get to B by the completion of the process. In fact, it must be at least 999 - 46 (the total number of moves required) - (499 + 69) (the number of moves available) = 385 moves behind. \n\nWhite now moves all the rooks inside a square side 23 at corner C. The king cannot cut across (or it will be unchecked). It must keep within 23 squares of the edge. So it ends up 770 moves behind (more in fact, since it cannot obstruct the move as effectively). Finally, white moves all the rooks inside a square side 23 at corner D. The king cannot get to the side CD by the time this process is completed. So there is then a lag of over two hundred moves before it can get back into check. Note that it does not help black to change direction. Whatever black does, white ends up with all the rooks at a corner and the king a long way from the two checked sides. \n\n(c) False. This follows from (b). But we may also use a simpler argument. Take coordinates \\(x = 1\\) to 1000, \\(y = 1\\) to 1000. White gets its pieces onto (2,0), (4,0), ..., (998,0). If the king moves onto \\((2n,*)\\) , then white moves its rook from \\((2n,0)\\) to \\((2n-1,0)\\) , leaving the king unchecked. If the king moves to \\((2n-1,*)\\) or \\((2n+1,*)\\) , then white moves its rook back to \\((2n,0)\\) , leaving the king unchecked. If the king stays on the line \\((2n,*)\\) , then white fills in time by toggling one of its endmost rooks to an adjacent square (and the king remains unchecked). The only way the black king can escape this repeated unchecking is by moving up to the line \\(y = 0\\) . If it does so, then white transfers all its rooks to the line \\(y = 1000\\) and repeats the process. The transfer takes 499 moves. It takes black 1000 moves to follow, so during the 501 moves before black catches up, the king is subject to repeated unchecking.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 8", "solution_match": "# Solution"}} {"year": "1967", "tier": "T1", "problem_label": "9", "problem_type": null, "exam": "AllSovietUnion", "problem": "ABCD is a unit square. One vertex of a rhombus lies on side AB, another on side BC, and a third on side AD. Find the area of the set of all possible locations for the fourth vertex of the rhombus.", "solution": "Answer: \\(2 1 / 3\\) \n\nLet the square be ABCD. Let the vertices of the rhombus be P on AB, Q on AD, and R on BC. We require the locus of the fourth vertex S of the rhombus. Suppose P is a distance x from B. We may take \\(\\mathrm{x}< = 1 / 2\\) , since the locus for \\(\\mathrm{x} > 1 / 2\\) is just the reflection of the locus for \\(\\mathrm{x}< 1 / 2\\) . Then since PR is parallel to QS, S is a distance x from the line AD. Also, by continuity, as Q varies over AD (with P fixed a distance x from B), the locus of S is a line segment. \n\nThe two extreme positions for S occur when Q coincides with A and when R coincides with C. When Q coincides with A the rhombus has side \\(1 - \\mathrm{x}\\) . Hence \\(\\mathrm{BR}^2 = (1 - \\mathrm{x})^2 - \\mathrm{x}^2 = 1 - 2\\mathrm{x}\\) . In this case SR is parallel to AB, so the distance of S from AB is \\(\\sqrt{(1 - 2\\mathrm{x})}\\) . When R coincides with C, the rhombus has side \\(\\sqrt{(1 + \\mathrm{x}^2)}\\) , so \\(\\mathrm{AQ}^2 = 1 + \\mathrm{x}^2 - (1 - \\mathrm{x})^2 = 2\\mathrm{x}\\) . Hence the distance of S from AB is \\(1 + \\sqrt{(2\\mathrm{x})}\\) . \n\nThus the locus of S over all possible rhombi is the interior of a curvilinear quadrilateral with vertices MDNC, where M is the midpoint of AB and N is the reflection of M in CD. Moreover the curve from M to C is just the translate of the curve from D to N, for if we put y \\(= 1 / 2 - \\mathrm{x}\\) , then \\(\\sqrt{(1 - 2\\mathrm{x})}\\) becomes \\(\\sqrt{(2\\mathrm{y})}\\) . Thus if L is the midpoint of CD, then the area in the MLC plus the area in DLN is just \\(1 / 2\\) , and the total area of the curvilinear quadrilateral is 1. \n\nHowever, the arrangement of the vertices discussed above is not the only one. The order of vertices above is PQSR. We could also have PQRS or PSQR. In either case QR is a side rather than a diagonal of the rhombus. We consider the case PQRS (the case PSQR is just the reflection in the line MN). As before it is convenient to keep P fixed, but this time we take x to be the distance AP. Take y to be the distance AQ. \n\nAs before we find that S must lie on a line parallel to BC a distance x from it (on the other side to AD). Again we find that for fixed P, the locus of S is a segment of this line. If we assume that \\(\\mathrm{AQ} > \\mathrm{BR}\\) , then the two extreme positions are (1) QR parallel to AB, giving S on the line AB, (2) Q at D, giving S a distance x from the line AB. So as x varies from 0 to 1 we get a right- angled triangle sides 1, 1 and \\(\\sqrt{2}\\) and area \\(1 / 2\\) . However, we can also have \\(\\mathrm{BR} > \\mathrm{AQ}\\) . This gives points below the line AB. The extreme position is with R at C. Suppose \\(\\mathrm{QD} = \\mathrm{y}\\) . Then \\(1 + \\mathrm{y}^2 = \\mathrm{x}^2 + (1 - \\mathrm{y})^2\\) , so \\(\\mathrm{y} = \\mathrm{x}^2 /2\\) . This gives S a distance y below the line AB. This gives an additional area of \\(1 / 6\\) (by calculus - integrate \\(\\mathrm{x}^2 /2\\) from 0 to 1; I do not see how to do it without). \n\nThe triangle and the curvilinear triangle together form a curvilinear triangle area \\(1 / 2 + 1 / 6 = 2 / 3\\) . There is an identical triangle formed by reflection in MN. Thus the total area is \\(1 + 2 / 3 + 2 / 3 = 2 1 / 3\\) . \n\nThanks to Robert Hill and John Jones for pointing out that the original solution missed out the two triangles.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 9", "solution_match": "# Solution"}} {"year": "1967", "tier": "T1", "problem_label": "10", "problem_type": null, "exam": "AllSovietUnion", "problem": "A natural number k has the property that if k divides n, then the number obtained from n by reversing the order of its digits is also divisible by k. Prove that k is a divisor of 99.", "solution": "Let \\(\\mathrm{r(m)}\\) denote the number obtained from m by reversing the digits. \n\nWe show first that k cannot be divisible by 2 or 5. It cannot be divisible by both, for then it ends in a zero and hence \\(\\mathrm{r(k)}< \\mathrm{k}\\) and so is not divisible by k (contradiction). So if 5 divides k, then the last digit of k must be 5. Since \\(\\mathrm{r(k)}\\) is divisible by 5 its last digit must also be 5, so the first digit of k is 5. But now 3k has first digit 1 \\((3.5 > 10\\) and \\(3.6< 20\\) ), so \\(\\mathrm{r(3k)}\\) has last digit 1 and cannot be divisible by 5. Contradiction. If 2 divides k, then every multiple of k must be even. So the last digit of \\(\\mathrm{r(k)}\\) must be even and hence the first digit of k must be 2, 4, 6, or 8. If 2, then 5k has first digit 1, so \\(\\mathrm{r(2k)}\\) is odd. Contradiction. Similarly, if the first digit is 4, 3k has first digit 1; if 6, then 5k has first digit 3; if 8, then 2k has first digit 1. Contradiction. So k is not divisible by 2 or 5. \n\nSuppose \\(\\mathrm{k} = 10^{\\mathrm{n}}\\mathrm{a}_{\\mathrm{n}} + \\ldots +\\mathrm{a}_{0}\\) k divides \\(\\mathrm{r(k)}\\) , so \\(\\mathrm{a}_{0} > = 1\\) . Hence \\((10^{\\mathrm{n} + 1} - 1)\\mathrm{k} = 10^{2\\mathrm{n} + 1}\\mathrm{a}_{\\mathrm{n}} + \\ldots +\\) \\(10^{\\mathrm{n} + 1}\\mathrm{a}_{0} - (10^{\\mathrm{n}}\\mathrm{a}_{\\mathrm{n}} + \\ldots +\\mathrm{a}_{0}) = 10^{2\\mathrm{n} + 1}\\mathrm{a}_{\\mathrm{n}} + \\ldots +10^{\\mathrm{n} + 1}(\\mathrm{a}_{0} - 1) + 10^{\\mathrm{n}}\\mathrm{c}_{\\mathrm{n}} + \\ldots +10\\mathrm{c}_{1} + (\\mathrm{c}_{0} + 1)\\) , where \\(\\mathrm{c_{i}} =\\) 9 - a. The reverse of this, \\(10^{2\\mathrm{n} + 1}(\\mathrm{c}_{0} + 1) + 10^{2\\mathrm{n}}\\mathrm{c}_{1} + \\ldots +10^{\\mathrm{n} + 1}\\mathrm{c}_{\\mathrm{n}} + 10^{\\mathrm{n}}(\\mathrm{a}_{0} - 1) + \\ldots +\\mathrm{a}_{\\mathrm{n}}\\) , is also divisible by k. So is the reverse of k, \\(10^{\\mathrm{n}}\\mathrm{a}_{0} + \\ldots +\\mathrm{a}_{\\mathrm{n}}\\) and hence also their difference: \\(10^{\\mathrm{n}}(10^{\\mathrm{n} + 1}(\\mathrm{c}_{0} + 1) + 10^{\\mathrm{n}}\\mathrm{c}_{1} + \\ldots +10\\mathrm{c}_{\\mathrm{n}} - 1)\\) . k has no factors 2 or 5, so k must divide \\(10^{\\mathrm{n} + 1}(\\mathrm{c}_{0} + 1)\\) \\(+10^{\\mathrm{n}}\\mathrm{c}_{1} + \\ldots +10\\mathrm{c}_{\\mathrm{n}} - 1\\) . Adding 10k, we find that k also divides \\(10^{\\mathrm{n} + 2} + 10^{\\mathrm{n}}9 + \\ldots +10.9 - 1 =\\) 1099. .989 (n - 2 consecutive 9s) \\(= 11(10^{\\mathrm{n} + 1} - 1)\\) \n\nWe can now carry out exactly the same argument starting with \\((10^{\\mathrm{n} + 2} - 1)\\mathrm{k}\\) . This leads to k dividing \\(10^{\\mathrm{n} + 2}(\\mathrm{c}_{0} + 1) + \\ldots +10^{2}\\mathrm{c}_{0} + 10.9 - 1\\) and hence also \\(10^{\\mathrm{n} + 3} + 10^{\\mathrm{n} + 1}9 + \\ldots +10^{2}9 + 10.8+\\) \\(9 = 11(10^{\\mathrm{n} + 2} - 1)\\) . Subtracting 10 times this from the previous number we conclude that k must divide \\(11(10^{\\mathrm{n} + 1} - 1) - 11(10^{\\mathrm{n} + 1} - 10) = 99\\) \n\nFinally, we note that any factor of 99 has the required property. For 3 and 9 divide a number if and only if they divide its digit sum. So if m is divisible by 3 or 9, then the number formed by any rearrangement of its digits is also divisible by 3 or 9. m is divisible by 11 if and only if the difference between the sums of alternate digits is divisible by 11, so if m is divisible by 11, then so is its reverse.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 10", "solution_match": "# Solution"}} {"year": "1968", "tier": "T1", "problem_label": "1", "problem_type": null, "exam": "AllSovietUnion", "problem": "An octagon has equal angles. The lengths of the sides are all integers. Prove that the opposite sides are equal in pairs.", "solution": "Extend the sides to form two rectangles. Let the sides of the octagon have length a, b, c, d, e, f, g, h. Then we can find the rectangle sides. For example, one of the rectangles has opposite sides \\(\\mathrm{a + (b + h) / \\sqrt{2}}\\) and \\(\\mathrm{e + (d + f) / \\sqrt{2}}\\) . Hence either \\(\\mathrm{a = e}\\) or \\(\\sqrt{2} = (\\mathrm{b + h - d - f}) / (\\mathrm{a - e})\\) . The root is irrational, so we must have \\(\\mathrm{a = e}\\) . Similarly for the other pairs of opposite sides.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 1", "solution_match": "# Solution"}} {"year": "1968", "tier": "T1", "problem_label": "2", "problem_type": null, "exam": "AllSovietUnion", "problem": "Which is greater: \\(31^{11}\\) or \\(17^{14}\\) ? [No calculators allowed!]", "solution": "\\[17^{2} = 289 > 9.31. \\mathrm{So} 17^{14} > 9^{7} 31^{7}. \\mathrm{But} 3^{7} = 2187 > 31^{2}. \\mathrm{Hence} 17^{14} > 31^{11}.\\]", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 2", "solution_match": "# Solution"}} {"year": "1968", "tier": "T1", "problem_label": "3", "problem_type": null, "exam": "AllSovietUnion", "problem": "A circle radius 100 is drawn on squared paper with unit squares. It does not touch any of the grid lines or pass through any of the lattice points. What is the maximum number of squares can it pass through?", "solution": "Take compass directions aligned with the grid. Let N, E, S, W be the most northerly, easterly, southerly and westerly points on the circle. The arc from N to E must cross 100 north- south grid lines and 100 east- west grid lines. Each time it crosses a grid line it changes square (and it never crosses two grid lines at once, because it does not pass through any lattice points), so the arc N to E must pass through 200 in addition to the starting square. Similarly for the other 4 arcs. So the circle passes through a total of 800 squares (we count the starting square in the last 200).", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 3", "solution_match": "# Solution"}} {"year": "1968", "tier": "T1", "problem_label": "4", "problem_type": null, "exam": "AllSovietUnion", "problem": "In a group of students, 50 speak English, 50 speak French and 50 speak Spanish. Some students speak more than one language. Prove it is possible to divide the students into 5 groups (not necessarily equal), so that in each group 10 speak English, 10 speak French and 10 speak Spanish.", "solution": "Let EF denote the number of students speaking English and French. Similarly define ES, FS, E, F, S, EFS. Then ES + EF + E + EFS = 50, EF + FS + F + EFS = 50. Subtracting: ES - F = FS - E. Similarly, ES - F = EF - S.\n\n\n\nPair off members of FS with members of E. Similarly, members of ES with F, and members of EF with S. The resulting pairs have one person speaking each language. If \\(\\mathrm{ES} = \\mathrm{F}\\) , then the only remaining students are those in EFS, who speak all three languages. We thus have a collection of units (pairs or individuals) each containing one speaker of each language. \n\nIf \\(\\mathrm{ES}< \\mathrm{F}\\) , then after the pairing off we are left with equal numbers of members of E, F, and S. These may be formed into triplets, with each triplet containing one speaker of each language. As before we also have the students in EFS. Again, we have partitioned the student body into units with each unit containing one speaker of each language. \n\nIf \\(\\mathrm{ES} > \\mathrm{F}\\) , then after the pairing off, we are left with an equal number of members of ES, FS and EF. These may be formed into triplets, with each triplet containing two speakers of each language. So, in this case we partition the student body into units with each unit containing either one speaker of each language, or two speakers of each language. \n\nFinally, we may divide the units into 5 groups with 10 speakers of each language in each group.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 4", "solution_match": "# Solution"}} {"year": "1968", "tier": "T1", "problem_label": "5", "problem_type": null, "exam": "AllSovietUnion", "problem": "Prove that: \n\n\\[2 / (\\mathrm{x}^{2} - 1) + 4 / (\\mathrm{x}^{2} - 4) + 6 / (\\mathrm{x}^{2} - 9) + \\ldots +20 / (\\mathrm{x}^{2} - 100) =\\] \\[11 / ((\\mathrm{x} - 1)(\\mathrm{x} + 10)) + 11 / ((\\mathrm{x} - 2)(\\mathrm{x} + 9)) + \\ldots +11 / ((\\mathrm{x} - 10)(\\mathrm{x} + 1)).\\]", "solution": "\\[\\mathrm{lhs} = 1 / (\\mathrm{x} - 1) - 1 / (\\mathrm{x} + 1) + 1 / (\\mathrm{x} - 2) - 1 / (\\mathrm{x} + 2) + \\ldots +1 / (\\mathrm{x} + 10) - 1 / (\\mathrm{x} - 10) =\\] \\[1 / (\\mathrm{x} - 1) - 1 / (\\mathrm{x} + 10) + 1 / (\\mathrm{x} - 2) - 1 / (\\mathrm{x} + 9) + \\ldots +1 / (\\mathrm{x} - 10) - 1 / (\\mathrm{x} + 1) = \\mathrm{rhs}.\\]", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 5", "solution_match": "# Solution"}} {"year": "1968", "tier": "T1", "problem_label": "6", "problem_type": null, "exam": "AllSovietUnion", "problem": "The difference between the longest and shortest diagonals of the regular n- gon equals its side. Find all possible n.", "solution": "Answer: \\(\\mathrm{n} = 9\\) \n\nFor \\(\\mathrm{n}< 6\\) , there is at most one length of diagonal. For \\(\\mathrm{n} = 6\\) , 7 the longest and shortest, and a side of the n- gon form a triangle, so the difference between the longest and shortest is less than the side. \n\nFor \\(\\mathrm{n} > 7\\) the side has length 2R sin \\(\\pi /\\mathrm{n}\\) , the shortest diagonal has length 2R sin \\(2\\pi /\\mathrm{n}\\) , and the longest diagonal has length 2R for n even and 2R cos \\(\\pi /2\\mathrm{n}\\) for n odd (where R is the radius of the circumcircle). Thus we require: \n\n\\(\\sin 2\\pi /\\mathrm{n} + \\sin \\pi /\\mathrm{n} = 1\\) and n even, or\n\n\n\n\\(\\sin 2\\pi /\\mathrm{n} + \\sin \\pi /\\mathrm{n} = \\cos \\pi /2\\mathrm{n}\\) and n odd. \n\nEvidently the lhs is a strictly decreasing function of n and the rhs is an increasing function of n, so there can be at most one solution of each equation. The second equation is satisfied by n \\(= 9\\) , although it is easier to see that there is a quadrilateral with the longest diagonal and shortest diagonals as one pair of opposite sides, and 9- gon sides as the other pair of opposite sides. The angle between the longest side and an adjacent side is 60, so that its length is the length of the shortest diagonal plus \\(2 \\times 9\\) - gon side x cos 60. Hence that is the only solution for n odd. \n\nFor \\(\\mathrm{n} = 8\\) we have the same quadrilateral as for the 9- gon except that the angle is 67.5 and hence the difference is less than 1. For \\(\\mathrm{n} = 10\\) , \\(\\sin 2\\pi /10 + \\sin \\pi /10 = \\sin \\pi /10\\) (2 cos \\(\\pi /10 + 1\\) ) \\(< 3\\) sin \\(\\pi /10< 3\\pi /10< 1\\) . So there are no solutions for n even \\(\\geq 10\\) , and hence no solutions for n even.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 6", "solution_match": "# Solution"}} {"year": "1968", "tier": "T1", "problem_label": "7", "problem_type": null, "exam": "AllSovietUnion", "problem": "The sequence \\(\\mathrm{a}_{\\mathrm{n}}\\) is defined as follows: \\(\\mathrm{a}_{1} = 1\\) , \\(\\mathrm{a}_{\\mathrm{n} + 1} = \\mathrm{a}_{\\mathrm{n}} + 1 / \\mathrm{a}_{\\mathrm{n}}\\) for \\(\\mathrm{n} \\geq 1\\) . Prove that \\(\\mathrm{a}_{100} > 14\\) .", "solution": "First we must notice that for \\(1 \\leq \\mathrm{a}\\) , b we have \\(\\mathrm{a} < \\mathrm{b}\\) , then \\(\\mathrm{a} + 1 / \\mathrm{a} < \\mathrm{b} + 1 / \\mathrm{b}\\) . This is basic to any estimation. \n\nThe obvious approach is to notice that if \\(\\mathrm{a}_{\\mathrm{i}} \\leq \\mathrm{n}\\) , then \\(\\mathrm{a}_{\\mathrm{i} + 1} \\geq \\mathrm{a}_{\\mathrm{i}} + 1 / \\mathrm{n}\\) . Hence it takes at most n steps to get from \\(\\mathrm{n} - 1\\) to \\(\\mathrm{n}\\) . Unfortunately, this does not quite work: we need \\(2 + 3 + \\ldots + 14 = 104\\) steps to get from 1 to 14. \n\nThe trick is to notice that \\(\\mathrm{a}_{\\mathrm{n} + 1}^{2} > \\mathrm{a}_{\\mathrm{n}}^{2} + 2\\) . But \\(\\mathrm{a}_{2} = 2\\) , so \\(\\mathrm{a}_{\\mathrm{n}}^{2} > 2\\mathrm{n}\\) . That gives \\(\\mathrm{a}_{100}^{2} > 200 > 14^{2}\\) .", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 7", "solution_match": "# Solution"}} {"year": "1968", "tier": "T1", "problem_label": "8", "problem_type": null, "exam": "AllSovietUnion", "problem": "Given point O inside the acute- angled triangle ABC, and point O' inside the acute- angled triangle A'B'C'. D, E, F are the feet of the perpendiculars from O to BC, CA, AB respectively, and D', E', F' are the feet of the perpendiculars from O' to B'C', C'A', A'B' respectively. OD is parallel to O'A', OE is parallel to O'B' and OF is parallel to O'C'. Also OD- O'A' = OE- O'B' = OF- O'C'. Prove that O'D' is parallel to OA, O'E' to OB and O'F' to OC, and that O'D' OA = O'E' OB = O'F' OC.", "solution": "![md5:ca87b07b2609f5391dc57bee5f28e69d](ca87b07b2609f5391dc57bee5f28e69d.jpeg)\n \n\nLet \\(\\Gamma\\) be the circumcircle of DEF. Let OD, OE, OF meet it again at A\", B\", C\" respectively. Then the figure O'A'B'C' must be similar to OA\"B\"C\". So to prove that OD is parallel to O'A', we have to prove that AO is perpendicular to B\"C\". \n\nSo AO meets B\"C\" at D\". Now since \\(\\square \\mathrm{AFC}'' = 90^{0}\\) and \\(\\square \\mathrm{AD}''\\mathrm{C}'' = 90^{0}\\) , both F and D' lie on the circle diameter AC\". Hence AO- OD\" = OF- OC\". Similarly, BO meets C\"A\" at E\", and CO meets A\"B\" at F\", and BO- OE\" = OD- OA\" and CO- OF\" = OE- OB\". Hence OD\". OA = OE\". OB = OF\". OC. So using the similarity, OD'- OA = OE'- OB = OF'. OC.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 8", "solution_match": "# Solution"}} {"year": "1968", "tier": "T1", "problem_label": "9", "problem_type": null, "exam": "AllSovietUnion", "problem": "Prove that any positive integer not exceeding n! can be written as a sum of at most n distinct factors of n!.", "solution": "Given \\(\\mathrm{m}\\leq \\mathrm{n}!\\) write \\(\\mathrm{m} = \\mathrm{nq} + \\mathrm{r}\\) (\\*), with \\(0\\leq \\mathrm{q},0\\leq \\mathrm{r}< \\mathrm{m}\\) . Then \\(\\mathrm{q}\\leq (\\mathrm{n} - 1)!\\) , so \\(\\mathrm{q}\\) is a sum of at most n- 1 distinct factors of (n- 1)!. r is itself a factor of n! and is not divisible by n, so (\\*) expresses m as a sum of at most n distinct factors of n!.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 9", "solution_match": "# Solution"}} {"year": "1968", "tier": "T1", "problem_label": "10", "problem_type": null, "exam": "AllSovietUnion", "problem": "Given a triangle ABC, and D on the segment AB, E on the segment AC, such that AD = DE = AC, BD = AE, and DE is parallel to BC. Prove that BD equals the side of a regular 10- gon inscribed in a circle with radius AC.", "solution": "\\(\\mathrm{DA} = \\mathrm{DE}\\) , so DAE is isosceles. DE is parallel to BC, so ABC is isosceles, so \\(\\mathrm{BA} = \\mathrm{AC} / (2 \\cos \\mathrm{A})\\) . Hence \\(\\mathrm{BD} = \\mathrm{AC} / (2 \\cos \\mathrm{A}) - \\mathrm{AC}\\) . But \\(\\mathrm{AE} = 2 \\mathrm{AC} \\cos \\mathrm{A}\\) , so we have an equation for \\(\\mathrm{c} = \\mathrm{cos} \\mathrm{A}: 4 \\mathrm{c}^{2} + 2 \\mathrm{c} - 1 = 0\\) . \n\n\\(2\\pi /5,4\\pi /5,6\\pi /5,8\\pi /5\\) and \\(10\\pi /5\\) are the roots of: real part of \\((\\cos \\theta + \\mathrm{i}\\sin \\theta)^{5} = 1\\) . Expanding this gives that \\(\\cos 2\\pi /5\\) , \\(\\cos 4\\pi /5\\) , \\(\\cos 6\\pi /5\\) , \\(\\cos 8\\pi /5\\) and 1 are the roots of \\(16\\mathrm{c}^{5} - 20\\mathrm{c}^{3} + 5\\mathrm{c} - 1 = 0\\) . Dividing by \\((\\mathrm{c} - 1)\\) gives \\(16\\mathrm{c}^{4} + 16\\mathrm{c}^{3} - 4\\mathrm{c}^{2} - 4\\mathrm{c} + 1 = (4\\mathrm{c}^{2} + 2\\mathrm{c} - 1)^{2}\\) . So \\(\\cos 2\\pi /5\\) ( \\(=\\) cos \\(8\\pi /5\\) ) and \\(\\cos 4\\pi /5\\) ( \\(=\\) cos \\(6\\pi /5\\) ) are the roots of \\(4\\mathrm{c}^{2} + 2\\mathrm{c} - 1 = 0\\) .\n\n\n\nWe know that \\(\\mathrm{A}< 90^{\\circ}\\) (since \\(\\mathrm{A} = \\mathrm{C}\\) and their sum is less than \\(180^{\\circ}\\) ). Hence \\(\\mathrm{A} = 2\\pi /5\\) . So BD \\(= 2\\) AC cos \\(2\\pi /5 = 2\\) AC sin \\(\\pi /10\\) , which is the side length for a regular 10- gon inscribed in a circle radius AC.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 10", "solution_match": "# Solution"}} {"year": "1968", "tier": "T1", "problem_label": "11", "problem_type": null, "exam": "AllSovietUnion", "problem": "Given a regular tetrahedron ABCD, prove that it is contained in the three spheres on diameters AB, BC and AD. Is this true for any tetrahedron?", "solution": "Let the tetrahedron have side 1. Then the center O is a distance \\(1 / \\sqrt{8}\\) from the center of each of the spheres, so it is contained in each of the spheres. We now use convexity. \n\nTwo circles with diameters two of the sides of a triangle cover the triangle (consider the foot of the altitude to the third side), so faces ABC and ABD are certainly contained in the spheres. Consider face ACD. The sphere on BC passes through the midpoints of AC and CD, and through C, so it contains the triangle formed by these three points (by convexity). But the rest of ACD is contained in the sphere on AD. Similarly for the face BCD. Hence all the faces are contained in the spheres. But now take any point P inside the tetrahedron. Extend OP to meet a face at X. X lies in one of the spheres, but O also lies in the sphere and hence all points on OX, including P (by convexity). \n\nFalse in general. Take ABCD to be a plane square, then no points on CD are in the spheres except C and D (and we can obviously distort this slightly to make it less degenerate).", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 11", "solution_match": "# Solution"}} {"year": "1968", "tier": "T1", "problem_label": "12", "problem_type": null, "exam": "AllSovietUnion", "problem": "(a) Given a \\(4 \\times 4\\) array with \\(+\\) signs in each place except for one non-corner square on the perimeter which has a - sign. You can change all the signs in any row, column or diagonal. A diagonal can be of any length down to 1. Prove that it is not possible by repeated changes to arrive at all \\(+\\) signs. \n\n(b) What about an \\(8 \\times 8\\) array?", "solution": "(a) Let S be the set of the 8 positions on the perimeter not at a corner. Any move changes the sign of either 2 or 0 of the members of S. We start with an odd number of members of S with a minus sign, so we must always have an odd number of members of S with a minus sign and hence cannot get all plus signs. \n\n(b) Also impossible. The same argument works.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 12", "solution_match": "# Solution"}} {"year": "1968", "tier": "T1", "problem_label": "13", "problem_type": null, "exam": "AllSovietUnion", "problem": "The medians divide a triangle into 6 smaller triangles. 4 of the circles inscribed in the smaller triangles have equal radii. Prove that the original triangle is equilateral.", "solution": "Denote the side lengths by a, b, c and the corresponding median lengths by \\(\\mathrm{m}_{\\mathrm{a}}\\) , \\(\\mathrm{m}_{\\mathrm{b}}\\) , \\(\\mathrm{m}_{\\mathrm{c}}\\) . The six small triangles all have equal area. [Let the areas be \\(\\mathrm{t}_1\\) , ..., \\(\\mathrm{t}_6\\) . It is obvious that the adjacent pairs have equal height and equal base, so we have \\(\\mathrm{t}_1 = \\mathrm{t}_2\\) , \\(\\mathrm{t}_3 = \\mathrm{t}_4\\) , \\(\\mathrm{t}_5 = \\mathrm{t}_6\\) . The three on each side of a median sum to the same area, so \\(\\mathrm{t}_1 + \\mathrm{t}_2 + \\mathrm{t}_3 = \\mathrm{t}_4 + \\mathrm{t}_5 + \\mathrm{t}_6\\) , \\(\\mathrm{t}_1 + \\mathrm{t}_5 + \\mathrm{t}_6 = \\mathrm{t}_2 + \\mathrm{t}_3 + \\mathrm{t}_4\\) . Subtracting gives \\(\\mathrm{t}_1 = \\mathrm{t}_4\\) . Similarly, \\(\\mathrm{t}_2 = \\mathrm{t}_5\\) and we are home.] So by the usual result that the twice area of a triangle equals its perimeter times its in- radius, we conclude that the perimeters of four of the small triangles are equal. \n\nTwo of them must share a side of the original triangle. Suppose it is a. Then we have: \\(a / 2+\\) \\(\\mathrm{m}_{\\mathrm{a}} / 3 + 2\\mathrm{m}_{\\mathrm{b}} / 3 = a / 2 + \\mathrm{m}_{\\mathrm{a}} / 3 + 2\\mathrm{m}_{\\mathrm{c}} / 3\\) . So \\(\\mathrm{m}_{\\mathrm{b}} = \\mathrm{m}_{\\mathrm{c}}\\) . That implies that \\(\\mathrm{b} = \\mathrm{c}\\) . [Because the triangle formed by the centroid and side a is isosceles, so the median is perpendicular to the side, so the main triangle is isosceles.] \n\nUsing the facts that \\(\\mathrm{b} = \\mathrm{c}\\) and \\(\\mathrm{m}_{\\mathrm{b}} = \\mathrm{m}_{\\mathrm{c}}\\) , we see that two of the remaining small triangles have perimeter \\(\\mathrm{b} / 2 + \\mathrm{m}_{\\mathrm{b}}\\) and two have perimeter \\(\\mathrm{b} / 2 + \\mathrm{m}_{\\mathrm{b}} / 3 + 2\\mathrm{m}_{\\mathrm{a}} / 3\\) . So there are two cases to consider. In the first case \\(a / 2 - \\mathrm{m}_{\\mathrm{a}} / 3 = \\mathrm{b} / 2 - \\mathrm{m}_{\\mathrm{b}} / 3\\) . That implies \\(\\mathrm{a} = \\mathrm{b}\\) , since if \\(\\mathrm{a}< \\mathrm{b}\\) , \\(\\mathrm{m}_{\\mathrm{a}} > \\mathrm{m}_{\\mathrm{b}}\\) (consider the triangle formed by the centroid and the side c). So the triangle is equilateral. \n\nThe second case is harder. We have: \\(a / 2 + \\mathrm{m}_{\\mathrm{a}} / 3 + 2\\mathrm{m}_{\\mathrm{b}} / 3 = \\mathrm{b} / 2 + \\mathrm{m}_{\\mathrm{b}}\\) , and hence \\(a / 2 + \\mathrm{m}_{\\mathrm{a}} / 3 = \\mathrm{b} / 2 + \\mathrm{m}_{\\mathrm{b}} / 3\\) (\\*). Take the angle between a and b to be \\(\\theta\\) . Then \\(\\mathrm{m}_{\\mathrm{a}} = \\mathrm{b}\\) sin \\(\\theta\\) , \\(\\mathrm{a} = 2\\mathrm{b}\\cos \\theta\\) , and \\(\\mathrm{m}_{\\mathrm{b}}^{2} = \\mathrm{b}^{2} / 4 + \\mathrm{a}^{2} - \\mathrm{ab}\\cos \\theta = \\mathrm{b}^{2} / 4 + 2\\mathrm{b}^{2}\\cos^{2}\\theta\\) . We can now use (\\*) to get an equation for \\(\\theta\\) . First we square (\\*) to get: \\(\\mathrm{m}_{\\mathrm{b}}^{2} = (3a / 2 - 3b / 2 + \\mathrm{m}_{\\mathrm{a}})^{2}\\) . We divide out the factor \\(\\mathrm{b}^{2}\\) to get: \\(1 / 4 + 2\\cos^{2}\\theta = 3 1 / 4 + 8\\cos^{2}\\theta - 9\\cos \\theta + 3\\sin \\theta (2\\cos \\theta - 1)\\) . Squaring, so that we can use \\(\\sin^{2}\\theta = 1 - \\cos^{2}\\theta\\) , and writing \\(\\mathrm{c} = \\cos \\theta\\) , we get: \\((1 - \\mathrm{c}^{2})(4\\mathrm{c}^{2} - 4\\mathrm{c} + 1) = 4\\mathrm{c}^{4} - 12\\mathrm{c}^{3} + 13\\mathrm{c}^{2} - 6\\mathrm{c} + 1\\) . Hence \\(8\\mathrm{c}^{4} - 16\\mathrm{c}^{3} + 10\\mathrm{c}^{2} - 2\\mathrm{c} = 0\\) . Factorizing: \\(\\mathrm{c}(\\mathrm{c} - 1)(2\\mathrm{c} - 1)^{2} = 0\\) . \\(\\mathrm{c} = 0\\) and \\(\\mathrm{c} = 1\\) give degenerate triangles, so we must have \\(\\mathrm{c} = 1 / 2\\) and hence the triangle is equilateral.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 13", "solution_match": "# Solution"}} {"year": "1968", "tier": "T1", "problem_label": "14", "problem_type": null, "exam": "AllSovietUnion", "problem": "Prove that we can find positive integers \\(\\mathrm{x}\\) , y satisfying \\(\\mathrm{x}^{2} + \\mathrm{x} + 1 = \\mathrm{py}\\) for an infinite number of primes p.", "solution": "This is a trivial variant on the proof that there are an infinite number of primes. Suppose that we can only find \\(\\mathrm{x}\\) , y for a finite number of primes \\(\\mathrm{p}_1\\) , \\(\\mathrm{p}_2\\) , ..., \\(\\mathrm{p}_n\\) . Set \\(\\mathrm{x} = \\mathrm{p}_1\\mathrm{p}_2\\dots \\mathrm{p}_n\\) . Then none of the \\(\\mathrm{p}_i\\) can divide \\(\\mathrm{x}(\\mathrm{x} + 1) + 1\\) . But it must have prime factors. Contradiction.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 14", "solution_match": "# Solution"}} {"year": "1968", "tier": "T1", "problem_label": "15", "problem_type": null, "exam": "AllSovietUnion", "problem": "9 judges each award 20 competitors a rank from 1 to 20. The competitor's score is the sum of the ranks from the 9 judges, and the winner is the competitor with the lowest score. For each competitor the difference between the highest and lowest ranking (from different judges) is at most 3. What is the highest score the winner could have obtained?", "solution": "Answer: 24.\n\n\n\nAt most 4 competitors can receive a rank 1. For a competitor with a rank 1 can only receive ranks 1, 2, 3 or 4. There are only 36 such ranks available and each competitor with a rank 1 needs 9 of them. \n\nIf only one competitor receives a rank 1, then his score is 9. If only 2 competitors receive a rank 1, then one of them must receive at least five rank 1s. His maximum score is then \\(5.1 + 4.4 = 21\\) . If 4 competitors receive a rank 1, then they must use all the 36 ranks 1, 2, 3, and 4. The total score available is thus \\(9(1 + 2 + 3 + 4) = 90\\) , so at least one competitor must receive 22 or less. Thus the winner's maximum score is at most 22. If 3 competitors receive a rank 1, then the winner's score is maximised by giving all three competitors the same score and letting them share the 27 ranks 1, 3 and 4. That gives a winner's score of \\(9(1 + 3 + 4) / 3 = 24\\) . That can be achieved in several ways, for example: each competitor gets 3 1s, 3 3s and 3 4s, or one competitor gets 4 1s and 5 4s, another gets 3 1s, 3 3s and 3 4s, another gets 2 1s 6 3s and one 4. Note that it is trivial to arrange ranks for the remaining 17 competitors. For example: give one 5 2s and 4 5s total 30, one 4 2s and 5 5s total 33, and then one 9 6s, one 9 7s and so on. \n\nThus the answer is 24, with three joint winners. If there is required to be a single winner, then the answer is 23.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 15", "solution_match": "# Solution"}} {"year": "1968", "tier": "T1", "problem_label": "16", "problem_type": null, "exam": "AllSovietUnion", "problem": "\\(\\{\\mathrm{a_i}\\}\\) and \\(\\{\\mathrm{b_i}\\}\\) are permutations of \\(\\{1 / 1,1 / 2,\\dots ,1 / \\mathrm{n}\\}\\) . \\(\\mathrm{a_1 + b_1\\geq a_2 + b_2\\geq \\ldots \\geq a_n + b_n}\\) . Prove that for every m \\((1\\leq \\mathrm{m}\\leq \\mathrm{n})\\) \\(\\mathrm{a_m + a_n\\geq 4 / m}\\)", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 16", "solution_match": ""}} {"year": "1968", "tier": "T1", "problem_label": "17", "problem_type": null, "exam": "AllSovietUnion", "problem": "There is a set of scales on the table and a collection of weights. Each weight is on one of the two pans. Each weight has the name of one or more pupils written on it. All the pupils are outside the room. If a pupil enters the room then he moves the weights with his name on them to the other pan. Show that you can let in a subset of pupils one at a time, so that the scales change position after the last pupil has moved his weights.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 17", "solution_match": ""}} {"year": "1968", "tier": "T1", "problem_label": "18", "problem_type": null, "exam": "AllSovietUnion", "problem": "The streets in a city are on a rectangular grid with m east- west streets and n north- south streets. It is known that a car will leave some (unknown) junction and move along the streets at an unknown and possibly variable speed, eventually returning to its starting point without ever moving along the same block twice. Detectors can be positioned anywhere except at a junction to record the time at which the car passes and it direction of travel. What is the minimum number of detectors needed to ensure that the car's route can be reconstructed?", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 18", "solution_match": ""}} {"year": "1968", "tier": "T1", "problem_label": "19", "problem_type": null, "exam": "AllSovietUnion", "problem": "The circle inscribed in the triangle ABC touches the side AC at K. Prove that the line joining the midpoint of AC with the center of the circle bisects the segment BK.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 19", "solution_match": ""}} {"year": "1968", "tier": "T1", "problem_label": "20", "problem_type": null, "exam": "AllSovietUnion", "problem": "The sequence \\(\\mathrm{a_1,a_2,\\ldots,a_n}\\) satisfies the following conditions: \\(\\mathrm{a_1 = 0}\\) \\(\\mathrm{|a_i| = |a_{i - 1} + 1|}\\) for \\(\\mathrm{i} = 2\\) , 3, ... , n. Prove that \\((\\mathrm{a_1 + a_2 + \\ldots + a_n}) / \\mathrm{n}\\geq - 1 / 2\\) .", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 20", "solution_match": ""}} {"year": "1968", "tier": "T1", "problem_label": "21", "problem_type": null, "exam": "AllSovietUnion", "problem": "The sides and diagonals of ABCD have rational lengths. The diagonals meet at O. Prove that the length AO is also rational.", "solution": "\\(\\mathrm{AB} = \\mathrm{AO}\\cos \\mathrm{OAB} + \\mathrm{BO}\\cos \\mathrm{OBA}\\) . We can derive a rational expression for cos OAB using the cosine rule for triangle ABC. Similarly for cos OBA using the cosine rule for triangle DAB. So \\(\\mathrm{OA} = \\mathrm{r}_1 + \\mathrm{r}_2\\mathrm{OB}\\) , where \\(\\mathrm{r}_1\\) denotes a rational number. Similarly, \\(\\mathrm{OB} = \\mathrm{r}_3 + \\mathrm{r}_4\\mathrm{OC}\\) , so \\(\\mathrm{OA} = \\mathrm{r}_5 + \\mathrm{r}_6\\mathrm{OC}\\) . But \\(\\mathrm{OA} + \\mathrm{OC} = \\mathrm{AC} = \\mathrm{r}_7\\) . Hence OA is rational.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 21", "solution_match": "# Solution"}} {"year": "1969", "tier": "T1", "problem_label": "1", "problem_type": null, "exam": "AllSovietUnion", "problem": "In the quadrilateral ABCD, BC is parallel to AD. The point E lies on the segment AD and the perimeters of ABE, BCE and CDE are equal. Prove that \\(\\mathrm{BC} = \\mathrm{AD} / 2\\) .", "solution": "Take \\(\\mathrm{E_1}\\) on the line AD so that \\(\\mathrm{AE_1CB}\\) is a parallelogram. Then \\(\\mathrm{AE_1 = BC}\\) \\(\\mathrm{AB = CE_1}\\) , so triangles \\(\\mathrm{ABE_1}\\) and \\(\\mathrm{BCE_1}\\) have equal perimeters. Moreover, \\(\\mathrm{E_1}\\) is the only point on the line for which this is true. For if we move E a distance \\(\\mathbf{x}\\) from \\(\\mathrm{E_1}\\) , then we change \\(\\mathrm{AE_1}\\) by \\(\\mathbf{x}\\) , and \\(\\mathrm{CE_1}\\) by less than \\(\\mathbf{x}\\) . AB and BC are unchanged. So \\(\\mathrm{AB + BE_1}\\) and \\(\\mathrm{BC + CE_1}\\) are changed by different amounts. Hence the perimeters of \\(\\mathrm{ABE_1}\\) and \\(\\mathrm{BCE_1}\\) are no longer equal. \n\nSimilarly, let \\(\\mathrm{E_2}\\) be the point on the line AD so that \\(\\mathrm{BCDE_2}\\) is a parallelogram. Then \\(\\mathrm{E_2}\\) is the unique point such that \\(\\mathrm{BCE_2}\\) and \\(\\mathrm{CDE_2}\\) have equal perimeters. So if all three triangles have equal perimeters, then \\(\\mathrm{E_1}\\) and \\(\\mathrm{E_2}\\) must coincide and hence \\(\\mathrm{BC} = \\mathrm{AE} = \\mathrm{DE}\\) , so \\(\\mathrm{BC} = \\mathrm{AD} / 2\\) .", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 1", "solution_match": "# Solution"}} {"year": "1969", "tier": "T1", "problem_label": "2", "problem_type": null, "exam": "AllSovietUnion", "problem": "A wolf is in the center of a square field and there is a dog at each corner. The wolf can run anywhere in the field, but the dogs can only run along the sides. The dogs' speed is 3/2 times the wolf's speed. The wolf can kill a single dog, but two dogs together can kill the wolf. Prove that the dogs can prevent the wolf escaping.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 2", "solution_match": ""}} {"year": "1969", "tier": "T1", "problem_label": "3", "problem_type": null, "exam": "AllSovietUnion", "problem": "A finite sequence of 0s and 1s has the following properties: (1) for any \\(\\mathrm{i}< \\mathrm{j}\\) , the sequences of length 5 beginning at position i and position j are different; (2) if you add an additional digit at either the start or end of the sequence, then (1) no longer holds. Prove that the first 4 digits of the sequence are the same as the last 4 digits.", "solution": "Let the last 4 digits be abcd. Then the 5 digit sequences abcd0 and abcd1 must occur somewhere. If neither of them are at the beginning then there are three 5 digit sequences xabcd, two of which must therefore be the same, contradicting (1). Hence abcd are the first 4 digits.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 3", "solution_match": "# Solution"}} {"year": "1969", "tier": "T1", "problem_label": "4", "problem_type": null, "exam": "AllSovietUnion", "problem": "Given positive numbers a, b, c, d prove that at least one of the inequalities does not hold: \\(\\mathrm{a + }\\) \\(\\mathrm{b< c + d}\\) ; \\((\\mathrm{a + b})(\\mathrm{c + d})< \\mathrm{ab + cd}\\) ; \\((\\mathrm{a + b})\\mathrm{cd}< \\mathrm{ab}(\\mathrm{c + d})\\) .", "solution": "From the first and second inequalities we have \\(\\mathrm{ab + cd > a(c + d) + b(a + b)}\\) , so \\(\\mathrm{cd > ad}\\) , and hence \\(\\mathrm{c > a}\\) . We also have \\(\\mathrm{ab + cd > a(a + b) + b(c + d)}\\) , so \\(\\mathrm{cd > bc}\\) , and hence \\(\\mathrm{d > b}\\) . So \\(1 / \\mathrm{a} + 1 / \\mathrm{b} > 1 / \\mathrm{c} + 1 / \\mathrm{d}\\) , which contradicts the third inequality.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 4", "solution_match": "# Solution"}} {"year": "1969", "tier": "T1", "problem_label": "5", "problem_type": null, "exam": "AllSovietUnion", "problem": "What is the smallest positive integer a such that we can find integers b and c so that \\(\\mathrm{ax}^2 +\\mathrm{bx} + \\mathrm{c}\\) has two distinct positive roots less than 1?", "solution": "\\(4\\mathrm{x}^2 - 4\\mathrm{x} + 1 = (2\\mathrm{x} - 1)^2\\) , which has the double root 1/2. So it remains to consider \\(\\mathrm{a} = 1,2,3\\) \n\n- b/a is the sum of the roots, so b is negative. c/a is the product of the roots, so c is positive. If \\(\\mathrm{a} = 1\\) , then the product of the roots is c, which is at least 1, so both roots cannot lie strictly between 0 and 1. If \\(\\mathrm{a} = 2\\) , then the sum of the roots is less than 2, so b must be -1, -2, or -3. The roots are real so \\(\\mathrm{b}^2 > 4\\mathrm{ac} = 8\\mathrm{c}\\) . Hence \\(\\mathrm{b} = -3\\) and \\(\\mathrm{c} = 1\\) . But \\(2\\mathrm{x}^2 - 3\\mathrm{x} + 1 = (2\\mathrm{x} - 1)(\\mathrm{x} - 1)\\) and one root is not less than 1. If \\(\\mathrm{a} = 3\\) , then b must be -1, -2, ..., or -5. But \\(\\mathrm{b}^2 > 4\\mathrm{ac} = 12\\mathrm{c}\\) , so \\((\\mathrm{b},\\mathrm{c}) = (-4,1),(-5,1)\\) or (-5, 2). In the first and last case, the equation has a root 1. In the middle case it has a root \\(5 / 6 + \\sqrt{13 / 6} = 1.434 > 1\\) . Thus there are no solutions for \\(\\mathrm{a} = 1,2,3\\) and so the smallest value of a is 4.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 5", "solution_match": "# Solution"}} {"year": "1969", "tier": "T1", "problem_label": "6", "problem_type": null, "exam": "AllSovietUnion", "problem": "n is an integer. Prove that the sum of all fractions 1/rs, where r and s are relatively prime integers satisfying \\(0< \\mathrm{r}< \\mathrm{s}\\leq \\mathrm{n}\\) , \\(\\mathrm{r} + \\mathrm{s} > \\mathrm{n}\\) , is 1/2.", "solution": "We use induction on n. If \\(\\mathrm{n} = 2\\) , then the only such fraction is \\(\\mathrm{r} = 1\\) , \\(\\mathrm{s} = 2\\) , giving \\(1 / \\mathrm{rs} = 1 / 2\\) , so the result holds. Suppose it holds for \\(\\mathrm{n} - 1\\) . As we move to n, we lose the fractions with \\(\\mathrm{r} + \\mathrm{s} = \\mathrm{n}\\) . The other fractions \\(1 / \\mathrm{rs}\\) which satisfy the conditions for \\(\\mathrm{n} - 1\\) also satisfy the conditions for n. We also gain the fractions with \\(\\mathrm{s} = \\mathrm{n}\\) . These have sum \\(= 1 / \\mathrm{n}\\) (sum \\(1 / \\mathrm{r}\\) for all r satisfying \\(0< \\mathrm{r}< \\mathrm{n}\\) and r relatively prime to n). But if r is relatively prime to n, then so is n - r, and n - r does not equal r (otherwise r divides n). The pair \\(1 / \\mathrm{r}\\) , \\(1 / (\\mathrm{n} - \\mathrm{r})\\) has sum \\(\\mathrm{n} / (\\mathrm{r}(\\mathrm{n} - \\mathrm{r}))\\) . So the fractions with \\(\\mathrm{s} = \\mathrm{n}\\) have sum equal to the sum of all \\(1 / (\\mathrm{r}(\\mathrm{n} - \\mathrm{r}))\\) with \\(0< \\mathrm{r}< \\mathrm{n}\\) and r relatively prime to n. But that is exactly the sum of the fractions lost. Thus the total is unchanged as we move from n- 1 to n.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 6", "solution_match": "# Solution"}} {"year": "1969", "tier": "T1", "problem_label": "7", "problem_type": null, "exam": "AllSovietUnion", "problem": "Given n points in space such that the triangle formed from any three of the points has an angle greater than 120 degrees. Prove that the points can be labeled 1, 2, 3, ..., n so that the angle defined by i, \\(\\mathrm{i} + 1\\) , \\(\\mathrm{i} + 2\\) is greater than 120 degrees for \\(\\mathrm{i} = 1,2,\\ldots ,\\mathrm{n} - 2\\) .", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 7", "solution_match": ""}} {"year": "1969", "tier": "T1", "problem_label": "8", "problem_type": null, "exam": "AllSovietUnion", "problem": "Find four different three- digit numbers (in base 10) starting with the same digit, such that their sum is divisible by three of the numbers.", "solution": "Answer: 108, 117, 135, 180. Sum \\(540 = 108\\) . \\(5 = 135\\) . \\(4 = 180\\) . 3.\n\n\n\nTry looking for a number of the form 3. 4. 5. n. We want 12n, 15n and 20n to have the same first digit. If the first digit is 1, this requires \\(\\mathrm{n} = 9\\) . We must now check that the fourth number which must be \\(60\\mathrm{n} - 12\\mathrm{n} - 15\\mathrm{n} - 20\\mathrm{n} = 13\\mathrm{n}\\) also has three digits starting with 1. It does, so we are home. [In fact, in this case the first digit must be 1, since \\(20\\mathrm{n} > 3 / 2 12\\mathrm{n}\\) .]", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 8", "solution_match": "# Solution"}} {"year": "1969", "tier": "T1", "problem_label": "9", "problem_type": null, "exam": "AllSovietUnion", "problem": "Every city in a certain state is directly connected by air with at most three other cities in the state, but one can get from any city to any other city with at most one change of plane. What is the maximum possible number of cities?", "solution": "Answer: 10. \n\nTake a particular city X. At most 3 cities are directly connected to X. Each of those is directly connected to at most 2 other cities (apart from X). So X is connected with at most one change to at most 9 other cities. Thus the maximum number is at most 10. \n\nWe can achieve 10 as follows. Label the cities 1, ..., 10. Make direct connections as follows: 1: 2, 3, 4; 2: 1, 5, 6; 3: 1, 7, 8; 4: 1, 9, 10; 5: 2, 7, 9; 6: 2, 8, 10; 7: 3, 5, 10; 8: 3, 6, 9; 9: 4, 5, 8; 10: 4, 6, 7.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 9", "solution_match": "# Solution"}} {"year": "1969", "tier": "T1", "problem_label": "10", "problem_type": null, "exam": "AllSovietUnion", "problem": "Given a pentagon with equal sides. \n\n(a) Prove that there is a point X on the longest diagonal such that every side subtends an angle at most 90 degrees at X. \n\n(b) Prove that the five circles with diameter one of the pentagon's sides do not cover the pentagon.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 10", "solution_match": ""}} {"year": "1969", "tier": "T1", "problem_label": "11", "problem_type": null, "exam": "AllSovietUnion", "problem": "Given the equation \\(\\mathrm{x}^{3} + \\mathrm{ax}^{2} + \\mathrm{bx} + \\mathrm{c} = 0\\) , the first player gives one of a, b, c an integral value. Then the second player gives one of the remaining coefficients an integral value, and finally the first player gives the remaining coefficient an integral value. The first player's objective is to ensure that the equation has three integral roots (not necessarily distinct). The second player's objective is to prevent this. Who wins?", "solution": "Answer: the first player. \n\nThe first player starts by choosing \\(\\mathrm{c} = 0\\) . Now if the second player selects a, then he can take b = a - 1. Then the polynomial factorizes as: \\(\\mathrm{x}(\\mathrm{x} + 1)(\\mathrm{x} + \\mathrm{a} - 1)\\) with integral roots, 0, - 1, 1- a. If the second player selects b, then he can take a = b + 1. Then the polynomial factorizes as \\(\\mathrm{x}(\\mathrm{x} + 1)(\\mathrm{x} + \\mathrm{b})\\) with integral roots 0, - 1, - b.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 11", "solution_match": "# Solution"}} {"year": "1969", "tier": "T1", "problem_label": "12", "problem_type": null, "exam": "AllSovietUnion", "problem": "20 teams compete in a competition. What is the smallest number of games that must be played to ensure that given any three teams at least two play each other?", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 12", "solution_match": ""}} {"year": "1969", "tier": "T1", "problem_label": "13", "problem_type": null, "exam": "AllSovietUnion", "problem": "A regular n- gon is inscribed in a circle radius R. The distance from the center of the circle to the center of a side is \\(\\mathbf{h}_{\\mathrm{n}}\\) . Prove that \\((n + 1) \\mathbf{h}_{\\mathrm{n} + 1} - \\mathbf{n} \\mathbf{h}_{\\mathrm{n}} > \\mathbf{R}\\) .", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 13", "solution_match": ""}} {"year": "1969", "tier": "T1", "problem_label": "14", "problem_type": null, "exam": "AllSovietUnion", "problem": "Prove that for any positive numbers \\(\\mathbf{a}_{1}, \\mathbf{a}_{2}, \\ldots , \\mathbf{a}_{\\mathrm{n}}\\) we have: \n\n\\[\\mathrm{a}_{1} / (\\mathrm{a}_{2} + \\mathrm{a}_{3}) + \\mathrm{a}_{2} / (\\mathrm{a}_{3} + \\mathrm{a}_{4}) + \\ldots +\\mathrm{a}_{\\mathrm{n} - 1} / (\\mathrm{a}_{\\mathrm{n}} + \\mathrm{a}_{1}) + \\mathrm{a}_{\\mathrm{n}} / (\\mathrm{a}_{1} + \\mathrm{a}_{2}) > \\mathrm{n} / 4.\\]", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 14", "solution_match": ""}} {"year": "1970", "tier": "T1", "problem_label": "1", "problem_type": null, "exam": "AllSovietUnion", "problem": "Given a circle, diameter AB and a point C on AB, show how to construct two points X and Y on the circle such that (1) Y is the reflection of X in the line AB, (2) YC is perpendicular to XA.", "solution": "AB is a diameter, so BX is perpendicular to AX and hence parallel to YC. YX is perpendicular to BC, so \\(\\mathrm{YC} = \\mathrm{YB}\\) . Hence X and Y lie on the perpendicular bisector of BC.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 1", "solution_match": "# Solution"}} {"year": "1970", "tier": "T1", "problem_label": "2", "problem_type": null, "exam": "AllSovietUnion", "problem": "The product of three positive numbers is 1, their sum is greater than the sum of their inverses. Prove that just one of the numbers is greater than 1.", "solution": "The product of the numbers is 1, so they cannot all be greater than 1 or all less than 1. If all equalled 1, then the sum would not be greater than the sum of the inverses. So we must have either one or two greater than 1. Thus it is sufficient to show that we cannot have two of the numbers greater than 1. \n\nSuppose that a, \\(\\mathrm{b} > 1\\) . Then since \\(\\mathrm{a} + \\mathrm{b} + \\mathrm{c} > 1 / \\mathrm{a} + 1 / \\mathrm{b} + 1 / \\mathrm{c}\\) , we have \\(\\mathrm{a} + \\mathrm{b} + 1 / \\mathrm{ab} > 1 / \\mathrm{a} + 1 / \\mathrm{b} + \\mathrm{ab}\\) , and hence \\((1 - 1 / \\mathrm{a})(1 - 1 / \\mathrm{b}) > (\\mathrm{a} - 1)(\\mathrm{b} - 1)\\) . Dividing by \\((\\mathrm{a} - 1)(\\mathrm{b} - 1)\\) gives \\(\\mathrm{ab}< 1\\) . Contradiction.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 2", "solution_match": "# Solution"}} {"year": "1970", "tier": "T1", "problem_label": "3", "problem_type": null, "exam": "AllSovietUnion", "problem": "What is the greatest number of sides of a convex polygon that can equal its longest diagonal?", "solution": "Answer: 2, except for the equilateral triangle. \n\nIt is easy to find two. Take the two sides to be AB and AC with angle \\(\\mathrm{BAC} = 60\\) deg, and take the other vertices on the minor arc of the circle center A radius AB between B and C. \n\nLet the longest diagonal have length k. Suppose there are three sides with length k. Extend them (if necessary) so they meet at A, B, C. Suppose \\(\\square \\mathrm{A} > 60^{\\circ}\\) . Take the vertices on side AB to be P, Q (where we may have \\(\\mathrm{P} = \\mathrm{A}\\) , or \\(\\mathrm{Q} = \\mathrm{B}\\) , or both). Take the vertices on side AC to be R, S (where we may have \\(\\mathrm{R} = \\mathrm{A}\\) , or \\(\\mathrm{S} = \\mathrm{C}\\) , or both). Then \\(\\mathrm{AQ}\\geq \\mathrm{k}\\) , \\(\\mathrm{AS}\\geq \\mathrm{k}\\) , so \\(\\mathrm{QS} > \\mathrm{k}\\) . Contradiction. Hence angle \\(\\mathrm{A}\\leq 60^{\\circ}\\) . The same is true for \\(\\square \\mathrm{B}\\) and \\(\\square \\mathrm{C}\\) . Hence \\(\\square \\mathrm{A} = \\square \\mathrm{B} = \\square \\mathrm{C} = 60^{\\circ}\\) . But now \\(\\mathrm{QS} > \\mathrm{k}\\) unless \\(\\mathrm{A} = \\mathrm{P} = \\mathrm{R}\\) . Similarly, B and C must be vertices of the convex polygon, so that it is just an equilateral triangle.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 3", "solution_match": "# Solution"}} {"year": "1970", "tier": "T1", "problem_label": "4", "problem_type": null, "exam": "AllSovietUnion", "problem": "n is a 17 digit number. m is derived from n by taking its decimal digits in the reverse order. Show that at least one digit of n + m is even.", "solution": "Let the number be n with digits \\(\\mathrm{d_1d_2\\ldots d_{17}}\\) , so that the reversed number n' has digits \\(\\mathrm{d_{17}d_{16}\\ldots}\\) \\(\\mathrm{d_1}\\) . Let the digits of \\(\\mathrm{n + n'}\\) be \\(\\mathrm{a_0a_1\\ldots a_{17}}\\) , where \\(\\mathrm{a_0}\\) may be zero. Let the carry forward when adding digits to get \\(\\mathrm{a_i}\\) be \\(\\mathrm{c_{i - 1}}\\) , so that, in general, \\(\\mathrm{c_i + d_i + d_{18 - i} = a_i + 10 c_{i - 1}}\\) . Obviously \\(\\mathrm{c_i}\\) is 0 or 1. \n\nSuppose all the digits \\(\\mathrm{a_i}\\) are odd (except that \\(\\mathrm{a_0}\\) may be zero). Now \\(\\mathrm{c_9 + 2d_9 = a_9 + 10 c_8}\\) . Since \\(\\mathrm{a_9}\\) is odd, \\(\\mathrm{c_9}\\) must be 1. But if we consider \\(\\mathrm{c_{10} + d_{10} + d_8 = a_{10} + 10 c_9}\\) , we see that since \\(\\mathrm{a_{10}}\\) is odd it is at least 1 and hence \\(\\mathrm{d_8 + d_{10}}\\) is at least 10. Hence there must be a non- zero carry \\(\\mathrm{c_9}\\) in \\(\\mathrm{c_{10} + d_{10} + d_8 = a_{10} + 10 c_9}\\) irrespective of the value of \\(\\mathrm{c_{10}}\\) . \n\nWe can now iterate and conclude successively that \\(\\mathrm{c_{12}}\\) , \\(\\mathrm{c_{14}}\\) , \\(\\mathrm{c_{16}}\\) must be non- zero.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 4", "solution_match": "# Solution"}} {"year": "1970", "tier": "T1", "problem_label": "5", "problem_type": null, "exam": "AllSovietUnion", "problem": "A room is an equilateral triangle side 100 meters. It is subdivided into 100 rooms, all equilateral triangles with side 10 meters. Each interior wall between two rooms has a door. If you start inside one of the rooms and can only pass through each door once, show that you cannot visit more than 91 rooms. Suppose now the large triangle has side k and is divided into \\(\\mathrm{k^2}\\) small triangles by lines parallel to its sides. A chain is a sequence of triangles, such that a triangle can only be included once and consecutive triangles have a common side. What is the largest possible number of triangles in a chain?", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 5", "solution_match": ""}} {"year": "1970", "tier": "T1", "problem_label": "6", "problem_type": null, "exam": "AllSovietUnion", "problem": "Given 5 segments such that any 3 can be used to form a triangle. Show that at least one of the triangles is acute- angled.", "solution": "Let the segments have length \\(\\mathrm{a\\leq b\\leq c\\leq d\\leq e}\\) . Then if all triangles are obtuse we have \\(\\mathrm{e^2 > c^2}\\) \\(+\\mathrm{d}^2\\) \\(\\mathrm{d}^2 >\\mathrm{b}^2 +\\mathrm{c}^2\\) \\(\\mathrm{c}^2 >\\mathrm{a}^2 +\\mathrm{b}^2\\) . Adding \\(\\mathrm{e^2 > a^2 + 2b^2 + c^2 > a^2 + 3b^2}\\) . But \\(\\mathrm{e\\leq a + b}\\) , so \\(\\mathrm{e^2\\leq a^2 + }\\) \\(2\\mathrm{ab + b^2\\leq a^2 + 3b^2}\\) . Contradiction.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 6", "solution_match": "# Solution"}} {"year": "1970", "tier": "T1", "problem_label": "7", "problem_type": null, "exam": "AllSovietUnion", "problem": "ABC is an acute- angled triangle. The angle bisector AD, the median BM and the altitude CH are concurrent. Prove that angle A is more than 45 degrees.", "solution": "We use Ceva's theorem. Since AD, BM, CH are concurrent, we have (BD/DC).(CM/MA).(AH/BH) = 1. But CM = MA and since AD is the angle bisector BD/DC = AB/AC, so (AB/AC).(AH/BH) = 1. Hence AH/AC = BH/AB < 1. So angle HAC > angle HCA. But angle AHC = 90 deg, so angle A > 45 deg.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 7", "solution_match": "# Solution"}} {"year": "1970", "tier": "T1", "problem_label": "8", "problem_type": null, "exam": "AllSovietUnion", "problem": "Five n- digit binary numbers have the property that every two numbers have the same digits in just m places, but no place has the same digit in all five numbers. Show that \\(2 / 5 \\leq \\mathrm{m} / \\mathrm{n} \\leq 3 / 5\\) .", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 8", "solution_match": ""}} {"year": "1970", "tier": "T1", "problem_label": "9", "problem_type": null, "exam": "AllSovietUnion", "problem": "Show that given 200 integers you can always choose 100 with sum a multiple of 100.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 9", "solution_match": ""}} {"year": "1970", "tier": "T1", "problem_label": "10", "problem_type": null, "exam": "AllSovietUnion", "problem": "ABC is a triangle with incenter I. M is the midpoint of BC. IM meets the altitude AH at E. Show that \\(\\mathrm{AE} = \\mathrm{r}\\) , the radius of the inscribed circle.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 10", "solution_match": ""}} {"year": "1970", "tier": "T1", "problem_label": "11", "problem_type": null, "exam": "AllSovietUnion", "problem": "Given any positive integer n, show that we can find infinitely many integers m such that m has no zeros (when written as a decimal number) and the sum of the digits of m and mn is the same.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 11", "solution_match": ""}} {"year": "1970", "tier": "T1", "problem_label": "12", "problem_type": null, "exam": "AllSovietUnion", "problem": "Two congruent rectangles of area A intersect in eight points. Show that the area of the intersection is more than A/2.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 12", "solution_match": ""}} {"year": "1970", "tier": "T1", "problem_label": "13", "problem_type": null, "exam": "AllSovietUnion", "problem": "If the numbers from 11111 to 99999 are arranged in an arbitrary order show that the resulting 444445 digit number is not a power of 2.", "solution": "Let the set of numbers be S. Define the function f on S as follows. Replace each digit i in n by 9- i for \\(0 < \\mathrm{i} < 9\\) . This gives f(n). Then f(f(n)) = n, so f is a bijection. The fixed points have only the digits 0 and 9 and so are all divisible by 9. The other points divide into pairs (n, f(n)) and the sum of each pair is divisible by 9. Hence the sum of all the numbers in S is divisible by 9.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 13", "solution_match": "# Solution"}} {"year": "1970", "tier": "T1", "problem_label": "14", "problem_type": null, "exam": "AllSovietUnion", "problem": "S is the set of all positive integers with n decimal digits or less and with an even digit sum. T is the set of all positive integers with n decimal digits or less and an odd digit sum. Show that the sum of the kth powers of the members of S equals the sum for T if \\(1 \\leq \\mathrm{k} < \\mathrm{n}\\) .", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 14", "solution_match": ""}} {"year": "1970", "tier": "T1", "problem_label": "15", "problem_type": null, "exam": "AllSovietUnion", "problem": "The vertices of a regular n- gon are colored (each vertex has only one color). Each color is applied to at least three vertices. The vertices of any given color form a regular polygon. Show that there are two colors which are applied to the same number of vertices.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 15", "solution_match": ""}} {"year": "1971", "tier": "T1", "problem_label": "1", "problem_type": null, "exam": "AllSovietUnion", "problem": "Prove that we can find a number divisible by \\(2^{n}\\) whose decimal representation uses only the digits 1 and 2.", "solution": "Induction on n. We claim that we can find N with n digits, all 1 or 2, so that N is divisible by \\(2^{n}\\) . True for \\(\\mathrm{n} = 1\\) : take \\(\\mathrm{N} = 2\\) . Suppose it is true for n. If \\(2^{n + 1}\\) divides N, then since \\(2^{n + 1}\\) divides \\(2 \\times 10^{n}\\) it also divides N' obtained from N by placing a 2 in front of it. If \\(2^{n + 1}\\) does not divide N, then \\(\\mathrm{N} = 2^{n} \\times \\mathrm{odd}\\) and \\(10^{n} = 2^{n} \\times \\mathrm{odd}\\) , so \\(\\mathrm{N} + 10^{n}\\) (in other words the \\(\\mathrm{n} + 1\\) digit number obtained by placing a 1 in front of N) is divisible by \\(2^{n + 1}\\) .", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "\nProblem 1", "solution_match": "# Solution"}} {"year": "1971", "tier": "T1", "problem_label": "2", "problem_type": null, "exam": "AllSovietUnion", "problem": "(1) \\(\\mathrm{A_1A_2A_3}\\) is a triangle. Points \\(\\mathrm{B_1}\\) , \\(\\mathrm{B_2}\\) , \\(\\mathrm{B_3}\\) are chosen on \\(\\mathrm{A_1A_2}\\) , \\(\\mathrm{A_2A_3}\\) , \\(\\mathrm{A_3A_1}\\) respectively and points \\(\\mathrm{D_1}\\) , \\(\\mathrm{D_2}\\) \\(\\mathrm{D_3}\\) on \\(\\mathrm{A_3A_1}\\) , \\(\\mathrm{A_1A_2}\\) , \\(\\mathrm{A_2A_3}\\) respectively, so that if parallelograms \\(\\mathrm{A_iB_iC_iD_i}\\) are formed, then the lines \\(\\mathrm{A_iC_i}\\) concur. Show that \\(\\mathrm{A_1B_1}\\) : \\(\\mathrm{A_2B_2}\\) : \\(\\mathrm{A_3B_3} = \\mathrm{A_1D_1}\\) : \\(\\mathrm{A_2D_2}\\) : \\(\\mathrm{A_3D_3}\\) . \n\n(2) \\(\\mathrm{A_1A_2\\ldots A_n}\\) is a convex polygon. Points \\(\\mathrm{B_i}\\) are chosen on \\(\\mathrm{A_iA_{i + 1}}\\) (where we take \\(\\mathrm{A_{n + 1}}\\) to mean \\(\\mathrm{A_1}\\) ), and points \\(\\mathrm{D_i}\\) on \\(\\mathrm{A_{i - 1}A_i}\\) (where we take \\(\\mathrm{A_0}\\) to mean \\(\\mathrm{A_n}\\) ) such that if parallelograms \\(\\mathrm{A_iB_iC_iD_i}\\) are formed, then the n lines \\(\\mathrm{A_iC_i}\\) concur. Show that \\(\\prod \\mathrm{A_iB_i} = \\prod \\mathrm{A_iD_i}\\) .", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 2", "solution_match": ""}} {"year": "1971", "tier": "T1", "problem_label": "3", "problem_type": null, "exam": "AllSovietUnion", "problem": "(1) Player A writes down two rows of 10 positive integers, one under the other. The numbers must be chosen so that if a is under b and c is under d, then a + d = b + c. Player B is allowed to ask for the identity of the number in row i, column j. How many questions must he ask to be sure of determining all the numbers? \n\n(2) An m x n array of positive integers is written on the blackboard. It has the property that for any four numbers a, b, c, d with a and b in the same row, c and d in the same row, a above c (in the same column) and b above d (in the same column) we have a + d = b + c. If some numbers are wiped off, how many must be left for the table to be accurately restored?", "solution": "(1) is trivial. We can write the condition as \\(\\mathrm{b - a = d - c}\\) , so the 10 numbers in the first row and 1 in the second row can all be chosen arbitrarily. Hence at least 11 questions are needed. But they are also sufficient. Having determined those numbers, the others immediately follow. \n\n(2). The m+n-1 numbers in the first row and first column can all be chosen arbitrarily, but are sufficient to determine all the numbers. Hence at least m+n-1 numbers must survive.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 3", "solution_match": "# Solution"}} {"year": "1971", "tier": "T1", "problem_label": "4", "problem_type": null, "exam": "AllSovietUnion", "problem": "Circles, each with radius less than R, are drawn inside a square side 1000R. There are no points on different circles a distance R apart. Show that the total area covered by the circles does not exceed \\(340,000 \\mathrm{R}^2\\) .", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 4", "solution_match": ""}} {"year": "1971", "tier": "T1", "problem_label": "5", "problem_type": null, "exam": "AllSovietUnion", "problem": "You are given three positive integers. A move consists of replacing \\(\\mathrm{m}\\leq \\mathrm{n}\\) by \\(2\\mathrm{m}\\) , n- m. Show that you can always make a series of moves which results in one of the integers becoming zero. [For example, if you start with 4, 5, 10, then you could get 8, 5, 6, then 3, 10, 6, then 6, 7, 6, then 0, 7, 12. ]", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 5", "solution_match": ""}} {"year": "1971", "tier": "T1", "problem_label": "6", "problem_type": null, "exam": "AllSovietUnion", "problem": "The real numbers a, b, A, B satisfy \\((\\mathrm{B} - \\mathrm{b})^{2}< (\\mathrm{A} - \\mathrm{a})(\\mathrm{Ba} - \\mathrm{Ab})\\) . Show that the quadratics \\(\\mathrm{x}^{2}+\\) \\(\\mathrm{ax} + \\mathrm{b} = 0\\) and \\(\\mathrm{x}^{2} + \\mathrm{Ax} + \\mathrm{B} = 0\\) have real roots and between the roots of each there is a root of the other.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 6", "solution_match": ""}} {"year": "1971", "tier": "T1", "problem_label": "7", "problem_type": null, "exam": "AllSovietUnion", "problem": "The projections of a body on two planes are circles. Show that the circles have the same radius.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 7", "solution_match": ""}} {"year": "1971", "tier": "T1", "problem_label": "8", "problem_type": null, "exam": "AllSovietUnion", "problem": "An integer is written at each vertex of a regular n- gon. A move is to find four adjacent vertices with numbers a, b, c, d (in that order), so that \\((\\mathrm{a} - \\mathrm{d})(\\mathrm{b} - \\mathrm{c})< 0\\) , and then to interchange b and c. Show that only finitely many moves are possible. For example, a possible sequence of moves is shown below: \n\n
172354
127354
123754
123574
213574
", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 8", "solution_match": ""}} {"year": "1971", "tier": "T1", "problem_label": "9", "problem_type": null, "exam": "AllSovietUnion", "problem": "A polygon P has an inscribed circle center O. If a line divides P into two polygons with equal areas and equal perimeters, show that it must pass through O.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 9", "solution_match": ""}} {"year": "1971", "tier": "T1", "problem_label": "10", "problem_type": null, "exam": "AllSovietUnion", "problem": "Given any set S of 25 positive integers, show that you can always find two such that none of the other numbers equals their sum or difference.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 10", "solution_match": ""}} {"year": "1971", "tier": "T1", "problem_label": "11", "problem_type": null, "exam": "AllSovietUnion", "problem": "A and B are adjacent vertices of a 12- gon. Vertex A is marked - and the other vertices are marked +. You are allowed to change the sign of any n adjacent vertices. Show that by a succession of moves of this type with \\(\\mathrm{n} = 6\\) you cannot get B marked - and the other vertices marked +. Show that the same is true if all moves have \\(\\mathrm{n} = 3\\) or if all moves have \\(\\mathrm{n} = 4\\) .", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 11", "solution_match": ""}} {"year": "1971", "tier": "T1", "problem_label": "12", "problem_type": null, "exam": "AllSovietUnion", "problem": "Equally spaced perpendicular lines divide a large piece of paper into unit squares. N squares are colored black. Show that you can always cut out a set of disjoint square pieces of paper, so\n\n\n\nthat all the black squares are removed and the black area of each piece is between 1/5 and 4/5 of its total area.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 12", "solution_match": ""}} {"year": "1971", "tier": "T1", "problem_label": "13", "problem_type": null, "exam": "AllSovietUnion", "problem": "n is a positive integer. S is the set of all triples (a, b, c) such that \\(1 \\leq a, b, c, \\leq n\\) . What is the smallest subset X of triples such that for every member of S one can find a member of X which differs in only one position. [For example, for \\(n = 2\\) , one could take \\(X = \\{ (1, 1, 1), (2, 2, 2) \\} .\\) ]", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 13", "solution_match": ""}} {"year": "1971", "tier": "T1", "problem_label": "14", "problem_type": null, "exam": "AllSovietUnion", "problem": "Let \\(\\operatorname {f}(\\mathbf{x}, \\mathbf{y}) = \\mathbf{x}^{2} + \\mathbf{x}\\mathbf{y} + \\mathbf{y}^{2}\\) . Show that given any real \\(\\mathbf{x}\\) , \\(\\mathbf{y}\\) one can always find integers \\(\\mathbf{m}, \\mathbf{n}\\) such that \\(\\operatorname {f}(\\mathbf{x} - \\mathbf{m}, \\mathbf{y} - \\mathbf{n}) \\leq = 1 / 3\\) . What is the corresponding result if \\(\\operatorname {f}(\\mathbf{x}, \\mathbf{y}) = \\mathbf{x}^{2} + \\mathbf{a}\\mathbf{x}\\mathbf{y} + \\mathbf{y}^{2}\\) with 0 \\(\\leq \\mathbf{a} \\leq 2\\) ?", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 14", "solution_match": ""}} {"year": "1971", "tier": "T1", "problem_label": "15", "problem_type": null, "exam": "AllSovietUnion", "problem": "A switch has two inputs 1, 2 and two outputs 1, 2. It either connects 1 to 1 and 2 to 2, or 1 to 2 and 2 to 1. If you have three inputs 1, 2, 3 and three outputs 1, 2, 3, then you can use three switches, the first across 1 and 2, then the second across 2 and 3, and finally the third across 1 and 2. It is easy to check that this allows the output to be any permutation of the inputs and that at least three switches are required to achieve this. What is the minimum number of switches required for 4 inputs, so that by suitably setting the switches the output can be any permutation of the inputs?", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 15", "solution_match": ""}} {"year": "1972", "tier": "T1", "problem_label": "1", "problem_type": null, "exam": "AllSovietUnion", "problem": "ABCD is a rectangle. M is the midpoint of AD and N is the midpoint of BC. P is a point on the ray CD on the opposite side of D to C. The ray PM intersects AC at Q. Show that MN bisects the angle PNQ.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 1", "solution_match": ""}} {"year": "1972", "tier": "T1", "problem_label": "2", "problem_type": null, "exam": "AllSovietUnion", "problem": "Given 50 segments on a line show that you can always find either 8 segments which are disjoint or 8 segments with a common point.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 2", "solution_match": ""}} {"year": "1972", "tier": "T1", "problem_label": "3", "problem_type": null, "exam": "AllSovietUnion", "problem": "Find the largest integer n such that \\(4^{27} + 4^{1000} + 4^{n}\\) is a square.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 3", "solution_match": ""}} {"year": "1972", "tier": "T1", "problem_label": "4", "problem_type": null, "exam": "AllSovietUnion", "problem": "a, m, n are positive integers and a \\(>1\\) . Show that if \\(\\mathrm{a^{m} + 1}\\) divides \\(\\mathrm{a^{n} + 1}\\) , then m divides n. The positive integer b is relatively prime to a, show that if \\(\\mathrm{a^{m} + b^{m}}\\) divides \\(\\mathrm{a^{n} + b^{n}}\\) then m divides n.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 4", "solution_match": ""}} {"year": "1972", "tier": "T1", "problem_label": "5", "problem_type": null, "exam": "AllSovietUnion", "problem": "A sequence of finite sets of positive integers is defined as follows. \\(\\mathrm{S_0 = \\{m\\}}\\) , where \\(\\mathrm{m > 1}\\) . Then given \\(\\mathrm{S_n}\\) you derive \\(\\mathrm{S_{n + 1}}\\) by taking \\(\\mathrm{k^2}\\) and \\(\\mathrm{k + 1}\\) for each element k of \\(\\mathrm{S_n}\\) . For example, if \\(\\mathrm{S_0 = \\{5\\}}\\) , then \\(\\mathrm{S_2 = \\{7, 26, 36, 625\\}}\\) . Show that \\(\\mathrm{S_n}\\) always has \\(2^{\\mathrm{n}}\\) distinct elements.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 5", "solution_match": ""}} {"year": "1972", "tier": "T1", "problem_label": "6", "problem_type": null, "exam": "AllSovietUnion", "problem": "Prove that a collection of squares with total area 1 can always be arranged inside a square of area 2 without overlapping.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 6", "solution_match": ""}} {"year": "1972", "tier": "T1", "problem_label": "7", "problem_type": null, "exam": "AllSovietUnion", "problem": "O is the point of intersection of the diagonals of the convex quadrilateral ABCD. Prove that the line joining the centroids of ABO and CDO is perpendicular to the line joining the orthocenters of BCO and ADO.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 7", "solution_match": ""}} {"year": "1972", "tier": "T1", "problem_label": "8", "problem_type": null, "exam": "AllSovietUnion", "problem": "9 lines each divide a square into two quadrilaterals with areas 2/5 and 3/5 that of the square. Show that 3 of the lines meet in a point.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 8", "solution_match": ""}} {"year": "1972", "tier": "T1", "problem_label": "9", "problem_type": null, "exam": "AllSovietUnion", "problem": "A 7- gon is inscribed in a circle. The center of the circle lies inside the 7- gon. A, B, C are adjacent vertices of the 7- gon show that the sum of the angles at A, B, C is less than 450 degrees.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 9", "solution_match": ""}} {"year": "1972", "tier": "T1", "problem_label": "10", "problem_type": null, "exam": "AllSovietUnion", "problem": "Two players play the following game. At each turn the first player chooses a decimal digit, then the second player substitutes it for one of the stars in the subtraction | **** - **** |. The first player tries to end up with the largest possible result, the second player tries to end up with the smallest possible result. Show that the first player can always play so that the result is at least 4000 and that the second player can always play so that the result is at most 4000.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "\nProblem 10", "solution_match": ""}} {"year": "1972", "tier": "T1", "problem_label": "11", "problem_type": null, "exam": "AllSovietUnion", "problem": "For positive reals x, y let f(x, y) be the smallest of x, 1/y, y + 1/x. What is the maximum value of f(x, y)? What are the corresponding x, y?", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "\nProblem 11", "solution_match": ""}} {"year": "1972", "tier": "T1", "problem_label": "12", "problem_type": null, "exam": "AllSovietUnion", "problem": "P is a convex polygon and X is an interior point such that for every pair of vertices A, B, the triangle XAB is isosceles. Prove that all the vertices of P lie on some circle center X.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "\nProblem 12", "solution_match": ""}} {"year": "1972", "tier": "T1", "problem_label": "13", "problem_type": null, "exam": "AllSovietUnion", "problem": "Is it possible to place the digits 0, 1, 2 into unit squares of 100 x 100 cross- lined paper such that every 3 x 4 (and every 4 x 3) rectangle contains three 0s, four 1s and five 2s?", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "\nProblem 13", "solution_match": ""}} {"year": "1972", "tier": "T1", "problem_label": "14", "problem_type": null, "exam": "AllSovietUnion", "problem": "x₁, x₂, ..., xₙ are positive reals with sum 1. Let s be the largest of x₁/(1 + x₁), x₂/(1 + x₁ + x₂), ..., xₙ/(1 + x₁ + ... + xₙ). What is the smallest possible value of s? What are the corresponding xᵢ?", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "\nProblem 14", "solution_match": ""}} {"year": "1972", "tier": "T1", "problem_label": "15", "problem_type": null, "exam": "AllSovietUnion", "problem": "n teams compete in a tournament. Each team plays every other team once. In each game a team gets 2 points for a win, 1 for a draw and 0 for a loss. Given any subset S of teams, one can find a team (possibly in S) whose total score in the games with teams in S was odd. Prove that n is even.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "\nProblem 15", "solution_match": ""}} {"year": "1973", "tier": "T1", "problem_label": "1", "problem_type": null, "exam": "AllSovietUnion", "problem": "You are given 14 coins. It is known that genuine coins all have the same weight and that fake coins all have the same weight, but weigh less than genuine coins. You suspect that 7 particular coins are genuine and the other 7 fake. Given a balance, how can you prove this in three weighings (assuming that you turn out to be correct)?", "solution": "Let the coins you suspect to be genuine be \\(\\mathrm{G}_1\\) , \\(\\mathrm{G}_2\\) , ..., \\(\\mathrm{G}_7\\) , and the suspected fakes by \\(\\mathrm{F}_1\\) , \\(\\mathrm{F}_2\\) , ..., \\(\\mathrm{F}_7\\) . First weigh \\(\\mathrm{F}_1\\) against \\(\\mathrm{G}_1\\) . Assuming \\(\\mathrm{F}_1\\) weighs less, you have proved that \\(\\mathrm{F}_1\\) is fake and \\(\\mathrm{G}_1\\) genuine. Second, weigh \\(\\mathrm{F}_1\\) , \\(\\mathrm{G}_2\\) , \\(\\mathrm{G}_3\\) against \\(\\mathrm{G}_1\\) , \\(\\mathrm{F}_2\\) , \\(\\mathrm{F}_3\\) . Assuming the first three weigh more you have proved that they include more genuine coins than the second three. But the second three includes one genuine coin \\((\\mathrm{G}_1)\\) and the first three includes one fake \\((\\mathrm{F}_1)\\) , so you have proved that \\(\\mathrm{G}_2\\) and \\(\\mathrm{G}_3\\) are genuine and \\(\\mathrm{F}_2\\) and \\(\\mathrm{F}_3\\) fake. Finally, weigh \\(\\mathrm{F}_1\\) , \\(\\mathrm{F}_2\\) , \\(\\mathrm{F}_3\\) , \\(\\mathrm{G}_4\\) , \\(\\mathrm{G}_5\\) , \\(\\mathrm{G}_6\\) , \\(\\mathrm{G}_7\\) against \\(\\mathrm{F}_4\\) , \\(\\mathrm{F}_5\\) , \\(\\mathrm{F}_6\\) , \\(\\mathrm{F}_7\\) , \\(\\mathrm{G}_1\\) , \\(\\mathrm{G}_2\\) , \\(\\mathrm{G}_3\\) . Assuming the first group weighs more it must include more genuine coins and hence just four genuine coins. Similarly, the second group must include four fakes. So you have proved the identity of the remaining coins.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 1", "solution_match": "# Solution"}} {"year": "1973", "tier": "T1", "problem_label": "2", "problem_type": null, "exam": "AllSovietUnion", "problem": "Prove that a 9 digit decimal number whose digits are all different, which does not end with 5 and or contain a 0, cannot be a square.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 2", "solution_match": ""}} {"year": "1973", "tier": "T1", "problem_label": "3", "problem_type": null, "exam": "AllSovietUnion", "problem": "Given \\(\\mathrm{n} > 4\\) points, show that you can place an arrow between each pair of points, so that given any point you can reach any other point by travelling along either one or two arrows in the direction of the arrow.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 3", "solution_match": ""}} {"year": "1973", "tier": "T1", "problem_label": "4", "problem_type": null, "exam": "AllSovietUnion", "problem": "OA and OB are tangent to a circle at A and B. The line parallel to OB through A meets the circle again at C. The line OC meets the circle again at E. The ray AE meets the line OB at K. Prove that K is the midpoint of OB.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 4", "solution_match": ""}} {"year": "1973", "tier": "T1", "problem_label": "5", "problem_type": null, "exam": "AllSovietUnion", "problem": "\\(\\mathrm{p}(\\mathrm{x}) = \\mathrm{ax}^2 +\\mathrm{bx} + \\mathrm{c}\\) is a real quadratic such that \\(\\mathrm{lp}(\\mathrm{x})\\leq 1\\) for all \\(|\\mathrm{x}|\\leq 1\\) . Prove that \\(|\\mathrm{cx}^2 +\\mathrm{bx} + \\mathrm{al}\\leq 2\\) for \\(|\\mathrm{x}|\\leq 1\\) .", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 5", "solution_match": ""}} {"year": "1973", "tier": "T1", "problem_label": "6", "problem_type": null, "exam": "AllSovietUnion", "problem": "Players numbered 1 to 1024 play in a knock- out tournament. There are no draws, the winner of a match goes through to the next round and the loser is knocked- out, so that there are 512 matches in the first round, 256 in the second and so on. If m plays n and \\(\\mathrm{m}< \\mathrm{n} - 2\\) then m always wins. What is the largest possible number for the winner?", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 6", "solution_match": ""}} {"year": "1973", "tier": "T1", "problem_label": "7", "problem_type": null, "exam": "AllSovietUnion", "problem": "Define \\(\\mathrm{p(x) = ax^2 + bx + c}\\) . If \\(\\mathrm{p(x) = x}\\) has no real roots, prove that \\(\\mathrm{p(p(x)) = 0}\\) has no real roots.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 7", "solution_match": ""}} {"year": "1973", "tier": "T1", "problem_label": "8", "problem_type": null, "exam": "AllSovietUnion", "problem": "At time 1, n unit squares of an infinite sheet of paper ruled in squares are painted black, the rest remain white. At time \\(\\mathrm{k + 1}\\) , the color of each square is changed to the color held at time k by a majority of the following three squares: the square itself, its northern neighbour and its eastern neighbour. Prove that all the squares are white at time \\(\\mathrm{n + 1}\\) .", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 8", "solution_match": ""}} {"year": "1973", "tier": "T1", "problem_label": "9", "problem_type": null, "exam": "AllSovietUnion", "problem": "ABC is an acute- angled triangle. D is the reflection of A in BC, E is the reflection of B in AC, and F is the reflection of C in AB. Show that the circumcircles of DBC, ECA, FAB meet at a point and that the lines AD, BE, CF meet at a point.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 9", "solution_match": ""}} {"year": "1973", "tier": "T1", "problem_label": "10", "problem_type": null, "exam": "AllSovietUnion", "problem": "n people are all strangers. Show that you can always introduce some of them to each other, so that afterwards each person has met a different number of the others. [problem: this is false as stated. Each person must have 0, 1, ... or n- 1 meetings, so all these numbers must be used. But if one person has met no one, then another cannot have met everyone.]", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 10", "solution_match": ""}} {"year": "1973", "tier": "T1", "problem_label": "11", "problem_type": null, "exam": "AllSovietUnion", "problem": "A king moves on an \\(8 \\times 8\\) chessboard. He can move one square at a time, diagonally or orthogonally (so away from the borders he can move to any of eight squares). He makes a complete circuit of the board, starting and finishing on the same square and visiting every other square just once. His trajectory is drawn by joining the center of the squares he moves to and from for each move. The trajectory does not intersect itself. Show that he makes at least 28 moves parallel to the sides of the board (the others being diagonal) and that a circuit is possible with exactly 28 moves parallel to the sides of the board. If the board has side length 8, what is the maximum and minimum possible length for such a trajectory.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 11", "solution_match": ""}} {"year": "1973", "tier": "T1", "problem_label": "12", "problem_type": null, "exam": "AllSovietUnion", "problem": "A triangle has area 1, and sides \\(\\mathrm{a}\\geq \\mathrm{b}\\geq \\mathrm{c}\\) . Prove that \\(\\mathrm{b}^2\\geq 2\\)", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 12", "solution_match": ""}} {"year": "1973", "tier": "T1", "problem_label": "13", "problem_type": null, "exam": "AllSovietUnion", "problem": "A convex n- gon has no two sides parallel. Given a point P inside the n- gon show that there are at most n lines through P which bisect the area of the n- gon.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 13", "solution_match": ""}} {"year": "1973", "tier": "T1", "problem_label": "14", "problem_type": null, "exam": "AllSovietUnion", "problem": "a, b, c, d, e are positive reals. Show that \\((\\mathrm{a} + \\mathrm{b} + \\mathrm{c} + \\mathrm{d} + \\mathrm{e})^2\\geq 4(\\mathrm{ab} + \\mathrm{bc} + \\mathrm{cd} + \\mathrm{de} + \\mathrm{ea})\\)", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 14", "solution_match": ""}} {"year": "1973", "tier": "T1", "problem_label": "15", "problem_type": null, "exam": "AllSovietUnion", "problem": "Given 4 points which do not lie in a plane, how many parallelepipeds have all 4 points as vertices?", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 15", "solution_match": ""}} {"year": "1974", "tier": "T1", "problem_label": "1", "problem_type": null, "exam": "AllSovietUnion", "problem": "A collection of n cards is numbered from 1 to n. Each card has either 1 or - 1 on the back. You are allowed to ask for the product of the numbers on the back of any three cards. What is the smallest number of questions which will allow you to determine the numbers on the backs of all the cards if n is (1) 30, (2) 31, (3) 32? If 50 cards are arranged in a circle and you are only allowed to ask for the product of the numbers on the backs of three adjacent cards, how many questions are needed to determine the product of the numbers on the backs of all 50 cards?", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 1", "solution_match": ""}} {"year": "1974", "tier": "T1", "problem_label": "2", "problem_type": null, "exam": "AllSovietUnion", "problem": "Find the smallest positive integer which can be represented as \\(36^{\\mathrm{m}} - 5^{\\mathrm{n}}\\) . \n\n## Answer \n\n11", "solution": "Obviously \\(11 = 36^{1} - 5^{2}\\) , and we guess that this is the best possible. We cannot have \\(36^{\\mathrm{m}} - 5^{\\mathrm{n}} = \\mathrm{k}\\) , where 2, 3 or 5 divides k (because then 2 would divide \\(5^{\\mathrm{n}}\\) and similarly in the other cases). So the only possible values of \\(\\mathrm{k}< 11\\) are 1, 7. \n\nWe have \\(36^{\\mathrm{m}} - 5^{\\mathrm{n}} = 1 \\mathrm{mod} 5\\) , so \\(\\mathrm{k} \\neq 7\\) . Similarly, \\(36^{\\mathrm{m}} - 5^{\\mathrm{n}} = 3 \\mathrm{mod} 4\\) , so \\(\\mathrm{k} \\neq 1\\) .", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 2", "solution_match": "# Solution"}} {"year": "1974", "tier": "T1", "problem_label": "3", "problem_type": null, "exam": "AllSovietUnion", "problem": "Each side of a convex hexagon is longer than 1. Is there always a diagonal longer than 2? If each of the main diagonals of a hexagon is longer than 2, is there always a side longer than 1?", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 3", "solution_match": ""}} {"year": "1974", "tier": "T1", "problem_label": "4", "problem_type": null, "exam": "AllSovietUnion", "problem": "Circles radius r and R touch externally. AD is parallel to BC. AB and CD touch both circles. AD touches the circle radius r, but not the circle radius R, and BC touches the circle radius R, but not the circle radius r. What is the smallest possible length for AB?", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 4", "solution_match": ""}} {"year": "1974", "tier": "T1", "problem_label": "5", "problem_type": null, "exam": "AllSovietUnion", "problem": "Given n unit vectors in the plane whose sum has length less than one. Show that you can arrange them so that the sum of the first k has length less than 2 for every \\(1< \\mathrm{k}< \\mathrm{n}\\) .", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 5", "solution_match": ""}} {"year": "1974", "tier": "T1", "problem_label": "6", "problem_type": null, "exam": "AllSovietUnion", "problem": "Find all real a, b, c such that \\(\\mathrm{la x} + \\mathrm{by} + \\mathrm{czl} + \\mathrm{lbx} + \\mathrm{cy} + \\mathrm{azl} + \\mathrm{lcx} + \\mathrm{ay} + \\mathrm{bzl} = \\mathrm{lx} + \\mathrm{y} + \\mathrm{zl}\\) for all real x, y, z.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 6", "solution_match": ""}} {"year": "1974", "tier": "T1", "problem_label": "7", "problem_type": null, "exam": "AllSovietUnion", "problem": "ABCD is a square. P is on the segment AB and Q is on the segment BC such that \\(\\mathrm{BP} = \\mathrm{BQ}\\) . H lies on PC such that BHC is a right angle. Show that DHQ is a right angle.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 7", "solution_match": ""}} {"year": "1974", "tier": "T1", "problem_label": "8", "problem_type": null, "exam": "AllSovietUnion", "problem": "The n points of a graph are each colored red or blue. At each move we select a point which differs in color from more than half of the points to which it it is joined and we change its color. Prove that this process must finish after a finite number of moves.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 8", "solution_match": ""}} {"year": "1974", "tier": "T1", "problem_label": "9", "problem_type": null, "exam": "AllSovietUnion", "problem": "Find all positive integers m, n such that \\(\\mathrm{n}^{\\mathrm{n}}\\) has m decimal digits and \\(\\mathrm{m}^{\\mathrm{m}}\\) has n decimal digits.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 9", "solution_match": ""}} {"year": "1974", "tier": "T1", "problem_label": "10", "problem_type": null, "exam": "AllSovietUnion", "problem": "In the triangle ABC, angle C is 90 deg and \\(\\mathrm{AC} = \\mathrm{BC}\\) . Take points D on CA and E on CB such that \\(\\mathrm{CD} = \\mathrm{CE}\\) . Let the perpendiculars from D and C to AE meet AB at K and L respectively. Show that \\(\\mathrm{KL} = \\mathrm{LB}\\) .", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 10", "solution_match": ""}} {"year": "1974", "tier": "T1", "problem_label": "11", "problem_type": null, "exam": "AllSovietUnion", "problem": "One rat and two cats are placed on a chess- board. The rat is placed first and then the two cats choose positions on the border squares. The rat moves first. Then the cats and the rat move alternately. The rat can move one square to an adjacent square (but not diagonally). If it is on a border square, then it can also move off the board. On a cat move, both cats move one square. Each must move to an adjacent square, and not diagonally. The cats win if one of them moves onto the same square as the rat. The rat wins if it moves off the board. Who wins? Suppose there are three cats (and all three cats move when it is the cats' turn), but that the rat gets an extra initial turn. Prove that the rat wins.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 11", "solution_match": ""}} {"year": "1974", "tier": "T1", "problem_label": "12", "problem_type": null, "exam": "AllSovietUnion", "problem": "Arrange the numbers 1, 2, ..., 32 in a sequence such that the arithmetic mean of two numbers does not lie between them. (For example, ... 3, 4, 5, 2, 1, ... is invalid, because 2 lies between 1 and 3.) Can you arrange the numbers 1, 2, ..., 100 in the same way?", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 12", "solution_match": ""}} {"year": "1974", "tier": "T1", "problem_label": "13", "problem_type": null, "exam": "AllSovietUnion", "problem": "Find all three digit decimal numbers \\(\\mathrm{a_1a_2a_3}\\) which equal the mean of the six numbers \\(\\mathrm{a_1a_2a_3}\\) , \\(\\mathrm{a_1a_3a_2}\\) , \\(\\mathrm{a_2a_1a_3}\\) , \\(\\mathrm{a_2a_3a_1}\\) , \\(\\mathrm{a_3a_1a_2}\\) , \\(\\mathrm{a_3a_2a_1}\\) .", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 13", "solution_match": ""}} {"year": "1974", "tier": "T1", "problem_label": "14", "problem_type": null, "exam": "AllSovietUnion", "problem": "No triangle of area 1 can be fitted inside a convex polygon. Show that the polygon can be fitted inside a triangle of area 4.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 14", "solution_match": ""}} {"year": "1974", "tier": "T1", "problem_label": "15", "problem_type": null, "exam": "AllSovietUnion", "problem": "f is a function on the closed interval [0, 1] with non- negative real values. \\(\\mathrm{f}(1) = 1\\) and \\(\\mathrm{f}(\\mathrm{x} + \\mathrm{y}) \\geq \\mathrm{f}(\\mathrm{x}) + \\mathrm{f}(\\mathrm{y})\\) for all \\(\\mathrm{x}, \\mathrm{y}\\) . Show that \\(\\mathrm{f}(\\mathrm{x}) \\leq 2\\mathrm{x}\\) for all \\(\\mathrm{x}\\) . Is it necessarily true that \\(\\mathrm{f}(\\mathrm{x}) \\leq 1.9\\mathrm{x}\\) for all \\(\\mathrm{x}\\) .\n\n\n\n## Answer \n\nno", "solution": "We have \\(\\mathrm{f(x) = f(1) - f(1 - x)\\leq f(1) = 1}\\) . So for \\(\\mathrm{x}\\geq 1 / 2\\) \\(\\mathrm{f(x)}\\leq 1\\leq 2\\mathrm{x}\\) . If \\(\\mathrm{x}< 1 / 2\\) , then for some n we have \\(1 / 2^{n + 1}\\leq \\mathrm{x}< 1 / 2^{\\mathrm{n}}\\) . Hence by a trivial induction \\(\\mathrm{f}(2^{\\mathrm{n}}\\mathrm{x})\\geq 2^{\\mathrm{n}}\\mathrm{f}(\\mathrm{x})\\) . But \\(\\mathrm{f}(2^{\\mathrm{n}}\\mathrm{x})\\leq 1\\) , so \\(\\mathrm{f(x)}\\leq\\) \\(1 / 2^{\\mathrm{n}}\\leq 2\\mathrm{x}\\) \n\nNote that \\(\\mathrm{f(x) = 0}\\) for \\(\\mathrm{x}\\leq 1 / 2\\) and 1 for \\(\\mathrm{x} > 1 / 2\\) satisfies the conditions. But \\(\\mathrm{f}(0.51) = 1>\\) \\((1.9)(0.51)\\)", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 15", "solution_match": "# Solution"}} {"year": "1974", "tier": "T1", "problem_label": "16", "problem_type": null, "exam": "AllSovietUnion", "problem": "The triangle ABC has area 1. D, E, F are the midpoints of the sides BC, CA, AB. P lies in the segment BF, Q lies in the segment CD, R lies in the segment AE. What is the smallest possible area for the intersection of triangles DEF and PQR?", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 16", "solution_match": ""}} {"year": "1975", "tier": "T1", "problem_label": "1", "problem_type": null, "exam": "AllSovietUnion", "problem": "(1) O is the circumcenter of the triangle ABC. The triangle is rotated about O to give a new triangle A'B'C'. The lines AB and A'B' intersect at C\", BC and B'C' intersect at A\", and CA and C'A' intersect at B\". Show that A\"B\"C\" is similar to ABC. \n\n(2) O is the center of the circle through ABCD. ABCD is rotated about O to give the quadrilateral A'B'C'D'. Prove that the intersection points of corresponding sides form a parallelogram.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 1", "solution_match": ""}} {"year": "1975", "tier": "T1", "problem_label": "2", "problem_type": null, "exam": "AllSovietUnion", "problem": "A triangle ABC has unit area. The first player chooses a point X on side AB, then the second player chooses a point Y on side BC, and finally the first player chooses a point Z on side CA. The first player tries to arrange for the area of XYZ to be as large as possible, the second player tries to arrange for the area to be as small as possible. What is the optimum strategy for the first player and what is the best he can do (assuming the second player plays optimally)?", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 2", "solution_match": ""}} {"year": "1975", "tier": "T1", "problem_label": "3", "problem_type": null, "exam": "AllSovietUnion", "problem": "What is the smallest perimeter for a convex 32- gon whose vertices are all lattice points?", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 3", "solution_match": ""}} {"year": "1975", "tier": "T1", "problem_label": "4", "problem_type": null, "exam": "AllSovietUnion", "problem": "Given a \\(7 \\times 7\\) square subdivided into 49 unit squares, mark the center of n unit squares, so that no four marks form a rectangle with sides parallel to the square. What is the largest n for which this is possible? What about a \\(13 \\times 13\\) square?", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 4", "solution_match": ""}} {"year": "1975", "tier": "T1", "problem_label": "5", "problem_type": null, "exam": "AllSovietUnion", "problem": "Given a convex hexagon, take the midpoint of each of the six diagonals joining vertices which are separated by a single vertex (so if the vertices are in order A, B, C, D, E, F, then the diagonals are AC, BD, CE, DF, EA, FB). Show that the midpoints form a convex hexagon with a quarter the area of the original.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 5", "solution_match": ""}} {"year": "1975", "tier": "T1", "problem_label": "6", "problem_type": null, "exam": "AllSovietUnion", "problem": "Show that there are \\(2^{n + 1}\\) numbers each with \\(2^{n}\\) digits, all 1 or 2, so that every two numbers differ in at least half their digits.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 6", "solution_match": ""}} {"year": "1975", "tier": "T1", "problem_label": "7", "problem_type": null, "exam": "AllSovietUnion", "problem": "There are finitely many polygons in the plane. Every two have a common point. Prove that there is a straight line intersecting all the polygons.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 7", "solution_match": ""}} {"year": "1975", "tier": "T1", "problem_label": "8", "problem_type": null, "exam": "AllSovietUnion", "problem": "a, b, c are positive reals. Show that a \\(^{3} + \\mathrm{b}^{3} + \\mathrm{c}^{3} + 3\\mathrm{abc}\\geq \\mathrm{ab}(\\mathrm{a} + \\mathrm{b}) + \\mathrm{bc}(\\mathrm{b} + \\mathrm{c}) + \\mathrm{ca}(\\mathrm{c} + \\mathrm{a})\\) .", "solution": "The inequality is homogeneous, so we can take \\(\\mathrm{a} = 1\\) and put \\(\\mathrm{b} = 1 + \\mathrm{x}\\) , \\(\\mathrm{c} = 1 + \\mathrm{y}\\) , where \\(\\mathrm{x}\\) , \\(\\mathrm{y} \\geq 0\\) . Then after some reduction the inequality is equivalent to \\(\\mathrm{x}^{3} + \\mathrm{y}^{3} + \\mathrm{x}^{2} + \\mathrm{y}^{2} - \\mathrm{x}^{2} - \\mathrm{y} - \\mathrm{xy}^{2} - \\mathrm{xy} \\geq 0\\) , or (after factorising \\(\\mathrm{x}^{3} + \\mathrm{y}^{3}\\) ) to \\((\\mathrm{x} + \\mathrm{y} + 1)(\\mathrm{x} - \\mathrm{y})^{2} + \\mathrm{xy} \\geq 0\\) , which is obviously true.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 8", "solution_match": "# Solution"}} {"year": "1975", "tier": "T1", "problem_label": "9", "problem_type": null, "exam": "AllSovietUnion", "problem": "Three flies crawl along the perimeter of a triangle. At least one fly makes a complete circuit of the perimeter. For the entire period the center of mass of the flies remains fixed. Show that it must be at the centroid of the triangle. [You may not assume, without proof, that the flies have the same mass, or that they crawl at the same speed, or that any fly crawls at a constant speed.]", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 9", "solution_match": ""}} {"year": "1975", "tier": "T1", "problem_label": "10", "problem_type": null, "exam": "AllSovietUnion", "problem": "The finite sequence \\(\\mathrm{a_n}\\) has each member 0, 1 or 2. A move involves replacing any two unequal members of the sequence by a single member different from either. A series of moves results in a single number. Prove that no series of moves can terminate in a (single) different number.", "solution": "Suppose we start with a 0s, b 1s and c 2s. Each move changes the parity of all of a, b, c. Each moves reduces the length of the sequence by 1, so there must be a+b+c- 1 moves in all. Hence the total number of 0s, the total number of 1s and the total number of 2s all have their parity changed a+b+c- 1 times. So if we end up with just one 0, then a must have the opposite parity to b and c. In that case, we cannot end up with just one 1, or just one 2. Similarly in the other cases.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 10", "solution_match": "# Solution"}} {"year": "1975", "tier": "T1", "problem_label": "11", "problem_type": null, "exam": "AllSovietUnion", "problem": "S is a horizontal strip in the plane. n lines are drawn so that no three are collinear and every pair intersects within the strip. A path starts at the bottom border of the strip and consists of a sequence of segments from the n lines. The path must change line at each intersection and must always move upwards. Show that: (1) there are at least n/2 disjoint paths; (2) there is a path of at least n segments; (3) there is a path involving not more than n/2 + 1 of the lines; and (4) there is a path that involves segments from all n lines.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 11", "solution_match": ""}} {"year": "1975", "tier": "T1", "problem_label": "12", "problem_type": null, "exam": "AllSovietUnion", "problem": "For what n can we color the unit cubes in an n x n x n cube red or green so that every red unit cube has just two red neighbouring cubes (sharing a face) and every green unit cube has just two green neighbouring cubes.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 12", "solution_match": ""}} {"year": "1975", "tier": "T1", "problem_label": "13", "problem_type": null, "exam": "AllSovietUnion", "problem": "\\(\\mathrm{p(x)}\\) is a polynomial with integral coefficients. \\(\\mathrm{f(n)} =\\) the sum of the (decimal) digits in the value \\(\\mathrm{p(n)}\\) . Show that \\(\\mathrm{f(n)}\\) some value m infinitely many times.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 13", "solution_match": ""}} {"year": "1975", "tier": "T1", "problem_label": "14", "problem_type": null, "exam": "AllSovietUnion", "problem": "20 teams each play one game with every other team. Each game results in a win or loss (no draws). k of the teams are European. A separate trophy is awarded for the best European team on the basis of the k(k- 1)/2 games in which both teams are European. This trophy is won by a single team. The same team comes last in the overall competition (winning fewer games than any other team). What is the largest possible value of k? If draws are allowed and a team scores 2 for a win and 1 for a draw, what is the largest possible value of k?", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 14", "solution_match": ""}} {"year": "1975", "tier": "T1", "problem_label": "15", "problem_type": null, "exam": "AllSovietUnion", "problem": "Given real numbers \\(\\mathbf{a}_{\\mathrm{i}}\\) , \\(\\mathbf{b}_{\\mathrm{i}}\\) and positive reals \\(\\mathbf{c}_{\\mathrm{i}}\\) , \\(\\mathbf{d}_{\\mathrm{i}}\\) , let \\(\\mathbf{e}_{\\mathrm{ij}} = (\\mathbf{a}_{\\mathrm{i}} + \\mathbf{b}_{\\mathrm{j}}) / (\\mathbf{c}_{\\mathrm{i}} + \\mathbf{d}_{\\mathrm{j}})\\) . Let \\(\\mathbf{M}_{\\mathrm{i}} = \\max_{0\\leq \\mathrm{j}\\leq \\mathrm{n}}\\mathbf{e}_{\\mathrm{ij}}\\) , \\(\\mathbf{m}_{\\mathrm{j}} = \\min_{1\\leq \\mathrm{i}\\leq \\mathrm{n}}\\mathbf{e}_{\\mathrm{ij}}\\) . Show that we can find an \\(\\mathbf{e}_{\\mathrm{ij}}\\) with \\(1\\leq \\mathrm{i},\\mathrm{j}\\leq \\mathrm{n}\\) such that \\(\\mathbf{e}_{\\mathrm{ij}} = \\mathbf{M}_{\\mathrm{i}} = \\mathbf{m}_{\\mathrm{j}}\\) .", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 15", "solution_match": ""}} {"year": "1976", "tier": "T1", "problem_label": "1", "problem_type": null, "exam": "AllSovietUnion", "problem": "50 watches, all keeping perfect time, lie on a table. Show that there is a moment when the sum of the distances from the center of the table to the center of each dial equals the sum of the distances from the center of the table to the tip of each minute hand.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 1", "solution_match": ""}} {"year": "1976", "tier": "T1", "problem_label": "2", "problem_type": null, "exam": "AllSovietUnion", "problem": "1000 numbers are written in line 1, then further lines are constructed as follows. If the number m occurs in line n, then we write under it in line \\(\\mathrm{n + 1}\\) , each time it occurs, the number of times that m occurs in line n. Show that lines 11 and 12 are identical. Show that we can choose numbers in line 1, so that lines 10 and 11 are not identical.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 2", "solution_match": ""}} {"year": "1976", "tier": "T1", "problem_label": "3", "problem_type": null, "exam": "AllSovietUnion", "problem": "(1) The circles \\(\\mathrm{C_1}\\) , \\(\\mathrm{C_2}\\) , \\(\\mathrm{C_3}\\) with equal radius all pass through the point X. \\(\\mathrm{C_i}\\) and \\(\\mathrm{C_j}\\) also intersect at the point \\(\\mathrm{Y_{ij}}\\) . Show that angle \\(\\mathrm{XO_1Y_{12} + angle XO_2Y_{23} + angle XO_3Y_{31} = 180 deg}\\) where \\(\\mathrm{O_i}\\) is the center of circle \\(\\mathrm{C_i}\\) .", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 3", "solution_match": ""}} {"year": "1976", "tier": "T1", "problem_label": "4", "problem_type": null, "exam": "AllSovietUnion", "problem": "\\(\\mathrm{a_1}\\) and \\(\\mathrm{a_2}\\) are positive integers less than 1000. Define \\(\\mathrm{a_n = min\\{|a_i - a_j|:0< i< j< n\\}}\\) . Show that \\(\\mathrm{a_{21} = 0}\\) .", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 4", "solution_match": ""}} {"year": "1976", "tier": "T1", "problem_label": "5", "problem_type": null, "exam": "AllSovietUnion", "problem": "Can you label each vertex of a cube with a different three digit binary number so that the numbers at any two adjacent vertices differ in at least two digits?", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 5", "solution_match": ""}} {"year": "1976", "tier": "T1", "problem_label": "6", "problem_type": null, "exam": "AllSovietUnion", "problem": "a, b, c, d are vectors in the plane such that \\(\\mathbf{a} + \\mathbf{b} + \\mathbf{c} + \\mathbf{d} = 0\\) . Show that \\(\\left|\\mathbf{a}\\right| + \\left|\\mathbf{b}\\right| + \\left|\\mathbf{c}\\right| + \\left|\\mathbf{d}\\right|\\geq \\left|\\mathbf{a}\\right|\\) \\(+\\mathbf{d}\\mathbf{i} + \\mathbf{i}\\mathbf{b} + \\mathbf{d}\\mathbf{i} + \\mathbf{i}\\mathbf{c} + \\mathbf{d}\\mathbf{i}\\) .", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 6", "solution_match": ""}} {"year": "1976", "tier": "T1", "problem_label": "7", "problem_type": null, "exam": "AllSovietUnion", "problem": "S is a set of 1976 points which form a regular 1976- gon. T is the set of all points which are the midpoint of at least one pair of points in S. What is the greatest number of points of T which lie on a single circle?", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 7", "solution_match": ""}} {"year": "1976", "tier": "T1", "problem_label": "8", "problem_type": null, "exam": "AllSovietUnion", "problem": "n rectangles are drawn on a rectangular sheet of paper. Each rectangle has its sides parallel to the sides of the paper. No pair of rectangles has an interior point in common. If the rectangles were removed show that the rest of the sheet would be in at most \\(\\mathrm{n + 1}\\) parts.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 8", "solution_match": ""}} {"year": "1976", "tier": "T1", "problem_label": "9", "problem_type": null, "exam": "AllSovietUnion", "problem": "There are three straight roads. On each road a man is walking at constant speed. At time \\(t = 0\\) , the three men are not collinear. Prove that they will be collinear for \\(t > 0\\) at most twice.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 9", "solution_match": ""}} {"year": "1976", "tier": "T1", "problem_label": "10", "problem_type": null, "exam": "AllSovietUnion", "problem": "Initially, there is one beetle on each square in the set S. Suddenly each beetle flies to a new square, subject to the following conditions: (1) the new square may be the same as the old or different; (2) more than one beetle may choose the same new square; (3) if two beetles are initially in squares with a common vertex, then after the flight they are either in the same square or in squares with a common vertex. Suppose S is the set of all squares in the middle row and column of a \\(99 \\times 99\\) chess board, is it true that there must always be a beetle whose new square shares a vertex with its old square (or is identical with it)? What if S also includes all the border squares (so S is rows 1, 50 and 99 and columns 1, 50 and 99)? What if S is all squares of the board?", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 10", "solution_match": ""}} {"year": "1976", "tier": "T1", "problem_label": "11", "problem_type": null, "exam": "AllSovietUnion", "problem": "Call a triangle big if each side is longer than 1. Show that we can draw 100 big triangles inside an equilateral triangle with side length 5 so that all the triangles are disjoint. Show that you can draw 100 big triangles with every vertex inside or on an equilateral triangle with side 3, so that they cover the equilateral triangle, and any two big triangles either (1) are disjoint, or (2) have as intersection a common vertex, or (3) have as intersection a common side.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 11", "solution_match": ""}} {"year": "1976", "tier": "T1", "problem_label": "12", "problem_type": null, "exam": "AllSovietUnion", "problem": "n is a positive integer. A universal sequence of length m is a sequence of m integers each between 1 and n such that one can obtain any permutation of 1, 2, ..., n by deleting suitable members of the sequence. For example, 1, 2, 3, 1, 2, 1, 3 is a universal sequence of length 7 for \\(n = 3\\) . But 1, 2, 3, 2, 1, 3, 1 is not universal, because one cannot obtain the permutation 3, 1, 2. Show that one can always obtain a universal sequence for n of length \\(n^2 - n + 1\\) . Show that a universal sequence for n must have length at least \\(n(n + 1) / 2\\) . Show that the shortest sequence for \\(n = 4\\) has 12 members. [You are told, but do not have to prove, that there is a universal sequence for n of length \\(n^2 - 2n + 4\\) .]", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 12", "solution_match": ""}} {"year": "1976", "tier": "T1", "problem_label": "13", "problem_type": null, "exam": "AllSovietUnion", "problem": "n real numbers are written around a circle. One of the numbers is 1 and the sum of the numbers is 0. Show that there are two adjacent numbers whose difference is at least \\(n / 4\\) . Show that there is a number which differs from the arithmetic mean of its two neighbours by at least \\(8 / n^2\\) . Improve this result to some \\(k / n^2\\) with \\(k > 8\\) . Show that for \\(n = 30\\) , we can take \\(k = 1800 / 113\\) . Give an example of 30 numbers such that no number differs from the arithmetic mean of its two neighbours by more than \\(2 / 113\\) .", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 13", "solution_match": ""}} {"year": "1976", "tier": "T1", "problem_label": "14", "problem_type": null, "exam": "AllSovietUnion", "problem": "You are given a regular n- gon. Each vertex is marked \\(+1\\) or - 1. A move consists of changing the sign of all the vertices which form a regular k- gon for some \\(1 < k \\ll = n\\) . [A regular 2- gon means two vertices which have the center of the n- gon as their midpoint.]. For example, if we label the vertices of a regular 6- gon 1, 2, 3, 4, 5, 6, then you can change the sign of {1, 4}, {2, 5}, {3, 6}, {1, 3, 5}, {2, 4, 6} or {1, 2, 3, 4, 5, 6}. Show that for (1) \\(n = 15\\) , (2) \\(n = 30\\) , (3) any \\(n > 2\\) , we can find some initial marking which cannot be changed to all \\(+1\\) by any series of\n\n\n\nmoves. Let f(n) be the largest number of markings, so that no one can be obtained from any other by any series of moves. Show that \\(\\mathrm{f}(200) = 2^{80}\\) .", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 14", "solution_match": ""}} {"year": "1976", "tier": "T1", "problem_label": "15", "problem_type": null, "exam": "AllSovietUnion", "problem": "S is a sphere with unit radius. P is a plane through the center. For any point x on the sphere \\(\\mathrm{f}(\\mathbf{x})\\) is the perpendicular distance from \\(\\mathbf{x}\\) to P. Show that if \\(\\mathbf{x}\\) , \\(\\mathbf{y}\\) , \\(\\mathbf{z}\\) are the ends of three mutually perpendicular radii, then \\(\\mathrm{f}(\\mathbf{x})^2 + \\mathrm{f}(\\mathbf{y})^2 + \\mathrm{f}(\\mathbf{z})^2 = 1\\) (\\\\*). Now let \\(\\mathrm{g}(\\mathbf{x})\\) be any function on the points of S taking non- negative real values and satisfying (\\\\*). Regard the intersection of P and S as the equator, the poles as the points with \\(\\mathrm{f}(\\mathbf{x}) = 1\\) and lines of longitude as semicircles through both poles. (1) If \\(\\mathbf{x}\\) and \\(\\mathbf{y}\\) have the same longitude and both lie on the same side of the equator with \\(\\mathbf{x}\\) closer to the pole, show that \\(\\mathrm{g}(\\mathbf{x}) > \\mathrm{g}(\\mathbf{y})\\) . (2) Show that for any \\(\\mathbf{x}\\) , \\(\\mathbf{y}\\) on the same side of the equator with \\(\\mathbf{x}\\) closer to the pole than \\(\\mathbf{y}\\) we have \\(\\mathrm{g}(\\mathbf{x}) > \\mathrm{g}(\\mathbf{y})\\) . (3) Show that if \\(\\mathbf{x}\\) and \\(\\mathbf{y}\\) are the same distance from the pole then \\(\\mathrm{g}(\\mathbf{x}) = \\mathrm{g}(\\mathbf{y})\\) . (4) Show that \\(\\mathrm{g}(\\mathbf{x}) = \\mathrm{f}(\\mathbf{x})\\) for all \\(\\mathbf{x}\\) .", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 15", "solution_match": ""}} {"year": "1977", "tier": "T1", "problem_label": "1", "problem_type": null, "exam": "AllSovietUnion", "problem": "P is a polygon. Its sides do not intersect except at its vertices, and no three vertices lie on a line. The pair of sides AB, PQ is called special if (1) AB and PQ do not share a vertex and (2) either the line AB intersects the segment PQ or the line PQ intersects the segment AB. Show that the number of special pairs is even.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 1", "solution_match": ""}} {"year": "1977", "tier": "T1", "problem_label": "2", "problem_type": null, "exam": "AllSovietUnion", "problem": "n points lie in the plane, not all on a single line. A real number is assigned to each point. The sum of the numbers is zero for all the points lying on any line. Show that all the assigned numbers must be zero.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 2", "solution_match": ""}} {"year": "1977", "tier": "T1", "problem_label": "3", "problem_type": null, "exam": "AllSovietUnion", "problem": "(1) The triangle ABC is inscribed in a circle. D is the midpoint of the arc BC (not containing A), similarly E and F. Show that the hexagon formed by the intersection of ABC and DEF has its main diagonals parallel to the sides of ABC and intersecting in a single point. \n\n(2) EF meets AB at X and AC at Y. Prove that AXIY is a rhombus, where I is the center of the circle inscribed in ABC.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 3", "solution_match": ""}} {"year": "1977", "tier": "T1", "problem_label": "4", "problem_type": null, "exam": "AllSovietUnion", "problem": "Black and white tokens are placed around a circle. First all the black tokens with one or two white neighbors are removed. Then all white tokens with one or two black neighbors are removed. Then all black tokens with one or two white neighbors and so on until all the tokens have the same color. Is it possible to arrange 40 tokens so that only one remains after 4 moves? What is the minimum possible number of moves to go from 1000 tokens to one?", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 4", "solution_match": ""}} {"year": "1977", "tier": "T1", "problem_label": "5", "problem_type": null, "exam": "AllSovietUnion", "problem": "\\(\\mathbf{a}_{\\mathrm{n}}\\) is an infinite sequence such that \\((\\mathbf{a}_{\\mathrm{n} + 1} - \\mathbf{a}_{\\mathrm{n}}) / 2\\) tends to zero. Show that \\(\\mathbf{a}_{\\mathrm{n}}\\) tends to zero.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 5", "solution_match": ""}} {"year": "1977", "tier": "T1", "problem_label": "6", "problem_type": null, "exam": "AllSovietUnion", "problem": "There are direct routes between every two cities in a country. The fare between each pair of cities is the same in both directions. Two travellers decide to visit all the cities. The first traveller starts at a city and travels to the city with the most expensive fare (or if there are several such, any one of them). He then repeats this process, never visiting a city twice, until he has been to all the cities (so he ends up in a different city from the one he starts from). The second traveller has a similar plan, except that he always chooses the cheapest fare, and does not necessarily start at the same city. Show that the first traveller spends at least as much on fares as the second.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 6", "solution_match": ""}} {"year": "1977", "tier": "T1", "problem_label": "7", "problem_type": null, "exam": "AllSovietUnion", "problem": "Each vertex of a convex polyhedron has three edges. Each face is a cyclic polygon. Show that its vertices all lie on a sphere.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 7", "solution_match": ""}} {"year": "1977", "tier": "T1", "problem_label": "8", "problem_type": null, "exam": "AllSovietUnion", "problem": "Given a polynomial \\(\\mathrm{x}_{10} + \\mathrm{a}_{9}\\mathrm{x}^{9} + \\ldots +\\mathrm{a}_{1}\\mathrm{x} + 1\\) . Two players alternately choose one of the coefficients \\(\\mathrm{a}_{1}\\) to \\(\\mathrm{a}_{9}\\) (which has not been chosen before) and assign a real value to it. The first player wins iff the resulting polynomial has no real roots. Who wins?", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 8", "solution_match": ""}} {"year": "1977", "tier": "T1", "problem_label": "9", "problem_type": null, "exam": "AllSovietUnion", "problem": "Seven elves sit at a table. Each elf has a cup. In total the cups contain 3 liters of milk. Each elf in turn gives all his milk to the others in equal shares. At the end of the process each elf has the same amount of milk as at the start. What was that?", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 9", "solution_match": ""}} {"year": "1977", "tier": "T1", "problem_label": "10", "problem_type": null, "exam": "AllSovietUnion", "problem": "We call a number doubly square if (1) it is a square with an even number 2n of (decimal) digits, (2) its first n digits form a square, (3) its last n digits form a non- zero square. For example, 1681 is doubly square, but 2500 is not. (1) find all 2- digit and 4- digit doubly square numbers. (2) Is there a 6- digit doubly square number? (3) Show that there is a 20- digit doubly square number. (4) Show that there are at least ten 100- digit doubly square numbers. (5) Show that there is a 30- digit doubly square number.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 10", "solution_match": ""}} {"year": "1977", "tier": "T1", "problem_label": "11", "problem_type": null, "exam": "AllSovietUnion", "problem": "Given a sequence \\(\\mathrm{a}_{1}\\) , \\(\\mathrm{a}_{2}\\) , ..., \\(\\mathrm{a}_{\\mathrm{n}}\\) of positive integers. Let S be the set of all sums of one or more members of the sequence. Show that S can be divided into n subsets such that the smallest member of each subset is at least half the largest member.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 11", "solution_match": ""}} {"year": "1977", "tier": "T1", "problem_label": "12", "problem_type": null, "exam": "AllSovietUnion", "problem": "You have 1000 tickets numbered 000, 001, ..., 999 and 100 boxes numbered 00, 01, ..., 99. You may put each ticket into any box whose number can be obtained from the ticket number by deleting one digit. Show that you can put every ticket into 50 boxes, but not into less than 50. Show that if you have 10000 4- digit tickets and you are allowed to delete two digits, then you can put every ticket into 34 boxes. For \\(\\mathrm{n} + 2\\) digit tickets, where you delete n digits, what is the minimum number of boxes required?", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 12", "solution_match": ""}} {"year": "1977", "tier": "T1", "problem_label": "13", "problem_type": null, "exam": "AllSovietUnion", "problem": "Given a \\(100\\mathrm{x}100\\) square divided into unit squares. Several paths are drawn. Each path is drawn along the sides of the unit squares. Each path has its endpoints on the sides of the big square, but does not contain any other points which are vertices of unit squares and lie on the big square sides. No path intersects itself or any other path. Show that there is a vertex apart from the four corners of the big square that is not on any path.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 13", "solution_match": ""}} {"year": "1977", "tier": "T1", "problem_label": "14", "problem_type": null, "exam": "AllSovietUnion", "problem": "The positive integers \\(\\mathbf{a}_1\\) , \\(\\mathbf{a}_2\\) , ..., \\(\\mathbf{a}_{\\mathrm{m}}\\) , \\(\\mathbf{b}_1\\) , \\(\\mathbf{b}_2\\) , ..., \\(\\mathbf{b}_{\\mathrm{n}}\\) satisfy: \\((\\mathbf{a}_1 + \\mathbf{a}_2 + \\ldots + \\mathbf{a}_{\\mathrm{m}}) = (\\mathbf{b}_1 + \\mathbf{b}_2 + \\ldots + \\mathbf{b}_{\\mathrm{n}}) < \\mathrm{mn}\\) . Show that we can delete some (but not all) of the numbers so that the sum of the remaining a's equals to the sum of the remaining b's.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 14", "solution_match": ""}} {"year": "1977", "tier": "T1", "problem_label": "15", "problem_type": null, "exam": "AllSovietUnion", "problem": "Given 1000 square plates in the plane with their sides parallel to the coordinate axes (but possibly overlapping and possibly of different sizes). Let S be the set of points covered by the plates. Show that you can choose a subset T of plates such that every point of S is covered by at least one and at most four plates in T.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 15", "solution_match": ""}} {"year": "1977", "tier": "T1", "problem_label": "16", "problem_type": null, "exam": "AllSovietUnion", "problem": "You are given a set of scales and a set of n different weights. R represents the state in which the right pan is heavier, L represents the state in which the left pan is heavier and B represents the state in which the pans balance. Show that given any n- letter string of Rs and Ls you can put the weights onto the scales one at a time so that the string represents the successive states of the scales. For example, if the weights were 1, 2 and 3 and the string was LRL, then you would place 1 in the left pan, then 2 in the right pan, then 3 in the left pan.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 16", "solution_match": ""}} {"year": "1977", "tier": "T1", "problem_label": "17", "problem_type": null, "exam": "AllSovietUnion", "problem": "A polynomial is monic if its leading coefficient is 1. Two polynomials \\(\\mathrm{p(x)}\\) and \\(\\mathrm{q(x)}\\) commute if \\(\\mathrm{p(q(x)) = q(p(x))}\\) . \n\n(1) Find all monic polynomials of degree 3 or less which commute with \\(\\mathrm{x}^2 - \\mathrm{k}\\) . \n\n(2) Given a monic polynomial \\(\\mathrm{p(x)}\\) , show that there is at most one monic polynomial of degree n which commutes with \\(\\mathrm{p(x)^2}\\) . \n\n(3) Find the polynomials described in (2) for \\(\\mathrm{n} = 4\\) and \\(\\mathrm{n} = 8\\) . \n\n(4) If \\(\\mathrm{q(x)}\\) and \\(\\mathrm{r(x)}\\) are monic polynomials which both commute with \\(\\mathrm{p(x)^2}\\) , show that \\(\\mathrm{q(x)}\\) and \\(\\mathrm{r(x)}\\) commute. \n\n(5) Show that there is a sequence of polynomials \\(\\mathrm{p}_2(\\mathrm{x}), \\mathrm{p}_3(\\mathrm{x}), \\ldots\\) such that \\(\\mathrm{p}_2(\\mathrm{x}) = \\mathrm{x}^2 - 2\\) , \\(\\mathrm{p}_n(\\mathrm{x})\\) has degree n and all polynomials in the sequence commute.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 17", "solution_match": ""}} {"year": "1978", "tier": "T1", "problem_label": "1", "problem_type": null, "exam": "AllSovietUnion", "problem": "\\(\\mathbf{a}_{\\mathrm{n}}\\) is the nearest integer to \\(\\sqrt{\\mathrm{n}}\\) . Find \\(1 / \\mathrm{a}_{1} + 1 / \\mathrm{a}_{2} + \\ldots +1 / \\mathrm{a}_{1980}\\) .", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 1", "solution_match": ""}} {"year": "1978", "tier": "T1", "problem_label": "2", "problem_type": null, "exam": "AllSovietUnion", "problem": "ABCD is a quadrilateral. M is a point inside it such that ABMD is a parallelogram. \\(\\angle \\mathrm{CBM} =\\) \\(\\angle \\mathrm{CDM}\\) . Show that \\(\\angle \\mathrm{ACD} = \\angle \\mathrm{BCM}\\) .", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 2", "solution_match": ""}} {"year": "1978", "tier": "T1", "problem_label": "3", "problem_type": null, "exam": "AllSovietUnion", "problem": "Show that there is no positive integer n for which \\(1000^{\\mathrm{n}} - 1\\) divides \\(1978^{\\mathrm{n}} - 1\\) .", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 3", "solution_match": ""}} {"year": "1978", "tier": "T1", "problem_label": "4", "problem_type": null, "exam": "AllSovietUnion", "problem": "If P, Q are points in space the point [PQ] is the point on the line PQ on the opposite side of Q to P and the same distance from Q. \\(\\mathrm{K}_{0}\\) is a set of points in space. Given \\(\\mathrm{K}_{\\mathrm{n}}\\) we derive \\(\\mathrm{K}_{\\mathrm{n} + 1}\\) by adjoining all the points [PQ] with P and Q in \\(\\mathrm{K}_{\\mathrm{n}}\\) . \n\n(1) \\(\\mathrm{K}_{0}\\) contains just two points A and B, a distance 1 apart, what is the smallest n for which \\(\\mathrm{K}_{\\mathrm{n}}\\) contains a point whose distance from A is at least 1000? \n\n(2) \\(\\mathrm{K}_{0}\\) consists of three points, each pair a distance 1 apart, find the area of the smallest convex polygon containing \\(\\mathrm{K}_{\\mathrm{n}}\\) . \n\n(3) \\(\\mathrm{K}_{0}\\) consists of four points, forming a regular tetrahedron with volume 1. Let \\(\\mathrm{H}_{\\mathrm{n}}\\) be the smallest convex polyhedron containing \\(\\mathrm{K}_{\\mathrm{n}}\\) . How many faces does \\(\\mathrm{H}_{1}\\) have? What is the volume of \\(\\mathrm{H}_{\\mathrm{n}}\\) ?", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 4", "solution_match": ""}} {"year": "1978", "tier": "T1", "problem_label": "5", "problem_type": null, "exam": "AllSovietUnion", "problem": "Two players play a game. There is a heap of m tokens and a heap of \\(\\mathrm{n}< \\mathrm{m}\\) tokens. Each player in turn takes one or more tokens from the heap which is larger. The number he takes must be a multiple of the number in the smaller heap. For example, if the heaps are 15 and 4, the first player may take 4, 8 or 12 from the larger heap. The first player to clear a heap wins. Show that if \\(\\mathrm{m} > 2\\mathrm{n}\\) , then the first player can always win. Find all k such that if \\(\\mathrm{m} > \\mathrm{k}\\mathrm{n}\\) , then the first player can always win.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 5", "solution_match": ""}} {"year": "1978", "tier": "T1", "problem_label": "6", "problem_type": null, "exam": "AllSovietUnion", "problem": "Show that there is an infinite sequence of reals \\(\\mathrm{x}_{1}\\) , \\(\\mathrm{x}_{2}\\) , \\(\\mathrm{x}_{3}\\) , ... such that \\(\\mathrm{l}\\mathrm{x}_{\\mathrm{n}}\\mathrm{l}\\) is bounded and for any \\(\\mathrm{m} > \\mathrm{n}\\) , we have \\(\\mathrm{l}\\mathrm{x}_{\\mathrm{m}} - \\mathrm{x}_{\\mathrm{n}}\\mathrm{l} > 1 / (\\mathrm{m} - \\mathrm{n})\\) .", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 6", "solution_match": ""}} {"year": "1978", "tier": "T1", "problem_label": "7", "problem_type": null, "exam": "AllSovietUnion", "problem": "Let \\(\\mathrm{p}(\\mathrm{x}) = \\mathrm{x}^{2} + \\mathrm{x} + 1\\) . Show that for every positive integer n, the numbers n, \\(\\mathrm{p}(\\mathrm{n})\\) , \\(\\mathrm{p}(\\mathrm{p}(\\mathrm{n}))\\) , \\(\\mathrm{p}(\\mathrm{p}(\\mathrm{p}(\\mathrm{n})))\\) , ... are relatively prime.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 7", "solution_match": ""}} {"year": "1978", "tier": "T1", "problem_label": "8", "problem_type": null, "exam": "AllSovietUnion", "problem": "Show that for some k, you can find 1978 different sizes of square with all its vertices on the graph of the function \\(\\mathrm{y} = \\mathrm{k}\\sin \\mathrm{x}\\) .", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 8", "solution_match": ""}} {"year": "1978", "tier": "T1", "problem_label": "9", "problem_type": null, "exam": "AllSovietUnion", "problem": "The set \\(\\mathrm{S_0}\\) has the single member (5, 19). We derive the set \\(\\mathrm{S_{n + 1}}\\) from \\(\\mathrm{S_n}\\) by adjoining a pair to \\(\\mathrm{S_n}\\) . If \\(\\mathrm{S_n}\\) contains the pair (2a, 2b), then we may adjoin the pair (a, b). If \\(\\mathrm{S}\\) contains the pair (a, b) we may adjoin (a+1, b+1). If \\(\\mathrm{S}\\) contains (a, b) and (b, c), then we may adjoin (a, c). Can we obtain (1, 50)? (1, 100)? If We start with (a, b), with a < b, instead of (5, 19), for which n can we obtain (1, n)?", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 9", "solution_match": ""}} {"year": "1978", "tier": "T1", "problem_label": "10", "problem_type": null, "exam": "AllSovietUnion", "problem": "An n- gon area A is inscribed in a circle radius R. We take a point on each side of the polygon to form another n- gon. Show that it has perimeter at least 2A/R.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 10", "solution_match": ""}} {"year": "1978", "tier": "T1", "problem_label": "11", "problem_type": null, "exam": "AllSovietUnion", "problem": "Two players play a game by moving a piece on an n x n chessboard. The piece is initially in a corner square. Each player may move the piece to any adjacent square (which shares a side with its current square), except that the piece may never occupy the same square twice. The first player who is unable to move loses. Show that for even n the first player can always win, and for odd n the second player can always win. Who wins if the piece is initially on a square adjacent to the corner?", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 11", "solution_match": ""}} {"year": "1978", "tier": "T1", "problem_label": "12", "problem_type": null, "exam": "AllSovietUnion", "problem": "Given a set of n non- intersecting segments in the plane. No two segments lie on the same line. Can we successively add n- 1 additional segments so that we end up with a single non- intersecting path? Each segment we add must have as its endpoints two existing segment endpoints.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 12", "solution_match": ""}} {"year": "1978", "tier": "T1", "problem_label": "13", "problem_type": null, "exam": "AllSovietUnion", "problem": "a and b are positive real numbers. \\(\\mathbf{x}_i\\) are real numbers lying between a and b. Show that \\((\\mathbf{x}_1 + \\mathbf{x}_2 + \\ldots + \\mathbf{x}_n)(1 / \\mathbf{x}_1 + 1 / \\mathbf{x}_2 + \\ldots + 1 / \\mathbf{x}_n)\\leq \\mathrm{n}^2 (\\mathrm{a} + \\mathrm{b})^2 /4\\mathrm{ab}\\) .", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 13", "solution_match": ""}} {"year": "1978", "tier": "T1", "problem_label": "14", "problem_type": null, "exam": "AllSovietUnion", "problem": "\\(\\mathrm{n} > 3\\) is an integer. Let S be the set of lattice points (a, b) with \\(0\\leq \\mathrm{a},\\mathrm{b}< \\mathrm{n}\\) . Show that we can choose n points of S so that no three chosen points are collinear and no four chosen points from a parallelogram.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 14", "solution_match": ""}} {"year": "1978", "tier": "T1", "problem_label": "15", "problem_type": null, "exam": "AllSovietUnion", "problem": "Given any tetrahedron, show that we can find two planes such that the areas of the projections of the tetrahedron onto the two planes have ratio at least \\(\\sqrt{2}\\) .", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 15", "solution_match": ""}} {"year": "1978", "tier": "T1", "problem_label": "16", "problem_type": null, "exam": "AllSovietUnion", "problem": "\\(\\mathbf{a}_{1}, \\mathbf{a}_{2}, \\ldots , \\mathbf{a}_{\\mathrm{n}}\\) are real numbers. Let \\(\\mathbf{b}_{\\mathrm{k}} = (\\mathbf{a}_{1} + \\mathbf{a}_{2} + \\ldots +\\mathbf{a}_{\\mathrm{k}}) / \\mathbf{k}\\) for \\(\\mathbf{k} = 1, 2, \\ldots , \\mathbf{n}\\) . Let \\(\\mathbf{C} = (\\mathbf{a}_{1} - \\mathbf{b}_{1})^{2} + (\\mathbf{a}_{2} - \\mathbf{b}_{2})^{2} + \\ldots +(\\mathbf{a}_{\\mathrm{n}} - \\mathbf{b}_{\\mathrm{n}})^{2}\\) , and \\(\\mathbf{D} = (\\mathbf{a}_{1} - \\mathbf{b}_{\\mathrm{n}})^{2} + (\\mathbf{a}_{2} - \\mathbf{b}_{\\mathrm{n}})^{2} + \\ldots +(\\mathbf{a}_{\\mathrm{n}} - \\mathbf{b}_{\\mathrm{n}})^{2}\\) . Show that \\(\\mathbf{C} \\leq \\mathbf{D} \\leq 2\\mathbf{C}\\) .", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 16", "solution_match": ""}} {"year": "1978", "tier": "T1", "problem_label": "17", "problem_type": null, "exam": "AllSovietUnion", "problem": "Let \\(\\mathbf{x}_{\\mathrm{n}} = (1 + \\sqrt{2} + \\sqrt{3})^{\\mathrm{n}}\\) . We may write \\(\\mathbf{x}_{\\mathrm{n}} = \\mathbf{a}_{\\mathrm{n}} + \\mathbf{b}_{\\mathrm{n}}\\sqrt{2} + \\mathbf{c}_{\\mathrm{n}}\\sqrt{3} + \\mathbf{d}_{\\mathrm{n}}\\sqrt{6}\\) , where \\(\\mathbf{a}_{\\mathrm{n}}, \\mathbf{b}_{\\mathrm{n}}, \\mathbf{c}_{\\mathrm{n}}, \\mathbf{d}_{\\mathrm{n}}\\) are integers. Find the limit as \\(\\mathbf{n}\\) tends to infinity of \\(\\mathbf{b}_{\\mathrm{n}} / \\mathbf{a}_{\\mathrm{n}}, \\mathbf{c}_{\\mathrm{n}} / \\mathbf{a}_{\\mathrm{n}}, \\mathbf{d}_{\\mathrm{n}} / \\mathbf{a}_{\\mathrm{n}}\\) .", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 17", "solution_match": ""}} {"year": "1979", "tier": "T1", "problem_label": "1", "problem_type": null, "exam": "AllSovietUnion", "problem": "T is an isosceles triangle. Another isosceles triangle T' has one vertex on each side of T. What is the smallest possible value of area T'area T?", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 1", "solution_match": ""}} {"year": "1979", "tier": "T1", "problem_label": "2", "problem_type": null, "exam": "AllSovietUnion", "problem": "A grasshopper hops about in the first quadrant \\((\\mathrm{x},\\mathrm{y}\\geqslant = 0)\\) . From \\((\\mathrm{x},\\mathrm{y})\\) it can hop to \\((\\mathrm{x} + 1,\\mathrm{y} - 1)\\) or to \\((\\mathrm{x} - 5,\\mathrm{y} + 7)\\) , but it can never leave the first quadrant. Find the set of points \\((\\mathrm{x},\\mathrm{y})\\) from which it can never get further than a distance 1000 from the origin.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 2", "solution_match": ""}} {"year": "1979", "tier": "T1", "problem_label": "3", "problem_type": null, "exam": "AllSovietUnion", "problem": "In a group of people every person has less than 4 enemies. Assume that A is B's enemy iff B is A's enemy. Show that we can divide the group into two parts, so that each person has at most one enemy in his part.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 3", "solution_match": ""}} {"year": "1979", "tier": "T1", "problem_label": "4", "problem_type": null, "exam": "AllSovietUnion", "problem": "Let S be the set {0, 1}. Given any subset of S we may add its arithmetic mean to S (provided it is not already included - S never includes duplicates). Show that by repeating this process we can include the number 1/5 in S. Show that we can eventually include any rational number between 0 and 1.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 4", "solution_match": ""}} {"year": "1979", "tier": "T1", "problem_label": "5", "problem_type": null, "exam": "AllSovietUnion", "problem": "The real sequence \\(\\mathrm{x}_1\\geq \\mathrm{x}_2\\geq \\mathrm{x}_3\\geq \\ldots\\) satisfies \\(\\mathrm{x}_1 + \\mathrm{x}_4 / 2 + \\mathrm{x}_9 / 3 + \\mathrm{x}_{16} / 4 + \\ldots +\\mathrm{x}_\\mathrm{N} / \\mathrm{n}\\leq 1\\) for every square \\(\\mathrm{N} = \\mathrm{n}^2\\) . Show that it also satisfies \\(\\mathrm{x}_1 + \\mathrm{x}_2 / 2 + \\mathrm{x}_3 / 3 + \\ldots +\\mathrm{x}_\\mathrm{n} / \\mathrm{n}\\leq 3\\) .", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 5", "solution_match": ""}} {"year": "1979", "tier": "T1", "problem_label": "6", "problem_type": null, "exam": "AllSovietUnion", "problem": "Given a finite set X of points in the plane. S is a set of vectors AB where (A, B) are some pairs of points in X. For every point A the number of vectors AB (starting at A) in S equals the number of vectors CA (ending at A) in S. Show that the sum of the vectors in S is zero.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 6", "solution_match": ""}} {"year": "1979", "tier": "T1", "problem_label": "7", "problem_type": null, "exam": "AllSovietUnion", "problem": "What is the smallest number of pieces that can be placed on an \\(8\\mathrm{x}8\\) chessboard so that every row, column and diagonal has at least one piece? [A diagonal is any line of squares parallel to one of the two main diagonals, so there are 30 diagonals in all.] What is the smallest number for an n x n board?", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 7", "solution_match": ""}} {"year": "1979", "tier": "T1", "problem_label": "8", "problem_type": null, "exam": "AllSovietUnion", "problem": "a and b are real numbers. Find real x and y satisfying: \\((\\mathrm{x} - \\mathrm{y}(\\mathrm{x}^2 - \\mathrm{y}^2)^{1 / 2} = \\mathrm{a}(1 - \\mathrm{x}^2 + \\mathrm{y}^2)^{1 / 2}\\) and \\((\\mathrm{y} - \\mathrm{x}(\\mathrm{x}^2 - \\mathrm{y}^2)^{1 / 2} = \\mathrm{b}(1 - \\mathrm{x}^2 + \\mathrm{y}^2)^{1 / 2}\\) .", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 8", "solution_match": ""}} {"year": "1979", "tier": "T1", "problem_label": "9", "problem_type": null, "exam": "AllSovietUnion", "problem": "A set of square carpets have total area 4. Show that they can cover a unit square.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 9", "solution_match": ""}} {"year": "1979", "tier": "T1", "problem_label": "10", "problem_type": null, "exam": "AllSovietUnion", "problem": "\\(\\mathbf{x}_{\\mathrm{i}}\\) are real numbers between 0 and 1. Show that \\(\\left(\\mathbf{x}_{1} + \\mathbf{x}_{2} + \\ldots +\\mathbf{x}_{\\mathrm{n}} + 1\\right)^{2}\\geq 4(\\mathbf{x}_{1}^{2} + \\mathbf{x}_{2}^{2} + \\ldots +\\mathbf{x}_{\\mathrm{n}}^{2})\\) .", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 10", "solution_match": ""}} {"year": "1979", "tier": "T1", "problem_label": "11", "problem_type": null, "exam": "AllSovietUnion", "problem": "m and n are relatively prime positive integers. The interval [0, 1] is divided into m + n equal subintervals. Show that each part except those at each end contains just one of the numbers 1/m, 2/m, 3/m, ..., (m- 1)/m, 1/n, 2/n, ..., (n- 1)/n.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 11", "solution_match": ""}} {"year": "1979", "tier": "T1", "problem_label": "12", "problem_type": null, "exam": "AllSovietUnion", "problem": "Given a point P in space and 1979 lines \\(\\mathbf{L}_{1}\\) , \\(\\mathbf{L}_{2}\\) , ..., \\(\\mathbf{L}_{1979}\\) containing it. No two lines are perpendicular. \\(\\mathbf{P}_{1}\\) is a point on \\(\\mathbf{L}_{1}\\) . Show that we can find a point \\(\\mathbf{A}_{\\mathrm{n}}\\) on \\(\\mathbf{L}_{\\mathrm{n}}\\) (for \\(\\mathrm{n} = 2\\) , 3, ..., 1979) such that the following 1979 pairs of lines are all perpendicular: \\(\\mathbf{A}_{\\mathrm{n - 1}}\\mathbf{A}_{\\mathrm{n + 1}}\\) and \\(\\mathbf{L}_{\\mathrm{n}}\\) for \\(\\mathrm{n} = 1\\) , ..., 1979. [We regard \\(\\mathbf{A}_{\\mathrm{- 1}}\\) as \\(\\mathbf{A}_{1979}\\) and \\(\\mathbf{A}_{1980}\\) as \\(\\mathbf{A}_{1}\\) .]", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 12", "solution_match": ""}} {"year": "1979", "tier": "T1", "problem_label": "13", "problem_type": null, "exam": "AllSovietUnion", "problem": "Find a sequence \\(\\mathbf{a}_{1}\\) , \\(\\mathbf{a}_{2}\\) , ..., \\(\\mathbf{a}_{25}\\) of 0s and 1s such that the following sums are all odd: \n\n\\(\\begin{array}{r l} & {\\mathrm{a}_{1}\\mathrm{a}_{1} + \\mathrm{a}_{2}\\mathrm{a}_{2} + \\ldots +\\mathrm{a}_{25}\\mathrm{a}_{25}}\\\\ & {\\mathrm{a}_{1}\\mathrm{a}_{2} + \\mathrm{a}_{2}\\mathrm{a}_{3} + \\ldots +\\mathrm{a}_{24}\\mathrm{a}_{25}}\\\\ & {\\mathrm{a}_{1}\\mathrm{a}_{3} + \\mathrm{a}_{2}\\mathrm{a}_{4} + \\ldots +\\mathrm{a}_{23}\\mathrm{a}_{25}}\\\\ & {\\ldots}\\\\ & {\\mathrm{a}_{1}\\mathrm{a}_{24} + \\mathrm{a}_{2}\\mathrm{a}_{25}} \\end{array}\\) \n\nShow that we can find a similar sequence of n terms for some \\(\\mathrm{n} > 1000\\) .", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 13", "solution_match": ""}} {"year": "1979", "tier": "T1", "problem_label": "14", "problem_type": null, "exam": "AllSovietUnion", "problem": "A convex quadrilateral is divided by its diagonals into four triangles. The incircles of each of the four are equal. Show that the quadrilateral has all its sides equal.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 14", "solution_match": ""}} {"year": "1980", "tier": "T1", "problem_label": "1", "problem_type": null, "exam": "AllSovietUnion", "problem": "All two digit numbers from 19 to 80 inclusive are written down one after the other as a single number \\(\\mathrm{N} = 192021\\ldots 7980\\) . Is N divisible by 1980? \n\n## Answer \n\nYes", "solution": "\\(1980 = 2^{2}3^{2}5\\) . 11. N is obviously divisible by \\(2^{2}\\) and 5. The digits in odd position are \\(9+\\) \\((0 + 1 + 2 + \\ldots +9) + (0 + 1 + 2 + \\ldots +9) + \\ldots +(0 + 1 + 2 + \\ldots +9) + 0 = 9 + 6\\cdot 45 = 279\\) . The digits in even position are \\(1 + (2 + 2 + \\ldots +2) + (3 + 3 + \\ldots +3) + \\ldots +(7 + \\ldots +7) + 8 = 9 + 10(2 + 3 + \\ldots +7) = 279\\) . So the sum of the digits of N is 2. 279 which is divisible by 9. Hence N is divisible by 9. The difference between the odd and even sums is 0, which is divisible by 11, so N is divisible by 11.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 1", "solution_match": "# Solution"}} {"year": "1980", "tier": "T1", "problem_label": "2", "problem_type": null, "exam": "AllSovietUnion", "problem": "A square is divided into n parallel strips (parallel to the bottom side of the square). The width of each strip is integral. The total width of the strips with odd width equals the total width of the strips with even width. A diagonal of the square is drawn which divides each strip into a left part and a right part. Show that the sum of the areas of the left parts of the odd strips equals the sum of the areas of the right parts of the even strips.", "solution": "Let LO be the total area of the left parts of the odd strips, LE the total area of the left parts of the even strips, and RE the total area of the right parts of the even trips. Since the diagonal bisects the square, \\(\\mathrm{LO} + \\mathrm{LE} = \\mathrm{A} / 2\\) , where A is the area of the square. Also \\(\\mathrm{RE} + \\mathrm{LE} = \\mathrm{A} / 2\\) (because the total width of the even strips equals the total width of the odd strips). Subtracting, \\(\\mathrm{LO} = \\mathrm{RE}\\) , as required.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 2", "solution_match": "# Solution"}} {"year": "1980", "tier": "T1", "problem_label": "3", "problem_type": null, "exam": "AllSovietUnion", "problem": "35 containers of total weight 18 must be taken to a space station. One flight can take any collection of containers weighing 3 or less. It is possible to take any subset of 34 containers in 7 flights. Show that it must be possible to take all 35 containers in 7 flights.", "solution": "Let the lightest container be S weighing s. The other containers can be taken in 7 flights. The smallest load on these flights must be \\(\\leq (18 - \\mathrm{s}) / 7\\) , and so that flight has spare capacity of at least \\(3 - (18 - \\mathrm{s}) / 7 = (3 + \\mathrm{s}) / 7\\) . Thus it can accomodate S provided that \\((3 + \\mathrm{s}) / 7 \\geq \\mathrm{s}\\) , or \\(\\mathrm{s} \\leq 1 / 2\\) . \n\nAt least one of the 7 flights takes \\(\\leq 4\\) containers. These weigh at most the weight of the 4 heaviest. Since the 31 lightest weigh at least 31s, the 4 heaviest weigh at most 18- 31s. Thus\n\n\n\nthis flight has spare capacity of at least \\(3 - (18 - 31s) = 31s - 15\\) and can accomodate S provided that \\(31s - 15 \\geq s\\) , or \\(s \\geq 1 / 2\\) .", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 3", "solution_match": "# Solution"}} {"year": "1980", "tier": "T1", "problem_label": "4", "problem_type": null, "exam": "AllSovietUnion", "problem": "ABCD is a convex quadrilateral. M is the midpoint of BC and N is the midpoint of CD. If \\(k = \\mathrm{AM} + \\mathrm{AN}\\) show that the area of ABCD is less than \\(k^2 /2\\) .", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 4", "solution_match": ""}} {"year": "1980", "tier": "T1", "problem_label": "5", "problem_type": null, "exam": "AllSovietUnion", "problem": "Are there any solutions in positive integers to \\(\\mathrm{a}^4 = \\mathrm{b}^3 + \\mathrm{c}^2\\) ?", "solution": "We have \\(\\mathrm{b}^3 = (\\mathrm{a}^2 - \\mathrm{c})(\\mathrm{a}^2 + \\mathrm{c})\\) , so one possibility is that \\(\\mathrm{a}2 \\pm \\mathrm{c}\\) are both cubes. So we want two cubes whose sum is twice a square. Looking at the small cubes, we soon find \\(8 + 64 = 2\\) . 36 giving \\(6^4 = 28^2 + 8^3\\) . Multiplying through by \\(k^{12}\\) gives an infinite family of solutions. Note that the question does not ask for all solutions.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 5", "solution_match": "# Solution"}} {"year": "1980", "tier": "T1", "problem_label": "6", "problem_type": null, "exam": "AllSovietUnion", "problem": "Given a point P on the diameter AC of the circle K, find the chord BD through P which maximises the area of ABCD.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 6", "solution_match": ""}} {"year": "1980", "tier": "T1", "problem_label": "7", "problem_type": null, "exam": "AllSovietUnion", "problem": "There are several settlements around Big Lake. Some pairs of settlements are directly connected by a regular shipping service. For all \\(\\mathrm{A} \\neq \\mathrm{B}\\) , settlement A is directly connected to X iff B is not directly connected to Y, where B is the next settlement to A counterclockwise and Y is the next settlement to X counterclockwise. Show that you can move between any two settlements with at most 3 trips.", "solution": "Suppose there are n settlements \\(\\mathrm{A}_1, \\mathrm{A}_2, \\ldots , \\mathrm{A}_n\\) in counterclockwise order around the lake. We will use cyclic indices, so that \\(\\mathrm{A}_{n + 1}\\) means \\(\\mathrm{A}_1\\) , and so on. wlog \\(\\mathrm{A}_1\\) has a direct service to \\(\\mathrm{A}_2\\) . Then it follows that \\(\\mathrm{A}_2\\) does not have a direct service to \\(\\mathrm{A}_3\\) , so \\(\\mathrm{A}_3\\) does have a direct service to \\(\\mathrm{A}_4\\) , and so on. So \\(\\mathrm{A}_i\\) has direct service to \\(\\mathrm{A}_{i + 1}\\) iff i is odd. But \\(\\mathrm{A}_1 = \\mathrm{A}_{n + 1}\\) has direct service to \\(\\mathrm{A}_2\\) , so n must be even. \n\nNow suppose we want to get from \\(\\mathrm{A}_i\\) to \\(\\mathrm{A}_j\\) . If there is direct service we are done. So suppose not. Then there must be direct service from \\(\\mathrm{A}_{i + 1}\\) to \\(\\mathrm{A}_{j + 1}\\) . If i and j are both odd, then there is direct service from \\(\\mathrm{A}_i\\) to \\(\\mathrm{A}_{i + 1}\\) and from \\(\\mathrm{A}_j\\) to \\(\\mathrm{A}_{j + 1}\\) , so we can make the journey in 3 trips. If i and j are both even, then we can go \\(\\mathrm{A}_i\\) to \\(\\mathrm{A}_{i - 1}\\) to \\(\\mathrm{A}_{j - 1}\\) to \\(\\mathrm{A}_j\\) . So suppose i and j have opposite parity. wlog i is odd and j is even. If there is direct service from \\(\\mathrm{A}_i\\) to \\(\\mathrm{A}_{j - 1}\\) , then we can make the journey in two trips: \\(\\mathrm{A}_i\\) to \\(\\mathrm{A}_{j - 1}\\) to \\(\\mathrm{A}_j\\) . If not, then we can go \\(\\mathrm{A}_i\\) to \\(\\mathrm{A}_{i + 1}\\) to \\(\\mathrm{A}_j\\) .", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 7", "solution_match": "# Solution"}} {"year": "1980", "tier": "T1", "problem_label": "8", "problem_type": null, "exam": "AllSovietUnion", "problem": "A six digit (decimal) number has six different digits, none of them 0, and is divisible by 37. Show that you can obtain at least 23 other numbers which are divisible by 37 by permuting the digits.", "solution": "Suppose the digits are a1, a2, a3, a4, a5, a6 and that a1a2a3a4a5a6 is divisible by 37. We claim that a2a3a4a5a6a1 is also divisible by 37. Put \\(\\mathrm{n} = \\mathrm{a}_2\\mathrm{a}_3\\mathrm{a}_4\\mathrm{a}_5\\mathrm{a}_6\\) and \\(\\mathrm{m} = \\mathrm{a}_1\\) . The original number is \\(10^{5}\\mathrm{m} + \\mathrm{n}\\) and the derived number is \\(10\\mathrm{n} + \\mathrm{m}\\) . But 37 divides \\(10^{3} - 1\\) and hence also \\(10^{6} - 1\\) and \\(\\mathrm{m}(10^{6} - 1)\\) . So it also divides \\(10(10^{5}\\mathrm{m} + \\mathrm{n}) - \\mathrm{m}(10^{6} - 1) = 10\\mathrm{n} + \\mathrm{m}\\) , which proves the claim. \n\nIterating, we get the original number and 5 others: \n\na1a2a3a4a5a6 a2a3a4a5a6a1 a3a4a5a6a1a2 a4a5a6a1a2a3 a5a6a1a2a3a4 a6a1a2a3a4a5 \n\nSimilarly, we have that a1a2a3a4a5a6 - a1a2a6a4a5a3 = (a6- a3)999, so a1a2a6a4a5a3 is also divisible by 37. Iterating we get: \n\na1a2a6a4a5a3 a2a6a4a5a3a1 a6a4a5a3a1a2 a4a5a3a1a2a6 a5a3a1a2a6a4 a3a1a2a6a4a5 a5a3a1a2a6a4 a3a1a2a3a4a5 \n\nSimilarly, we could swap the first term and the fourth to get: \n\na4a2a3a1a5a6 a2a3a1a5a6a4 a3a1a5a6a4a2 a1a5a6a4a2a3 a5a6a4a2a3a1 a6a4a2a3a1a5 \n\nor the second and the fifth to get: \n\na1a5a3a4a2a6 a5a3a4a2a6a1 a3a4a2a6a1a5 a4a2a6a1a5a3 a2a6a1a5a3a4 a6a1a5a3a4a2", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 8", "solution_match": "# Solution"}} {"year": "1980", "tier": "T1", "problem_label": "9", "problem_type": null, "exam": "AllSovietUnion", "problem": "Find all real solutions to: \\(\\sin x + 2\\sin (x + y + z) = 0\\) \\(\\sin y + 3\\sin (x + y + z) = 0\\) \\(\\sin z + 4\\sin (x + y + z) = 0\\)", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 9", "solution_match": ""}} {"year": "1980", "tier": "T1", "problem_label": "10", "problem_type": null, "exam": "AllSovietUnion", "problem": "Given 1980 vectors in the plane. The sum of every 1979 vectors is a multiple of the other vector. Not all the vectors are multiples of each other. Show that the sum of all the vectors is zero.", "solution": "Let the vectors be \\(\\mathbf{x}_{\\mathrm{i}}\\) and their sum \\(\\mathbf{s}\\) . Then we have \\(\\mathbf{s} - \\mathbf{x}_{\\mathrm{i}} = \\mathbf{n}_{\\mathrm{i}}\\mathbf{x}_{\\mathrm{i}}\\) for some scalar \\(\\mathbf{n}_{\\mathrm{i}}\\) . Hence \\((\\mathbf{n}_{\\mathrm{i}} + 1)\\mathbf{x}_{\\mathrm{i}} = \\mathbf{s}\\) . If \\(\\mathbf{s}\\) is non- zero, then it follows that every vector is a multiple of \\(\\mathbf{s}\\) and hence all the vectors are multiples of each other. But we are told that is not true. Hence \\(\\mathbf{s}\\) is zero.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 10", "solution_match": "# Solution"}} {"year": "1980", "tier": "T1", "problem_label": "11", "problem_type": null, "exam": "AllSovietUnion", "problem": "Let \\(\\mathbf{f}(\\mathbf{n})\\) be the sum of \\(\\mathbf{n}\\) and its digits. For example, \\(\\mathbf{f}(34) = 41\\) . Is there an integer such that \\(\\mathbf{f}(\\mathbf{n}) = 1980\\) ? Show that given any positive integer \\(\\mathbf{m}\\) we can find \\(\\mathbf{n}\\) such that \\(\\mathbf{f}(\\mathbf{n}) = \\mathbf{m}\\) or \\(\\mathbf{m} + 1\\) . \n\n## Answer \n\n\\[\\mathrm{f}(1962) = 1962 + 18 = 1980\\]", "solution": "If the last digit of \\(\\mathbf{n}\\) is not 9, then \\(\\mathbf{f}(\\mathbf{n} + 1) = \\mathbf{f}(\\mathbf{n}) + 2\\) . If the last digit of \\(\\mathbf{n}\\) is 9, then \\(\\mathbf{f}(\\mathbf{n} + 1)< \\mathbf{f}(\\mathbf{n})\\) . On the other hand \\(\\mathbf{f}\\) clearly achieves arbitrarily large values. Also \\(\\mathbf{f}(1) = 1\\) . Now consider any \\(\\mathbf{m} > 1\\) . Let \\(\\mathbf{M}\\) be the smallest integer such that \\(\\mathbf{f}(\\mathbf{M}) > \\mathbf{m}\\) . Then \\(\\mathbf{f}(\\mathbf{M} - 1)\\leq \\mathbf{m}\\) . Since \\(\\mathbf{f}(\\mathbf{M}) > \\mathbf{f}(\\mathbf{M} - 1)\\) we must have \\(\\mathbf{f}(\\mathbf{M}) = \\mathbf{f}(\\mathbf{M} - 1) + 2\\) . Hence either \\(\\mathbf{f}(\\mathbf{M}) = \\mathbf{m} + 1\\) or \\(\\mathbf{f}(\\mathbf{M} - 1) = \\mathbf{m}\\) .", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 11", "solution_match": "# Solution"}} {"year": "1980", "tier": "T1", "problem_label": "12", "problem_type": null, "exam": "AllSovietUnion", "problem": "Some unit squares in an infinite sheet of squared paper are colored red so that every \\(2 \\times 3\\) and \\(3 \\times 2\\) rectangle contains exactly two red squares. How many red squares are there in a \\(9 \\times 11\\) rectangle? \n\n## Answer \n\n33", "solution": "![md5:5f00730fde8fe7df4a9585aa390cc519](5f00730fde8fe7df4a9585aa390cc519.jpeg)\n \n\nThere cannot be two red squares with a common side. For consider as the diagram shows we can immediately conclude that the squares with a \\(\\ast\\) are not red, but now the bold rectangle has at most 1 red square. Contradiction.\n\n\n![md5:b97a810dbe5c47c0e3729869585fd247](b97a810dbe5c47c0e3729869585fd247.jpeg)\n \n\nConsider a red square. One of the two diagonally adjacent squares marked \\* must be red. But it is now easy to show that all red squares on that diagonal are red and that the other red squares are those on every third parallel diagonal line. Any \\(9 \\times 11\\) rectangle must have just three such diagonals on a 9 cell border row, and hence just 3 red cells in that border row. But the remaining \\(9 \\times 10\\) rectangle can easily be partitioned into fifteen \\(3 \\times 2\\) rectangles, each with 2 red squares.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 12", "solution_match": "# Solution"}} {"year": "1980", "tier": "T1", "problem_label": "13", "problem_type": null, "exam": "AllSovietUnion", "problem": "There is a flu epidemic in elf city. The course of the disease is always the same. An elf is infected one day, he is sick the next, recovered and immune the third, recovered but not immune thereafter. Every day every elf who is not sick visits all his sick friends. If he is not immune he is sure to catch flu if he visits a sick elf. On day 1 no one is immune and one or more elves are infected from some external source. Thereafter there is no further external infection and the epidemic spreads as described above. Show that it is sure to die out (irrespective of the number of elves, the number of friends each has, and the number infected on day 1). Show that if one or more elves is immune on day 1, then it is possible for the epidemic to continue indefinitely.", "solution": "This is curiously easy. Write S for sick, N for not sick and not immune, and I for immune. Suppose group A are S on day 1 and group B are N on day 1. Then on day 2, B are S, and A are I. So on day 3 no one is sick, A are N and B are I. Thereafter no one can get sick, so the epidemic has died out. \n\nSuppose on day 1, there is also group C who are I. Then on day 2, B are S, A are I and C are N. So on day 3, C are S, A are N and B are I. On day 4, A are S, B are N and C are I, the same as day 1, so the epidemic continues indefinitely.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 13", "solution_match": "# Solution"}} {"year": "1980", "tier": "T1", "problem_label": "14", "problem_type": null, "exam": "AllSovietUnion", "problem": "Define the sequence \\(\\mathbf{a}_{\\mathrm{n}}\\) of positive integers as follows. \\(\\mathbf{a}_{1} = \\mathbf{m}\\) . \\(\\mathbf{a}_{\\mathrm{n} + 1} = \\mathbf{a}_{\\mathrm{n}}\\) plus the product of the digits of \\(\\mathbf{a}_{\\mathrm{n}}\\) . For example, if \\(\\mathrm{m} = 5\\) , we have 5, 10, 10, ... . Is there an m for which the sequence is unbounded? \n\n## Answer \n\nNo.", "solution": "Put \\(\\mathrm{p(n)}\\) for the product of the digits of n. We show that, for sufficiently large n, a sequence starting below it cannot get past the \"gap\" from \\(10_{\\mathrm{n}}\\) to \\(10_{\\mathrm{n}} + 10_{\\mathrm{n} - 1}\\) . For suppose N is the last member of the sequence below the gap. Then N has at most n digits, so \\(\\mathrm{p(N)} \\leq 9^{\\mathrm{n}}\\) . But for sufficiently large n (in fact for \\(\\mathrm{n} \\geq 21\\) ) we have \\(9^{\\mathrm{n}} < 10^{\\mathrm{n} - 1}\\) . So \\(\\mathrm{N} + \\mathrm{p(N)} < 10^{\\mathrm{n}} + 10^{\\mathrm{n} - 1}\\) . But \\(\\mathrm{N} + \\mathrm{p(N)} > 10^{\\mathrm{n}}\\) by assumption. Hence \\(\\mathrm{N} + \\mathrm{p(N)}\\) is sure to have second digit (from the left) zero.\n\n\n\nSo all further terms of the sequence are the same. But for any m there is certainly a gap above m, and, as shown, the sequence will not be able to get beyond it. So it is bounded.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 14", "solution_match": "# Solution"}} {"year": "1980", "tier": "T1", "problem_label": "15", "problem_type": null, "exam": "AllSovietUnion", "problem": "ABC is equilateral. A line parallel to AC meets AB at M and BC at P. D is the center of the equilateral triangle BMP. E is the midpoint of AP. Find the angles of DEC. \n\n## Answer \n\n\\[\\mathrm{D} = 60^{\\circ},\\mathrm{E} = 90^{\\circ}\\]", "solution": "![md5:a902c5010ecb112e54485bddc3d17aca](a902c5010ecb112e54485bddc3d17aca.jpeg)\n \n\nLet K be the midpoint of BP and L the midpoint of AC. EL is parallel to BC, so \\(\\angle ELC = 120^{\\circ}\\) . EK is parallel to AB, so \\(\\angle EKC = 60^{\\circ}\\) , so ELCK is cyclic. But \\(\\angle DKC = \\angle DLC = 90^{\\circ}\\) , so DLCK is cyclic. Hence D, K, C, L, E all lie on a circle. Hence \\(\\angle DEC = \\angle DLC = 90^{\\circ}\\) , and \\(\\angle EDC = \\angle EKC = 60^{\\circ}\\) .", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 15", "solution_match": "# Solution"}} {"year": "1980", "tier": "T1", "problem_label": "16", "problem_type": null, "exam": "AllSovietUnion", "problem": "A rectangular box has sides \\(\\mathbf{x}< \\mathbf{y}< \\mathbf{z}\\) . Its perimeter is \\(\\mathrm{p} = 4(\\mathrm{x} + \\mathrm{y} + \\mathrm{z})\\) , its surface area is \\(\\mathrm{s} =\\) \\(2(\\mathrm{xy} + \\mathrm{yz} + \\mathrm{zx})\\) and its main diagonal has length \\(\\mathrm{d} = \\sqrt{(\\mathrm{x}^2 + \\mathrm{y}^2 + \\mathrm{z}^2)}\\) . Show that \\(3\\mathrm{x}< (\\mathrm{p} / 4-\\) \\(\\sqrt{(\\mathrm{d}^2 - \\mathrm{s} / 2)}\\) and \\(3\\mathrm{z} > (\\mathrm{p} / 4 + \\sqrt{(\\mathrm{d}^2 - \\mathrm{s} / 2)}}\\)", "solution": "We have \\(3(\\mathrm{y - x})(\\mathrm{z - x}) > 0\\) , so \\(3\\mathrm{x}^2 +3\\mathrm{yz} > 3\\mathrm{xy} + 3\\mathrm{xz}\\) . Hence \\(\\mathrm{y}^2 +\\mathrm{z}^2 +4\\mathrm{x}^2 +2\\mathrm{yz} - 4\\mathrm{xy} - 4\\mathrm{xz} > \\mathrm{x}^2 + \\mathrm{y}^2 +\\mathrm{z}^2 - \\mathrm{xy} - \\mathrm{yz} - \\mathrm{xz}\\) or \\((\\mathrm{y} + \\mathrm{z} - 2\\mathrm{x})^2 >(\\mathrm{d}^2 - \\mathrm{s} / 2)\\) . Hence \\((\\mathrm{x} + \\mathrm{y} + \\mathrm{z}) > 3\\mathrm{x} + \\sqrt{(\\mathrm{d}^2 - \\mathrm{s} / 2)}\\) . So \\(3\\mathrm{x}< \\mathrm{p} / 4 - \\sqrt{(\\mathrm{d}^2 - \\mathrm{s} / 2)}\\) . \n\nSimilarly, \\(3(\\mathrm{z - x})(\\mathrm{z - y}) > 0\\) , so \\(\\mathrm{x}^2 +\\mathrm{y}^2 +4\\mathrm{z}^2 >\\mathrm{x}^2 +\\mathrm{y}^2 +\\mathrm{z}^2 +3\\mathrm{zx} + 3\\mathrm{zy} - 3\\mathrm{xy}\\) , so \\((2\\mathrm{z} - \\mathrm{x} - \\mathrm{y})^2 >\\mathrm{x}^2 +\\mathrm{y}^2 +\\mathrm{z}^2 - \\mathrm{xy} - \\mathrm{yz} - \\mathrm{zx}\\) or \\((3\\mathrm{z} - \\mathrm{p} / 4)^2 >(\\mathrm{d}^2 - \\mathrm{s} / 2)\\) . Hence \\(3\\mathrm{z} > \\mathrm{p} / 4 + \\sqrt{(\\mathrm{d}^2 - \\mathrm{s} / 2)}\\) .", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 16", "solution_match": "# Solution"}} {"year": "1980", "tier": "T1", "problem_label": "17", "problem_type": null, "exam": "AllSovietUnion", "problem": "S is a set of integers. Its smallest element is 1 and its largest element is 100. Every element of S except 1 is the sum of two distinct members of the set or double a member of the set. What is the smallest possible number of integers in S? \n\n## Answer", "solution": "Let \\(\\mathrm{n} = \\mathrm{M}(\\mathrm{n}) + \\mathrm{m}(\\mathrm{n})\\) , where \\(\\mathrm{M}(\\mathrm{n})\\geq \\mathrm{m}(\\mathrm{n})\\) . Put \\(\\mathrm{M}^{1}(\\mathrm{n}) = \\mathrm{M}(\\mathrm{n})\\) , \\(\\mathrm{M}^{2}(\\mathrm{n}) = \\mathrm{M}(\\mathrm{M}(\\mathrm{n}))\\) etc. Then \\(\\mathrm{M}(100)\\geq 50\\) , \\(\\mathrm{M}^{2}(100)\\geq 25\\) , \\(\\mathrm{M}^{3}(100)\\geq 13\\) , \\(\\mathrm{M}^{4}(100)\\geq 7\\) , \\(\\mathrm{M}^{5}(100)\\geq 4\\) , \\(\\mathrm{M}^{6}(100)\\geq 2\\) (and obviously \\(\\mathrm{n} > \\mathrm{M}(\\mathrm{n})\\) ), so we need at least 8 numbers. There are several ways of using 9 numbers. For example, {1, 2, 4, 8, 16, 32, 36, 64, 100}, where \\(36 = 4 + 32\\) , \\(100 = 36 + 64\\) and the others are double another number. \n\nDoubling every time does not work: 1, 2, 4, 8, 16, 32, 64, 128. But if we do not double every time, then we cannot get a number larger than 96 with 8 numbers: the best we can do is \\(1\\cdot 2^{6}\\) . \\((3 / 2) = 96\\) (on the occasion when we do not double the best we can do is to the largest plus the next largest, or \\(3 / 2\\) x the largest). Hence we need at least 9 numbers. [To be more formal, write the elements as \\(1 = \\mathrm{a}_{1}< \\mathrm{a}_{2}< \\ldots < \\mathrm{a}_{\\mathrm{n}}\\) , then each \\(\\mathrm{a}_{\\mathrm{i}}\\) must be a sum of preceding elements. The largest possible \\(\\mathrm{a}_{\\mathrm{i}}\\) is \\(2\\mathrm{a}_{\\mathrm{i - 1}}\\) and the next largest \\(\\mathrm{a}_{\\mathrm{i - 1}} + \\mathrm{a}_{\\mathrm{i - 2}}\\) and so on.]", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 17", "solution_match": "# Solution"}} {"year": "1980", "tier": "T1", "problem_label": "18", "problem_type": null, "exam": "AllSovietUnion", "problem": "Show that there are infinitely many positive integers n such that \\([\\mathrm{a}^{3 / 2}] + [\\mathrm{b}^{3 / 2}] = \\mathrm{n}\\) has at least 1980 integer solutions.", "solution": "Consider all a, b in the range 1, 2, 3, ..., \\(\\mathrm{N}^{2}\\) . There are \\(\\mathrm{N}^{4}\\) possible pairs of values. But \\([\\mathrm{a}^{3 / 2}]\\) and \\([\\mathrm{b}^{3 / 2}]\\) are in the range 1, 2, ..., \\(\\mathrm{N}^{3}\\) , so their sum is in the range 1, 2, ..., \\(2\\mathrm{N}^{3}\\) . Hence one of these values has at least \\(\\mathrm{N} / 2\\) solutions. By taking \\(\\mathrm{N}\\) sufficiently large we can get \\(\\mathrm{a}_{1} > 1980\\) solutions for some \\(\\mathrm{N}_{1}\\leq 2\\mathrm{N}^{3}\\) . But now by taking \\(\\mathrm{N}\\) sufficiently large we can get \\(\\mathrm{a}_{2} > \\mathrm{a}_{1}\\) solutions for some \\(\\mathrm{N}_{2}\\) . Since \\(\\mathrm{a}_{2}\\neq \\mathrm{a}_{1}\\) , we must have \\(\\mathrm{N}_{2}\\neq \\mathrm{N}_{1}\\) . In other words, we have a different n, also with \\(>1980\\) solutions. Continuing, we get an infinite sequence of distinct n each with at least 1980 solutions.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 18", "solution_match": "# Solution"}} {"year": "1980", "tier": "T1", "problem_label": "19", "problem_type": null, "exam": "AllSovietUnion", "problem": "ABCD is a tetrahedron. Angles ACB and ADB are 90 deg. Let k be the angle between the lines AC and BD. Show that \\(\\cos \\mathrm{k}< \\mathrm{CD} / \\mathrm{AB}\\) .", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 19", "solution_match": ""}} {"year": "1980", "tier": "T1", "problem_label": "20", "problem_type": null, "exam": "AllSovietUnion", "problem": "\\(\\mathrm{x}_{0}\\) is a real number in the interval (0, 1) with decimal representation \\(0. \\mathrm{d}_{1} \\mathrm{d}_{2} \\mathrm{d}_{3} \\ldots\\) . We obtain the sequence \\(\\mathrm{x}_{\\mathrm{n}}\\) as follows. \\(\\mathrm{x}_{\\mathrm{n} + 1}\\) is obtained from \\(\\mathrm{x}_{\\mathrm{n}}\\) by rearranging the 5 digits \\(\\mathrm{d}_{\\mathrm{n} + 1}\\) , \\(\\mathrm{d}_{\\mathrm{n} + 2}\\) , \\(\\mathrm{d}_{\\mathrm{n} + 3}\\) , \\(\\mathrm{d}_{\\mathrm{n} + 4}\\) , \\(\\mathrm{d}_{\\mathrm{n} + 5}\\) . Show that the sequence \\(\\mathrm{x}_{\\mathrm{n}}\\) converges. Can the limit be irrational if \\(\\mathrm{x}_{0}\\) is rational? Find a number \\(\\mathrm{x}_{0}\\) so that every member of the sequence is irrational, no matter how the rearrangements are carried out.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 20", "solution_match": ""}} {"year": "1981", "tier": "T1", "problem_label": "1", "problem_type": null, "exam": "AllSovietUnion", "problem": "A chess board is placed on top of an identical board and rotated through 45 degrees about its center. What is the area which is black in both boards?", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 1", "solution_match": ""}} {"year": "1981", "tier": "T1", "problem_label": "2", "problem_type": null, "exam": "AllSovietUnion", "problem": "AB is a diameter of the circle C. M and N are any two points on the circle. The chord MA' is perpendicular to the line NA and the chord MB' is perpendicular to the line NB. Show that AA' and BB' are parallel.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 2", "solution_match": ""}} {"year": "1981", "tier": "T1", "problem_label": "3", "problem_type": null, "exam": "AllSovietUnion", "problem": "Find an example of m and n such that m is the product of n consecutive positive integers and also the product of \\(\\mathrm{n} + 2\\) consecutive positive integers. Show that we cannot have \\(\\mathrm{n} = 2\\) .", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 3", "solution_match": ""}} {"year": "1981", "tier": "T1", "problem_label": "4", "problem_type": null, "exam": "AllSovietUnion", "problem": "Write down a row of arbitrary integers (repetitions allowed). Now construct a second row as follows. Suppose the integer n is in column k in the first row. In column k in the second row write down the number of occurrences of n in row 1 in columns 1 to k inclusive. Similarly, construct a third row under the second row (using the values in the second row), and a fourth row. An example follows: \n\n
7121711
1112234
1231211
1112234
\n\nShow that the fourth row is always the same as the second row.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 4", "solution_match": ""}} {"year": "1981", "tier": "T1", "problem_label": "5", "problem_type": null, "exam": "AllSovietUnion", "problem": "Let S be the set of points (x, y) given by \\(\\mathrm{y}\\leq - \\mathrm{x}^2\\) and \\(\\mathrm{y}\\geq \\mathrm{x}^2 - 2\\mathrm{x} + \\mathrm{a}\\) . Find the area of the rectangle with sides parallel to the axes and the smallest possible area which encloses S.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 5", "solution_match": ""}} {"year": "1981", "tier": "T1", "problem_label": "6", "problem_type": null, "exam": "AllSovietUnion", "problem": "ABC, CDE, EFG are equilateral triangles (not necessarily the same size). The vertices are counter- clockwise in each case. A, D, G are collinear and \\(\\mathrm{AD} = \\mathrm{DG}\\) . Show that BFD is equilateral.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 6", "solution_match": ""}} {"year": "1981", "tier": "T1", "problem_label": "7", "problem_type": null, "exam": "AllSovietUnion", "problem": "1000 people live in a village. Every evening each person tells his friends all the news he heard during the day. All news eventually becomes known (by this process) to everyone. Show that one can choose 90 people, so that if you give them some news on the same day, then everyone will know in 10 days.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 7", "solution_match": ""}} {"year": "1981", "tier": "T1", "problem_label": "8", "problem_type": null, "exam": "AllSovietUnion", "problem": "The reals a and b are such that a cos \\(x + b\\) cos \\(3x > 1\\) has no real solutions. Show that \\(|b| \\leq 1\\) .", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 8", "solution_match": ""}} {"year": "1981", "tier": "T1", "problem_label": "9", "problem_type": null, "exam": "AllSovietUnion", "problem": "ABCD is a convex quadrilateral. K is the midpoint of AB and M is the midpoint of CD. L lies on the side BC and N lies on the side AD. KLMN is a rectangle. Show that its area is half that of ABCD.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 9", "solution_match": ""}} {"year": "1981", "tier": "T1", "problem_label": "10", "problem_type": null, "exam": "AllSovietUnion", "problem": "The sequence \\(\\mathbf{a}_{\\mathrm{n}}\\) of positive integers is such that (1) \\(\\mathbf{a}_{\\mathrm{n}} \\leq \\mathbf{n}^{3 / 2}\\) for all n, and (2) m- n divides \\(\\mathbf{k}_{\\mathrm{m}} - \\mathbf{k}_{\\mathrm{n}}\\) (for all \\(\\mathbf{m} > \\mathbf{n}\\) ). Find \\(\\mathbf{a}_{\\mathrm{n}}\\) .", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 10", "solution_match": ""}} {"year": "1981", "tier": "T1", "problem_label": "11", "problem_type": null, "exam": "AllSovietUnion", "problem": "Is it possible to color half the cells in a rectangular array white and half black so that in each row and column more than 3/4 of the cells are the same color?", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 11", "solution_match": ""}} {"year": "1981", "tier": "T1", "problem_label": "12", "problem_type": null, "exam": "AllSovietUnion", "problem": "ACPH, AMBE, AHBT, BKXM and CKXP are parallelograms. Show that ABTE is also a parallelogram (vertices are labeled anticlockwise).", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 12", "solution_match": ""}} {"year": "1981", "tier": "T1", "problem_label": "13", "problem_type": null, "exam": "AllSovietUnion", "problem": "Find all solutions (x, y) in positive integers to \\(x^{3} - y^{3} = xy + 61\\) . \n\n## Answer \n\n(6,5)", "solution": "Put \\(x = y + a\\) . Then \\((3a - 1)y^{2} + a(3a - 1)y + (a^{3} - 61) = 0\\) . The first two terms are positive, so the last term must be negative, so \\(a = 1, 2, 3\\) . Trying each case in turn, we get \\((y + 6)(y - 5) = 0\\) , \\(5y^{2} + 10y - 53 = 0\\) , \\(4y^{2} + 12y - 17 = 0\\) . The last two equations have no integers solutions.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 13", "solution_match": "# Solution"}} {"year": "1981", "tier": "T1", "problem_label": "14", "problem_type": null, "exam": "AllSovietUnion", "problem": "Eighteen teams are playing in a tournament. So far, each team has played exactly eight games, each with a different opponent. Show that there are three teams none of which has yet played the other.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 14", "solution_match": ""}} {"year": "1981", "tier": "T1", "problem_label": "15", "problem_type": null, "exam": "AllSovietUnion", "problem": "ABC is a triangle. A' lies on the side BC with \\(\\mathrm{BA} / \\mathrm{BC} = 1 / 4\\) . Similarly, B' lies on the side CA with \\(\\mathrm{CB} / \\mathrm{CA} = 1 / 4\\) , and C' lies on the side AB with \\(\\mathrm{AC} / \\mathrm{AB} = 1 / 4\\) . Show that the perimeter of A'B'C' is between 1/2 and 3/4 of the perimeter of ABC.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 15", "solution_match": ""}} {"year": "1981", "tier": "T1", "problem_label": "16", "problem_type": null, "exam": "AllSovietUnion", "problem": "The positive reals \\(\\mathbf{x}\\) , y satisfy \\(\\mathbf{x}^{3} + \\mathbf{y}^{3} = \\mathbf{x} - \\mathbf{y}\\) . Show that \\(\\mathbf{x}^{2} + \\mathbf{y}^{2} < 1\\) .", "solution": "Since \\(\\mathbf{x}\\) , y are positive, so is \\(\\mathbf{x}^{3} + \\mathbf{y}^{3}\\) , and hence \\(\\mathbf{x} > \\mathbf{y}\\) . So \\((\\mathbf{x}^{2} + \\mathbf{y}^{2})(\\mathbf{x} - \\mathbf{y}) = (\\mathbf{x}^{3} - \\mathbf{y}^{3}) - \\mathbf{xy}(\\mathbf{x} - \\mathbf{y})\\) \\(< \\mathbf{x}^{3} - \\mathbf{y}^{3} = \\mathbf{x} - \\mathbf{y}\\) . Hence \\(\\mathbf{x}^{2} + \\mathbf{y}^{2} < 1\\) .", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 16", "solution_match": "# Solution"}} {"year": "1981", "tier": "T1", "problem_label": "17", "problem_type": null, "exam": "AllSovietUnion", "problem": "A convex polygon is drawn inside the unit circle. Someone makes a copy by starting with one vertex and then drawing each side successively. He copies the angle between each side and the previous side accurately, but makes an error in the length of each side of up to a factor \\(1 \\pm \\mathbf{p}\\) . As a result the last side ends up a distance \\(\\mathbf{d}\\) from the starting point. Show that \\(\\mathbf{d} < 4 \\mathbf{p}\\) .", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 17", "solution_match": ""}} {"year": "1981", "tier": "T1", "problem_label": "18", "problem_type": null, "exam": "AllSovietUnion", "problem": "An integer is initially written at each vertex of a cube. A move is to add 1 to the numbers at two vertices connected by an edge. Is it possible to equalise the numbers by a series of moves in the following cases? (1) The initial numbers are (1) 0, except for one vertex which is 1. (2) The initial numbers are 0, except for two vertices which are 1 and diagonally opposite on a face of the cube. (3) Initially, the numbers going round the base are 1, 2, 3, 4. The corresponding vertices on the top are 6, 7, 4, 5 (with 6 above the 1, 7 above the 2 and so on).", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 18", "solution_match": ""}} {"year": "1981", "tier": "T1", "problem_label": "19", "problem_type": null, "exam": "AllSovietUnion", "problem": "Find 21 consecutive integers, each with a prime factor less than 17.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 19", "solution_match": ""}} {"year": "1981", "tier": "T1", "problem_label": "20", "problem_type": null, "exam": "AllSovietUnion", "problem": "Each of the numbers from 100 to 999 inclusive is written on a separate card. The cards are arranged in a pile in random order. We take cards off the pile one at a time and stack them into 10 piles according to the last digit. We then put the 1 pile on top of the 0 pile, the 2 pile on top of the 1 pile and so on to get a single pile. We now take them off one at a time and stack them into 10 piles according to the middle digit. We then consolidate the piles as before. We then take them off one at a time and stack them into 10 piles according to the first digit and finally consolidate the piles as before. What can we say about the order in the final pile?", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 20", "solution_match": ""}} {"year": "1981", "tier": "T1", "problem_label": "21", "problem_type": null, "exam": "AllSovietUnion", "problem": "Given 6 points inside a \\(3 \\times 4\\) rectangle, show that we can find two points whose distance does not exceed \\(\\sqrt{5}\\) .", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 21", "solution_match": ""}} {"year": "1981", "tier": "T1", "problem_label": "22", "problem_type": null, "exam": "AllSovietUnion", "problem": "What is the smallest value of \\(4 + \\mathbf{x}^{2}\\mathbf{y}^{4} + \\mathbf{x}^{4}\\mathbf{y}^{2} - 3\\mathbf{x}^{2}\\mathbf{y}^{2}\\) for real \\(\\mathbf{x}\\) , \\(\\mathbf{y}\\) ? Show that the polynomial cannot be written as a sum of squares. [Note the candidates did not know calculus.]", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 22", "solution_match": ""}} {"year": "1981", "tier": "T1", "problem_label": "23", "problem_type": null, "exam": "AllSovietUnion", "problem": "ABCDEF is a prism. Its base ABC and its top DEF are congruent equilateral triangles. The side edges are AD, BE and CF. Find all points on the base which are equidistant from the three lines AE, BF and CD.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 23", "solution_match": ""}} {"year": "1982", "tier": "T1", "problem_label": "1", "problem_type": null, "exam": "AllSovietUnion", "problem": "The circle C has center O and radius r and contains the points A and B. The circle C' touches the rays OA and OB and has center O' and radius r'. Find the area of the quadrilateral OAOB.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 1", "solution_match": ""}} {"year": "1982", "tier": "T1", "problem_label": "2", "problem_type": null, "exam": "AllSovietUnion", "problem": "The sequence \\(\\mathbf{a}_{\\mathrm{n}}\\) is defined by \\(\\mathbf{a}_{1} = 1\\) , \\(\\mathbf{a}_{2} = 2\\) , \\(\\mathbf{a}_{\\mathrm{n} + 2} = \\mathbf{a}_{\\mathrm{n} + 1} + \\mathbf{a}_{\\mathrm{n}}\\) . The sequence \\(\\mathbf{b}_{\\mathrm{n}}\\) is defined by \\(\\mathbf{b}_{1} = 2\\) , \\(\\mathbf{b}_{2} = 1\\) , \\(\\mathbf{b}_{\\mathrm{n} + 2} = \\mathbf{b}_{\\mathrm{n} + 1} + \\mathbf{b}_{\\mathrm{n}}\\) . How many integers belong to both sequences? \n\n## Answer \n\n1,2,3 only", "solution": "The first few terms are: \n\nn 1 2 3 4 5 6 7 \\(\\mathbf{a}_{\\mathrm{n}}\\) 1 2 3 5 8 13 21 \\(\\mathbf{b}_{\\mathrm{n}}\\) 2 1 3 4 7 11 18 \n\nNote that for \\(\\mathbf{n} = 4\\) , 5 we have \\(\\mathbf{a}_{\\mathrm{n - 1}} < \\mathbf{b}_{\\mathrm{n}} < \\mathbf{a}_{\\mathrm{n}}\\) . So by a trivial induction, the inequality holds for all \\(\\mathbf{n} \\geq 4\\) .", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 2", "solution_match": "# Solution"}} {"year": "1982", "tier": "T1", "problem_label": "3", "problem_type": null, "exam": "AllSovietUnion", "problem": "N is a sum of n powers of 2. If N is divisible by \\(2^{\\mathrm{m}} - 1\\) , prove that \\(\\mathrm{n} \\geq \\mathrm{m}\\) . Does there exist a number divisible by 11...1 (m 1s) which has the sum of its digits less than m?", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 3", "solution_match": ""}} {"year": "1982", "tier": "T1", "problem_label": "4", "problem_type": null, "exam": "AllSovietUnion", "problem": "A non- negative real is written at each vertex of a cube. The sum of the eight numbers is 1. Two players choose faces of the cube alternately. A player cannot choose a face already chosen or the one opposite, so the first player plays twice, the second player plays once. Can the first player arrange that the vertex common to all three chosen faces is \\(\\leq 1 / 6\\) ?", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 4", "solution_match": ""}} {"year": "1982", "tier": "T1", "problem_label": "5", "problem_type": null, "exam": "AllSovietUnion", "problem": "A library is open every day except Wednesday. One day three boys, A, B, C visit the library together for the first time. Thereafter they visit the library many times. A always makes his next visit two days after the previous visit, unless the library is closed on that day, in which case he goes the following day. B always makes his next visit three days after the previous visit (or four if the library is closed). C always makes his next visit four days after the previous visit (or five if the library is closed). For example, if A went first on Monday, his next visit would be Thursday, then Saturday. If B went first on Monday, his next visit would be on Thursday. All three boys are subsequently in the library on a Monday. What day of the week was their first visit?", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 5", "solution_match": ""}} {"year": "1982", "tier": "T1", "problem_label": "6", "problem_type": null, "exam": "AllSovietUnion", "problem": "ABCD is a parallelogram and AB is not equal to BC. M is chosen so that (1) \\(\\angle \\mathrm{MAC} =\\) \\(\\angle \\mathrm{DAC}\\) and M is on the opposite side of AC to D, and (2) \\(\\angle \\mathrm{MBD} = \\angle \\mathrm{CBD}\\) and M is on the opposite side of BD to C. Find AM/BM in terms of \\(\\mathrm{k} = \\mathrm{AC} / \\mathrm{BD}\\) .", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 6", "solution_match": ""}} {"year": "1982", "tier": "T1", "problem_label": "7", "problem_type": null, "exam": "AllSovietUnion", "problem": "3n points divide a circle into 3n arcs. One third of the arcs have length 1, one third have length 2 and one third have length 3. Show that two of the points are at opposite ends of a diameter.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 7", "solution_match": ""}} {"year": "1982", "tier": "T1", "problem_label": "8", "problem_type": null, "exam": "AllSovietUnion", "problem": "M is a point inside a regular tetrahedron. Show that we can find two vertices A, B of the tetrahedron such that \\(\\cos \\mathrm{AMB} \\leq - 1 / 3\\) .", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 8", "solution_match": ""}} {"year": "1982", "tier": "T1", "problem_label": "9", "problem_type": null, "exam": "AllSovietUnion", "problem": "\\(0 < \\mathrm{x}, \\mathrm{y}, \\mathrm{z} < \\pi / 2\\) . We have \\(\\cos \\mathrm{x} = \\mathrm{x}, \\sin (\\cos \\mathrm{y}) = \\mathrm{y}, \\cos (\\sin \\mathrm{z}) = \\mathrm{z}\\) . Which of \\(\\mathrm{x}, \\mathrm{y}, \\mathrm{z}\\) is the largest and which the smallest?", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 9", "solution_match": ""}} {"year": "1982", "tier": "T1", "problem_label": "10", "problem_type": null, "exam": "AllSovietUnion", "problem": "P is a polygon with \\(2\\mathrm{n} + 1\\) sides. A new polygon is derived by taking as its vertices the midpoints of the sides of P. This process is repeated. Show that we must eventually reach a polygon which is homothetic to P.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 10", "solution_match": ""}} {"year": "1982", "tier": "T1", "problem_label": "11", "problem_type": null, "exam": "AllSovietUnion", "problem": "\\(\\mathrm{a}_1, \\mathrm{a}_2, \\ldots , \\mathrm{a}_{1982}\\) is a permutation of 1, 2, ..., 1982. If \\(\\mathrm{a}_1 > \\mathrm{a}_2\\) , we swap \\(\\mathrm{a}_1\\) and \\(\\mathrm{a}_2\\) . Then if (the new) \\(\\mathrm{a}_2 > \\mathrm{a}_3\\) we swap \\(\\mathrm{a}_2\\) and \\(\\mathrm{a}_3\\) . And so on. After 1981 potential swaps we have a new permutation \\(\\mathrm{b}_1, \\mathrm{b}_2, \\ldots , \\mathrm{b}_{1982}\\) . We then compare \\(\\mathrm{b}_{1982}\\) and \\(\\mathrm{b}_{1981}\\) . If \\(\\mathrm{b}_{1981} > \\mathrm{b}_{1982}\\) , we swap them. We then compare \\(\\mathrm{b}_{1980}\\) and (the new) \\(\\mathrm{b}_{1981}\\) . So we arrive finally at \\(\\mathrm{c}_1, \\mathrm{c}_2, \\ldots , \\mathrm{c}_{1982}\\) . We find that \\(\\mathrm{a}_{100} = \\mathrm{c}_{100}\\) . What value is \\(\\mathrm{a}_{100}\\) ?", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 11", "solution_match": ""}} {"year": "1982", "tier": "T1", "problem_label": "12", "problem_type": null, "exam": "AllSovietUnion", "problem": "Cucumber River has parallel banks a distance 1 meter apart. It has some islands with total perimeter 8 meters. It is claimed that it is always possible to cross the river (starting from an arbitrary point) by boat in at most 3 meters. Is the claim always true for any arrangement of islands? [Neglect the current.]", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 12", "solution_match": ""}} {"year": "1982", "tier": "T1", "problem_label": "13", "problem_type": null, "exam": "AllSovietUnion", "problem": "The parabola \\(\\mathrm{y} = \\mathrm{x}^2\\) is drawn and then the axes are deleted. Can you restore them using ruler and compasses?", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 13", "solution_match": ""}} {"year": "1982", "tier": "T1", "problem_label": "14", "problem_type": null, "exam": "AllSovietUnion", "problem": "An integer is put in each cell of an \\(\\mathrm{n} \\times \\mathrm{n}\\) array. The difference between the integers in cells which share a side is 0 or 1. Show that some integer occurs at least \\(\\mathrm{n}\\) times.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 14", "solution_match": ""}} {"year": "1982", "tier": "T1", "problem_label": "15", "problem_type": null, "exam": "AllSovietUnion", "problem": "\\(\\mathbf{x}\\) is a positive integer. Put \\(\\mathbf{a} = \\mathbf{x}^{1 / 12}\\) , \\(\\mathbf{b} = \\mathbf{x}^{1 / 4}\\) , \\(\\mathbf{c} = \\mathbf{x}^{1 / 6}\\) . Show that \\(2^{\\mathrm{a}} + 2^{\\mathrm{b}} \\geq 2^{1 + \\mathrm{c}}\\) .", "solution": "Put \\(\\mathbf{x} = \\mathbf{r}^{12}\\) . Since \\(\\mathbf{x}\\) is a positive integer, we have \\(\\mathbf{r} \\geq 1\\) . We have to show that \\((2^{\\mathrm{r}} + 2^{\\mathrm{r}^{3}}) / 2 \\geq 2^{\\mathrm{r}^{2}}\\) . But this follows immediately from AM/GM.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 15", "solution_match": "# Solution"}} {"year": "1982", "tier": "T1", "problem_label": "16", "problem_type": null, "exam": "AllSovietUnion", "problem": "What is the largest subset of \\(\\{1, 2, \\ldots , 1982\\}\\) with the property that no element is the product of two other distinct elements.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 16", "solution_match": ""}} {"year": "1982", "tier": "T1", "problem_label": "17", "problem_type": null, "exam": "AllSovietUnion", "problem": "A real number is assigned to each unit square in an infinite sheet of squared paper. Show that some cell contains a number that is less than or equal to at least four of its eight neighbors.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 17", "solution_match": ""}} {"year": "1982", "tier": "T1", "problem_label": "18", "problem_type": null, "exam": "AllSovietUnion", "problem": "Given a real sequence \\(\\mathbf{a}_{1}, \\mathbf{a}_{2}, \\ldots , \\mathbf{a}_{\\mathrm{n}}\\) , show that it is always possible to choose a subsequence such that (1) for each \\(\\mathrm{i} \\leq \\mathrm{n} - 2\\) at least one and at most two of \\(\\mathbf{a}_{\\mathrm{i}}, \\mathbf{a}_{\\mathrm{i} + 1}, \\mathbf{a}_{\\mathrm{i} + 2}\\) are chosen and (2) the sum of the absolute values of the numbers in the subsequence is at least \\(1 / 6 \\sum \\mathrm{n}^{\\mathrm{i}} \\mathrm{la}_{\\mathrm{i}}\\) .", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 18", "solution_match": ""}} {"year": "1982", "tier": "T1", "problem_label": "19", "problem_type": null, "exam": "AllSovietUnion", "problem": "An \\(\\mathrm{n} \\times \\mathrm{n}\\) array has a cross in \\(\\mathrm{n} - 1\\) cells. A move consists of moving a row to a new position or moving a column to a new position. For example, one might move row 2 to row 5, so that row 1 remained in the same position, row 3 became row 2, row 4 became row 3, row 5 became row 4, row 2 became row 5 and the remaining rows remained in the same position. Show that by a series of moves one can end up with all the crosses below the main diagonal.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 19", "solution_match": ""}} {"year": "1982", "tier": "T1", "problem_label": "20", "problem_type": null, "exam": "AllSovietUnion", "problem": "Let \\(\\{\\mathbf{a}\\}\\) denote the difference between a and the nearest integer. For example \\(\\{3.8\\} = 0.2, \\{- 5.4\\} = 0.4\\) . Show that \\(\\mathrm{la} \\mathrm{la} - 11 \\mathrm{la} - 2 \\mathrm{l} \\ldots \\mathrm{la} - \\mathrm{nl} \\geq = \\{\\mathrm{a} \\} \\mathrm{n}!/2^{\\mathrm{n}}\\) .", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 20", "solution_match": ""}} {"year": "1982", "tier": "T1", "problem_label": "21", "problem_type": null, "exam": "AllSovietUnion", "problem": "Do there exist polynomials \\(\\mathrm{p}(\\mathrm{x}), \\mathrm{q}(\\mathrm{x}), \\mathrm{r}(\\mathrm{x})\\) such that \\(\\mathrm{p}(\\mathrm{x} - \\mathrm{y} + \\mathrm{z})^{3} + \\mathrm{q}(\\mathrm{y} - \\mathrm{z} - 1)^{3} + \\mathrm{r}(\\mathrm{z} - 2\\mathrm{x} + 1)^{3} = 1\\) for all \\(\\mathrm{x}, \\mathrm{y}, \\mathrm{z}\\) ? Do there exist polynomials \\(\\mathrm{p}(\\mathrm{x}), \\mathrm{q}(\\mathrm{x}), \\mathrm{r}(\\mathrm{x})\\) such that \\(\\mathrm{p}(\\mathrm{x} - \\mathrm{y} + \\mathrm{z})^{3} + \\mathrm{q}(\\mathrm{y} - \\mathrm{z} - 1)^{3} + \\mathrm{r}(\\mathrm{z} - \\mathrm{x} + 1)^{3} = 1\\) for all \\(\\mathrm{x}, \\mathrm{y}, \\mathrm{z}\\) ?", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 21", "solution_match": ""}} {"year": "1982", "tier": "T1", "problem_label": "22", "problem_type": null, "exam": "AllSovietUnion", "problem": "A tetrahedron T' has all its vertices inside the tetrahedron T. Show that the sum of the edge lengths of T' is less than 4/3 times the corresponding sum for T.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 22", "solution_match": ""}} {"year": "1983", "tier": "T1", "problem_label": "1", "problem_type": null, "exam": "AllSovietUnion", "problem": "A \\(4 \\mathrm{x} 4\\) array of unit cells is made up of a grid of total length 40. Can we divide the grid into 8 paths of length 5? Into 5 paths of length 8?", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 1", "solution_match": ""}} {"year": "1983", "tier": "T1", "problem_label": "2", "problem_type": null, "exam": "AllSovietUnion", "problem": "Three positive integers are written on a blackboard. A move consists of replacing one of the numbers by the sum of the other two less one. For example, if the numbers are 3, 4, 5, then one move could lead to 4, 5, 8 or 3, 5, 7 or 3, 4, 6. After a series of moves the three numbers are 17, 1967 and 1983. Could the initial set have been 2, 2, 2? 3, 3, 3?", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 2", "solution_match": ""}} {"year": "1983", "tier": "T1", "problem_label": "3", "problem_type": null, "exam": "AllSovietUnion", "problem": "\\(\\mathrm{C}_{1}, \\mathrm{C}_{2}, \\mathrm{C}_{3}\\) are circles, none of which lie inside either of the others. \\(\\mathrm{C}_{1}\\) and \\(\\mathrm{C}_{2}\\) touch at Z, \\(\\mathrm{C}_{2}\\) and \\(\\mathrm{C}_{3}\\) touch at X, and \\(\\mathrm{C}_{3}\\) and \\(\\mathrm{C}_{1}\\) touch at Y. Prove that if the radius of each circle is increased by a factor \\(2 / \\sqrt{3}\\) without moving their centers, then the enlarged circles cover the triangle XYZ.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 3", "solution_match": ""}} {"year": "1983", "tier": "T1", "problem_label": "4", "problem_type": null, "exam": "AllSovietUnion", "problem": "Find all real solutions x, y to \\(\\mathrm{y}^{2} = \\mathrm{x}^{3} - 3\\mathrm{x}^{2} + 2\\mathrm{x}, \\mathrm{x}^{2} = \\mathrm{y}^{3} - 3\\mathrm{y}^{2} + 2\\mathrm{y}.\\)", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 4", "solution_match": ""}} {"year": "1983", "tier": "T1", "problem_label": "5", "problem_type": null, "exam": "AllSovietUnion", "problem": "The positive integer k has n digits. It is rounded to the nearest multiple of 10, then to the nearest multiple of 100 and so on (n- 1 roundings in all). Numbers midway between are rounded up. For example, 1474 is rounded to 1470, then to 1500, then to 2000. Show that the final number is less than 18k/13.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 5", "solution_match": ""}} {"year": "1983", "tier": "T1", "problem_label": "6", "problem_type": null, "exam": "AllSovietUnion", "problem": "M is the midpoint of BC. E is any point on the side AC and F is any point on the side AB. Show that area \\(\\mathrm{MEF} \\leq\\) area \\(\\mathrm{BMF} +\\) area CME.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 6", "solution_match": ""}} {"year": "1983", "tier": "T1", "problem_label": "7", "problem_type": null, "exam": "AllSovietUnion", "problem": "\\(\\mathrm{a}_{\\mathrm{n}}\\) is the last digit of \\([10^{n / 2}]\\) . Is the sequence \\(\\mathrm{a}_{\\mathrm{n}}\\) periodic? \\(\\mathrm{b}_{\\mathrm{n}}\\) is the last digit of \\([2^{n / 2}]\\) . Is the sequence \\(\\mathrm{b}_{\\mathrm{n}}\\) periodic?", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 7", "solution_match": ""}} {"year": "1983", "tier": "T1", "problem_label": "8", "problem_type": null, "exam": "AllSovietUnion", "problem": "A and B are acute angles such that \\(\\sin^{2} \\mathrm{A} + \\sin^{2} \\mathrm{B} = \\sin (\\mathrm{A} + \\mathrm{B})\\) . Show that \\(\\mathrm{A} + \\mathrm{B} = \\pi / 2\\) .", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 8", "solution_match": ""}} {"year": "1983", "tier": "T1", "problem_label": "9", "problem_type": null, "exam": "AllSovietUnion", "problem": "The projection of a tetrahedron onto the plane P is ABCD. Can we find a distinct plane P' such that the projection of the tetrahedron onto P' is A'B'C'D' and AA', BB', CC' and DD' are all parallel?", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 9", "solution_match": ""}} {"year": "1983", "tier": "T1", "problem_label": "10", "problem_type": null, "exam": "AllSovietUnion", "problem": "Given a quadratic equation \\(\\mathrm{ax}^2 +\\mathrm{bx} + \\mathrm{c}\\) . If it has two real roots \\(\\mathrm{A}\\leq \\mathrm{B}\\) , transform the equation to \\(\\mathrm{x}^2 +\\mathrm{Ax} + \\mathrm{B}\\) . Show that if we repeat this process we must eventually reach an equation with complex roots. What is the maximum possible number of transformations before we reach such an equation?", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 10", "solution_match": ""}} {"year": "1983", "tier": "T1", "problem_label": "11", "problem_type": null, "exam": "AllSovietUnion", "problem": "a, b, c are positive integers. If ab divides ba and ca divides ac, show that cb divides bc.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 11", "solution_match": ""}} {"year": "1983", "tier": "T1", "problem_label": "12", "problem_type": null, "exam": "AllSovietUnion", "problem": "A word is a finite string of As and Bs. Can we find a set of three 4- letter words, ten 5- letter words, thirty 6- letter words and five 7- letter words such that no word is the beginning of another word. [For example, if ABA was a word, then ABAAB could not be a word.]", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 12", "solution_match": ""}} {"year": "1983", "tier": "T1", "problem_label": "13", "problem_type": null, "exam": "AllSovietUnion", "problem": "Can you place an integer in every square of an infinite sheet of squared paper so that the sum of the integers in every 4 x 6 (or 6 x 4) rectangle is (1) 10, (2) 1?", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 13", "solution_match": ""}} {"year": "1983", "tier": "T1", "problem_label": "14", "problem_type": null, "exam": "AllSovietUnion", "problem": "A point is chosen on each of the three sides of a triangle and joined to the opposite vertex. The resulting lines divide the triangle into four triangles and three quadrilaterals. The four triangles all have area A. Show that the three quadrilaterals have equal area. What is it (in terms of A)?", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 14", "solution_match": ""}} {"year": "1983", "tier": "T1", "problem_label": "15", "problem_type": null, "exam": "AllSovietUnion", "problem": "A group of children form two equal lines side- by- side. Each line contains an equal number of boys and girls. The number of mixed pairs (one boy in one line next to one girl in the other line) equals the number of unmixed pairs (two girls side- by- side or two boys side- by- side). Show that the total number of children in the group is a multiple of 8.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 15", "solution_match": ""}} {"year": "1983", "tier": "T1", "problem_label": "16", "problem_type": null, "exam": "AllSovietUnion", "problem": "A 1 x k rectangle can be divided by two perpendicular lines parallel to the sides into four rectangles, each with area at least 1 and one with area at least 2. What is the smallest possible k?", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 16", "solution_match": ""}} {"year": "1983", "tier": "T1", "problem_label": "17", "problem_type": null, "exam": "AllSovietUnion", "problem": "O is a point inside the triangle ABC. \\(\\mathrm{a} =\\) area OBC, \\(\\mathrm{b} =\\) area OCA, \\(\\mathrm{c} =\\) area OAB. Show that the vector sum \\(\\mathrm{aOA} + \\mathrm{bOB} + \\mathrm{cOC}\\) is zero.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 17", "solution_match": ""}} {"year": "1983", "tier": "T1", "problem_label": "18", "problem_type": null, "exam": "AllSovietUnion", "problem": "Show that given any \\(2\\mathrm{m} + 1\\) different integers lying between - (2m- 1) and 2m- 1 (inclusive) we can always find three whose sum is zero.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 18", "solution_match": ""}} {"year": "1983", "tier": "T1", "problem_label": "19", "problem_type": null, "exam": "AllSovietUnion", "problem": "Interior points D, E, F are chosen on the sides BC, CA, AB (not at the vertices). Let k be the length of the longest side of DEF. Let a, b, c be the lengths of the longest sides of AFE, BDF, CDE respectively. Show that \\(\\mathrm{k}\\geq \\sqrt{3}\\) min(a, b, c) /2. When do we have equality?", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 19", "solution_match": ""}} {"year": "1983", "tier": "T1", "problem_label": "20", "problem_type": null, "exam": "AllSovietUnion", "problem": "X is a union of k disjoint intervals of the real line. It has the property that for any \\(\\mathrm{h}< 1\\) we can find two points of X which are a distance h apart. Show that the sum of the lengths of the intervals in X is at least \\(1 / \\mathrm{k}\\)", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 20", "solution_match": ""}} {"year": "1983", "tier": "T1", "problem_label": "21", "problem_type": null, "exam": "AllSovietUnion", "problem": "x is a real. The decimal representation of x includes all the digits at least once. Let f(n) be the number of distinct n- digit segments in the representation. Show that if for some n we have \\(\\mathrm{f(n)}\\leq \\mathrm{n} + 8\\) , then x is rational.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 21", "solution_match": ""}} {"year": "1984", "tier": "T1", "problem_label": "1", "problem_type": null, "exam": "AllSovietUnion", "problem": "Show that we can find n integers whose sum is 0 and whose product is n iff n is divisible by 4.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 1", "solution_match": ""}} {"year": "1984", "tier": "T1", "problem_label": "2", "problem_type": null, "exam": "AllSovietUnion", "problem": "Show that \\((a + b)^2 /2 + (a + b) / 4 \\geq a\\sqrt{b} + b\\sqrt{a}\\) for all positive a and b. \n\n## Answer \n\nBy AM/GM \\(\\sqrt{(ab)} \\leq (a + b) / 2\\) , so \\(\\sqrt{2} (a + b) + \\sqrt{(ab)} \\leq a + b\\) . Hence \\(\\sqrt{(2a + 2b)} \\geq \\sqrt{a} + \\sqrt{b} (*)\\) . \n\nBy AM/GM \\((a + b) \\geq 2\\sqrt{(ab)}\\) and \\(2(a + b) + 1 \\geq 2\\sqrt{(2a + 2b)}\\) . Multiplying, \\((a + b)(2a + 2b + 1) \\geq 4\\sqrt{(ab)}\\sqrt{(2a + 2b)}\\) . Then using \\((*)\\geq 4\\sqrt{(ab)}(\\sqrt{a} +\\sqrt{b})\\) .", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 2", "solution_match": ""}} {"year": "1984", "tier": "T1", "problem_label": "3", "problem_type": null, "exam": "AllSovietUnion", "problem": "ABC and A'B'C' are equilateral triangles and ABC and A'B'C' have the same sense (both clockwise or both counter- clockwise). Take an arbitrary point O and points P, Q, R so that OP is equal and parallel to AA', OQ is equal and parallel to BB', and OR is equal and parallel to CC'. Show that PQR is equilateral.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 3", "solution_match": ""}} {"year": "1984", "tier": "T1", "problem_label": "4", "problem_type": null, "exam": "AllSovietUnion", "problem": "Take a large number of unit squares, each with one edge red, one edge blue, one edge green, and one edge yellow. For which m, n can we combine mn squares by placing similarly colored edges together to get an m x n rectangle with one side entirely red, another entirely blue, another entirely green, and the fourth entirely yellow.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 4", "solution_match": ""}} {"year": "1984", "tier": "T1", "problem_label": "5", "problem_type": null, "exam": "AllSovietUnion", "problem": "Let \\(\\mathrm{A} = \\cos^2 \\mathrm{a}\\) , \\(\\mathrm{B} = \\sin^2 \\mathrm{a}\\) . Show that for all real a and positive x, y we have \\(\\mathrm{x}^\\mathrm{A}\\mathrm{y}^\\mathrm{B} < \\mathrm{x} + \\mathrm{y}\\) .", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 5", "solution_match": ""}} {"year": "1984", "tier": "T1", "problem_label": "6", "problem_type": null, "exam": "AllSovietUnion", "problem": "Two players play a game. Each takes it in turn to paint three unpainted edges of a cube. The first player uses red paint and the second blue paint. So each player has two moves. The first player wins if he can paint all edges of some face red. Can the first player always win?", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 6", "solution_match": ""}} {"year": "1984", "tier": "T1", "problem_label": "7", "problem_type": null, "exam": "AllSovietUnion", "problem": "\\(\\mathrm{n} > 3\\) positive integers are written in a circle. The sum of the two neighbours of each number divided by the number is an integer. Show that the sum of those integers is at least 2n and less than 3n. For example, if the numbers were 3, 7, 11, 15, 4, 1, 2 (with 2 also adjacent to 3), then the sum would be \\(14 / 7 + 22 / 11 + 15 / 15 + 16 / 4 + 6 / 1 + 4 / 2 + 9 / 3 = 20\\) and \\(14 \\leq 20 < 21\\) .", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 7", "solution_match": ""}} {"year": "1984", "tier": "T1", "problem_label": "8", "problem_type": null, "exam": "AllSovietUnion", "problem": "The incircle of the triangle ABC has center I and touches BC, CA, AB at D, E, F respectively. The segments AI, BI, CI intersect the circle at D', E', F respectively. Show that DD', EE', FF' are collinear.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 8", "solution_match": ""}} {"year": "1984", "tier": "T1", "problem_label": "9", "problem_type": null, "exam": "AllSovietUnion", "problem": "Find all integers m, n such that \\((5 + 3\\sqrt{2})^{\\mathrm{m}} = (3 + 5\\sqrt{2})^{\\mathrm{n}}\\) .", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 9", "solution_match": ""}} {"year": "1984", "tier": "T1", "problem_label": "10", "problem_type": null, "exam": "AllSovietUnion", "problem": "\\(\\mathrm{x_1< x_2< x_3< \\ldots < x_n}\\) . \\(\\mathrm{y_i}\\) is a permutation of the \\(\\mathrm{x_i}\\) . We have that \\(\\mathrm{x_1 + y_1< x_2 + y_2< \\ldots < x_n + }\\) \\(\\mathrm{y_n}\\) . Prove that \\(\\mathrm{x_i = y_i}\\) .", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 10", "solution_match": ""}} {"year": "1984", "tier": "T1", "problem_label": "11", "problem_type": null, "exam": "AllSovietUnion", "problem": "ABC is a triangle and P is any point. The lines PA, PB, PC cut the circumcircle of ABC again at A'B'C' respectively. Show that there are at most eight points P such that A'B'C' is congruent to ABC.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 11", "solution_match": ""}} {"year": "1984", "tier": "T1", "problem_label": "12", "problem_type": null, "exam": "AllSovietUnion", "problem": "The positive reals x, y, z satisfy \\(\\mathrm{x^2 + xy + y^2 / 3 = 25}\\) , \\(\\mathrm{y^2 / 3 + z^2 = 9}\\) , \\(\\mathrm{z^2 + zx + x^2 = 16}\\) . Find the value of \\(\\mathrm{xy + 2yz + 3zx}\\) .", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 12", "solution_match": ""}} {"year": "1984", "tier": "T1", "problem_label": "13", "problem_type": null, "exam": "AllSovietUnion", "problem": "Starting with the polynomial \\(\\mathrm{x^2 + 10x + 20}\\) , a move is to change the coefficient of \\(\\mathrm{x}\\) by 1 or to change the coefficient of \\(\\mathrm{x^0}\\) by 1 (but not both). After a series of moves the polynomial is changed to \\(\\mathrm{x^2 + 20x + 10}\\) . Is it true that at some intermediate point the polynomial had integer roots? \n\n## Answer \n\nYes.", "solution": "We have \\(\\mathrm{x^2 + (n + 1)x + n = (x + n)(x + 1)}\\) , so \\(\\mathrm{x^2 + ax + b}\\) has integer roots if \\(\\mathrm{a = b + 1}\\) (and a and b are integers). But initially a- b is - 10 and it ends up as +10. Each move changes a- b by \\(\\pm 1\\) , so it must pass through all values between - 10 and +10.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 13", "solution_match": "# Solution"}} {"year": "1984", "tier": "T1", "problem_label": "14", "problem_type": null, "exam": "AllSovietUnion", "problem": "The center of a coin radius r traces out a polygon with perimeter p which has an incircle radius \\(\\mathrm{R > r}\\) . What is the area of the figure traced out by the coin?", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 14", "solution_match": ""}} {"year": "1984", "tier": "T1", "problem_label": "15", "problem_type": null, "exam": "AllSovietUnion", "problem": "Each weight in a set of n has integral weight and the total weight of the set is 2n. A balance is initially empty. We then place the weights onto a pan of the balance one at a time. Each time we place the heaviest weight not yet placed. If the pans balance, then we place the weight\n\n\n\nonto the left pan. Otherwise, we place the weight onto the lighter pan. Show that when all the weights have been placed, the scales will balance. [For example, if the weights are 2, 2, 1, 1. Then we must place 2 in the left pan, followed by 2 in the right pan, followed by 1 in the left pan, followed by 1 in the right pan.]", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 15", "solution_match": ""}} {"year": "1984", "tier": "T1", "problem_label": "16", "problem_type": null, "exam": "AllSovietUnion", "problem": "A number is prime however we order its digits. Show that it cannot contain more than three different digits. For example, 337 satisfies the conditions because 337, 373 and 733 are all prime.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 16", "solution_match": ""}} {"year": "1984", "tier": "T1", "problem_label": "17", "problem_type": null, "exam": "AllSovietUnion", "problem": "Find all pairs of digits (b, c) such that the number b ... b6c ... c4, where there are n bs and n cs is a square for all positive integers n.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 17", "solution_match": ""}} {"year": "1984", "tier": "T1", "problem_label": "18", "problem_type": null, "exam": "AllSovietUnion", "problem": "A, B, C and D lie on a line in that order. Show that if X does not lie on the line then \\(\\vert \\mathrm{XA}\\vert +\\) \\(\\vert \\mathrm{XD}\\vert + \\vert \\vert \\mathrm{AB}\\vert - \\vert \\mathrm{CD}\\vert \\vert >\\vert \\mathrm{XB}\\vert +\\vert \\mathrm{XC}\\vert\\)", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 18", "solution_match": ""}} {"year": "1984", "tier": "T1", "problem_label": "19", "problem_type": null, "exam": "AllSovietUnion", "problem": "The real sequence \\(\\mathbf{x}_{\\mathrm{n}}\\) is defined by \\(\\mathbf{x}_{1} = 1\\) \\(\\mathbf{x}_{2} = 1\\) \\(\\mathbf{x}_{\\mathrm{n} + 2} = \\mathbf{x}_{\\mathrm{n} + 1}{}^{2} - \\mathbf{x}_{\\mathrm{n}} / 2\\) . Show that the sequence converges and find the limit.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 19", "solution_match": ""}} {"year": "1984", "tier": "T1", "problem_label": "20", "problem_type": null, "exam": "AllSovietUnion", "problem": "The squares of a 1983 x 1984 chess board are colored alternately black and white in the usual way. Each white square is given the number 1 or the number - 1. For each black square the product of the numbers in the neighbouring white squares is 1. Show that all the numbers must be 1.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 20", "solution_match": ""}} {"year": "1984", "tier": "T1", "problem_label": "21", "problem_type": null, "exam": "AllSovietUnion", "problem": "A 3 x 3 chess board is colored alternately black and white in the usual way with the center square white. Each white square is given the number 1 or the number - 1. A move consists of simultaneously changing each number to the product of the adjacent numbers. So the four corner squares are each changed to the number previously in the center square and the center square is changed to the product of the four numbers in the corners. Show that after finitely many moves all numbers are 1.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 21", "solution_match": ""}} {"year": "1984", "tier": "T1", "problem_label": "22", "problem_type": null, "exam": "AllSovietUnion", "problem": "Is In 1.01 greater or less than 2/201?", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 22", "solution_match": ""}} {"year": "1984", "tier": "T1", "problem_label": "23", "problem_type": null, "exam": "AllSovietUnion", "problem": "\\(\\mathbf{C}_{1}\\) , \\(\\mathbf{C}_{2}\\) , \\(\\mathbf{C}_{3}\\) are circles with radii \\(\\mathbf{r}_{1}\\) , \\(\\mathbf{r}_{2}\\) , \\(\\mathbf{r}_{3}\\) respectively. The circles do not intersect and no circle lies inside any other circle. \\(\\mathbf{C}_{1}\\) is larger than the other two. The two outer common tangents to \\(\\mathbf{C}_{1}\\) and \\(\\mathbf{C}_{2}\\) meet at A (\"outer\" means that the points where the tangent touches the two circles\n\n\n\nlie on the same side of the line of centers). The two outer common tangents to \\(C_1\\) and \\(C_3\\) intersect at B. The two tangents from A to \\(C_3\\) and the two tangents from B to \\(C_2\\) form a quadrangle. Show that it has an inscribed circle and find its radius.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 23", "solution_match": ""}} {"year": "1984", "tier": "T1", "problem_label": "24", "problem_type": null, "exam": "AllSovietUnion", "problem": "Show that any cross- section of a cube through its center has area not less than the area of a face.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 24", "solution_match": ""}} {"year": "1985", "tier": "T1", "problem_label": "1", "problem_type": null, "exam": "AllSovietUnion", "problem": "ABC is an acute angled triangle. The midpoints of BC, CA and AB are D, E, F respectively. Perpendiculars are drawn from D to AB and CA, from E to BC and AB, and from F to CA and BC. The perpendiculars form a hexagon. Show that its area is half the area of the triangle.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 1", "solution_match": ""}} {"year": "1985", "tier": "T1", "problem_label": "2", "problem_type": null, "exam": "AllSovietUnion", "problem": "Is there an integer n such that the sum of the (decimal) digits of n is 1000 and the sum of the squares of the digits is \\(1000^{2}\\) ?", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 2", "solution_match": ""}} {"year": "1985", "tier": "T1", "problem_label": "3", "problem_type": null, "exam": "AllSovietUnion", "problem": "An \\(8 \\times 8\\) chess- board is colored in the usual way. What is the largest number of pieces can be placed on the black squares (at most one per square), so that each piece can be taken by at least one other? A piece A can take another piece B if they are (diagonally) adjacent and the square adjacent to B and opposite to A is empty.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 3", "solution_match": ""}} {"year": "1985", "tier": "T1", "problem_label": "4", "problem_type": null, "exam": "AllSovietUnion", "problem": "Call a side or diagonal of a regular n- gon a segment. How many colors are required to paint all the segments of a regular n- gon, so that each segment has a single color and every two segments with a vertex in common have different colors.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 4", "solution_match": ""}} {"year": "1985", "tier": "T1", "problem_label": "5", "problem_type": null, "exam": "AllSovietUnion", "problem": "Given a line L and a point O not on the line, can we move an arbitrary point X to O using only rotations about O and reflections in L?", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 5", "solution_match": ""}} {"year": "1985", "tier": "T1", "problem_label": "6", "problem_type": null, "exam": "AllSovietUnion", "problem": "The quadratic \\(\\mathrm{p}(\\mathrm{x}) = \\mathrm{ax}^{2} + \\mathrm{bx} + \\mathrm{c}\\) has a \\(>100\\) . What is the maximum possible number of integer values x such that \\(\\mathrm{lp}(\\mathrm{x})< 50\\) ?", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 6", "solution_match": ""}} {"year": "1985", "tier": "T1", "problem_label": "7", "problem_type": null, "exam": "AllSovietUnion", "problem": "In the diagram below a, b, c, d, e, f, g, h, i, j are distinct positive integers and each (except a, e, h and j) is the sum of the two numbers to the left and above. For example, \\(\\mathrm{b} = \\mathrm{a} + \\mathrm{e}\\) , \\(\\mathrm{f} = \\mathrm{e} + \\mathrm{h}\\) , \\(\\mathrm{i} = \\mathrm{h} + \\mathrm{j}\\) . What is the smallest possible value of d? \n\nh i e f g a b c d", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 7", "solution_match": ""}} {"year": "1985", "tier": "T1", "problem_label": "8", "problem_type": null, "exam": "AllSovietUnion", "problem": "\\(\\mathrm{a}_{1}< \\mathrm{a}_{2}< \\ldots < \\mathrm{a}_{\\mathrm{n}}< \\ldots\\) is an unbounded sequence of positive reals. Show that there exists k such that \\(\\mathrm{a}_{1} / \\mathrm{a}_{2} + \\mathrm{a}_{2} / \\mathrm{a}_{3} + \\ldots + \\mathrm{a}_{\\mathrm{h}} / \\mathrm{a}_{\\mathrm{h} + 1}< \\mathrm{h} - 1\\) for all \\(\\mathrm{h} > \\mathrm{k}\\) . Show that we can also find a k such that \\(\\mathrm{a}_{1} / \\mathrm{a}_{2} + \\mathrm{a}_{2} / \\mathrm{a}_{3} + \\ldots + \\mathrm{a}_{\\mathrm{h}} / \\mathrm{a}_{\\mathrm{h} + 1}< \\mathrm{h} - 1985\\) for all \\(\\mathrm{h} > \\mathrm{k}\\) .", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 8", "solution_match": ""}} {"year": "1985", "tier": "T1", "problem_label": "9", "problem_type": null, "exam": "AllSovietUnion", "problem": "Find all pairs (x, y) such that \\(\\mathrm{Isin x - sin y| + sin x sin y< = 0}\\)", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 9", "solution_match": ""}} {"year": "1985", "tier": "T1", "problem_label": "10", "problem_type": null, "exam": "AllSovietUnion", "problem": "ABCDE is a convex pentagon. A' is chosen so that B is the midpoint of AA', B' is chosen so that C is the midpoint of BB' and so on. Given A', B', C', D', E', how do we construct ABCDE using ruler and compasses?", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 10", "solution_match": ""}} {"year": "1985", "tier": "T1", "problem_label": "11", "problem_type": null, "exam": "AllSovietUnion", "problem": "The sequence \\(\\mathrm{a_1,a_2,a_3,\\ldots}\\) satisfies \\(\\mathrm{a_{4n + 1} = 1}\\) \\(\\mathrm{a_{4n + 3} = 0}\\) \\(\\mathrm{a_{2n} = a_n}\\) . Show that it is not periodic.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 11", "solution_match": ""}} {"year": "1985", "tier": "T1", "problem_label": "12", "problem_type": null, "exam": "AllSovietUnion", "problem": "n lines are drawn in the plane. Some of the resulting regions are colored black, no pair of painted regions have a boundary line in common (but they may have a common vertex). Show that at most \\((\\mathrm{n}^2 +\\mathrm{n}) / 3\\) regions are black.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 12", "solution_match": ""}} {"year": "1985", "tier": "T1", "problem_label": "13", "problem_type": null, "exam": "AllSovietUnion", "problem": "Each face of a cube is painted a different color. The same colors are used to paint every face of a cubical box a different color. Show that the cube can always be placed in the box, so that every face is a different color from the box face it is in contact with.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 13", "solution_match": ""}} {"year": "1985", "tier": "T1", "problem_label": "14", "problem_type": null, "exam": "AllSovietUnion", "problem": "The points A, B, C, D, E, F are equally spaced on the circumference of a circle (in that order) and AF is a diameter. The center is O. OC and OD meet BE at M and N respectively. Show that \\(\\mathrm{MN} + \\mathrm{CD} = \\mathrm{OA}\\) .", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 14", "solution_match": ""}} {"year": "1985", "tier": "T1", "problem_label": "15", "problem_type": null, "exam": "AllSovietUnion", "problem": "A move replaces the real numbers a, b, c, d by a- b, b- c, c- d, d- a. If a, b, c, d are not all equal, show that at least one of the numbers can exceed 1985 after a finite number of moves.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 15", "solution_match": ""}} {"year": "1985", "tier": "T1", "problem_label": "16", "problem_type": null, "exam": "AllSovietUnion", "problem": "\\(\\mathrm{a_1< a_2< \\ldots < a_n}\\) and \\(\\mathrm{b_1 > b_2 > \\ldots > b_n}\\) . Taken together the \\(\\mathrm{a_i}\\) and \\(\\mathrm{b_i}\\) constitute the numbers 1, 2, ..., 2n. Show that \\(\\mathrm{la_1 - b_1| + la_2 - b_2| + \\ldots + la_n - b_n| = n^2}\\) .", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 16", "solution_match": ""}} {"year": "1985", "tier": "T1", "problem_label": "17", "problem_type": null, "exam": "AllSovietUnion", "problem": "An r x s x t cuboid is divided into rst unit cubes. Three faces of the cuboid, having a common vertex, are colored. As a result exactly half the unit cubes have at least one face colored. What is the total number of unit cubes?", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 17", "solution_match": ""}} {"year": "1985", "tier": "T1", "problem_label": "18", "problem_type": null, "exam": "AllSovietUnion", "problem": "ABCD is a parallelogram. A circle through A and B has radius R. A circle through B and D has radius R and meets the first circle again at M. Show that the circumradius of AMD is R.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 18", "solution_match": ""}} {"year": "1985", "tier": "T1", "problem_label": "19", "problem_type": null, "exam": "AllSovietUnion", "problem": "A regular hexagon is divided into 24 equilateral triangles by lines parallel to its sides. 19 different numbers are assigned to the 19 vertices. Show that at least 7 of the 24 triangles have the property that the numbers assigned to its vertices increase counterclockwise.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 19", "solution_match": ""}} {"year": "1985", "tier": "T1", "problem_label": "20", "problem_type": null, "exam": "AllSovietUnion", "problem": "\\(\\mathrm{x}\\) is a real number. Define \\(\\mathrm{x}_0 = 1 + \\sqrt{(1 + \\mathrm{x})}\\) , \\(\\mathrm{x}_1 = 2 + \\mathrm{x} / \\mathrm{x}_0\\) , \\(\\mathrm{x}_2 = 2 + \\mathrm{x} / \\mathrm{x}_1\\) , ..., \\(\\mathrm{x}_{1985} = 2 + \\mathrm{x} / \\mathrm{x}_{1984}\\) . Find all solutions to \\(\\mathrm{x}_{1985} = \\mathrm{x}\\) . \n\n## Answer \n\n3", "solution": "If \\(\\mathrm{x} = 0\\) , then \\(\\mathrm{x}^{1985} = 2 \\neq \\mathrm{x}\\) . Otherwise we find \\(\\mathrm{x}_1 = 2 + \\mathrm{x} / (1 + \\sqrt{(1 + \\mathrm{x})}) = 2 + (\\sqrt{(1 + \\mathrm{x})} - 1) = 1 + \\sqrt{(1 + \\mathrm{x})}\\) . Hence \\(\\mathrm{x}_{1985} = 1 + \\sqrt{(1 + \\mathrm{x})}\\) . So \\(\\mathrm{x} - 1 = \\sqrt{(1 + \\mathrm{x})}\\) . Squaring, \\(\\mathrm{x} = 0\\) or 3. We have already ruled out \\(\\mathrm{x} = 0\\) . It is easy to check that \\(\\mathrm{x} = 3\\) is a solution.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 20", "solution_match": "# Solution"}} {"year": "1985", "tier": "T1", "problem_label": "20", "problem_type": null, "exam": "AllSovietUnion", "problem": "\\(\\mathrm{x}\\) is a real number. Define \\(\\mathrm{x}_0 = 1 + \\sqrt{(1 + \\mathrm{x})}\\) , \\(\\mathrm{x}_1 = 2 + \\mathrm{x} / \\mathrm{x}_0\\) , \\(\\mathrm{x}_2 = 2 + \\mathrm{x} / \\mathrm{x}_1\\) , ..., \\(\\mathrm{x}_{1985} = 2 + \\mathrm{x} / \\mathrm{x}_{1984}\\) . Find all solutions to \\(\\mathrm{x}_{1985} = \\mathrm{x}\\) .", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 20", "solution_match": ""}} {"year": "1985", "tier": "T1", "problem_label": "21", "problem_type": null, "exam": "AllSovietUnion", "problem": "A regular pentagon has side 1. All points whose distance from every vertex is less than 1 are deleted. Find the area remaining.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 21", "solution_match": ""}} {"year": "1985", "tier": "T1", "problem_label": "22", "problem_type": null, "exam": "AllSovietUnion", "problem": "Given a large sheet of squared paper, show that for \\(\\mathrm{n} > 12\\) you can cut along the grid lines to get a rectangle of more than \\(\\mathrm{n}\\) unit squares such that it is impossible to cut it along the grid lines to get a rectangle of \\(\\mathrm{n}\\) unit squares from it.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 22", "solution_match": ""}} {"year": "1985", "tier": "T1", "problem_label": "23", "problem_type": null, "exam": "AllSovietUnion", "problem": "The cube ABCDA'B'C'D' has unit edges. Find the distance between the circle circumscribed about the base ABCD and the circumcircle of ABC.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 23", "solution_match": ""}} {"year": "1986", "tier": "T1", "problem_label": "1", "problem_type": null, "exam": "AllSovietUnion", "problem": "The quadratic \\(\\mathbf{x}^{2} + \\mathbf{ax} + \\mathbf{b} + 1\\) has roots which are positive integers. Show that \\((\\mathbf{a}^{2} + \\mathbf{b}^{2})\\) is composite.", "solution": "Let the roots be c, d, so c + d = - a, cd = b+1. Hence a² + b² = (c² + 1)(d² + 1).", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 1", "solution_match": "# Solution"}} {"year": "1986", "tier": "T1", "problem_label": "2", "problem_type": null, "exam": "AllSovietUnion", "problem": "Two equal squares, one with blue sides and one with red sides, intersect to give an octagon with sides alternately red and blue. Show that the sum of the octagon's red side lengths equals the sum of its blue side lengths.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 2", "solution_match": ""}} {"year": "1986", "tier": "T1", "problem_label": "3", "problem_type": null, "exam": "AllSovietUnion", "problem": "ABC is acute- angled. What point P on the segment BC gives the minimal area for the intersection of the circumcircles of ABP and ACP?", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 3", "solution_match": ""}} {"year": "1986", "tier": "T1", "problem_label": "4", "problem_type": null, "exam": "AllSovietUnion", "problem": "Given n points can one build n- 1 roads, so that each road joins two points, the shortest distance between any two points along the roads belongs to {1, 2, 3, ..., n(n- 1)/2 }, and given any element of {1, 2, 3, ..., n(n- 1)/2 } one can find two points such that the shortest distance between them along the roads is that element?", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 4", "solution_match": ""}} {"year": "1986", "tier": "T1", "problem_label": "5", "problem_type": null, "exam": "AllSovietUnion", "problem": "Prove that there is no convex quadrilateral with vertices at lattice points so that one diagonal has twice the length of the other and the angle between them is 45 degrees.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 5", "solution_match": ""}} {"year": "1986", "tier": "T1", "problem_label": "6", "problem_type": null, "exam": "AllSovietUnion", "problem": "Prove that we can find an m x n array of squares so that the sum of each row and the sum of each column is also a square.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 6", "solution_match": ""}} {"year": "1986", "tier": "T1", "problem_label": "7", "problem_type": null, "exam": "AllSovietUnion", "problem": "Two circles intersect at P and Q. A is a point on one of the circles. The lines AP and AQ meet the other circle at B and C respectively. Show that the circumradius of ABC equals the distance between the centers of the two circles. Find the locus of the circumcircle as A varies.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 7", "solution_match": ""}} {"year": "1986", "tier": "T1", "problem_label": "8", "problem_type": null, "exam": "AllSovietUnion", "problem": "A regular hexagon has side 1000. Each side is divided into 1000 equal parts. Let S be the set of the vertices and all the subdividing points. All possible lines parallel to the sides and with endpoints in S are drawn, so that the hexagon is divided into equilateral triangles with side 1.\n\n\n\nLet X be the set of all vertices of these triangles. We now paint any three unpainted members of X which form an equilateral triangle (of any size). We then repeat until every member of X except one is painted. Show that the unpainted vertex is not a vertex of the original hexagon.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 8", "solution_match": ""}} {"year": "1986", "tier": "T1", "problem_label": "9", "problem_type": null, "exam": "AllSovietUnion", "problem": "Let \\(\\mathrm{d(n)}\\) be the number of (positive integral) divisors of n. For example, \\(\\mathrm{d}(12) = 6\\) . Find all n such that \\(\\mathrm{n} = \\mathrm{d}(\\mathrm{n})^2\\) .", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 9", "solution_match": ""}} {"year": "1986", "tier": "T1", "problem_label": "10", "problem_type": null, "exam": "AllSovietUnion", "problem": "Show that for all positive reals \\(\\mathbf{x}_{\\mathrm{i}}\\) we have \\(1 / \\mathbf{x}_{1} + 1 / (\\mathbf{x}_{1} + \\mathbf{x}_{2}) + \\ldots +\\mathbf{n} / (\\mathbf{x}_{1} + \\ldots +\\mathbf{x}_{\\mathrm{n}}) < 4 / \\mathbf{a}_{1} + 4 / \\mathbf{a}_{2} + \\ldots +4 / \\mathbf{a}_{\\mathrm{n}}\\) .", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 10", "solution_match": ""}} {"year": "1986", "tier": "T1", "problem_label": "11", "problem_type": null, "exam": "AllSovietUnion", "problem": "ABC is a triangle with \\(\\mathrm{AB} \\neq \\mathrm{AC}\\) . Show that for each line through A, there is at most one point X on the line (excluding A, B, C) with \\(\\angle \\mathrm{ABX} = \\angle \\mathrm{ACX}\\) . Which lines contain no such points X?", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 11", "solution_match": ""}} {"year": "1986", "tier": "T1", "problem_label": "12", "problem_type": null, "exam": "AllSovietUnion", "problem": "An n x n x n cube is divided into \\(\\mathrm{n}^3\\) unit cubes. Show that we can assign a different integer to each unit cube so that the sum of each of the \\(3\\mathrm{n}^2\\) rows parallel to an edge is zero.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 12", "solution_match": ""}} {"year": "1986", "tier": "T1", "problem_label": "13", "problem_type": null, "exam": "AllSovietUnion", "problem": "Find all positive integers a, b, c so that \\(\\mathrm{a}^2 + \\mathrm{b} = \\mathrm{c}\\) and a has \\(\\mathrm{n} > 1\\) decimal digits all the same, b has n decimal digits all the same, and c has 2n decimal digits all the same.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 13", "solution_match": ""}} {"year": "1986", "tier": "T1", "problem_label": "14", "problem_type": null, "exam": "AllSovietUnion", "problem": "Two points A and B are inside a convex 12- gon. Show that if the sum of the distances from A to each vertex is a and the sum of the distances from B to each vertex is b, then \\(\\mathrm{la} - \\mathrm{bl} < 10\\) |AB|.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 14", "solution_match": ""}} {"year": "1986", "tier": "T1", "problem_label": "15", "problem_type": null, "exam": "AllSovietUnion", "problem": "There are 30 cups each containing milk. An elf is able to transfer milk from one cup to another so that the amount of milk in the two cups is equalised. Is there an initial distribution of milk so that the elf cannot equalise the amount in all the cups by a finite number of such transfers?", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 15", "solution_match": ""}} {"year": "1986", "tier": "T1", "problem_label": "16", "problem_type": null, "exam": "AllSovietUnion", "problem": "A \\(99 \\times 100\\) chess board is colored in the usual way with alternate squares black and white. What fraction of the main diagonal is black? What if the board is \\(99 \\times 101\\) ?", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 16", "solution_match": ""}} {"year": "1986", "tier": "T1", "problem_label": "17", "problem_type": null, "exam": "AllSovietUnion", "problem": "\\(\\mathrm{A_1A_2\\ldots A_n}\\) is a regular n- gon and P is an arbitrary point in the plane. Show that if n is even we can choose signs so that the vector sum \\(\\pm \\mathrm{PA}_1\\pm \\mathrm{PA}_2\\pm \\ldots \\pm \\mathrm{PA}_\\mathrm{n} = 0\\) , but if n is odd, then this is only possible for finitely many points P.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 17", "solution_match": ""}} {"year": "1986", "tier": "T1", "problem_label": "18", "problem_type": null, "exam": "AllSovietUnion", "problem": "A 1 or a - 1 is put into each cell of an n x n array as follows. A - 1 is put into each of the cells around the perimeter. An unoccupied cell is then chosen arbitrarily. It is given the product of the four cells which are closest to it in each of the four directions. For example, if the cells below containing a number or letter (except x) are filled and we decide to fill x next, then x gets the product of a, b, c and d. \n\n- 1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 a 1 -1 c x d -1 -1 -1 b -1 -1 -1 -1 \n\nWhat is the minimum and maximum number of 1s that can be obtained?", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 18", "solution_match": ""}} {"year": "1986", "tier": "T1", "problem_label": "19", "problem_type": null, "exam": "AllSovietUnion", "problem": "Prove that \\(\\mathrm{Isin} 1\\mathrm{l} + \\mathrm{Isin} 2\\mathrm{l} + \\ldots + \\mathrm{Isin} 3\\mathrm{nl} > 8\\mathrm{n} / 5\\)", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 19", "solution_match": ""}} {"year": "1986", "tier": "T1", "problem_label": "20", "problem_type": null, "exam": "AllSovietUnion", "problem": "Let S be the set of all numbers which can be written as 1/mn, where m and n are positive integers not exceeding 1986. Show that the sum of the elements of S is not an integer.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 20", "solution_match": ""}} {"year": "1986", "tier": "T1", "problem_label": "21", "problem_type": null, "exam": "AllSovietUnion", "problem": "The incircle of a triangle has radius 1. It also lies inside a square and touches each side of the square. Show that the area inside both the square and the triangle is at least 3.4. Is it at least 3.5?", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 21", "solution_match": ""}} {"year": "1986", "tier": "T1", "problem_label": "22", "problem_type": null, "exam": "AllSovietUnion", "problem": "How many polynomials \\(\\mathrm{p(x)}\\) have all coefficients 0, 1, 2 or 3 and take the value n at \\(\\mathrm{x} = 2\\) ?", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 22", "solution_match": ""}} {"year": "1986", "tier": "T1", "problem_label": "23", "problem_type": null, "exam": "AllSovietUnion", "problem": "A and B are fixed points outside a sphere S. X and Y are chosen so that S is inscribed in the tetrahedron ABXY. Show that the sum of the angles AXB, XBY, BYA and YAX is independent of X and Y.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 23", "solution_match": ""}} {"year": "1987", "tier": "T1", "problem_label": "1", "problem_type": null, "exam": "AllSovietUnion", "problem": "Ten players play in a tournament. Each pair plays one match, which results in a win or loss. If the ith player wins \\(\\mathbf{a}_{\\mathrm{i}}\\) matches and loses \\(\\mathbf{b}_{\\mathrm{i}}\\) matches, show that \\(\\sum \\mathbf{a}_{\\mathrm{i}}^{2} = \\sum \\mathbf{b}_{\\mathrm{i}}^{2}\\) .", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 1", "solution_match": ""}} {"year": "1987", "tier": "T1", "problem_label": "2", "problem_type": null, "exam": "AllSovietUnion", "problem": "Find all sets of 6 weights such that for each of \\(\\mathrm{n} = 1,2,3,\\ldots ,63\\) , there is a subset of weights weighing n.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 2", "solution_match": ""}} {"year": "1987", "tier": "T1", "problem_label": "3", "problem_type": null, "exam": "AllSovietUnion", "problem": "ABCDEFG is a regular 7- gon. Prove that \\(1 / \\mathrm{AB} = 1 / \\mathrm{AC} + 1 / \\mathrm{AD}\\) .", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 3", "solution_match": ""}} {"year": "1987", "tier": "T1", "problem_label": "4", "problem_type": null, "exam": "AllSovietUnion", "problem": "Your opponent has chosen a 1 x 4 rectangle on a 7 x 7 board. At each move you are allowed to ask whether a particular square of the board belongs to his rectangle. How many questions do you need to be certain of identifying the rectangle. How many questions are needed for a 2 x 2 rectangle?", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 4", "solution_match": ""}} {"year": "1987", "tier": "T1", "problem_label": "5", "problem_type": null, "exam": "AllSovietUnion", "problem": "Prove that \\(1^{1987} + 2^{1987} + \\ldots + \\mathrm{n}^{1987}\\) is divisible by \\(\\mathrm{n} + 2\\) .", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 5", "solution_match": ""}} {"year": "1987", "tier": "T1", "problem_label": "6", "problem_type": null, "exam": "AllSovietUnion", "problem": "An L is an arrangement of 3 adjacent unit squares formed by deleting one unit square from a 2 x 2 square. How many Ls can be placed on an 8 x 8 board (with no interior points overlapping)? Show that if any one square is deleted from a 1987 x 1987 board, then the remaining squares can be covered with Ls (with no interior points overlapping).", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 6", "solution_match": ""}} {"year": "1987", "tier": "T1", "problem_label": "7", "problem_type": null, "exam": "AllSovietUnion", "problem": "Squares ABC'C\", BCA'A\", CAB'B\" are constructed on the outside of the sides of the triangle ABC. The line A'A\" meets the lines AB and AC at P and P'. Similarly, the line B'B\" meets the lines BC and BA at Q and Q', and the line C'C\" meets the lines CA and CB at R and R'. Show that P, P', Q, Q', R and R' lie on a circle.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 7", "solution_match": ""}} {"year": "1987", "tier": "T1", "problem_label": "8", "problem_type": null, "exam": "AllSovietUnion", "problem": "\\(\\mathrm{A_1,A_2,\\ldots,A_{2m + 1}}\\) and \\(\\mathbf{B}_1,\\mathbf{B}_2,\\ldots ,\\mathbf{B}_{2n + 1}\\) are points in the plane such that the \\(2\\mathrm{m} + 2\\mathrm{n} + 2\\) lines \\(\\mathrm{A_1A_2,A_2A_3,\\ldots,A_{2m}A_{2m + 1},A_{2m + 1}A_1,B_1B_2,B_2B_3,\\ldots,B_{2n}B_{2n + 1},B_{2n + 1}B_1}\\) are all different and no three of them are concurrent. Show that we can find i and j such that \\(\\mathrm{A_iA_{i + 1}}\\) \\(\\mathrm{B_iB_{j + 1}}\\) are opposite sides of a convex quadrilateral (if \\(\\mathrm{i} = 2\\mathrm{m} + 1\\) , then we take \\(\\mathrm{A_{i + 1}}\\) to be \\(\\mathrm{A_1}\\) . Similarly for \\(\\mathrm{j} = 2\\mathrm{n} + 1\\) ).", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 8", "solution_match": ""}} {"year": "1987", "tier": "T1", "problem_label": "9", "problem_type": null, "exam": "AllSovietUnion", "problem": "Find 5 different relatively prime numbers, so that the sum of any subset of them is composite.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 9", "solution_match": ""}} {"year": "1987", "tier": "T1", "problem_label": "10", "problem_type": null, "exam": "AllSovietUnion", "problem": "ABCDE is a convex pentagon with \\(\\angle ABC = \\angle ADE\\) and \\(\\angle AEC = \\angle ADB\\) . Show that \\(\\angle BAC = \\angle DAE\\) .", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 10", "solution_match": ""}} {"year": "1987", "tier": "T1", "problem_label": "11", "problem_type": null, "exam": "AllSovietUnion", "problem": "Show that there is a real number x such that all of cos x, cos 2x, cos 4x, ... cos \\((2^{n}x)\\) are negative.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 11", "solution_match": ""}} {"year": "1987", "tier": "T1", "problem_label": "12", "problem_type": null, "exam": "AllSovietUnion", "problem": "The positive reals a, b, c, x, y, z satisfy a + x = b + y = c + z = k. Show that ax + by + cz ≤ k².", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 12", "solution_match": ""}} {"year": "1987", "tier": "T1", "problem_label": "13", "problem_type": null, "exam": "AllSovietUnion", "problem": "A real number with absolute value at most 1 is put in each square of a 1987 x 1987 board. The sum of the numbers in each 2 x 2 square is 0. Show that the sum of all the numbers does not exceed 1987.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 13", "solution_match": ""}} {"year": "1987", "tier": "T1", "problem_label": "14", "problem_type": null, "exam": "AllSovietUnion", "problem": "AB is a chord of the circle center O. P is a point outside the circle and C is a point on the chord. The angle bisector of APC is perpendicular to AB and a distance d from O. Show that BC = 2d.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 14", "solution_match": ""}} {"year": "1987", "tier": "T1", "problem_label": "15", "problem_type": null, "exam": "AllSovietUnion", "problem": "Players take turns in choosing numbers from the set {1, 2, 3, ..., n}. Once m has been chosen, no divisor of m may be chosen. The first player unable to choose a number loses. Who has a winning strategy for n = 10? For n = 1000?", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 15", "solution_match": ""}} {"year": "1987", "tier": "T1", "problem_label": "16", "problem_type": null, "exam": "AllSovietUnion", "problem": "What is the smallest number of subsets of S = {1, 2, ..., 33}, such that each subset has size 9 or 10 and each member of S belongs to the same number of subsets?", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 16", "solution_match": ""}} {"year": "1987", "tier": "T1", "problem_label": "17", "problem_type": null, "exam": "AllSovietUnion", "problem": "Some lattice points in the plane are marked. S is a set of non- zero vectors. If you take any one of the marked points P and add place each vector in S with its beginning at P, then more vectors will have their ends on marked points than not. Show that there are an infinite number of points.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 17", "solution_match": ""}} {"year": "1987", "tier": "T1", "problem_label": "18", "problem_type": null, "exam": "AllSovietUnion", "problem": "A convex pentagon is cut along all its diagonals to give 11 pieces. Show that the pieces cannot all have equal areas.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 18", "solution_match": ""}} {"year": "1987", "tier": "T1", "problem_label": "19", "problem_type": null, "exam": "AllSovietUnion", "problem": "The set \\(\\mathrm{S}_0 = \\{1,2!4!8!16!,\\ldots \\}\\) . The set \\(\\mathrm{S}_{\\mathrm{n + 1}}\\) consists of all finite sums of distinct elements of \\(\\mathrm{S}_{\\mathrm{n}}\\) . Show that there is a positive integer not in \\(\\mathrm{S}_{1987}\\) .", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 19", "solution_match": ""}} {"year": "1987", "tier": "T1", "problem_label": "20", "problem_type": null, "exam": "AllSovietUnion", "problem": "If the graph of the function \\(\\mathrm{f} = \\mathrm{f}(\\mathrm{x})\\) is rotated through 90 degrees about the origin, then it is not changed. Show that there is a unique solution to \\(\\mathrm{f}(\\mathrm{b}) = \\mathrm{b}\\) . Give an example of such a function.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 20", "solution_match": ""}} {"year": "1987", "tier": "T1", "problem_label": "21", "problem_type": null, "exam": "AllSovietUnion", "problem": "A convex polyhedron has all its faces triangles. Show that it is possible to color some edges red and the others blue so that given any two vertices one can always find a path between them along the red edges and another path between them along the blue edges.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 21", "solution_match": ""}} {"year": "1987", "tier": "T1", "problem_label": "22", "problem_type": null, "exam": "AllSovietUnion", "problem": "Show that \\((2\\mathrm{n} + 1)^{\\mathrm{n}}\\geq (2\\mathrm{n})^{\\mathrm{n}} + (2\\mathrm{n} - 1)^{\\mathrm{n}}\\) for every positive integer n.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 22", "solution_match": ""}} {"year": "1988", "tier": "T1", "problem_label": "1", "problem_type": null, "exam": "AllSovietUnion", "problem": "A book contains 30 stories. Each story has a different number of pages under 31. The first story starts on page 1 and each story starts on a new page. What is the largest possible number of stories that can begin on odd page numbers?", "solution": "Answer: 23. \n\nCall stories with an odd number of pages odd stories and stories with an even number of pages even stories. There are 15 odd stories and 15 even stories. The odd stories change the parity of the starting page (in the sense that the following story starts on a page of opposite parity), whereas the even stories do not. So the odd stories must start alternately on odd and even pages. Hence 8 of them must start on odd pages and 7 on even pages (irrespective of how the stories are arranged). We can, however, control the even stories. In particular, if we put each of them after an even number of odd stories, then they will all begin on odd pages. For example, we could put them all first (before any of the odd stories).", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 1", "solution_match": "# Solution"}} {"year": "1988", "tier": "T1", "problem_label": "2", "problem_type": null, "exam": "AllSovietUnion", "problem": "ABCD is a convex quadrilateral. The midpoints of the diagonals and the midpoints of AB and CD form another convex quadrilateral Q. The midpoints of the diagonals and the midpoints of BC and CA form a third convex quadrilateral Q'. The areas of Q and Q' are equal. Show that either AC or BD divides ABCD into two parts of equal area.", "solution": "Note that Q is a parallelogram because each side is formed by joining the midpoints of two sides of a triangle, so it is parallel to and half the length of the base of the triangle. But the triangles corresponding to opposite sides have the same base. Hence opposite sides of Q are parallel and equal. Similarly Q'. \n\nLet the midpoints of the diagonals be X, Y. Take two adjacent side midpoints which are on the same side of the line XY. Suppose they are M, the midpoint of AB, and N, the midpoint of BC. Suppose also that X is the midpoint of BD, and Y the midpoint of AC. If X does not lie on AC, then we may assume it lies on the same side of AC as M and N (if not just consider the other two midpoints instead of M and N). So the line parallel to XY through M cuts the altitude from N of NXY. So XYM has the same base XY as XYN, but smaller height, so it has smaller area. Hence the two parallelograms also have different areas. Contradiction. So X must lie on AC. But AX bisects ABD and CX bisects CBD, so AC bisects ABD and CBD and hence ABCD.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 2", "solution_match": "# Solution"}} {"year": "1988", "tier": "T1", "problem_label": "3", "problem_type": null, "exam": "AllSovietUnion", "problem": "Show that there are infinitely many triples of distinct positive integers a, b, c such that each divides the product of the other two and a + b = c + 1.", "solution": "\\[\\mathrm{n(n + 1), n(n^2 + n - 1), (n + 1)(n^2 + n - 1).}\\]", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 3", "solution_match": "# Solution"}} {"year": "1988", "tier": "T1", "problem_label": "4", "problem_type": null, "exam": "AllSovietUnion", "problem": "Given a sequence of 19 positive integers not exceeding 88 and another sequence of 88 positive integers not exceeding 19. Show that we can find two subsequences of consecutive terms, one from each sequence, with the same sum.", "solution": "We prove the general case. Let the first sequence be \\(\\mathbf{a}_1,\\mathbf{a}_2,\\ldots ,\\mathbf{a}_{\\mathrm{m}}\\) and the second sequence be \\(\\mathbf{b}_1,\\mathbf{b}_2,\\ldots ,\\mathbf{b}_{\\mathrm{n}}\\) , were \\(0< \\mathbf{a}_{\\mathrm{i}}\\leq \\mathbf{n}\\) and \\(0< \\mathbf{b}_{\\mathrm{j}}\\leq \\mathbf{m}\\) . Put \\(\\mathbf{s}_{\\mathrm{k}} = \\mathbf{a}_{1} + \\mathbf{a}_{2} + \\ldots +\\mathbf{a}_{\\mathrm{k}}\\) , \\(\\mathbf{t}_{\\mathrm{k}} = \\mathbf{b}_{1} + \\mathbf{b}_{2} + \\ldots +\\mathbf{b}_{\\mathrm{k}}\\) . Assume \\(\\mathbf{s}_{\\mathrm{m}} > \\mathbf{t}_{\\mathrm{n}}\\) (if they are equal, then we are done). \n\nLet \\(\\mathbf{f}(\\mathbf{i})\\) be the smallest \\(\\mathbf{k}\\) such that \\(\\mathbf{s}_{\\mathrm{k}} > = \\mathbf{t}_{\\mathrm{i}}\\) . If it is equal, we are done, so assume \\(\\mathbf{s}_{\\mathrm{k}} > \\mathbf{t}_{\\mathrm{i}}\\) . Now consider the n numbers \\(\\mathbf{s}_{\\mathrm{f}(\\mathrm{i})} - \\mathbf{t}_{\\mathrm{i}}\\) . Each is at least 1 and at most n- 1 (if it was n or more then \\(\\mathbf{s}_{\\mathrm{f}(\\mathrm{i}) - 1} \\geq \\mathbf{s}_{\\mathrm{f}(\\mathrm{i})} - \\mathbf{n} \\geq \\mathbf{t}_{\\mathrm{i}}\\) , contradicting the minimality of \\(\\mathbf{f}(\\mathrm{i})\\) ). So there must be two the same. So we have \\(\\mathbf{s}_{\\mathrm{f}(\\mathrm{i})} - \\mathbf{t}_{\\mathrm{i}} = \\mathbf{s}_{\\mathrm{f}(\\mathrm{i})} - \\mathbf{t}_{\\mathrm{j}}\\) for some \\(\\mathrm{i} > \\mathrm{j}\\) and hence \\(\\mathbf{a}_{\\mathrm{f}(\\mathrm{j}) + 1} + \\mathbf{a}_{\\mathrm{f}(\\mathrm{j}) + 2} + \\ldots + \\mathbf{a}_{\\mathrm{f}(\\mathrm{i})} = \\mathbf{b}_{\\mathrm{j} + 1} + \\mathbf{b}_{\\mathrm{j} + 2} + \\ldots + \\mathbf{b}_{\\mathrm{i}}\\) .", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 4", "solution_match": "# Solution"}} {"year": "1988", "tier": "T1", "problem_label": "5", "problem_type": null, "exam": "AllSovietUnion", "problem": "The quadrilateral ABCD is inscribed in a fixed circle. It has AB parallel to CD and the length AC is fixed, but it is otherwise allowed to vary. If h is the distance between the midpoints of AC and BD and k is the distance between the midpoints of AB and CD, show that the ratio h/k remains constant.", "solution": "Let the center of the circle be O and its radius be R. Let \\(\\angle \\mathrm{AOB} = 2\\mathrm{x}\\) (variable) and let \\(\\angle \\mathrm{AOC} = 2\\mathrm{y}\\) (fixed). Then \\(\\mathrm{AC} = 2\\mathrm{R}\\) sin y. We find \\(\\angle \\mathrm{COD} = 180^{\\circ} - \\mathrm{x} - 2\\mathrm{y}\\) , so \\(2\\mathrm{h} = 2\\mathrm{R}\\sin \\mathrm{x} + 2\\mathrm{R}\\) \\(\\sin (\\mathrm{x} + 2\\mathrm{y})\\) . Angle \\(\\mathrm{ACD} = \\mathrm{x} + \\mathrm{y}\\) , so \\(\\mathrm{k} = \\mathrm{AB}\\sin (\\mathrm{x} + \\mathrm{y}) = 2\\mathrm{R}\\sin (\\mathrm{x} + \\mathrm{y})\\) sin y. Hence the ratio \\(\\mathrm{h / k} = (\\sin \\mathrm{x} + \\sin (\\mathrm{x} + 2\\mathrm{y})) / (2\\sin (\\mathrm{x} + \\mathrm{y})\\sin \\mathrm{y})\\) . We have \\(\\sin \\mathrm{x} = \\sin (\\mathrm{x} + \\mathrm{y} - \\mathrm{y}) = \\sin (\\mathrm{x} + \\mathrm{y})\\cos \\mathrm{y} - \\cos (\\mathrm{x} + \\mathrm{y})\\sin \\mathrm{y}\\) , and \\(\\sin (\\mathrm{x} + 2\\mathrm{y}) = \\sin (\\mathrm{x} + \\mathrm{y} + \\mathrm{y}) = \\sin (\\mathrm{x} + \\mathrm{y})\\cos \\mathrm{y} + \\cos (\\mathrm{x} + \\mathrm{y})\\sin \\mathrm{y}\\) , so \\((\\sin \\mathrm{x} + \\sin (\\mathrm{x} + 2\\mathrm{y}) = 2\\sin (\\mathrm{x} + \\mathrm{y})\\cos \\mathrm{y}\\) . Hence \\(\\mathrm{h / k} = \\cot \\mathrm{y}\\) , which is constant.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 5", "solution_match": "# Solution"}} {"year": "1988", "tier": "T1", "problem_label": "6", "problem_type": null, "exam": "AllSovietUnion", "problem": "The numbers 1 and 2 are written on an empty blackboard. Whenever the numbers m and n appear on the blackboard the number \\(\\mathrm{m} + \\mathrm{n} + \\mathrm{mn}\\) may be written. Can we obtain (1) 13121, (2) 12131?", "solution": "(1) \\(13121 = 2 + 4373 + 2\\) . \\(4373,4373 = 2 + 1457 + 2\\) . \\(1457,1457 = 2 + 485 + 2\\) . \\(485,485 = 2+\\) \\(161 + 2\\) . \\(161,161 = 2 + 53 + 2\\) . \\(53,53 = 2 + 17 + 2\\) . \\(17,17 = 2 + 5 + 2\\) . \\(5,5 = 2 + 1 + 2\\) . 1. \n\nPut \\(\\mathrm{M} = \\mathrm{m} + 1\\) , \\(\\mathrm{N} = \\mathrm{n} + 1\\) . Then we the number derived from m and n is MN - 1. So if M and N are of the form \\(2^{a}3^{b}\\) then so is MN. Thus we can only ever write up numbers of the form \\(2^{a}3^{b} - 1\\) . But \\(12131 = 2^{2}3^{2}337 - 1\\) , which is not of the required form.\n\n\n\nNote that it makes no difference whether the two numbers m, n are allowed to be the same (which is ambiguous).", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 6", "solution_match": "# Solution"}} {"year": "1988", "tier": "T1", "problem_label": "7", "problem_type": null, "exam": "AllSovietUnion", "problem": "If rationals x, y satisfy \\(\\mathbf{x}^{5} + \\mathbf{y}^{5} = 2\\mathbf{x}^{2}\\mathbf{y}^{2}\\) show that 1 - x y is the square of a rational.", "solution": "Put \\(\\mathbf{y} = \\mathbf{k}\\mathbf{x}\\) , then \\(\\mathbf{x}^{5}(1 + \\mathbf{k}^{5}) = 2\\mathbf{k}^{2}\\mathbf{x}^{4}\\) , so \\(\\mathbf{x} = 2\\mathbf{k}^{2} / (1 + \\mathbf{k}^{5})\\) , \\(\\mathbf{y} = 2\\mathbf{k}^{3} / (1 + \\mathbf{k}^{5})\\) and \\(1 - \\mathbf{x}\\mathbf{y} = (1-\\) \\(\\mathbf{k}^{5})^{2} / (1 + \\mathbf{k}^{5})^{2}\\) . x and y are rational, so \\((1 - \\mathbf{k}^{5}) / (1 + \\mathbf{k}^{5})\\) is rational.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 7", "solution_match": "# Solution"}} {"year": "1988", "tier": "T1", "problem_label": "8", "problem_type": null, "exam": "AllSovietUnion", "problem": "There are 21 towns. Each airline runs direct flights between every pair of towns in a group of five. What is the minimum number of airlines needed to ensure that at least one airline runs direct flights between every pair of towns?", "solution": "Answer: 21. \n\nThere are 210 pairs of towns. Each airline serves 10 pairs, so we certainly need at least 21 airlines. The following arrangement shows that 21 is possible: \n\n
12345
16789
110111213
114151617
118192021
26101418
27111519
28121620
29131721
36111621
37101720
38131419
39121518
46121719
47131618
48101521
49111420
56131520
57121421
58111718
59101619
", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 8", "solution_match": "# Solution"}} {"year": "1988", "tier": "T1", "problem_label": "9", "problem_type": null, "exam": "AllSovietUnion", "problem": "Find all positive integers n satisfying \\((1 + 1 / \\mathrm{n})^{n + 1} = (1 + 1 / 1998)^{1998}\\) .", "solution": "Answer: no solutions.\n\n\n\nWe have \\((1 + 1 / \\mathrm{n})^{\\mathrm{n} + 1} > \\mathrm{e} > (1 + 1 / \\mathrm{n})^{\\mathrm{n}}\\) .", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 9", "solution_match": "# Solution"}} {"year": "1988", "tier": "T1", "problem_label": "10", "problem_type": null, "exam": "AllSovietUnion", "problem": "A, B, C are the angles of a triangle. Show that \\(2(\\sin \\mathrm{A}) / \\mathrm{A} + 2(\\sin \\mathrm{B}) / \\mathrm{B} + 2(\\sin \\mathrm{C}) / \\mathrm{C} \\leq (1 / \\mathrm{B} + 1 / \\mathrm{C}) \\sin \\mathrm{A} + (1 / \\mathrm{C} + 1 / \\mathrm{A}) \\sin \\mathrm{B} + (1 / \\mathrm{A} + 1 / \\mathrm{B}) \\sin \\mathrm{C}\\) .", "solution": "Assume \\(\\mathrm{A} \\leq \\mathrm{B} \\leq \\mathrm{C}\\) . Then \\(\\sin \\mathrm{A} \\leq \\sin \\mathrm{B}\\) . Also \\(\\mathrm{A} \\leq \\mathrm{C} < 180^{\\circ} - \\mathrm{A}\\) , so \\(\\sin \\mathrm{A} \\leq \\sin \\mathrm{C}\\) . Similarly \\(\\sin \\mathrm{B} \\leq \\sin \\mathrm{C}\\) . Hence \\((1 / \\mathrm{A} - 1 / \\mathrm{B})(\\sin \\mathrm{B} - \\sin \\mathrm{A})\\) , \\((1 / \\mathrm{B} - 1 / \\mathrm{C})(\\sin \\mathrm{C} - \\sin \\mathrm{B})\\) and \\((1 / \\mathrm{C} - 1 / \\mathrm{A})(\\sin \\mathrm{A} - \\sin \\mathrm{C})\\) are all non- negative. Hence their sum is also non- negative, which gives the result.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 10", "solution_match": "# Solution"}} {"year": "1988", "tier": "T1", "problem_label": "11", "problem_type": null, "exam": "AllSovietUnion", "problem": "Form 10A has 29 students who are listed in order on its duty roster. Form 10B has 32 students who are listed in order on its duty roster. Every day two students are on duty, one from form 10A and one from form 10B. Each day just one of the students on duty changes and is replaced by the following student on the relevant roster (when the last student on a roster is replaced he is replaced by the first). On two particular days the same two students were on duty. Is it possible that starting on the first of these days and ending the day before the second, every pair of students (one from 10A and one from 10B) shared duty exactly once?", "solution": "Answer: no. \n\nSuppose such an arrangement is possible. Suppose that it includes m cycles through the form 10A roster and n cycles through the 10B roster. Then the total number of changes is \\(29\\mathrm{m}+\\) \\(32\\mathrm{n} = 29\\mathrm{x}32\\) (since each pair occurs once). But that means 29 divides n and 32 divides m. Both m and n are at least 1, so that means \\(\\mathrm{n}\\geq 29\\) and \\(\\mathrm{m}\\geq 32\\) , but then \\(29\\mathrm{m} + 32\\mathrm{n} > 29\\) . 32. Contradiction.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 11", "solution_match": "# Solution"}} {"year": "1988", "tier": "T1", "problem_label": "12", "problem_type": null, "exam": "AllSovietUnion", "problem": "In the triangle ABC, the angle C is obtuse and D is a fixed point on the side BC, different from B and C. For any point M on the side BC, different from D, the ray AM intersects the circumcircle S of ABC at N. The circle through M, D and N meets S again at P, different from N. Find the location of the point M which minimises MP.", "solution": "Take A' on the circle S such that AA' is parallel to BC. Let the ray AD meet S again at P'. Then \\(\\angle \\mathrm{MNP}' = \\angle \\mathrm{ANP}'\\) (same angle) \\(= \\angle \\mathrm{AA'P}'\\) (A'AP'N cyclic) \\(= \\angle \\mathrm{A'DB}\\) (BC parallel to AA') \\(=\\) angle MDP (opposite angles). So MDNP' is cyclic, so P must be P'. Since P is a fixed point, independent of M, we minimise MP by taking M as the foot of the perpendicular from P to BC.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 12", "solution_match": "# Solution"}} {"year": "1988", "tier": "T1", "problem_label": "13", "problem_type": null, "exam": "AllSovietUnion", "problem": "Show that there are infinitely many odd composite numbers in the sequence \\(1^{1}\\) , \\(1^{1} + 2^{2}\\) , \\(1^{1} + 2^{2} + 3^{3}\\) , \\(1^{1} + 2^{2} + 3^{3} + 4^{4}\\) , ... .", "solution": "We show that infinitely many odd numbers in the sequence are divisible by 3. \n\nIf \\(\\mathrm{n} = 14\\) mod 36, then \\(\\mathrm{n} = 36\\mathrm{m} + 14\\) for some m. So there are \\(18\\mathrm{m} + 7\\) odd numbers in the sum and \\(18\\mathrm{m} + 7\\) even numbers. Hence the sum is odd. There are \\(12\\mathrm{m} + 5\\) numbers equal to 1 mod 3, \\(12\\mathrm{m} + 5\\) equal to - 1 mod 3 and \\(12\\mathrm{m} + 4\\) equal to 0 mod 3. Any product of numbers equal to 1 mod 3 equals 1 mod 3, so if \\(\\mathrm{k} = 1\\) mod 3, then \\(\\mathrm{k}^{\\mathrm{k}} = 1\\) mod 3. Similarly, if \\(\\mathrm{k} = 0\\) mod 3, then \\(\\mathrm{k}^{\\mathrm{k}} = 0\\) mod 3. If \\(\\mathrm{k} = - 1\\) mod 3 then \\(\\mathrm{k}^{\\mathrm{k}} = - 1\\) mod 3 if \\(\\mathrm{k}\\) is odd and 1 mod if \\(\\mathrm{k}\\) is even. Of the \\(12\\mathrm{m} + 5\\) numbers equal to - 1 mod 3, \\(6\\mathrm{m} + 3\\) are even and \\(6\\mathrm{m} + 2\\) are odd. Hence the sum \\(= (12\\mathrm{m} + 5)\\cdot 1 + (6\\mathrm{m} + 3)\\cdot 1 + (6\\mathrm{m} + 2)\\cdot - 1 + (12\\mathrm{m} + 4)\\cdot 0 = 12\\mathrm{m} + 6 = 0\\) mod 3. So the sum is divisible by 3.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 13", "solution_match": "# Solution"}} {"year": "1988", "tier": "T1", "problem_label": "14", "problem_type": null, "exam": "AllSovietUnion", "problem": "ABC is an acute- angled triangle. The tangents to the circumcircle at A and C meet the tangent at B at M and N. The altitude from B meets AC at P. Show that BP bisects the angle MPN.", "solution": "If the tangent at B is parallel to AC, then angle NBC \\(=\\) angle BCA (parallel lines) and angle NBC \\(=\\) angle BAC (NB tangent), so BCA is isosceles and \\(\\mathrm{BC} = \\mathrm{BA}\\) . Hence the figure is symmetrical about the line PB and so BP bisects MPN. \n\nSo assume AC is not parallel to the tangent at B. Assume it meets it at L on the same side of B as N. Take A' on the line AC so that \\(\\mathrm{MA} = \\mathrm{MA}'\\) . We show that LMA' and LNC are similar. Obviously the angles at L are the same. \\(\\angle \\mathrm{MA'L} = \\angle \\mathrm{MAL}\\) ( \\(\\mathrm{MA} = \\mathrm{MA}'\\) ) \\(= \\angle \\mathrm{ABC}\\) (MA tangent) \\(= \\angle \\mathrm{LCN}\\) (NC tangent). So the triangles are similar. Hence \\(\\mathrm{LN} / \\mathrm{NC} = \\mathrm{LM} / \\mathrm{MA}'\\) . But \\(\\mathrm{NC} = \\mathrm{NB}\\) and \\(\\mathrm{MA}' = \\mathrm{MA} = \\mathrm{MB}\\) , so \\(\\mathrm{LN} / \\mathrm{NB} = \\mathrm{LM} / \\mathrm{MB}\\) and hence \\(\\mathrm{LM} / \\mathrm{LN} = \\mathrm{MB} / \\mathrm{NB}\\) . So the circle on LB as diameter has all points Q on it satisfying \\(\\mathrm{QM} / \\mathrm{QN} = \\mathrm{BM} / \\mathrm{BN}\\) . But \\(\\angle \\mathrm{LPB} = 90^{\\circ}\\) , so P must lie on the circle and hence \\(\\mathrm{PM} / \\mathrm{PN} = \\mathrm{BM} / \\mathrm{BN}\\) . Hence PB is the angle bisector of MPN.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 14", "solution_match": "# Solution"}} {"year": "1988", "tier": "T1", "problem_label": "15", "problem_type": null, "exam": "AllSovietUnion", "problem": "What is the minimal value of \\(\\mathrm{b} / (\\mathrm{c} + \\mathrm{d}) + \\mathrm{c} / (\\mathrm{a} + \\mathrm{b})\\) for positive real numbers b and c and nonnegative real numbers a and d such that \\(\\mathrm{b} + \\mathrm{c} \\geq \\mathrm{a} + \\mathrm{d}\\) ?", "solution": "Answer: \\(\\sqrt{2} - 1 / 2\\) . \n\nObviously \\(\\mathrm{a} + \\mathrm{d} = \\mathrm{b} + \\mathrm{c}\\) at the minimum value, because increasing a or d reduces the value. So we may take \\(\\mathrm{d} = \\mathrm{b} + \\mathrm{c} - \\mathrm{a}\\) . We also take \\(\\mathrm{b} \\gg \\mathrm{c}\\) (interchanging b and c if necessary). Dividing through by \\(\\mathrm{b} / 2\\) shows that there is no loss of generality in taking \\(\\mathrm{b} = 2\\) , so \\(0 < \\mathrm{c} \\ll = 2\\) . Thus we have to find the minimum value of \\(2 / (2\\mathrm{c} - \\mathrm{a} + 2) + \\mathrm{c} / (\\mathrm{a} + 2)\\) . We show that it is \\(\\sqrt{2} - 1 / 2\\) .\n\n\n\nThis is surprisingly awkward. Note first that \\((\\mathrm{c} - (\\mathrm{h} - \\mathrm{k}))^{2} > = 0\\) , so \\(\\mathrm{c}^{2} + \\mathrm{c}(2\\mathrm{k} - 2\\mathrm{h}) + \\mathrm{h}^{2} - 2\\mathrm{h}\\mathrm{k} + \\mathrm{k}^{2} > = 0\\) . Hence \\(\\mathrm{c}^{2} + \\mathrm{ck} + \\mathrm{h}^{2} > = (2\\mathrm{h} - \\mathrm{k})(\\mathrm{c} + \\mathrm{k})\\) . Hence \\(\\mathrm{c} / \\mathrm{h}^{2} + 1 / (\\mathrm{c} + \\mathrm{k}) > = 2 / \\mathrm{h} - \\mathrm{k} / \\mathrm{h}^{2}\\) with equality iff \\(\\mathrm{c} = \\mathrm{h} - \\mathrm{k}\\) . Applying this to \\(\\mathrm{c} / (\\mathrm{a} + 2) + 1 / (\\mathrm{c} + 1 - \\mathrm{a} / 2)\\) where \\(\\mathrm{h} = \\sqrt{(\\mathrm{a} + 2)}\\) , \\(\\mathrm{k} = 1 - \\mathrm{a} / 2\\) , we find that \\(\\mathrm{c} / (\\mathrm{a} + 2) + 2 / (2\\mathrm{c} + 2 - \\mathrm{a}) > = 2 / \\sqrt{(\\mathrm{a} + 2)} + (\\mathrm{a} - 2) / (2\\mathrm{a} + 4)\\) . \n\nThe allowed range for c is \\(0\\leq \\mathrm{c}\\leq 2\\) and \\(0\\leq \\mathrm{a}\\leq \\mathrm{c} + 2\\) , hence \\(0\\leq \\mathrm{a}\\leq 4\\) . Put \\(\\mathrm{x} = 1 / \\sqrt{(\\mathrm{a} + 2)}\\) , so \\(1 / \\sqrt{6} < = \\mathrm{x}< = 1 / \\sqrt{2}\\) . Then \\(2 / \\sqrt{(\\mathrm{a} + 2)} + (\\mathrm{a} - 2) / (2\\mathrm{a} + 4) = 2\\mathrm{x} + 1 / 2 - 2\\mathrm{x}^{2} = 1 - (2\\mathrm{x} - 1)^{2} / 2\\) . We have - \\(0.184 = (2 / \\sqrt{6} - 1)\\leq 2\\mathrm{x} - 1\\leq \\sqrt{2} - 1 = 0.414\\) . Hence \\(\\mathrm{c} / (\\mathrm{a} + 2) + 2 / (2\\mathrm{c} + 2 - \\mathrm{a})\\geq 1 - (\\sqrt{2} - 1)^{2} / 2 = \\sqrt{2} - 1 / 2\\) . \n\nWe can easily check that the minimum is achieved at \\(\\mathrm{b} = 2\\) , \\(\\mathrm{c} = \\sqrt{2} - 1\\) , \\(\\mathrm{a} = 0\\) , \\(\\mathrm{d} = \\sqrt{2} + 1\\) .", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 15", "solution_match": "# Solution"}} {"year": "1988", "tier": "T1", "problem_label": "16", "problem_type": null, "exam": "AllSovietUnion", "problem": "\\(\\mathrm{n}^{2}\\) real numbers are written in a square \\(\\mathrm{n}\\times \\mathrm{n}\\) table so that the sum of the numbers in each row and column equals zero. A move is to add a row to one column and subtract it from another (so if the entries are \\(\\mathrm{a_{ij}}\\) and we select row i, column h and column k, then column h becomes \\(\\mathrm{a_{1h} + a_{i1}}\\) , \\(\\mathrm{a_{2h} + a_{i2}}\\) , ..., \\(\\mathrm{a_{nh} + a_{in}}\\) , column k becomes \\(\\mathrm{a_{1k} - a_{i1}}\\) , \\(\\mathrm{a_{2k} - a_{i2}}\\) , ..., \\(\\mathrm{a_{nk} - a_{in}}\\) , and the other entries are unchanged). Show that we can make all the entries zero by a series of moves.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 16", "solution_match": ""}} {"year": "1988", "tier": "T1", "problem_label": "17", "problem_type": null, "exam": "AllSovietUnion", "problem": "In the acute- angled triangle ABC, the altitudes BD and CE are drawn. Let F and G be the points of the line ED such that BF and CG are perpendicular to ED. Prove that \\(\\mathrm{EF} = \\mathrm{DG}\\) .", "solution": "\\(\\angle \\mathrm{BDC} = \\angle \\mathrm{BEC} = 90^{\\circ}\\) , so BCDE is cyclic, so \\(\\angle \\mathrm{BDE} = \\angle \\mathrm{BCE} = 90^{\\circ} - \\angle \\mathrm{B}\\) . Hence \\(\\angle \\mathrm{DGC} = 90^{\\circ} - \\angle \\mathrm{CDG} = \\angle \\mathrm{BDE} = 90^{\\circ} - \\mathrm{B}\\) . So \\(\\mathrm{DG} = \\mathrm{CD}\\) sin \\(\\mathrm{DGC} = \\mathrm{BC}\\) sin CBD sin \\(\\mathrm{DGC} = \\mathrm{BC}\\) cos C cos B. Similarly EF.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 17", "solution_match": "# Solution"}} {"year": "1988", "tier": "T1", "problem_label": "18", "problem_type": null, "exam": "AllSovietUnion", "problem": "Find the minimum value of \\(\\mathrm{xy / z + yz / x + zx / y}\\) for positive reals \\(\\mathrm{x}\\) , \\(\\mathrm{y}\\) , \\(\\mathrm{z}\\) with \\(\\mathrm{x}^{2} + \\mathrm{y}^{2} + \\mathrm{z}^{2} = 1\\) .", "solution": "Answer: min \\(\\sqrt{3}\\) when all equal. \n\nLet us consider \\(\\mathrm{z}\\) to be fixed and focus on \\(\\mathrm{x}\\) and \\(\\mathrm{y}\\) . Put \\(\\mathrm{f(x,y,z) = xy / z + yz / x + zx / y}\\) . We have \\(\\mathrm{f(x,y,z) = p / z + z(1 - z^{2}) / p = (p + k^{2} / p) / z}\\) , where \\(\\mathrm{p} = \\mathrm{xy}\\) , and \\(\\mathrm{k} = z\\sqrt{(1 - z^{2})}\\) . Now \\(\\mathrm{p}\\) can take any value in the range \\(0< \\mathrm{p}\\leq (1 - z^{2}) / 2\\) . The upper limit is achieved when \\(\\mathrm{x} = \\mathrm{y}\\) . \n\nWe have \\(\\mathrm{p} + \\mathrm{k}^{2} / \\mathrm{p} = (\\mathrm{p} - \\mathrm{k})^{2} / \\mathrm{p}\\) . For \\(\\mathrm{p}\\leq \\mathrm{k}\\) , \\((\\mathrm{p} - \\mathrm{k})\\) and \\(1 / \\mathrm{p}\\) are both decreasing functions of \\(\\mathrm{p}\\) , so \\(\\mathrm{p} + \\mathrm{k}^{2} / \\mathrm{p}\\) is a decreasing function of \\(\\mathrm{p}\\) . Thus if \\(\\mathrm{p}\\) is restricted to the interval \\((0,\\mathrm{h}]\\) , then for \\(\\mathrm{k}\\leq\\) \\(\\mathrm{h}\\) the minimum value of \\(\\mathrm{p} + \\mathrm{k}^{2} / \\mathrm{p}\\) is \\(2\\mathrm{k}\\) and occurs at \\(\\mathrm{p} = \\mathrm{k}\\) . For \\(\\mathrm{k}\\geq \\mathrm{h}\\) the minimum is \\(\\mathrm{h} + \\mathrm{k}^{2} / \\mathrm{h}\\) and occurs at \\(\\mathrm{p} = \\mathrm{h}\\) . \n\nWe have \\(\\mathrm{h} = (1 - \\mathrm{z}^{2}) / 2\\) , \\(\\mathrm{k} = z\\sqrt{(1 - \\mathrm{z}^{2})}\\) . So \\(\\mathrm{k}\\leq \\mathrm{h}\\) iff \\(\\mathrm{z}\\leq = 1 / \\sqrt{5}\\) . So if \\(\\mathrm{z}\\leq 1 / \\sqrt{5}\\) , then \\(\\mathrm{f(x,y,z)}\\geq 2\\mathrm{k} / \\mathrm{z}\\) \\(= 2\\sqrt{(1 - \\mathrm{z}^{2})}\\geq 27\\sqrt{(1 - 1 / 5)} = 4 / \\sqrt{5} >\\sqrt{3}\\) .\n\n\n\nIf \\(z > 1 / \\sqrt{5}\\) , then the minimum of \\(\\mathrm{f}(\\mathrm{x}, \\mathrm{y}, \\mathrm{z})\\) occurs at \\(\\mathrm{x} = \\mathrm{y}\\) and is \\(\\mathrm{x}^{2} / \\mathrm{z} + \\mathrm{z} + \\mathrm{z} = (1 - \\mathrm{z}^{2}) / (2\\mathrm{z}) + 2\\mathrm{z} = 3\\mathrm{z} / 2 + 1 / (2\\mathrm{z}) = (\\sqrt{3}) / 2 (\\mathrm{z} \\sqrt{3} + 1 / (\\mathrm{z} \\sqrt{3}) \\geq \\sqrt{3}\\) with equality at \\(\\mathrm{z} = 1 / \\sqrt{3}\\) (and hence \\(\\mathrm{x} = \\mathrm{y} = 1 / \\sqrt{3}\\) also).", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 18", "solution_match": "# Solution"}} {"year": "1988", "tier": "T1", "problem_label": "19", "problem_type": null, "exam": "AllSovietUnion", "problem": "A polygonal line connects two opposite vertices of a cube with side 2. Each segment of the line has length 3 and each vertex lies on the faces (or edges) of the cube. What is the smallest number of segments the line can have? \n\nAnswer 6", "solution": "![md5:8cf996e790873a262ab31b6ce4f02ca0](8cf996e790873a262ab31b6ce4f02ca0.jpeg)\n \n\nSuppose one endpoint of a segment length 3 is at A. Evidently the other end could be at the edge midpoints B, C, D. It could also be on the circular arc connecting B and C (with center O and radius \\(\\sqrt{5}\\) ). Similarly, it could be on arcs connecting C and D, or B and D. We claim that if X is a point of one of these arcs other than its endpoints, then the only possible segment length 3 with an endpoint at X (and the other endpoint on the surface of the cube) is AX. wlog we can consider X to be on the arc BC. Take axes with origin O, so that A is (0,0,2). Suppose X is (a,b,0) and that the other endpoint of the segment is Y (x,y,z). Then \\(\\mathrm{XY}^{2} = (\\mathrm{x} - \\mathrm{a})^{2} + (\\mathrm{y} - \\mathrm{b})^{2} + \\mathrm{z}^{2} = \\mathrm{a}^{2} + \\mathrm{b}^{2} + \\mathrm{z}^{2} - \\mathrm{x}(2\\mathrm{a} - \\mathrm{x}) - \\mathrm{y}(2\\mathrm{b} - \\mathrm{y}) = 5 + \\mathrm{z}^{2} - \\mathrm{x}(2\\mathrm{a} - \\mathrm{x}) - \\mathrm{y}(2\\mathrm{b} - \\mathrm{y})\\) . But a, \\(\\mathrm{b} > 1\\) since X is not an endpoint of the arc, so (2a- x) and (2b- y) are both positive. Hence - x(2a- x) - y(2b- y) \\(\\leq 0\\) with equality iff \\(\\mathrm{x} = \\mathrm{y} = 0\\) . Similarly, \\(\\mathrm{z}^{2} \\leq 4\\) with equality iff \\(\\mathrm{z} = 2\\) . Hence \\(\\mathrm{XY}^{2} \\leq 9\\) with equality iff \\(\\mathrm{Y} = \\mathrm{A}\\) , which proves the claim. \n\nThus if the next link of the polygonal line goes from A to anywhere except B, C, D, then it has to go back to A. So a minimal line must go to B, C, or D. \n\nNow from D the line can only go to A or O. For if it goes to Z (x,y,z), then we have \\(\\mathrm{DZ}^{2} = (\\mathrm{x} - 2)^{2} + (\\mathrm{y} - 2)^{2} + (\\mathrm{z} - 1)^{2} \\leq 2^{2} + 2^{2} + 1^{2} = 3^{2}\\) with equality iff \\(\\mathrm{x} = 0\\) , \\(\\mathrm{y} = 0\\) and \\(\\mathrm{z} = 0\\) or 2. \n\nSo let us take A as the starting point of the polygonal line. wlog the first segment is AD. Then the second segment must be DO (for a minimal line). Thus the best we can do with 2 segments is to move along an edge. It takes three such moves to get to the opposite corner, and hence at least 6 segments. But it is obvious that it can be done with 6 segments.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 19", "solution_match": "# Solution"}} {"year": "1988", "tier": "T1", "problem_label": "20", "problem_type": null, "exam": "AllSovietUnion", "problem": "Let m, n, k be positive integers with \\(\\mathrm{m} \\geq \\mathrm{n}\\) and \\(1 + 2 + \\ldots + \\mathrm{n} = \\mathrm{mk}\\) . Prove that the numbers 1, 2, ..., n can be divided into k groups in such a way that the sum of the numbers in each group equals m.", "solution": "Induction on n, then m. For \\(\\mathrm{n} = 1\\) , 2 there is nothing to prove. Assume the result is proved for \\(< \\mathrm{n}\\) and consider the case n. If n is odd, we have \\(\\mathrm{n} = \\mathrm{n} - 1 + 1 = \\mathrm{n} - 2 + 2 = \\ldots = (\\mathrm{n} + 1) / 2 + (\\mathrm{n} - 1) / 2\\) , so the result is true for \\(\\mathrm{m} = \\mathrm{n}\\) , \\(\\mathrm{k} = (\\mathrm{n} + 1) / 2\\) . If n is even, we have \\(\\mathrm{n} + 1 = \\mathrm{n} - 1 + 2 = \\ldots = (\\mathrm{n} / 2 + 1) + (\\mathrm{n} / 2 - 1)\\) , so the result is true for \\(\\mathrm{m} = \\mathrm{n} + 1\\) and \\(\\mathrm{k} = \\mathrm{n} / 2\\) . Now suppose it is true for \\(< \\mathrm{m}\\) . \n\nIf \\(2\\mathrm{n} > \\mathrm{m} > \\mathrm{n} + 1\\) , then for m odd we can take the sums \\(\\mathrm{m} = \\mathrm{n} + \\mathrm{m} - \\mathrm{n} = \\mathrm{n} - 1 + \\mathrm{m} - \\mathrm{n} + 1 = \\ldots = (\\mathrm{m} + 1) / 2 + (\\mathrm{m} - 1) / 2\\) . These use up the numbers \\(\\mathrm{m} - \\mathrm{n}\\) , \\(\\mathrm{m} - \\mathrm{n} + 1\\) , ..., n and give some sums of m. By induction the remaining numbers 1, 2, ..., \\(\\mathrm{m} - \\mathrm{n} - 1\\) will give the remaining sums of m (obviously \\(\\mathrm{m} > \\mathrm{m} - \\mathrm{n} - 1\\) ). If m is even, we can take the sums \\(\\mathrm{m} = \\mathrm{n} + \\mathrm{m} - \\mathrm{n} = \\mathrm{n} - 1 + \\mathrm{m} - \\mathrm{n} + 1 = \\ldots = (\\mathrm{m} / 2 + 1) + (\\mathrm{m} / 2 - 1)\\) . That gives some sums of m and leaves us with the integers 1, 2, ..., \\(\\mathrm{m} - \\mathrm{n} - 1\\) and \\(\\mathrm{m} / 2\\) . But since \\(\\mathrm{m} < 2(\\mathrm{n} + 1)\\) , \\(\\mathrm{m} / 2 > \\mathrm{m} - \\mathrm{n} - 1\\) and hence we can use the integers 1, 2, ..., \\(\\mathrm{m} - \\mathrm{n} - 1\\) to form sums of \\(\\mathrm{m} / 2\\) . With the integer \\(\\mathrm{m} / 2\\) that gives us sums of m (we know that the parity must come out right because we know that the sum of all the remaining numbers is divisible by m). \n\nFinally, consider \\(\\mathrm{m} \\geq 2\\mathrm{n}\\) . In that case we can form k sums of \\(2\\mathrm{n} - 2\\mathrm{k} + 1\\) : \\(\\mathrm{n} + (\\mathrm{n} - 2\\mathrm{k} + 1)\\) , \\((\\mathrm{n} - 1) + (\\mathrm{n} - 2\\mathrm{k} + 2)\\) , ..., \\((\\mathrm{n} - \\mathrm{k} + 1) + (\\mathrm{n} - \\mathrm{k})\\) . So we are home provided the remaining integers 1, 2, ..., \\(\\mathrm{n} - 2\\mathrm{k}\\) can be used to form k sums of \\(\\mathrm{m} - (2\\mathrm{n} - 2\\mathrm{k} + 1)\\) . That follows by induction provided that \\(\\mathrm{m} - (2\\mathrm{n} - 2\\mathrm{k} + 1) \\geq \\mathrm{n} - 2\\mathrm{k}\\) , or \\(\\mathrm{m} + 4\\mathrm{k} - 1 \\geq 3\\mathrm{n}\\) , or \\(\\mathrm{m} + 2\\mathrm{n}(\\mathrm{n} + 1) / \\mathrm{m} - 1 \\geq 3\\mathrm{n}\\) or \\((\\mathrm{m} - 2\\mathrm{n})(\\mathrm{m} - \\mathrm{n} - 1) \\geq 0\\) , which is true.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 20", "solution_match": "# Solution"}} {"year": "1988", "tier": "T1", "problem_label": "21", "problem_type": null, "exam": "AllSovietUnion", "problem": "A polygonal line with a finite number of segments has all its vertices on a parabola. Any two adjacent segments make equal angles with the tangent to the parabola at their point of intersection. One end of the polygonal line is also on the axis of the parabola. Show that the other vertices of the polygonal line are all on the same side of the axis.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 21", "solution_match": ""}} {"year": "1988", "tier": "T1", "problem_label": "22", "problem_type": null, "exam": "AllSovietUnion", "problem": "What is the smallest n for which there is a solution to \\(\\sin x_{1} + \\sin x_{2} + \\ldots +\\sin x_{n} = 0\\) , \\(\\sin x_{1} + 2 \\sin x_{2} + \\ldots + n \\sin x_{n} = 100\\) ?", "solution": "Put \\(x_{1} = x_{2} = \\ldots = x_{10} = 3\\pi /2\\) , \\(x_{11} = x_{12} = \\ldots = x_{20} = \\pi /2\\) . Then \\(\\sin x_{1} + \\sin x_{2} + \\ldots +\\sin x_{20} = (- 1 - 1 - 1 - \\ldots - 1) + (1 + 1 + \\ldots + 1) = 0\\) , and \\(\\sin x_{1} + 2 \\sin x_{2} + \\ldots + 20 \\sin x_{20} = - (1 + 2 + \\ldots + 10) + (11 + 12 + \\ldots + 20) = 100\\) . So there is a solution with \\(\\mathrm{n} = 20\\) . If there is a solution with \\(\\mathrm{n} < 20\\) , then there must be a solution for \\(\\mathrm{n} = 19\\) (put any extra \\(x_{i} = 0\\) ). But then \\(100 = (\\sin x_{1} + 2 \\sin x_{2} + \\ldots + 19 \\sin x_{19}) - 10 (\\sin x_{1} + \\sin x_{2} + \\ldots + \\sin x_{19}) = - 9 \\sin x_{1} - 8 \\sin x_{2} - 7 \\sin x_{3} - \\ldots - \\sin x_{9} + \\sin x_{11} + 2 \\sin x_{12} + \\ldots + 9 \\sin x_{19}\\) . But \\(\\mathrm{l} \\mathrm{rhs} \\mathrm{l} \\leq (9 + 8 + \\ldots + 1) + (1 + 2 + \\ldots + 9) = 90\\) . Contradiction. So there is no solution for \\(\\mathrm{n} < 20\\) .", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 22", "solution_match": "# Solution"}} {"year": "1988", "tier": "T1", "problem_label": "23", "problem_type": null, "exam": "AllSovietUnion", "problem": "The sequence of integers \\(\\mathrm{a}_{\\mathrm{n}}\\) is given by \\(\\mathrm{a}_{0} = 0\\) , \\(\\mathrm{a}_{\\mathrm{n}} = \\mathrm{p}(\\mathrm{a}_{\\mathrm{n} - 1})\\) , where \\(\\mathrm{p}(\\mathrm{x})\\) is a polynomial whose coefficients are all positive integers. Show that for any two positive integers \\(\\mathrm{m}\\) , \\(\\mathrm{k}\\) with greatest common divisor d, the greatest common divisor of \\(\\mathrm{a}_{\\mathrm{m}}\\) and \\(\\mathrm{a}_{\\mathrm{k}}\\) is \\(\\mathrm{a}_{\\mathrm{d}}\\) .", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 23", "solution_match": ""}} {"year": "1988", "tier": "T1", "problem_label": "24", "problem_type": null, "exam": "AllSovietUnion", "problem": "Prove that for any tetrahedron the radius of the inscribed sphere \\(\\mathrm{r} < \\mathrm{ab} / (2(\\mathrm{a} + \\mathrm{b}))\\) , where a and b are the lengths of any pair of opposite edges.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 24", "solution_match": ""}} {"year": "1989", "tier": "T1", "problem_label": "1", "problem_type": null, "exam": "AllSovietUnion", "problem": "7 boys each went to a shop 3 times. Each pair met at the shop. Show that 3 must have been in the shop at the same time.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 1", "solution_match": ""}} {"year": "1989", "tier": "T1", "problem_label": "2", "problem_type": null, "exam": "AllSovietUnion", "problem": "Can 77 blocks each \\(3 \\times 3 \\times 1\\) be assembled to form a \\(7 \\times 9 \\times 11\\) block?", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 2", "solution_match": ""}} {"year": "1989", "tier": "T1", "problem_label": "3", "problem_type": null, "exam": "AllSovietUnion", "problem": "The incircle of ABC touches AB at M. N is any point on the segment BC. Show that the incircles of AMN, BMN, ACN have a common tangent.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 3", "solution_match": ""}} {"year": "1989", "tier": "T1", "problem_label": "4", "problem_type": null, "exam": "AllSovietUnion", "problem": "A positive integer n has exactly 12 positive divisors \\(1 = \\mathrm{d}_1 < \\mathrm{d}_2 < \\mathrm{d}_3 < \\ldots < \\mathrm{d}_{12} = \\mathrm{n}\\) . Let \\(\\mathrm{m} = \\mathrm{d}_4\\) - 1. We have \\(\\mathrm{d}_{\\mathrm{m}} = (\\mathrm{d}_1 + \\mathrm{d}_2 + \\mathrm{d}_4) \\mathrm{d}_8\\) . Find n.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 4", "solution_match": ""}} {"year": "1989", "tier": "T1", "problem_label": "5", "problem_type": null, "exam": "AllSovietUnion", "problem": "Eight pawns are placed on a chessboard, so that there is one in each row and column. Show that an even number of the pawns are on black squares.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 5", "solution_match": ""}} {"year": "1989", "tier": "T1", "problem_label": "6", "problem_type": null, "exam": "AllSovietUnion", "problem": "ABC is a triangle. A', B', C' are points on the segments BC, CA, AB respectively. Angle B'A'C' = angle A and AC'/C'B = BA'/A'C = CB'/B'A. Show that ABC and A'B'C' are similar.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 6", "solution_match": ""}} {"year": "1989", "tier": "T1", "problem_label": "7", "problem_type": null, "exam": "AllSovietUnion", "problem": "One bird lives in each of n bird- nests in a forest. The birds change nests, so that after the change there is again one bird in each nest. Also for any birds A, B, C, D (not necessarily distinct), if the distance \\(\\mathrm{AB} < \\mathrm{CD}\\) before the change, then \\(\\mathrm{AB} > \\mathrm{CD}\\) after the change. Find all possible values of n.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 7", "solution_match": ""}} {"year": "1989", "tier": "T1", "problem_label": "8", "problem_type": null, "exam": "AllSovietUnion", "problem": "Show that the 120 five digit numbers which are permutations of 12345 can be divided into two sets with each set having the same sum of squares.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 8", "solution_match": ""}} {"year": "1989", "tier": "T1", "problem_label": "9", "problem_type": null, "exam": "AllSovietUnion", "problem": "We are given 1998 normal coins, 1 heavy coin and 1 light coin, which all look the same. We wish to determine whether the average weight of the two abnormal coins is less than, equal to, or greater than the weight of a normal coin. Show how to do this using a balance 4 times or less.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 9", "solution_match": ""}} {"year": "1989", "tier": "T1", "problem_label": "10", "problem_type": null, "exam": "AllSovietUnion", "problem": "A triangle with perimeter 1 has side lengths a, b, c. Show that \\(\\mathrm{a}^2 +\\mathrm{b}^2 +\\mathrm{c}^2 +4\\mathrm{abc}< 1 / 2\\) .", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 10", "solution_match": ""}} {"year": "1989", "tier": "T1", "problem_label": "11", "problem_type": null, "exam": "AllSovietUnion", "problem": "ABCD is a convex quadrilateral. X lies on the segment AB with AX/XB = m/n. Y lies on the segment CD with CY/YD = m/n. AY and DX intersect at P, and BY and CX intersect at Q. Show that area XQYP/area ABCD < mn/(m² + mn + n²).", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 11", "solution_match": ""}} {"year": "1989", "tier": "T1", "problem_label": "12", "problem_type": null, "exam": "AllSovietUnion", "problem": "A 23 x 23 square is tiled with 1 x 1, 2 x 2 and 3 x 3 squares. What is the smallest possible number of 1 x 1 squares?", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 12", "solution_match": ""}} {"year": "1989", "tier": "T1", "problem_label": "13", "problem_type": null, "exam": "AllSovietUnion", "problem": "Do there exist two reals whose sum is rational, but the sum of their nth powers is irrational for all \\(n > 1\\) ? Do there exist two reals whose sum is irrational, but the sum of whose nth powers is rational for all \\(n > 1\\) ?", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 13", "solution_match": ""}} {"year": "1989", "tier": "T1", "problem_label": "14", "problem_type": null, "exam": "AllSovietUnion", "problem": "An insect is on a square ceiling side 1. The insect can jump to the midpoint of the segment joining it to any of the four corners of the ceiling. Show that in 8 jumps it can get to within 1/100 of any chosen point on the ceiling.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 14", "solution_match": ""}} {"year": "1989", "tier": "T1", "problem_label": "15", "problem_type": null, "exam": "AllSovietUnion", "problem": "ABCD has AB = CD, but AB not parallel to CD, and AD parallel to BC. The triangle is ABC is rotated about C to A'B'C. Show that the midpoints of BC, B'C and A'D are collinear.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 15", "solution_match": ""}} {"year": "1989", "tier": "T1", "problem_label": "16", "problem_type": null, "exam": "AllSovietUnion", "problem": "Show that for each integer \\(n > 0\\) , there is a polygon with vertices at lattice points and all sides parallel to the axes, which can be dissected into \\(1 \\times 2\\) (and/or \\(2 \\times 1\\) ) rectangles in exactly \\(n\\) ways.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 16", "solution_match": ""}} {"year": "1989", "tier": "T1", "problem_label": "17", "problem_type": null, "exam": "AllSovietUnion", "problem": "Find the smallest positive integer \\(n\\) for which we can find an integer \\(m\\) such that \\([10^n /m] = 1989\\) .", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 17", "solution_match": ""}} {"year": "1989", "tier": "T1", "problem_label": "18", "problem_type": null, "exam": "AllSovietUnion", "problem": "ABC is a triangle. Points D, E, F are chosen on BC, CA, AB such that B is equidistant from D and F, and C is equidistant from D and E. Show that the circumcenter of AEF lies on the bisector of EDF.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 18", "solution_match": ""}} {"year": "1989", "tier": "T1", "problem_label": "19", "problem_type": null, "exam": "AllSovietUnion", "problem": "S and S' are two intersecting spheres. The line BXB' is parallel to the line of centers, where B is a point on S, B' is a point on S' and X lies on both spheres. A is another point on S, and A' is another point on S' such that the line AA' has a point on both spheres. Show that the segments AB and A'B' have equal projections on the line AA'.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 19", "solution_match": ""}} {"year": "1989", "tier": "T1", "problem_label": "20", "problem_type": null, "exam": "AllSovietUnion", "problem": "Two walkers are at the same altitude in a range of mountains. The path joining them is piecewise linear with all its vertices above the two walkers. Can they each walk along the path until they have changed places, so that at all times their altitudes are equal?", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 20", "solution_match": ""}} {"year": "1989", "tier": "T1", "problem_label": "21", "problem_type": null, "exam": "AllSovietUnion", "problem": "Find the least possible value of \\((x + y)(y + z)\\) for positive reals satisfying \\((x + y + z)xyz = 1\\) .", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 21", "solution_match": ""}} {"year": "1989", "tier": "T1", "problem_label": "22", "problem_type": null, "exam": "AllSovietUnion", "problem": "A polyhedron has an even number of edges Show that we can place an arrow on each edge so that each vertex has an even number of arrows pointing towards it (on adjacent edges).", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 22", "solution_match": ""}} {"year": "1989", "tier": "T1", "problem_label": "23", "problem_type": null, "exam": "AllSovietUnion", "problem": "N is the set of positive integers. Does there exist a function f: \\(\\mathrm{N}\\to \\mathrm{N}\\) such that \\(\\mathrm{f(n + 1)} = \\mathrm{f}(\\mathrm{f(n)}\\) ) + f( \\(\\mathrm{f(n + 2)}\\) ) for all n.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 23", "solution_match": ""}} {"year": "1989", "tier": "T1", "problem_label": "24", "problem_type": null, "exam": "AllSovietUnion", "problem": "A convex polygon is such that any segment dividing the polygon into two parts of equal area which has at least one end at a vertex has length \\(< 1\\) . Show that the area of the polygon is \\(< \\pi /4\\) .", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 24", "solution_match": ""}} {"year": "1990", "tier": "T1", "problem_label": "1", "problem_type": null, "exam": "AllSovietUnion", "problem": "Show that \\(\\mathrm{x}^4 > \\mathrm{x} - 1 / 2\\) for all real x.", "solution": "\\(\\mathrm{x}^4 - \\mathrm{x} + 1 / 2 = (\\mathrm{x}^2 - 1 / 2)^2 +(\\mathrm{x} - 1 / 2)^2\\geq 0\\) . We could only have equality if \\(\\mathrm{x}^2 = \\mathrm{x} = 1 / 2\\) , which is impossible, so the inequality is strict.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 1", "solution_match": "# Solution"}} {"year": "1990", "tier": "T1", "problem_label": "2", "problem_type": null, "exam": "AllSovietUnion", "problem": "The line joining the midpoints of two opposite sides of a convex quadrilateral makes equal angles with the diagonals. Show that the diagonals are equal.", "solution": "![md5:54360b517d323d1521aef21360afdede](54360b517d323d1521aef21360afdede.jpeg)\n \n\nLet L, M, N be the midpoints of BC, CD, DA. Assume that NL makes equal angles with AC and BD, so \\(\\angle \\mathrm{NLM} = \\angle \\mathrm{BEL} = \\angle \\mathrm{AFN} = \\angle \\mathrm{LNM}\\) , so \\(\\mathrm{LM} = \\mathrm{MN}\\) and hence \\(\\mathrm{BD} = \\mathrm{AC}\\) .", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 2", "solution_match": "# Solution"}} {"year": "1990", "tier": "T1", "problem_label": "3", "problem_type": null, "exam": "AllSovietUnion", "problem": "A graph has 30 points and each point has 6 edges. Find the total number of triples such that each pair of points is joined or each pair of points is not joined. \n\n## Answer \n\n1990", "solution": "There are 30. 29. \\(28 / 6 = 4060\\) triples in all. Let m be the number of triples with 0 or 3 edges, and let n be the number of triples with 1 or 2 edges. So \\(\\mathrm{m} + \\mathrm{n} = 4060\\) . Each point is joined to 6 others, so it is in 6. \\(5 / 2 = 15\\) triples where it is joined to both the other points, and it is in 23. \\(22 / 2 = 253\\) triples where it is not joined to either of the other points. So the total number of triples (a,b,c), where a is joined to b and c or not joined to b or c is \\(30(15 + 253) = 8040\\) . This counts the m triples 3 times each, and the n triples once each, so \\(3\\mathrm{m} + \\mathrm{n} = 8040\\) . Hence \\(\\mathrm{m} = 1990\\) .", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 3", "solution_match": "# Solution"}} {"year": "1990", "tier": "T1", "problem_label": "4", "problem_type": null, "exam": "AllSovietUnion", "problem": "Does there exist a rectangle which can be dissected into 15 congruent polygons which are not rectangles? Can a square be dissected into 15 congruent polygons which are not rectangles? \n\n## Answer \n\nyes, yes", "solution": "![md5:fe9e789413e4c2d406e979a3b5cc493e](fe9e789413e4c2d406e979a3b5cc493e.jpeg)\n \n\nBy stretching vertically we get a square.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 4", "solution_match": "# Solution"}} {"year": "1990", "tier": "T1", "problem_label": "5", "problem_type": null, "exam": "AllSovietUnion", "problem": "The point P lies inside the triangle ABC. A line is drawn through P parallel to each side of the triangle. The lines divide AB into three parts length c, c', c\" (in that order), and BC into three parts length a, a', a\" (in that order), and CA into three parts length b, b', b\" (in that order). Show that abc = a'b'c' = a\"b\"c\".", "solution": "![md5:fca7c846c76e89d2f888faaeee6233c1](fca7c846c76e89d2f888faaeee6233c1.jpeg)\n \n\nThe three small triangles are similar, so a/a\" = c'/c = b\"/b' and a/a' = c'/c\" = b\"/b. Hence (a/a\")(b/b\") = (c'/c)(c\"/c') = c\"/c, so abc = a\"b\"c\". Similarly, (a/a')(c/c') = (b\"/b)(b\"/b\") = b/b, so abc = a'b'c'.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 5", "solution_match": "# Solution"}} {"year": "1990", "tier": "T1", "problem_label": "6", "problem_type": null, "exam": "AllSovietUnion", "problem": "Find three non- zero reals such that all quadratics with those numbers as coefficients have two distinct rational roots. \n\nAnswer 1,2,- 3", "solution": "If a + b + c = 0, then 1 is a root of ax² + bx + c, and so the other root is - b/a - 1, which is rational.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 6", "solution_match": "# Solution"}} {"year": "1990", "tier": "T1", "problem_label": "7", "problem_type": null, "exam": "AllSovietUnion", "problem": "What is the largest possible value of \\(|\\ldots |\\mathrm{la}_1 - \\mathrm{a}_2| - \\mathrm{a}_3| - \\ldots - \\mathrm{a}_{1990}|\\) , where \\(a_1, a_2, \\ldots , a_{1990}\\) is a permutation of 1, 2, 3, ..., 1990? \n\nAnswer 1989", "solution": "Since \\(\\mathrm{la - bl} \\leq \\max (\\mathrm{a,b})\\) , a trivial induction shows that the expression does not exceed \\(\\max (\\mathrm{a}_1, \\mathrm{a}_2, \\ldots , \\mathrm{a}_{1990}) = 1990\\) . But for integers \\(\\mathrm{la - bl}\\) has the same parity as \\(\\mathrm{a + b}\\) , so a trivial induction shows that the expression has the same parity as \\(\\mathrm{a}_1 + \\mathrm{a}_2 + \\ldots + \\mathrm{a}_{1990} = 1990\\) . 1991/2, which is odd. So it cannot exceed 1989. That can be attained by the permutation 2, 4, 5, 3, 6, 8, 9, 7, ... , \\(4\\mathrm{k} + 2\\) , \\(4\\mathrm{k} + 4\\) , \\(4\\mathrm{k} + 5\\) , \\(4\\mathrm{k} + 3\\) , ..., \\(1984 + 2\\) , \\(1984 + 4\\) , \\(1984 + 5\\) , \\(1984 + 3\\) , 1990, 1. Because we get successively 2, 3, 0; 6, 2, 7, 0; 10, 2, 11, 0; ... ; \\(4\\mathrm{k} + 2\\) , 2, \\(4\\mathrm{k} + 3\\) , 0; ... ; 1986, 2, 1987, 0; 1990, 1989.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 7", "solution_match": "# Solution"}} {"year": "1990", "tier": "T1", "problem_label": "8", "problem_type": null, "exam": "AllSovietUnion", "problem": "An equilateral triangle of side n is divided into \\(\\mathrm{n}^2\\) equilateral triangles of side 1. A path is drawn along the sides of the triangles which passes through each vertex just once. Prove that the path makes an acute angle at at least n vertices.", "solution": "![md5:58aed129ef4e27f6b77023add17b0c63](58aed129ef4e27f6b77023add17b0c63.jpeg)\n \n\nThe diagram has \\(1 + 2 + \\ldots + \\mathrm{n} = \\mathrm{n}(\\mathrm{n} + 1) / 2\\) upright triangles and \\(1 + 2 + \\ldots + \\mathrm{n} - 1 = \\mathrm{n}(\\mathrm{n} - 1) / 2\\) upside down triangles. It has \\(1 + 2 + \\ldots + \\mathrm{n} + 1 = (\\mathrm{n} + 1)(\\mathrm{n} + 2) / 2\\) vertices. So the path must be \\((\\mathrm{n} + 1)(\\mathrm{n} + 2) / 2 - 1 = (\\mathrm{n}^2 +3\\mathrm{n}) / 2\\) units long. Each unit length of the path is in just one upright triangle. The path cannot contain all three sides of a small triangle, or it would pass through a vertex more than once. So it must contain two sides of \\((\\mathrm{n}^2 +3\\mathrm{n}) / 2 - \\mathrm{n}(\\mathrm{n} + 1) / 2 = \\mathrm{n}\\) triangles. But if it contains two sides of a triangle, then it must make an acute angle at the vertex where they meet.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 8", "solution_match": "# Solution"}} {"year": "1990", "tier": "T1", "problem_label": "9", "problem_type": null, "exam": "AllSovietUnion", "problem": "Can the squares of a 1990 x 1990 chessboard be colored black or white so that half the squares in each row and column are black and cells symmetric with respect to the center are of opposite color? \n\nAnswer no", "solution": "![md5:ba89446342b07ea6059c12a58ecc2d7f](ba89446342b07ea6059c12a58ecc2d7f.jpeg)\n \n\nSuppose it can be done. Divide the board into 4 quadrants. Suppose there are b black and \\(995^{2}\\) - b white squares in the top left quadrant. Then there are \\(995^{2}\\) - b black and b white squares in the bottom right quadrant (by the symmetry property). \n\nIf half the squares in each row are black, then half the squares in the first 995 rows are black, so the number of black squares in the top right quadrant is 995. \\(1990 / 2 - \\mathrm{b} = 995^{2} - \\mathrm{b}\\) . So if half the squares in each column are black, then half the squares in the right- hand half of the board are black, so \\((995^{2} - \\mathrm{b}) + (995^{2} - \\mathrm{b}) = 995^{2}\\) , in other words, \\(\\mathrm{b} = 995^{2} / 2\\) , which is impossible.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 9", "solution_match": "\nSolution"}} {"year": "1990", "tier": "T1", "problem_label": "10", "problem_type": null, "exam": "AllSovietUnion", "problem": "Let \\(\\mathbf{x}_1\\) , \\(\\mathbf{x}_2\\) , ..., \\(\\mathbf{x}_n\\) be positive reals with sum 1. Show that \\(\\mathbf{x}_1^{2} / (\\mathbf{x}_1 + \\mathbf{x}_2) + \\mathbf{x}_2^{2} / (\\mathbf{x}_2 + \\mathbf{x}_3) + \\ldots + \\mathbf{x}_n\\) . \\(\\frac{1}{2} /(\\mathbf{x}_{\\mathrm{n - 1}} + \\mathbf{x}_{\\mathrm{n}}) + \\mathbf{x}_{\\mathrm{n}}^{2} / (\\mathbf{x}_{\\mathrm{n}} + \\mathbf{x}_{\\mathrm{1}}) \\geq 1 / 2\\) .", "solution": "\\[\\sum \\mathbf{x}_1^{2} / (\\mathbf{x}_1 + \\mathbf{x}_{i + 1}) - \\sum \\mathbf{x}_{i + 1}^{2} / (\\mathbf{x}_i + \\mathbf{x}_{i + 1}) = \\sum (\\mathbf{x}_i - \\mathbf{x}_{i + 1}) = 0.\\] \\[\\mathbf{x}_i^{2} + \\mathbf{x}_{i + 1}^{2} / (\\mathbf{x}_i + \\mathbf{x}_{i + 1}) \\geq \\frac{1}{4} \\sum (\\mathbf{x}_i + \\mathbf{x}_{i + 1}) = \\frac{1}{2}.\\]", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 10", "solution_match": "# Solution"}} {"year": "1990", "tier": "T1", "problem_label": "11", "problem_type": null, "exam": "AllSovietUnion", "problem": "ABCD is a convex quadrilateral. X is a point on the side AB. AC and DE intersect at Y. Show that the circumcircles of ABC, CDY and BDX have a common point.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 11", "solution_match": ""}} {"year": "1990", "tier": "T1", "problem_label": "12", "problem_type": null, "exam": "AllSovietUnion", "problem": "Two grasshoppers sit at opposite ends of the interval [0, 1]. A finite number of points (greater than zero) in the interval are marked. A move is for a grasshopper to select a marked point and jump over it to the equidistant point the other side. This point must lie in the interval for the move to be allowed, but it does not have to be marked. What is the smallest n such that if each grasshopper makes n moves or less, then they end up with no marked points between them?", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 12", "solution_match": ""}} {"year": "1990", "tier": "T1", "problem_label": "13", "problem_type": null, "exam": "AllSovietUnion", "problem": "Find all integers n such that \\([\\mathrm{n} / 1!] + [\\mathrm{n} / 2!] + \\ldots + [\\mathrm{n} / 10!] = 1001\\) .", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 13", "solution_match": ""}} {"year": "1990", "tier": "T1", "problem_label": "14", "problem_type": null, "exam": "AllSovietUnion", "problem": "A, B, C are adjacent vertices of a regular 2n- gon and D is the vertex opposite to B (so that BD passes through the center of the 2n- gon). X is a point on the side AB and Y is a point on the side BC so that angle XDY = π/2n. Show that DY bisects angle XYC.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 14", "solution_match": ""}} {"year": "1990", "tier": "T1", "problem_label": "15", "problem_type": null, "exam": "AllSovietUnion", "problem": "A graph has n points and n(n- 1)/2 edges. Each edge is colored with one of k colors so that there are no closed monochrome paths. What is the largest possible value of n (given k)?", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 15", "solution_match": ""}} {"year": "1990", "tier": "T1", "problem_label": "16", "problem_type": null, "exam": "AllSovietUnion", "problem": "Given a point X and n vectors \\(\\mathbf{x}_{\\mathrm{i}}\\) with sum zero in the plane. For each permutation of the vectors we form a set of n points, by starting at X and adding the vectors in order. For example, with the original ordering we get \\(\\mathbf{X}_{1}\\) such that \\(\\mathbf{X}\\mathbf{X}_{1} = \\mathbf{x}_{1}\\) , \\(\\mathbf{X}_{2}\\) such that \\(\\mathbf{X}_{1}\\mathbf{X}_{2} = \\mathbf{x}_{2}\\) and so on. Show that for some permutation we can find two points Y, Z with angle \\(\\mathbf{Y}\\mathbf{X}\\mathbf{Z} = 60\\) deg, so that all the points lie inside or on the triangle XYZ.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 16", "solution_match": ""}} {"year": "1990", "tier": "T1", "problem_label": "17", "problem_type": null, "exam": "AllSovietUnion", "problem": "Two unequal circles intersect at X and Y. Their common tangents intersect at Z. One of the tangents touches the circles at P and Q. Show that ZX is tangent to the circumcircle of PXQ.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 17", "solution_match": ""}} {"year": "1990", "tier": "T1", "problem_label": "18", "problem_type": null, "exam": "AllSovietUnion", "problem": "Given 1990 piles of stones, containing 1, 2, 3, ..., 1990 stones. A move is to take an equal number of stones from one or more piles. How many moves are needed to take all the stones?", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 18", "solution_match": ""}} {"year": "1990", "tier": "T1", "problem_label": "19", "problem_type": null, "exam": "AllSovietUnion", "problem": "A quadratic polynomial \\(\\mathrm{p(x)}\\) has positive real coefficients with sum 1. Show that given any positive real numbers with product 1, the product of their values under p is at least 1.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 19", "solution_match": ""}} {"year": "1990", "tier": "T1", "problem_label": "20", "problem_type": null, "exam": "AllSovietUnion", "problem": "A cube side 100 is divided into a million unit cubes with faces parallel to the large cube. The edges form a lattice. A prong is any three unit edges with a common vertex. Can we decompose the lattice into prongs with no common edges?", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 20", "solution_match": ""}} {"year": "1990", "tier": "T1", "problem_label": "21", "problem_type": null, "exam": "AllSovietUnion", "problem": "For which positive integers n is \\(3^{2n + 1} - 2^{2n + 1} - 6^n\\) composite? \n\nAnswer all \\(n\\neq 1\\)", "solution": "\\(3^{2n + 1} - 2^{2n + 1} - 6^n = (3^n - 2^n)(3^{n + 1} + 2^{n + 1})\\) , so it is certainly composite for \\(n > 1\\) . For \\(n = 1\\) , it is \\(27 - 8 - 6 = 13\\) , which is prime.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 21", "solution_match": "# Solution"}} {"year": "1990", "tier": "T1", "problem_label": "22", "problem_type": null, "exam": "AllSovietUnion", "problem": "If every altitude of a tetrahedron is at least 1, show that the shortest distance between each pair of opposite edges is more than 2.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 22", "solution_match": ""}} {"year": "1990", "tier": "T1", "problem_label": "23", "problem_type": null, "exam": "AllSovietUnion", "problem": "A game is played in three moves. The first player picks any real number, then the second player makes it the coefficient of a cubic, except that the coefficient of \\(x^{3}\\) is already fixed at 1. Can the first player make his choices so that the final cubic has three distinct integer roots?", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 23", "solution_match": ""}} {"year": "1990", "tier": "T1", "problem_label": "24", "problem_type": null, "exam": "AllSovietUnion", "problem": "Given 2n genuine coins and 2n fake coins. The fake coins look the same as genuine coins but weigh less (but all fake coins have the same weight). Show how to identify each coin as genuine or fake using a balance at most 3n times.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 24", "solution_match": ""}} {"year": "1991", "tier": "T1", "problem_label": "1", "problem_type": null, "exam": "AllSovietUnion", "problem": "Find all integers a, b, c, d such that ab - 2cd = 3, ac + bd = 1. \n\n## Answer \n\n\\[(\\mathrm{a},\\mathrm{b},\\mathrm{c},\\mathrm{d}) = (1,3,1,0),(-1, - 3, - 1,0), (3,1,0,1),(-3, - 1,0, - 1)\\]", "solution": "\\(11 = (\\mathrm{ab} - 2\\mathrm{cd})^{2} + 2(\\mathrm{ac} + \\mathrm{bd})^{2} = (\\mathrm{a}^{2} + 2\\mathrm{d}^{2})(\\mathrm{b}^{2} + 2\\mathrm{c}^{2})\\) , so we must have either (1) \\(\\mathrm{a}^{2} + 2\\mathrm{d}^{2} = 1\\) , \\(\\mathrm{b}^{2} + 2\\mathrm{c}^{2} = 11\\) , or (2) \\(\\mathrm{a}^{2} + 2\\mathrm{d}^{2} = 11\\) , \\(\\mathrm{b}^{2} + 2\\mathrm{c}^{2} = 1\\) . \n\n(1) gives \\(\\mathrm{a} = \\pm 1\\) , \\(\\mathrm{d} = 0\\) , \\(\\mathrm{b} = \\pm 3\\) , \\(\\mathrm{c} = \\pm 1\\) . If \\(\\mathrm{a} = 1\\) and \\(\\mathrm{d} = 0\\) , then \\(\\mathrm{ac} + \\mathrm{bd} = 1\\) implies \\(\\mathrm{c} = 1\\) , and \\(\\mathrm{ab} - 2\\mathrm{cd} = 3\\) implies \\(\\mathrm{b} = 3\\) . Similarly, if \\(\\mathrm{a} = -1\\) , then \\(\\mathrm{c} = -1\\) , and \\(\\mathrm{b} = -3\\) . Similarly, (2) gives \\((\\mathrm{a},\\mathrm{b},\\mathrm{c},\\mathrm{d}) = (3,1,0,1),(-3, - 1,0, - 1)\\) .", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 1", "solution_match": "# Solution"}} {"year": "1991", "tier": "T1", "problem_label": "2", "problem_type": null, "exam": "AllSovietUnion", "problem": "n numbers are written on a blackboard. Someone then repeatedly erases two numbers and writes half their arithmetic mean instead, until only a single number remains. If all the original numbers were 1, show that the final number is not less than \\(1 / \\mathrm{n}\\) .", "solution": "Put \\(\\mathrm{c} = (\\mathrm{a} + \\mathrm{b}) / 4\\) . We have \\(1 / \\mathrm{c} = 4 / (\\mathrm{a} + \\mathrm{b}) \\leq 1 / \\mathrm{a} + 1 / \\mathrm{b}\\) , so each move does not increase the sum of the reciprocals of the numbers. If the final number is \\(\\mathrm{k}\\) , then the final sum of reciprocals is \\(1 / \\mathrm{k}\\) . The initial sum is \\(\\mathrm{n}\\) , so \\(1 / \\mathrm{k} \\leq \\mathrm{n}\\) , or \\(\\mathrm{k} \\geq 1 / \\mathrm{n}\\) .", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 2", "solution_match": "# Solution"}} {"year": "1991", "tier": "T1", "problem_label": "3", "problem_type": null, "exam": "AllSovietUnion", "problem": "Four lines in the plane intersect in six points. Each line is thus divided into two segments and two rays. Is it possible for the eight segments to have lengths 1, 2, 3, ..., 8? Can the lengths of the eight segments be eight distinct integers? \n\nAnswer no, yes", "solution": "![md5:386ceaf84dd3e55dc0eef7999b32a956](386ceaf84dd3e55dc0eef7999b32a956.jpeg)\n \n\nIf a triangle has integer sides, one of which is 1, then it must be isosceles. So the only candidates for the segment length 1 are AB and AE. wlog \\(\\mathrm{AB} = 1\\) , so \\(\\mathrm{BF} = \\mathrm{AF}\\) . Hence \\(\\cos\\)\n\n\n\nDFE = 1 - 1/(2 AF²). Hence ED² = DF² + EF² + 2DF. EF(1 - 1/2AF²) = DF² + EF² + 2DF. EF - DF. EF/AF². But the first three terms are integers and the last term is < 1. Contradiction. (Careful, looking at the figure one is tempted to conclude that ED < AB, but a more realistic figure shows that is false.). \n\n![md5:de556ee4d753e91963e7e8be0bcc6baf](de556ee4d753e91963e7e8be0bcc6baf.jpeg)\n \n\nBuilding on the 3,4,5 triangle we get the figure above.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 3", "solution_match": "# Solution"}} {"year": "1991", "tier": "T1", "problem_label": "4", "problem_type": null, "exam": "AllSovietUnion", "problem": "A lottery ticket has 50 cells into which one must put a permutation of 1, 2, 3, ..., 50. Any ticket with at least one cell matching the winning permutation wins a prize. How many tickets are needed to be sure of winning a prize? \n\nAnswer 26", "solution": "Take the tickets: \n\n1 2 3 ... 25 26 27 ... 50 2 3 4 ... 26 1 27 ... 50 3 4 5 ... 1 2 27 ... 50 \n\n26 1 2 ... 24 25 27 ... 50 Each of the numbers 1, 2, ..., 26 occurs in each of the places 1, 2, ..., 26, but the winning ticket cannot have all these numbers in the last 24 places. So there must be at least one match. So 26 tickets suffice. \n\nNow given any 25 tickets we show that they could all fail to match the winning permutation. In other words, we construct a permutation which fails to match any of the 25 tickets in any cell. We place the numbers 1, 2, 3, ..., 50 in turn. We start by placing 1. Clearly at most 25 places are ruled out, so we can place the 1. Now suppose we have placed 1, 2, ..., a. There must be at least 25 places where a+1 is not ruled out. If any of them are still unoccupied, then we are done. If not, they must be occupied by numbers \\(\\mathbf{x}_1\\) , \\(\\mathbf{x}_2\\) , ..., \\(\\mathbf{x}_{25}\\) already placed. Take any empty place. 26 numbers cannot be ruled out for it, and we know that a+1 is ruled out, so at least one of the \\(\\mathbf{x}_i\\) is not ruled out. So we can move that \\(\\mathbf{x}_i\\) to it and then place a+1 where the \\(\\mathbf{x}_i\\) came from.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 4", "solution_match": "# Solution"}} {"year": "1991", "tier": "T1", "problem_label": "5", "problem_type": null, "exam": "AllSovietUnion", "problem": "Find unequal integers m, n such that mn + n and mn + m are both squares. Can you find such integers between 988 and 1991? \n\nAnswer no", "solution": "For example, \\(49 = 7^{2}\\) , \\(50 = 2\\) . \\(5^{2}\\) , \\(8 = 2\\) . \\(2^{2}\\) , \\(9 = 3^{2}\\) , so \\(49\\) . \\(8 + 8 = 20^{2}\\) , \\(49\\) . \\(8 + 49 = 21^{2}\\) . \n\n\\(\\mathrm{wlog m}< \\mathrm{n}\\) . Then \\(\\mathrm{mn} + \\mathrm{m} = (\\mathrm{m} + \\mathrm{h})^{2}\\) , \\(\\mathrm{mn} + \\mathrm{n} = (\\mathrm{m} + \\mathrm{k})^{2}\\) , with \\(\\mathrm{k} > \\mathrm{h}\\) . So \\(\\mathrm{n} - \\mathrm{m} = (\\mathrm{m} + \\mathrm{k})^{2} - (\\mathrm{m} + \\mathrm{h})^{2} = (\\mathrm{k} - \\mathrm{h})(2\\mathrm{m} + \\mathrm{k} + \\mathrm{h}) > 2\\mathrm{m}\\) , so \\(\\mathrm{n} > 3\\mathrm{m}\\) . Hence we cannot have \\(\\mathrm{m}\\) and \\(\\mathrm{n}\\) between 988 and 1991.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 5", "solution_match": "# Solution"}} {"year": "1991", "tier": "T1", "problem_label": "6", "problem_type": null, "exam": "AllSovietUnion", "problem": "ABCD is a rectangle. Points K, L, M, N are chosen on AB, BC, CD, DA respectively so that KL is parallel to MN, and KM is perpendicular to LN. Show that the intersection of KM and LN lies on BD.", "solution": "![md5:289e0cda6fd1182ce46a641ac3fcffd1](289e0cda6fd1182ce46a641ac3fcffd1.jpeg)\n \n\nLet LN and KM meet at O. \\(\\angle \\mathrm{NOM} = \\angle \\mathrm{NDM} = 90^{\\circ}\\) , so OMDN is cyclic. Hence \\(\\angle \\mathrm{NOD} = \\angle \\mathrm{NMD}\\) . Similarly, BLOK is cyclic and \\(\\angle \\mathrm{LOB} = \\angle \\mathrm{LKB}\\) . But NM is parallel to LK and AB is parallel to CD, so \\(\\angle \\mathrm{LKB} = \\angle \\mathrm{NMD}\\) . Hence \\(\\angle \\mathrm{NOD} = \\angle \\mathrm{LOB}\\) , so DOB is a straight line.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 6", "solution_match": "# Solution"}} {"year": "1991", "tier": "T1", "problem_label": "7", "problem_type": null, "exam": "AllSovietUnion", "problem": "An investigator works out that he needs to ask at most 91 questions on the basis that all the answers will be yes or no and all will be true. The questions may depend upon the earlier answers. Show that he can make do with 105 questions if at most one answer could be a lie.", "solution": "Suppose he asks n questions as usual, and then asks \"did you lie to any of the last n questions?\" If the reply is a truthful no, then the n answers were correct. If the reply is a lying no, then the n answers were still correct. On the other hand if the answer is yes, then the n answers might have been correct and might not. However, a lie has certainly been told, so all future answers must be truthful and so he could ask the n questions again. \n\n\\(91 = 7\\) . 13, so the obvious candidates for n are 7 and 13. If we take \\(\\mathrm{n} = 7\\) , then the worst case is 13 check questions and 7 repeat questions. That does not work because he needs 20 extra questions and only has 14. A little thought suggests reducing n each time. So the first batch of questions is 13, followed by a check question. If the check answer is yes, then he knows a lie has been told and asks the 13 questions again. No further check questions are needed, and he has used exactly 14 extra questions. If the check answer is no, then the lie may not have been told, so the next batch of questions is 12, followed by a check question, and so on. That allows him to ask \\(13 + 12 + \\ldots +1 = 91\\) questions. If he gets a yes to the check question after the batch of i, then he ignores the answers to that batch and asks them again, thus asking a total of 14 extra questions, but thereafter asks no check questions.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 7", "solution_match": "# Solution"}} {"year": "1991", "tier": "T1", "problem_label": "8", "problem_type": null, "exam": "AllSovietUnion", "problem": "A minus sign is placed on one square of a \\(5 \\mathrm{x} 5\\) board and plus signs are placed on the remaining squares. A move is to select a \\(2 \\mathrm{x} 2\\) , \\(3 \\mathrm{x} 3\\) , \\(4 \\mathrm{x} 4\\) or \\(5 \\mathrm{x} 5\\) square and change all the signs in it. Which initial positions allow a series of moves to change all the signs to plus? \n\nAnswer only the central square", "solution": "![md5:02463e47ef2122f6f333c91ae48786ab](02463e47ef2122f6f333c91ae48786ab.jpeg)\n \n\nWe take the 5x5 square, the two yellow 3x3 squares, which overlap at the center, and the two blue 2x2 squares. Then every square except the center square is changed an even number of times. So this works if the central square was selected. \n\n![md5:35c41272386d9da0a2235f7d237dfecf](35c41272386d9da0a2235f7d237dfecf.jpeg)\n \n\nIt is easy to check that any 2x2, 3x3, 4x4 or 5x5 square has an even number of green squares, so if the selected square was green, and we change it an odd number of times, then some other green square must also be changed an odd number of times and hence end up with a minus. So if all the squares end up plus, then the selected square was not green, so it must belong to the central white column. Similarly, it must belong to the central row and hence must be the center square.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 8", "solution_match": "# Solution"}} {"year": "1991", "tier": "T1", "problem_label": "9", "problem_type": null, "exam": "AllSovietUnion", "problem": "Show that \\((\\mathrm{x} + \\mathrm{y} + \\mathrm{z})^{2} / 3 \\geq \\mathrm{x}\\sqrt{(\\mathrm{y}\\mathrm{z})} + \\mathrm{y}\\sqrt{(\\mathrm{z}\\mathrm{x})} + \\mathrm{z}\\sqrt{(\\mathrm{x}\\mathrm{y})}\\) for all non- negative reals \\(\\mathrm{x}, \\mathrm{y}, \\mathrm{z}\\) .", "solution": "By AM/GM xy + yz \\(\\geq 2\\mathrm{x}\\sqrt{(\\mathrm{y}\\mathrm{z})}\\) . Adding the similar results gives \\(2(\\mathrm{xy} + \\mathrm{yz} + \\mathrm{zx})\\geq 2(\\mathrm{x}\\sqrt{(\\mathrm{y}\\mathrm{z})} +\\) \\(\\mathrm{y}\\sqrt{(\\mathrm{z}\\mathrm{x})} + \\mathrm{z}\\sqrt{(\\mathrm{x}\\mathrm{y})}\\) ). \n\nBy AM/GM \\(\\mathrm{x}^{2} + \\mathrm{x}^{2} + \\mathrm{y}^{2} + \\mathrm{z}^{2}\\geq 4\\mathrm{x}\\sqrt{(\\mathrm{y}\\mathrm{z})}\\) . Adding the similar results gives \\(\\mathrm{x}^{2} + \\mathrm{y}^{2} + \\mathrm{z}^{2}\\geq \\mathrm{x}\\sqrt{(\\mathrm{y}\\mathrm{z})}\\) \\(+\\mathrm{y}\\sqrt{(\\mathrm{z}\\mathrm{x})} +\\mathrm{z}\\sqrt{(\\mathrm{x}\\mathrm{y})}\\) . Adding the first result gives \\((\\mathrm{x} + \\mathrm{y} + \\mathrm{z})^{2} / 3\\geq \\mathrm{x}\\sqrt{(\\mathrm{y}\\mathrm{z})} +\\mathrm{y}\\sqrt{(\\mathrm{z}\\mathrm{x})} +\\mathrm{z}\\sqrt{(\\mathrm{x}\\mathrm{y})}\\)", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 9", "solution_match": "# Solution"}} {"year": "1991", "tier": "T1", "problem_label": "10", "problem_type": null, "exam": "AllSovietUnion", "problem": "Does there exist a triangle in which two sides are integer multiples of the median to that side? Does there exist a triangle in which every side is an integer multiple of the median to that side? \n\nAnswer yes, no", "solution": "The obvious approach is to make the triangle isosceles. So suppose the sides are a, b, b. Then the length m of a median to one of the sides length b satisfies: \\(\\mathrm{a}^2 +\\mathrm{b}^2 = 2\\mathrm{m}^2 +\\mathrm{b}^2 /2\\) . The simplest possibility is to take \\(\\mathrm{m} = \\mathrm{b}\\) , so \\(\\mathrm{a}^2 = 3\\mathrm{b}^2 /2\\) . Thus if \\(\\mathrm{b} = 2\\) , \\(\\mathrm{a} = \\sqrt{6}\\) . \n\nSuppose we have a triangle ABC, with medians AD, BE, CF, and BC/AD, CA/BE, AB/CF all integers. If \\(\\mathrm{AD} = \\mathrm{BC} / 2\\) , then \\(\\angle A = 90^{\\circ}\\) . If \\(\\mathrm{AD}< \\mathrm{BC} / 2\\) , then \\(\\angle A\\) is obtuse, so at least two of the medians must be equal to the corresponding sides. So wlog we have \\(\\mathrm{b}^2 +\\mathrm{c}^2 = 5\\mathrm{a}^2 /2\\) , \\(\\mathrm{c}^2 +\\mathrm{a}^2 = 5\\mathrm{b}^2 /2\\) . Subtracting, \\(\\mathrm{b}^2 -\\mathrm{a}^2 = (5 / 2)(\\mathrm{a}^2 -\\mathrm{b}^2)\\) , so \\(\\mathrm{a} = \\mathrm{b}\\) . Hence \\(\\mathrm{c} / \\mathrm{a} = \\sqrt{(3 / 2)}\\) . So the third median has length m where \\(\\mathrm{a}^2 +\\mathrm{a}^2 = (3 / 4)\\mathrm{a}^2 +2\\mathrm{m}^2\\) , so \\(\\mathrm{a} / \\mathrm{m} = \\sqrt{(8 / 5)}\\) , which is not integral. Contradiction.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 10", "solution_match": "# Solution"}} {"year": "1991", "tier": "T1", "problem_label": "11", "problem_type": null, "exam": "AllSovietUnion", "problem": "The numbers 1, 2, 3, ..., n are written on a blackboard (where \\(\\mathrm{n} \\geq 3\\) ). A move is to replace two numbers by their sum and non- negative difference. A series of moves makes all the numbers equal k. Find all possible k. \n\nAnswer all powers of \\(2 \\geq \\mathrm{n}\\)", "solution": "If a prime p divides \\(\\mathrm{a} + \\mathrm{b}\\) and a- b, then it divides 2a and 2b, so if p is odd, it divides a and b. Thus if an odd prime p divides k, then it must divide all the original numbers including 1. So k must be a power of 2. Note that \\(\\mathrm{k}, \\mathrm{k} \\rightarrow 0, 2\\mathrm{k} \\rightarrow 2\\mathrm{k}, 2\\mathrm{k}\\) and \\(\\mathrm{k}, \\mathrm{k}, \\mathrm{k} \\rightarrow 0, \\mathrm{k}, 2\\mathrm{k} \\rightarrow \\mathrm{k}, \\mathrm{k}, 2\\mathrm{k} \\rightarrow 0, 2\\mathrm{k}, 2\\mathrm{k} \\rightarrow 2\\mathrm{k}, 2\\mathrm{k}, 2\\mathrm{k}\\) . So (by a trivial induction) if we get all the numbers equal to k, then we can get them all to equal 2k. Finally, note that we can never decrease the largest number on the board, so the answer must be all powers of 2 greater than some minimum, which must be at least n. \n\nWe use induction to show that if \\(2^{\\mathrm{m}}\\) is the smallest power of 2 which is \\(\\geq \\mathrm{n}\\) , then we can get all numbers equal to \\(2^{\\mathrm{m}}\\) . Note that \\(0, \\mathrm{k} \\rightarrow \\mathrm{k}, \\mathrm{k} \\rightarrow 0, 2\\mathrm{k}\\) , so with a zero we can double each member of any set of numbers as often as we wish and finally convert the zero. For example, we could convert 0, 2, 4 to 8, 8, 8. It is convenient to take the induction hypothesis as \\(\\mathrm{S}_{\\mathrm{n}}\\) : we can convert 1, 2, ..., n to 0, \\(2^{\\mathrm{k}}, 2^{\\mathrm{k}}, \\ldots , 2^{\\mathrm{k}}\\) , where \\(2^{\\mathrm{k}}\\) is the smallest power of 2 which is \\(\\geq \\mathrm{n}\\) . \n\nWe show first that \\(\\mathrm{S}_{\\mathrm{n}}\\) is true for \\(\\mathrm{n} \\leq 8\\) . For \\(\\mathrm{n} = 3\\) , we take \\(1,3 \\rightarrow 2,4\\) , then \\(2,2 \\rightarrow 0,4\\) . For \\(\\mathrm{n} = 4\\) , we ignore the 4 and use the case \\(\\mathrm{n} = 3\\) . For \\(\\mathrm{n} = 5\\) , we take \\(3,5 \\rightarrow 2,8\\) . Then \\(2,2 \\rightarrow 0,4\\) . Then we use the 0 to convert the remaining powers of 2 (1,4,4) to 8. For \\(\\mathrm{n} = 6\\) , we take \\(2,6 \\rightarrow 4,8\\) and \\(3,5 \\rightarrow 2,8\\) , then \\(4,4 \\rightarrow 0,8\\) . Finally, we use the 0 to convert 1 and 2 to 8. For \\(\\mathrm{n} = 7\\) , we take \\(1,7 \\rightarrow 6,8\\) , then \\(2,6 \\rightarrow 4,8\\) , then \\(3,5 \\rightarrow 2,8\\) , then \\(4,4 \\rightarrow 0,8\\) , then \\(2,6 \\rightarrow 4,8\\) and finally use the 0 to convert the remaining 4 to 8. \n\nLet \\(\\mathrm{n} = 2^{\\mathrm{a}} + \\mathrm{b}\\) , where \\(0 < \\mathrm{b} \\leq 2^{\\mathrm{a}}\\) and assume \\(\\mathrm{S}_{\\mathrm{m}}\\) is true for all \\(\\mathrm{m} < \\mathrm{n}\\) . If \\(\\mathrm{b} = 1\\) , we convert the pair \\(2^{\\mathrm{a}} - 1\\) , \\(2^{\\mathrm{a}} + 1\\) to 2, \\(2^{\\mathrm{a} + 1}\\) . We have \\(2^{\\mathrm{a}} - 2 > 2\\) , so by induction we can convert 1, 2, ..., \\(2^{\\mathrm{a}} - 2\\) to 0, \\(2^{\\mathrm{a}}\\) , ..., \\(2^{\\mathrm{a}}\\) . Now all the numbers except 0 are powers of 2 and we can use the 0 to convert them each to \\(2^{\\mathrm{a} + 1}\\) . Similarly, if \\(\\mathrm{b} = 2\\) , we convert \\(2^{\\mathrm{a}} - 1\\) , \\(2^{\\mathrm{a}} + 1\\) to 2, \\(2^{\\mathrm{a} + 1}\\) and \\(2^{\\mathrm{a}} - 2\\) , \\(2^{\\mathrm{a}} + 2\\) to 4, \\(2^{\\mathrm{a} + 1}\\) and then proceed as in the previous case. If \\(3 \\leq \\mathrm{b} < 2^{\\mathrm{a}}\\) , then we start by converting the pairs \\((2^{\\mathrm{a}} + \\mathrm{b}, 2^{\\mathrm{a}} - \\mathrm{b})\\) , \\((2^{\\mathrm{a}} + \\mathrm{b} - 1, 2^{\\mathrm{a}} - \\mathrm{b} + 1)\\) , \\((2^{\\mathrm{a}} + \\mathrm{b} - 2, 2^{\\mathrm{a}} - \\mathrm{b} + 2)\\) , ..., \\((2^{\\mathrm{a}} + 1, 2^{\\mathrm{a}} - 1)\\) . That gives some \\(2^{\\mathrm{a} + 1}\\) s and 2, 4, ..., 2b. Now by \\(\\mathrm{S}_{\\mathrm{b}}\\) we can convert 2, 4, ..., 2b to 0, \\(2^{\\mathrm{a} + 1}\\) , ..., \\(2^{\\mathrm{a} + 1}\\) . The remaining\n\n\n\nnumbers 1, 2, ..., \\(2^{\\mathrm{a}}\\) - b- 1 can either be converted to powers of 2 by \\(S^{2\\mathrm{a - b - 1}}\\) (if \\(2^{\\mathrm{a}}\\) - b- 1 \\(\\geq 3\\) ) or are already powers of 2. Finally we use the 0 to bring all powers of 2 up to \\(2^{\\mathrm{a + 1}}\\) . In the case \\(\\mathrm{b} = 2^{\\mathrm{a}}\\) , we ignore \\(2^{\\mathrm{a}} + \\mathrm{b} (= 2^{\\mathrm{a + 1}})\\) and use the case b- 1 to convert the others.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 11", "solution_match": "# Solution"}} {"year": "1991", "tier": "T1", "problem_label": "12", "problem_type": null, "exam": "AllSovietUnion", "problem": "The figure below is cut along the lines into polygons (which need not be convex). No polygon contains a 2 x 2 square. What is the smallest possible number of polygons? \n\n![md5:04fbaa7e3df54e301a41791ce24d25b9](04fbaa7e3df54e301a41791ce24d25b9.jpeg)\n \n\nAnswer 12", "solution": "We can clearly cut the polygon into 12 strips width 1, so the smallest number is \\(\\leq 12\\) . \n\nThere are 84 unit squares in the figure. Each cut along the edge of a unit square not already cut (and not on the boundary) increases the number of pieces by at most 1. So it is sufficient to show that at most 72 edges remain uncut (after cutting into polygons). Because then cutting the remaining edges would increase the total number of pieces by at most 72. But the final number of pieces is 84, so we would have to start with at least 12. \n\nInitially, there are 144 edges, so we have to show that at least 72 of them are cut to make the polygons. An interior vertex has 4 edges. At least two of them must be cut, or the vertex would be the center of an uncut 2 x 2 square. If we take alternate interior vertices (36 in total, as shown below), then each has at least two cut edges, so in total at least 72 edges are cut to make the polygons.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 12", "solution_match": "# Solution"}} {"year": "1991", "tier": "T1", "problem_label": "13", "problem_type": null, "exam": "AllSovietUnion", "problem": "ABC is an acute- angled triangle with circumcenter O. The circumcircle of ABO intersects AC and BC at M and N. Show that the circumradii of ABO and MNC are the same.", "solution": "It is sufficient to show that \\(\\angle \\mathrm{MBN} = \\angle \\mathrm{C}\\) . But \\(\\angle \\mathrm{MBN} = \\angle \\mathrm{MBO} + \\angle \\mathrm{OBN} = \\angle \\mathrm{MAO} + \\angle \\mathrm{OBN} = \\angle \\mathrm{MCO} + \\angle \\mathrm{OCN} = \\angle \\mathrm{C}\\) .", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 13", "solution_match": "# Solution"}} {"year": "1991", "tier": "T1", "problem_label": "14", "problem_type": null, "exam": "AllSovietUnion", "problem": "A polygon can be transformed into a new polygon by making a straight cut, which creates two new pieces each with a new edge. One piece is then turned over and the two new edges are reattached. Can repeated transformations of this type turn a square into a triangle?", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 14", "solution_match": ""}} {"year": "1991", "tier": "T1", "problem_label": "15", "problem_type": null, "exam": "AllSovietUnion", "problem": "An \\(h \\times k\\) minor of an n x n table is the hk cells which lie in h rows and k columns. The semiperimeter of the minor is \\(\\mathrm{h} + \\mathrm{k}\\) . A number of minors each with semiperimeter at least n together include all the cells on the main diagonal. Show that they include at least half the cells in the table.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 15", "solution_match": ""}} {"year": "1991", "tier": "T1", "problem_label": "16", "problem_type": null, "exam": "AllSovietUnion", "problem": "(1) \\(\\mathbf{r}_1, \\mathbf{r}_2, \\ldots , \\mathbf{r}_{100}, \\mathbf{c}_1, \\mathbf{c}_2, \\ldots , \\mathbf{c}_{100}\\) are distinct reals. The number \\(\\mathbf{r}_i + \\mathbf{c}_j\\) is written in position i, j of a \\(100 \\times 100\\) array. The product of the numbers in each column is 1. Show that the product of the numbers in each row is -1. (2) \\(\\mathbf{r}_1, \\mathbf{r}_2, \\ldots , \\mathbf{r}_{2n}, \\mathbf{c}_1, \\mathbf{c}_2, \\ldots , \\mathbf{c}_{2n}\\) are distinct reals. The number \\(\\mathbf{r}_i + \\mathbf{c}_j\\) is written in position i, j of a \\(2n \\times 2n\\) array. The product of the numbers in each column is the same. Show that the product of the numbers in each row is also the same.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 16", "solution_match": ""}} {"year": "1991", "tier": "T1", "problem_label": "17", "problem_type": null, "exam": "AllSovietUnion", "problem": "A sequence of positive integers is constructed as follows. If the last digit of \\(\\mathbf{a}_{\\mathrm{n}}\\) is greater than 5, then \\(\\mathbf{a}_{\\mathrm{n} + 1}\\) is \\(9\\mathbf{a}_{\\mathrm{n}}\\) . If the last digit of \\(\\mathbf{a}_{\\mathrm{n}}\\) is 5 or less and \\(\\mathbf{a}_{\\mathrm{n}}\\) has more than one digit, then \\(\\mathbf{a}_{\\mathrm{n} + 1}\\) is obtained from \\(\\mathbf{a}_{\\mathrm{n}}\\) by deleting the last digit. If \\(\\mathbf{a}_{\\mathrm{n}}\\) has only one digit, which is 5 or less, then the sequence terminates. Can we choose the first member of the sequence so that it does not terminate?", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 17", "solution_match": ""}} {"year": "1991", "tier": "T1", "problem_label": "18", "problem_type": null, "exam": "AllSovietUnion", "problem": "\\(\\mathrm{p(x)}\\) is the cubic \\(\\mathrm{x}^3 - 3\\mathrm{x}^2 +5\\mathrm{x}\\) . If h is a real root of \\(\\mathrm{p(x)} = 1\\) and k is a real root of \\(\\mathrm{p(x)} = 5\\) find \\(\\mathrm{h} + \\mathrm{k}\\)", "solution": "Put \\(\\mathrm{y} = 2\\mathrm{- h}\\) , where \\(\\mathrm{p(h)} = 1\\) , then \\((2 - \\mathrm{y})^{3} - 3(2 - \\mathrm{y})^{2} + 5(2 - \\mathrm{y}) - 1 = 0\\) , so \\(8 - 12\\mathrm{y} + 6\\mathrm{y}^{2} - \\mathrm{y}^{3} - 12 + 12\\mathrm{y} - 3\\mathrm{y}^{2} + 10 - 5\\mathrm{y} - 1 = 0\\) , or \\(\\mathrm{y}^3 - 3\\mathrm{y}^2 +5\\mathrm{y} = 5\\) , or \\(\\mathrm{p(y)} = 5\\) . So if h is a root of \\(\\mathrm{p(h)} = 1\\) , then there is a root k of \\(\\mathrm{p(k)} = 5\\) such that \\(\\mathrm{h} + \\mathrm{k} = 2\\) . To complete the proof we have to show that \\(\\mathrm{p(x)} = 5\\) has only one real root. \n\nBut \\(\\mathrm{x}^3 - 3\\mathrm{x}^2 +5\\mathrm{x} = (\\mathrm{x} - 1)^3 +2(\\mathrm{x} - 1) + 3\\) which is a strictly increasing function of \\(\\mathrm{x} - 1\\) and hence of \\(\\mathrm{x}\\) . So \\(\\mathrm{p(x)} = \\mathrm{k}\\) has only one real root.", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 18", "solution_match": "# Solution"}} {"year": "1991", "tier": "T1", "problem_label": "19", "problem_type": null, "exam": "AllSovietUnion", "problem": "The chords AB and CD of a sphere intersect at X. A, C and X are equidistant from a point Y on the sphere. Show that BD and XY are perpendicular.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 19", "solution_match": ""}} {"year": "1991", "tier": "T1", "problem_label": "20", "problem_type": null, "exam": "AllSovietUnion", "problem": "Do there exist 4 vectors in the plane so that none is a multiple of another, but the sum of each pair is perpendicular to the sum of the other two? Do there exist 91 non- zero vectors in the plane such that the sum of any 19 is perpendicular to the sum of the others?", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 20", "solution_match": ""}} {"year": "1991", "tier": "T1", "problem_label": "21", "problem_type": null, "exam": "AllSovietUnion", "problem": "ABCD is a square. The points X on the side AB and Y on the side AD are such that AX·AY = 2 BX·DY. The lines CX and CY meet the diagonal BD in two points. Show that these points lie on the circumcircle of AXY.", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 21", "solution_match": ""}} {"year": "1991", "tier": "T1", "problem_label": "22", "problem_type": null, "exam": "AllSovietUnion", "problem": "X is a set with 100 members. What is the smallest number of subsets of X such that every pair of elements belongs to at least one subset and no subset has more than 50 members? What is the smallest number if we also require that the union of any two subsets has at most 80 members?", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 22", "solution_match": ""}} {"year": "1991", "tier": "T1", "problem_label": "23", "problem_type": null, "exam": "AllSovietUnion", "problem": "The real numbers \\(\\mathbf{x}_1,\\mathbf{x}_2,\\ldots ,\\mathbf{x}_{1991}\\) satisfy \\(\\left|\\mathbf{x}_1 - \\mathbf{x}_2\\right| + \\left|\\mathbf{x}_2 - \\mathbf{x}_3\\right| + \\ldots +\\left|\\mathbf{x}_{1990} - \\mathbf{x}_{1991}\\right| = 1991\\) . What is the maximum possible value of \\(\\left|\\mathbf{s}_1 - \\mathbf{s}_2\\right| + \\left|\\mathbf{s}_2 - \\mathbf{s}_3\\right| + \\ldots +\\left|\\mathbf{s}_{1990} - \\mathbf{s}_{1991}\\right|\\) , where \\(\\mathbf{s}_n = (\\mathbf{x}_1 + \\mathbf{x}_2 + \\ldots +\\mathbf{x}_n) / n\\) ?", "solution": "", "metadata": {"resource_path": "SovietUnion/segmented/en-ASU-1961-1991.jsonl", "problem_match": "# Problem 23", "solution_match": ""}}