Scribd
Upload
43 views1 page

Courtesy of Professor Andy Liu

This document contains 7 problems from an international mathematics tournament for senior-level students. The problems cover a range of mathematical topics and vary in difficulty and point value. They include questions about ratios of guard duty assignments, connecting points inside a circle, properties of integer sequences, geometry problems involving cubes and triangles, and covering a plane with overlapping rectangles.

Uploaded by

huonggiang97
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
43 views1 page

Courtesy of Professor Andy Liu

This document contains 7 problems from an international mathematics tournament for senior-level students. The problems cover a range of mathematical topics and vary in difficulty and point value. They include questions about ratios of guard duty assignments, connecting points inside a circle, properties of integer sequences, geometry problems involving cubes and triangles, and covering a plane with overlapping rectangles.

Uploaded by

huonggiang97
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

International Mathematics TOURNAMENT OF THE TOWNS Senior A-Level Paper Spring 20121 .

1. In a team of guards, each is assigned a dierent positive integer. For any two guards, the ratio of the two numbers assigned to them is at least 3:1. A guard assigned the number n is on duty for n days in a row, o duty for n days in a row, back on duty for n days in a row, and so on. The guards need not start their duties on the same day. Is it possible that on any day, at least one in such a team of guards is on duty? 2. One hundred points are marked inside a circle, with no three in a line. Prove that it is possible to connect the points in pairs such that all fty lines intersect one another inside the circle. 3. Let n be a positive integer. Prove that there exist integers a1 , a2 , . . . , an such that for any integer x, the number ( (((x2 + a1 )2 + a2 )2 + )2 + an1 )2 + an is divisible by 2n 1. 4. Alex marked one point on each of the six interior faces of a hollow unit cube. Then he connected by strings any two marked points on adjacent faces. Prove that the total length of these strings is at least 6 2. 5. Let be a tangent to the incircle of triangle ABC . Let a , b and c be the respective images of under reection across the exterior bisector of A, B and C . Prove that the triangle formed by these lines is congruent to ABC . 6. We attempt to cover the plane with an innite sequence of rectangles, overlapping allowed. (a) Is the task always possible if the area of the nth rectangle is n2 for each n? (b) Is the task always possible if each rectangle is a square, and for any number N , there exist squares with total area greater than N ? 7. Konstantin has a pile of 100 pebbles. In each move, he chooses a pile and splits it into two smaller ones until he gets 100 piles each with a single pebble. (a) Prove that at some point, there are 30 piles containing a total of exactly 60 pebbles. (b) Prove that at some point, there are 20 piles containing a total of exactly 60 pebbles. (c) Prove that Konstantin may proceed in such a way that at no point, there are 19 piles containing a total of exactly 60 pebbles. Note: The problems are worth 4, 5, 6, 6, 8, 3+6 and 6+3+3 points respectively.

Courtesy of Professor Andy Liu.

You might also like