On a circle there are $n$ red and $n$ blue arcs given in such a way that each red arc intersects each blue one. Prove that some point is contained by at least $n$ of the given coloured arcs.

[b]p1.[/b] Find the area of a right triangle with legs of lengths $20$ and $18$. [b]p2.[/b] How many $4$-digit numbers (without leading zeros) contain only $2,0,1,8$ as digits? Digits can be used more than once. [b]p3.[/b] A rectangle has perimeter $24$. Compute the largest possible area of the rectangle. [b]p4.[/b] Find the smallest positive integer with $12$ positive factors, including one and itself. [b]p5.[/b] Sammy can buy $3$ pencils and $6$ shoes for $9$ dollars, and Ben can buy $4$ pencils and $4$ shoes for $10$ dollars at the same store. How much more money does a pencil cost than a shoe? [b]p6.[/b] What is the radius of the circle inscribed in a right triangle with legs of length $3$ and $4$? [b]p7.[/b] Find the angle between the minute and hour hands of a clock at $12 : 30$. [b]p8.[/b] Three distinct numbers are selected at random fromthe set $\{1,2,3, ... ,101\}$. Find the probability that $20$ and $18$ are two of those numbers. [b]p9.[/b] If it takes $6$ builders $4$ days to build $6$ houses, find the number of houses $8$ builders can build in $9$ days. [b]p10.[/b] A six sided die is rolled three times. Find the probability that each consecutive roll is less than the roll before it. [b]p11.[/b] Find the positive integer $n$ so that $\frac{8-6\sqrt{n}}{n}$ is the reciprocal of $\frac{80+6\sqrt{n}}{n}$. [b]p12.[/b] Find the number of all positive integers less than $511$ whose binary representations differ from that of $511$ in exactly two places. [b]p13.[/b] Find the largest number of diagonals that can be drawn within a regular $2018$-gon so that no two intersect. [b]p14.[/b] Let $a$ and $b$ be positive real numbers with $a > b $ such that $ab = a +b = 2018$. Find $\lfloor 1000a \rfloor$. Here $\lfloor x \rfloor$ is equal to the greatest integer less than or equal to $x$. [b]p15.[/b] Let $r_1$ and $r_2$ be the roots of $x^2 +4x +5 = 0$. Find $r^2_1+r^2_2$ . [b]p16.[/b] Let $\vartriangle ABC$ with $AB = 5$, $BC = 4$, $C A = 3$ be inscribed in a circle $\Omega$. Let the tangent to $\Omega$ at $A$ intersect $BC$ at $D$ and let the tangent to $\Omega$ at $B$ intersect $AC$ at $E$. Let $AB$ intersect $DE$ at $F$. Find the length $BF$. [b]p17.[/b] A standard $6$-sided die and a $4$-sided die numbered $1, 2, 3$, and $4$ are rolled and summed. What is the probability that the sum is $5$? [b]p18.[/b] Let $A$ and $B$ be the points $(2,0)$ and $(4,1)$ respectively. The point $P$ is on the line $y = 2x +1$ such that $AP +BP$ is minimized. Find the coordinates of $P$. [b]p19.[/b] Rectangle $ABCD$ has points $E$ and $F$ on sides $AB$ and $BC$, respectively. Given that $\frac{AE}{BE}=\frac{BF}{FC}= \frac12$, $\angle ADE = 30^o$, and $[DEF] = 25$, find the area of rectangle $ABCD$. [b]p20.[/b] Find the sum of the coefficients in the expansion of $(x^2 -x +1)^{2018}$. [b]p21.[/b] If $p,q$ and $r$ are primes with $pqr = 19(p+q+r)$, find $p +q +r$ . [b]p22.[/b] Let $\vartriangle ABC$ be the triangle such that $\angle B$ is acute and $AB < AC$. Let $D$ be the foot of altitude from $A$ to $BC$ and $F$ be the foot of altitude from $E$, the midpoint of $BC$, to $AB$. If $AD = 16$, $BD = 12$, $AF = 5$, find the value of $AC^2$. [b]p23.[/b] Let $a,b,c$ be positive real numbers such that (i) $c > a$ (ii) $10c = 7a +4b +2024$ (iii) $2024 = \frac{(a+c)^2}{a}+ \frac{(c+a)^2}{b}$. Find $a +b +c$. [b]p24.[/b] Let $f^1(x) = x^2 -2x +2$, and for $n > 1$ define $f^n(x) = f ( f^{n-1}(x))$. Find the greatest prime factor of $f^{2018}(2019)-1$. [b]p25.[/b] Let $I$ be the incenter of $\vartriangle ABC$ and $D$ be the intersection of line that passes through $I$ that is perpendicular to $AI$ and $BC$. If $AB = 60$, $C A =120$, and $CD = 100$, find the length of $BC$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

