Let $ u_1, u_2, \ldots, u_m$ be $ m$ vectors in the plane, each of length $ \leq 1,$ with zero sum. Show that one can arrange $ u_1, u_2, \ldots, u_m$ as a sequence $ v_1, v_2, \ldots, v_m$ such that each partial sum $ v_1, v_1 \plus{} v_2, v_1 \plus{} v_2 \plus{} v_3, \ldots, v_1, v_2, \ldots, v_m$ has length less than or equal to $ \sqrt {5}.$

Consider the set $G$ of $2011^2$ points $(x, y)$ in the plane where $x$ and $y$ are both integers between $ 1$ and $2011$ inclusive. Let $A$ be any subset of $G$ containing at least $4\times 2011\times \sqrt{2011}$ points. Show that there are at least $2011^2$ parallelograms whose vertices lie in $A$ and all of whose diagonals meet at a single point.

Two players play the following game on a circular board with 2009 houses. The two plays put, alternatively, on an empty house, one of three pieces, called [i]explorer (E)[/i], [i]trap (T)[/i] or [i]stone (S)[/i]. A treasure is a sequence of three consecutive filled houses such that the first one (on any direction) has an explorer and the middle one doesn't have a trap. For example, [i]STE[/i] is not a treasure, while [i]TEE[/i] is a treasure. The first player forming a treasure wins. Can any of the players guarantee the victory? And, in affirmative case, who?

Ward and Gabrielle are playing a game on a large sheet of paper. At the start of the game, there are $999$ ones on the sheet of paper. Ward and Gabrielle each take turns alternatingly, and Ward has the first turn. During their turn, a player must pick two numbers a and b on the sheet such that $gcd(a, b) = 1$, erase these numbers from the sheet, and write the number $a + b$ on the sheet. The first player who is not able to do so, loses. Determine which player can always win this game.

One-round chess tournament involves $ 10 $ players from two countries. For a victory, one point is given, for a draw - half a point, for defeat - zero. All players scored a different number of points. Prove that one of the chess players scored in meetings with his countrymen less points, than meeting with players from another country.

A single burger is not enough to satisfy a guy's hunger. The five guys go to Five Guys' Restaurant, which has $20$ different meals on the menu. Each meal costs a different integer dollar amount between $\$1$ and $\$20$. The five guys have $\$20$ to split between them, and they want to use all the money to order five different meals. How many sets of five meals can the guys choose?

From a collection of $n$ persons $q$ distinct two-member teams are selected and ranked $1, \cdots, q$ (no ties). Let $m$ be the least integer larger than or equal to $2q/n$. Show that there are $m$ distinct teams that may be listed so that : [b](i)[/b] each pair of consecutive teams on the list have one member in common and [b](ii)[/b] the chain of teams on the list are in rank order. [i]Alternative formulation.[/i] Given a graph with $n$ vertices and $q$ edges numbered $1, \cdots , q$, show that there exists a chain of $m$ edges, $m \geq \frac{2q}{n}$ , each two consecutive edges having a common vertex, arranged monotonically with respect to the numbering.

For a competition a school wants to nominate a team of $k$ students, where $k$ is a given positive integer. Each member of the team has to compete in the three disciplines juggling, singing and mental arithmetic. To qualify for the team, the $n \ge 2$ students of the school compete in qualifying competitions, determining a unique ranking in each of the three disciplines. The school now wants to nominate a team satisfying the following condition: $(*)$ [i]If a student $X$ is not nominated for the team, there is a student $Y$ on the team who defeated $X$ in at least two disciplines.[/i] Determine all positive integers $n \ge 2$ such that for any combination of rankings, a team can be chosen to satisfy the condition $(*)$, when a) $k=2$, b) $k=3$.

Elza draws $2013$ cities on the map and connects some of them with $N$ roads. Then Elza and Susy erase cities in turns until just two cities left (first city is to be erased by Elza). If these cities are connected with a road then Elza wins, otherwise Susy wins. Find the smallest $N$ for which Elza has a winning strategy.

Two positive integers $p,q \in \mathbf{Z}^{+}$ are given. There is a blackboard with $n$ positive integers written on it. A operation is to choose two same number $a,a$ written on the blackboard, and replace them with $a+p,a+q$. Determine the smallest $n$ so that such operation can go on infinitely.

Let $n=3k$ be a positive integer (with $k\geq 2$). An equilateral triangle is divided in $n^2$ unit equilateral triangles with sides parallel to the initial, forming a grid. We will call "trapezoid" the trapezoid which is formed by three equilateral triangles (one base is equal to one and the other is equal to two). We colour the points of the grid with three colours (red, blue and green) such that each two neighboring points have different colour. Finally, the colour of a "trapezoid" will be the colour of the midpoint of its big base. Find the number of all "trapezoids" in the grid (not necessarily disjoint) and determine the number of red, blue and green "trapezoids".