A finite set of integers is called [i]bad[/i] if its elements add up to $2010$. A finite set of integers is a [i]Benelux-set[/i] if none of its subsets is bad. Determine the smallest positive integer $n$ such that the set $\{502, 503, 504, . . . , 2009\}$ can be partitioned into $n$ Benelux-sets. (A partition of a set $S$ into $n$ subsets is a collection of $n$ pairwise disjoint subsets of $S$, the union of which equals $S$.) [i](2nd Benelux Mathematical Olympiad 2010, Problem 1)[/i]

Let $A$ be a finite set of positive numbers , $B=\{\frac{a+b}{c+d} |a,b,c,d \in A \}$. Show that: $\left | B \right | \ge 2\left | A \right |^2-1 $, where $|X| $ be the number of elements of the finite set $X$. (High School Affiliated to Nanjing Normal University )

Let $n > 3$ be a positive integer. Suppose that $n$ children are arranged in a circle, and $n$ coins are distributed between them (some children may have no coins). At every step, a child with at least 2 coins may give 1 coin to each of their immediate neighbors on the right and left. Determine all initial distributions of the coins from which it is possible that, after a finite number of steps, each child has exactly one coin.

[url=http://www.mathlinks.ro/Forum/viewtopic.php?t=107262]IMO 2007 HKTST 1[/url] Problem 4 (a) Given five points on a plane such that no three of the points are collinear. Show that among the triangles which are drwan using any three of these five points as vertices, at least three of the triangles formed are not acute-angled triangles. (An acute-angled triangle is one in which all the three interior angles are acute angles.) (b) Given any 100 points on a plane such that no three of the points are collinear. SHow that among the triangles which are drawn using any three of these 100 points as vertices, at least 30% of the trinagles are not acute-angled triangles.

A crazy physicist discovered a new kind of particle wich he called an imon, after some of them mysteriously appeared in his lab. Some pairs of imons in the lab can be entangled, and each imon can participate in many entanglement relations. The physicist has found a way to perform the following two kinds of operations with these particles, one operation at a time. (i) If some imon is entangled with an odd number of other imons in the lab, then the physicist can destroy it. (ii) At any moment, he may double the whole family of imons in the lab by creating a copy $I'$ of each imon $I$. During this procedure, the two copies $I'$ and $J'$ become entangled if and only if the original imons $I$ and $J$ are entangled, and each copy $I'$ becomes entangled with its original imon $I$; no other entanglements occur or disappear at this moment. Prove that the physicist may apply a sequence of such operations resulting in a family of imons, no two of which are entangled.

Each of $4$ stones weights the integer number of grams. A balance with arrow indicates the difference of weights on the left and the right sides of it. Is it possible to determine the weights of all stones in $4$ weighings, if the balance can make a mistake in $1$ gram in at most one weighing?

A student wrote down the following sequence of numbers : the first number is 1, the second number is 2, and after that, each number is obtained by adding together all the previous numbers. Determine the 12th number in the sequence.

Let $n \geq 2, n \in \mathbb{N}$ and $A_0 = (a_{01},a_{02}, \ldots, a_{0n})$ be any $n-$tuple of natural numbers, such that $0 \leq a_{0i} \leq i-1,$ for $i = 1, \ldots, n.$ $n-$tuples $A_1= (a_{11},a_{12}, \ldots, a_{1n}), A_2 = (a_{21},a_{22}, \ldots, a_{2n}), \ldots$ are defined by: $a_{i+1,j} = Card \{a_{i,l}| 1 \leq l \leq j-1, a_{i,l} \geq a_{i,j}\},$ for $i \in \mathbb{N}$ and $j = 1, \ldots, n.$ Prove that there exists $k \in \mathbb{N},$ such that $A_{k+2} = A_{k}.$

Let $m$ and $n$ be positive integers greater than $1$. In each unit square of an $m\times n$ grid lies a coin with its tail side up. A [i]move[/i] consists of the following steps. [list=1] [*]select a $2\times 2$ square in the grid; [*]flip the coins in the top-left and bottom-right unit squares; [*]flip the coin in either the top-right or bottom-left unit square. [/list] Determine all pairs $(m,n)$ for which it is possible that every coin shows head-side up after a finite number of moves. [i]Thanasin Nampaisarn, Thailand[/i]

Two friends $A$ and $B$ must solve the following puzzle. Each of them receives a number from the set $\{1,2,…,250\}$, but they don’t see the number that the other received. The objective of each friend is to discover the other friend’s number. The procedure is as follows: each friend, by turns, announces various not necessarily distinct positive integers: first $A$ says a number, then $B$ says one, $A$ says a number again, etc., in such a way that the sum of all the numbers said is $20$. Demonstrate that there exists a strategy that $A$ and $B$ have previously agreed on such that they can reach the objective, no matter which number each one received at the beginning of the puzzle.

Seven cyclists follow one another, in a line, on a narrow way. By the end of the training, each cyclist complains about the style of driving of the one in front of him. They agree to rearrange themselves the next day, so that no cyclist would follow the same cyclist he follows the first day. How many such rearrangements are possible?

a) Given real numbers $a_1,a_2,b_1,b_2$ and positive $p_1,p_2,q_1,q_2$. Prove that in the table $2\times 2$ $$(a_1 + b_1)/(p_1 + q_1) , (a_1 + b_2)/(p_1 + q_2) $$ $$(a_2 + b_1)/(p_2 + q_1) , (a_2 + b_2)/(p_2 + q_2)$$ there is a number in the table, that is not less than another number in the same row and is not greater than another number in the same column (a saddle point). b) Given real numbers $a_1, a_2, ... , a_n, b_1, b_2, ... , b_n$ and positive $p_1, p_2, ... , p_n, q_1, q_2, ... , q_n$. We construct the table $n\times n$, with the numbers ($0 < i,j \le n$) $$(a_i + b_j)/(p_i + q_j)$$ in the intersection of the $i$-th row and $j$-th column. Prove that there is a number in the table, that is not less than arbitrary number in the same row and is not greater than arbitrary number in the same column (a saddle point).