[b]p1.[/b] BmMT is in a week, and we don’t have any problems! Let’s write $1$ on the first day, $2$ on the second day, $4$ on the third, $ 8$ on the fourth, $16$ on the fifth, $32$ on the sixth, and $64$ on the seventh. After seven days, how many problems will we have written in total? [b]p2.[/b] $100$ students are taking a ten-point exam. $50$ students scored $8$ points, $30$ students scored $7$ points, and the rest scored $9$ points. What is the average score for the exam? [b]p3.[/b] Rebecca has four pairs of shoes. Rebecca may or may not wear matching shoes. However, she will always use a left-shoe for her left foot and a right-shoe for her right foot. How many ways can Rebecca wear shoes? [b]p4.[/b] A council of $111$ mathematicians voted on whether to hold their conference in Beijing or Shanghai. The outcome of an initial vote was $70$ votes in favor of Beijing, and 41 votes in favor of Shanghai. If the vote were to be held again, what is the minimum number of mathematicians that would have to change their votes in order for Shanghai to win a majority of votes? [b]p5.[/b] What is the area of the triangle bounded by the line $20x + 16y = 160$, the $x$-axis, and the $y$-axis? [b]p6.[/b] Suppose that $3$ runners start running from the start line around a circular $800$-meter track and that their speeds are $100$, $160$, and $200$ meters per minute, respectively. How many minutes will they run before all three are next at the start line at the same time? [b]p7.[/b] Brian’s lawn is in the shape of a circle, with radius $10$ meters. Brian can throw a frisbee up to $50$ meters from where he stands. What is the area of the region (in square meters) in which the frisbee can land, if Brian can stand anywhere on his lawn? [b]p8.[/b] A seven digit number is called “bad” if exactly four of its digits are $0$ and the rest are odd. How many seven digit numbers are bad? [b]p9.[/b] Suppose you have a $3$-digit number with only even digits. What is the probability that twice that number also has only even digits? [b]p10.[/b] You have a flight on Air China from Beijing to New York. The flight will depart any time between $ 1$ p.m. and $6$ p.m., uniformly at random. Your friend, Henry, is flying American Airlines, also from Beijing to New York. Henry’s flight will depart any time between $3$ p.m. and $5$ p.m., uniformly at random. What is the probability that Henry’s flight departs before your flight? [b]p11.[/b] In the figure below, three semicircles are drawn outside the given right triangle. Given the areas $A_1 = 17$ and $A_2 = 14$, find the area $A_3$. [img]https://cdn.artofproblemsolving.com/attachments/4/4/28393acb3eba83a5a489e14b30a3e84ffa60fb.png[/img] [b]p12.[/b] Consider a circle of radius $ 1$ drawn tangent to the positive $x$ and $y$ axes. Now consider another smaller circle tangent to that circle and also tangent to the positive $x$ and $y$ axes. Find the radius of the smaller circle. [img]https://cdn.artofproblemsolving.com/attachments/7/4/99b613d6d570db7ee0b969f57103d352118112.png[/img] [b]p13.[/b] The following expression is an integer. Find this integer: $\frac{\sqrt{20 + 16\frac{\sqrt{20+ 16\frac{20 + 16...}{2}}}{2}}}{2}$ [b]p14.[/b] Let $2016 = a_1 \times a_2 \times ... \times a_n$ for some positive integers $a_1, a_2, ... , a_n$. Compute the smallest possible value of $a_1 + a_2 + ...+ a_n$. [b]p15.[/b] The tetranacci numbers are defined by the recurrence $T_n = T_{n-1} + T_{n-2} + T_{n-3} + T_{n-4}$ and $T_0 = T_1 = T_2 = 0$ and $T_3 = 1$. Given that $T_9 = 29$ and $T_{14} = 773$, calculate $T_{15}$. [b]p16.[/b] Find the number of zeros at the end of $(2016!)^{2016}$. Your answer should be an integer, not its prime factorization. [b]p17.[/b] A DJ has $7$ songs named $1, 2, 3, 4, 5, 6$, and $7$. He decides that no two even-numbered songs can be played one after the other. In how many different orders can the DJ play the $7$ songs? [b]p18.[/b] Given a cube, how many distinct ways are there (using $6$ colors) to color each face a distinct color? Colorings are distinct if they cannot be transformed into one another by a sequence of rotations. [b]p19. [/b]Suppose you have a triangle with side lengths $3, 4$, and $5$. For each of the triangle’s sides, draw a square on its outside. Connect the adjacent vertices in order, forming $3$ new triangles (as in the diagram). What is the area of this convex region? [img]https://cdn.artofproblemsolving.com/attachments/4/c/ac4dfb91cd055badc07caface93761453049fa.png[/img] [b]p20.[/b] Find $x$ such that $\sqrt{c +\sqrt{c - x}} = x$ when $c = 4$. PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $P_1, P_2, \dots, P_n$ be points on the plane. There is an edge between distinct points $P_x, P_y$ if and only if $x \mid y$. Find the largest $n$, such that the graph can be drawn with no crossing edges.

Siva has the following expression, which is missing operations: $$\frac12 \,\, \_ \,\,\frac14 \,\, \_ \,\, \frac18 \,\, \_ \,\,\frac{1}{16} \,\, \_ \,\,\frac{1}{32}.$$ For each blank, he flips a fair coin: if it comes up heads, he fills it with a plus, and if it comes up tails, he fills it with a minus. Afterwards, he computes the value of the expression. He then repeats the entire process with a new set of coinflips and operations. If the probability that the positive difference between his computed values is greater than $\frac12$ can be expressed as $\frac{a}{b}$ for relatively prime positive integers $a$, $b$, then find $a + b$.

An ordered quadruple of numbers is called [i]ten-esque[/i] if it is composed of 4 nonnegative integers whose sum is equal to $10$. Ana chooses a ten-esque quadruple $(a_1, a_2, a_3, a_4)$ and Banana tries to guess it. At each stage Banana offers a ten-esque quadtruple $(x_1,x_2,x_3,x_4)$ and Ana tells her the value of \[|a_1-x_1|+|a_2-x_2|+|a_3-x_3|+|a_4-x_4|\] How many guesses are needed for Banana to figure out the quadruple Ana chose?

A six-sided die is rolled four times. What is the probability that the minimum value of the four rolls is $4$?

each of the squares in a 2 x 2018 grid of squares is to be coloured black or white such that in any 2 x 2 block , at least one of the 4 squares is white. let P be the number of ways of colouring the grid. find the largest k so that $3^k$ divides P.

An infinite network is partitioned with dominos. Prove there exist three other tilings with dominos, have neither common domino with the existing tiling nor with each other. Clarifications for network: It means an infinite board consisting of square cells.

We call a sequence of length $n$ of zeros and ones a "string of length $n$" and the elements of the same sequence "bits". Let $m,n$ be two positive integers so that $m<2^n$. Arik holds $m$ strings of length $n$. Giora wants to find a new string of length $n$ different from all those Arik holds. For this Giora may ask Arik questions of the form: "What is the value of bit number $i$ in string number $j$?" where $1\leq i\leq n$ and $1\leq j\leq m$. What is the smallest number of questions needed for Giora to complete his task when: [b]a)[/b] $m=n$? [b]b)[/b] $m=n+1$?

On a straight road, points $1, 2, \ldots, n$ are marked. The distance between any two adjacent points is 1. A "placement" refers to the arrangement of $n$ cars, numbered with the same numbers, at the marked points (there can be multiple cars at one point). The "distance" between two placements is defined as the minimum total length of sections that need to be paved so that cars from the first placement can drive on the asphalt, forming the second one (cars can change places on the road). Prove that for any $\alpha<1$, there exists an integer number $n$ for which there are $100^n$ placements, the pairwise distances between which are greater than $\alpha n$. [i]Proposed by Ilya Bogdanov[/i]

Captain Jack and his pirate men plundered six chests of treasure $(A_1,A_2,A_3,A_4,A_5,A_6)$. Every chest $A_i$ contains $a_i$ coins of gold, and all $a_i$s are pairwise different $(i=1,2,\cdots ,6)$. They place all chests according to a layout (see the attachment) and start to alternately take out one chest a time between the captain and a pirate who serves as the delegate of the captain’s men. A rule must be complied with during the game: only those chests that are not adjacent to other two or more chests are allowed to be taken out. The captain will win the game if the coins of gold he obtains are not less than those of his men in the end. Let the captain be granted to take chest firstly, is there a certain strategy for him to secure his victory?

Some vertices of a regular $2024$-gon are marked such that for any regural polygon, all of whose vertices are vertices of the $2024$-gon, at least one of his vertices is marked. Find the minimal possible number of marked vertices [i]A. Voidelevich[/i]

You have an $n\times n$ grid and want to remove all edges of the grid by the sequence of the following moves. In each move, you can select a cell and remove exactly three edges surrounding that cell; in particular, that cell must have at least three remaining edges for the operation to be valid. For which positive integers $n$ is this possible?

A sequence $(x_n)_{n= 1}^{\infty}$ satisfies $x_1 = 1$ and for each $n > 1, x_n = \pm (n-1)x_{n-1} \pm (n-2)x_{n-2} \pm ... \pm 2x_2 \pm x_1$. Prove that the signs ” $\pm$” can be chosen so that $x_n \ne 12$ holds only for finitely many $n$.

Determine all composite positive integers $n$ for which it is possible to arrange all divisors of $n$ that are greater than 1 in a circle so that no two adjacent divisors are relatively prime.