The game of Nelipe is played on a $16\times16$-grid as follows: The two players write in turn numbers $1, 2,..., 16$ in different squares. The numbers on each row, column, and in every one of the 16 smaller squares have to be different. The loser is the one who is not able to write a number. Which one of the players wins, if both play with an optimal strategy?

a) A bus network is organized so that: 1) one can reach any stop from any other stop without changing buses; 2) every pair of routes has a single stop at which one can change buses; 3) each route has exactly three stops? How many bus routes are there? It is assumed that there are at least two routes. b) A town has $57$ bus routes. How many stops does each route have if it is known that 1) one can reach any stop from any other stop without changing buses; 2) for every pair of routes there is a single stop where one can change buses; 3) each route has three or more stops?

Each of the integers from 1 to 4027 has been colored either green or red. Changing the color of a number is making it red if it was green and making it green if it was red. Two positive integers $m$ and $n$ are said to be [i]cuates[/i] if either $\frac{m}{n}$ or $\frac{n}{m}$ is a prime number. A [i]step[/i] consists in choosing two numbers that are cuates and changing the color of each of them. Show it is possible to apply a sequence of steps such that every integer from 1 to 2014 is green.

a) A positive integer is written at each vertex of a triangle. Then on each side of the triangle the greatest common divisor of its ends is written. It is possible that the numbers written on the sides be three consecutive integers, in some order? b) A positive integer is written at each vertex of a tetrahedron. Then, on each edge of the tetrahedron is written the greatest common divisor of its ends . It is possible that the numbers written in the edges are six consecutive integers, in some order?

In how many ways can the set of integers $\{1,2,\ldots ,1995\}$ be partitioned into three non-empty sets so that none of these sets contains any pair of consecutive integers?

For a positive integer $N$, we color the positive divisors of $N$ (including 1 and $N$) with four colors. A coloring is called [i]multichromatic[/i] if whenever $a$, $b$ and $\gcd(a, b)$ are pairwise distinct divisors of $N$, then they have pairwise distinct colors. What is the maximum possible number of multichromatic colorings a positive integer can have if it is not the power of any prime?

Tim the Beaver can make three different types of geometrical figures: squares, regular hexagons, and regular octagons. Tim makes a random sequence $F_0$, $F_1$, $F_2$, $F_3$, $...$ of figures as follows: $\bullet$ $F_0$ is a square. $\bullet$ For every positive integer $i$, $F_i$ is randomly chosen to be one of the $2$ figures distinct from $F_{i-1}$ (each chosen with equal probability $\frac12$ ). $\bullet$ Tim takes $4$ seconds to make squares, $6$ to make hexagons, and $8$ to make octagons. He makes one figure after another, with no breaks in between. Suppose that exactly $17$ seconds after he starts making $F_0$, Tim is making a figure with $n$ sides. What is the expected value of $n$?

We have $n$ points in the plane such that they are not all collinear. We call a line $\ell$ a 'good' line if we can divide those $n$ points in two sets $A,B$ such that the sum of the distances of all points in $A$ to $\ell$ is equal to the sum of the distances of all points in $B$ to $\ell$. Prove that there exist infinitely many points in the plane such that for each of them we have at least $n+1$ good lines passing through them.

Is it possible to draw a closed $20$-link polyline on the plane and number its links with the numbers $1, 2, 3, \ldots, 20$ in the order of traversal so that for each natural $i = 1, 2, 3, \ldots, 10$ the links numbered $i$ and $10+i$ intersect each other and do not intersect the other links? [i] I. Efremov[/i]

A convex $n$-gon is divided into triangles by diagonals which do not intersect except at vertices of the n-gon. Each vertex belongs to an odd number of triangles. Show that $n$ must be a multiple of $3$.

We say that a pile is a set of four or more nuts. Two persons play the following game. They start with one pile of $n \geq 4$ nuts. During a move a player takes one of the piles that they have and split it into two nonempty sets (these sets are not necessarily piles, they can contain arbitrary number of nuts). If the player cannot move, he loses. For which values of $n$ does the first player have a winning strategy?