Write down $1, 2, 3, ... , 2015$ in a row on a whiteboard. Every minute, select a pair of adjacent numbers at random, erase them, and insert their sum where you selected the numbers. (For instance, selecting $3$ and $4$ from $1, 2, 3, 4, 5$ would result in $1, 2, 7, 5$.) Repeat this process until you have two numbers remaining. What is the probability that the smaller number is less than or equal to $2015$?

Determine all values of $n$ for which there is a set $S$ with $n$ points, with no 3 collinear, with the following property: it is possible to paint all points of $S$ in such a way that all angles determined by three points in $S$, all of the same color or of three different colors, aren't obtuse. The number of colors available is unlimited.

[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].

There are some boys and girls sitting in an $ n \times n$ quadratic array. We know the number of girls in every column and row and every line parallel to the diagonals of the array. For which $ n$ is this information sufficient to determine the exact positions of the girls in the array? For which seats can we say for sure that a girl sits there or not?

In a concert, 20 singers will perform. For each singer, there is a (possibly empty) set of other singers such that he wishes to perform later than all the singers from that set. Can it happen that there are exactly 2010 orders of the singers such that all their wishes are satisfied? [i]Proposed by Gerhard Wöginger, Austria[/i]

Six points are placed on the plane such that each three of them are the vertices of a triangle with sides of different lengths. Prove that the shortest side of one of these triangles is also the longest side of another of them.

Prove that the natural numbers can be divided into two groups in a way that both conditions are fulfilled: 1) For every prime number $p$ and every natural number $n$, the numbers $p^n,p^{n+1}$ and $p^{n+2}$ do not have the same colour. 2) There does not exist an infinite geometric sequence of natural numbers of the same colour.

An $n$-tuple $(x_1, x_2,\dots, x_n)$ is called unearthly if $q_1x_1 +q_2x_2 +\dots+q_nx_n$ is irrational for any non-negative rational coefficients $q_1, q_2, \dots, q_n$ where $q_i$’s are not all zero. Prove that it is possible to select an unearthly $n$-tuple from any $2n-1$ distinct irrational numbers.

Vasya has $n{}$ candies of several types, where $n>145$. It is known that for any group of at least 145 candies, there is a type of candy which appears exactly 10 times. Find the largest possible value of $n{}$. [i]Proposed by A. Antropov[/i]

Does there exist a set $S$ of $100$ points in a plane such that the center of mass of any $10$ points in $S$ is also a point in $S$?

A group of $4046$ friends will play a videogame tournament. For that, $2023$ of them will go to one room which the computers are labeled with $a_1,a_2,\dots,a_{2023}$ and the other $2023$ friends go to another room which the computers are labeled with $b_1,b_2,\dots,b_{2023}$. The player of computer $a_i$ [b]always[/b] challenges the players of computer $b_i,b_{i+2},b_{i+3},b_{i+4}$(the player doesn't challenge $b_{i+1}$). After the first round, inside both rooms, the players may switch the computers. After the reordering, all the players realize that they are challenging the same players of the first round. Prove that if [b]one[/b] player has [b]not[/b] switched his computer, then all the players have not switched their computers.

Let $p, k$ and $x$ be positive integers such that $p \geq k$ and $x < \left[ \frac{p(p-k+1)}{2(k-1)} \right]$, where $[q]$ is the largest integer no larger than $q$. Prove that when $x$ balls are put into $p$ boxes arbitrarily, there exist $k$ boxes with the same number of balls.

For which values of $n$ it is possible to cover the side wall of staircase of n steps (for $n = 6$ in the figure) with plates of shown shape? The width and height of each step is $1$ dm, the dimensions of plate are $2 \times 2$ dm and from the corner there is cut out a piece with dimensions $1\times 1$ dm. [img]https://cdn.artofproblemsolving.com/attachments/e/e/ac7a52f3dd40480f82024794708c5a449e0c2b.png[/img]

For every integer $n$ from $0$ to $6$, we have $3$ identical weights with weight $2^n$. How many ways are there to form a total weight of 263 grams using only these given weights?

There are $80$ peoples, one of them is murderer, and other one is witness of crime. Every day detective interrogates some peoples from this group. Witness will says about crime only if murderer will not be in interrogatory with him. It is enough $12$ days to find murderer ?

The great Zagier and his assistant performed a magic trick, which was a natural one number $n$ involved. To do this, Zagier distributes $n$ identical coins (with heads and tails on the sides) and then leave the hall. The audience now arranges the coins in a row, you can choose the top side of each coin as you like, and then tell the assistant one natural number $k$ from $1$ to $n$. This then turns over exactly one coin, whereupon Zagier is brought in and placed in front of said coins. To the surprise of the non-mathematical, he can name the number $k$ to the public. For which natural numbers $n$ can this trick be carried out, if the two are allowed to coordinate only before the show, but during the show they do not use any magic tricks?

Given is a convex polygon $ P$ with $ n$ vertices. Triangle whose vertices lie on vertices of $ P$ is called [i]good [/i] if all its sides are unit length. Prove that there are at most $ \frac {2n}{3}$ [i]good[/i] triangles. [i]Author: Vyacheslav Yasinskiy, Ukraine[/i]

A square is divided into $N^2$ equal smaller non-overlapping squares, where $N \geq 3$. We are given a broken line which passes through the centres of all the smaller squares (such a broken line may intersect itself). [list] [*] Show that it is possible to find a broken line composed of $4$ segments for $N = 3$. [*] Find the minimum number of segments in this broken line for arbitrary $N$. [/list]

Let $p_n(k)$ be the number of permutations of the set $\{1,2,3,\ldots,n\}$ which have exactly $k$ fixed points. Prove that $\sum_{k=0}^nk p_n(k)=n!$.

The sword is a figure consisting of $6$ unit squares presented in the picture below (and any other figure obtained from it by rotation). [img]https://cdn.artofproblemsolving.com/attachments/4/3/08494627d043ea575703564e9e6b5ba63dc2ef.png[/img] Determine the largest number of swords that can be cut from a $6\times 11$ piece of paper divided into unit squares (each sword should consist of six such squares).

Find all positive integers n such that one can write an integer 1 to $ n^2$ into each unit square of a $ n^2 \times n^2$ table in such a way that, in each row, each column and each $ n \times n$ block of unit squares, each number 1 to $ n^2$ occurs exactly once.

[b]6.1 [/b] Two people went from point A to point B. The first one walked along highway at a speed of 5 km/h, and the second along a path at a speed of 4 km/h. The first of them arrived at point B an hour later and traveled 6 kilometers more. Find the distance from A to B along the highway. [b]6.2.[/b] A pedestrian walks along the highway at a speed of 5 km/hour. Along this highway in both directions at the same speed Buses run, meeting every 5 minutes. At 12 o'clock the pedestrian noticed that the buses met near him and, Continuing to walk, he began to count those oncoming and overtaking buses. At 2 p.m., buses met near him again. It turned out that during this time the pedestrian encountered 4 buses more than overtook him. Find the speed of the bus [b]6.3. [/b] Prove that the difference $43^{43} - 17^{17}$ is divisible by $10$. [b]6.4. [/b] Two squares are cut out of the chessboard on the border of the board. When is it possible and when is it not possible to cover with the remaining squares of the board? shapes of the view without overlay? [b]6.5.[/b] The distance from city A to city B (by air) is 30 kilometers, from B to C - 80 kilometers, from C to D - 236 kilometers, from D to E - 86 kilometers, from E to A- 40 kilometers. Find the distance from E to C. [b]6.6.[/b] Is it possible to write down the numbers from $ 1$ to $1963$ in a series so that any two adjacent numbers and any two numbers located one after the other were mutually prime? PS. You should use hide for answers.Collected [url=https://artofproblemsolving.com/community/c3983460_1963_leningrad_math_olympiad]here[/url].

Six points are given so that there are not three on the same line and that the lengths of the segments determined by these points are all different. We consider all the triangles that they have their vertices at these points. Show that there is a segment that is both the shortest side of one of those triangles and the longest side of another.

For a permutation $P = (p_1, p_2, ... , p_n)$ of $(1, 2, ... , n)$ define $X(P)$ as the number of $j$ such that $p_i < p_j$ for every $i < j$. What is the expected value of $X(P)$ if each permutation is equally likely?

The eight points $A, B,. . ., G$ and $H$ lie on five circles as shown. Each of these letters are represented by one of the eight numbers $1, 2,. . ., 7$ and $ 8$ replaced so that the following conditions are met: (i) Each of the eight numbers is used exactly once. (ii) The sum of the numbers on each of the five circles is the same. How many ways are there to get the letters substituted through the numbers in this way? (Walther Janous) [img]https://cdn.artofproblemsolving.com/attachments/5/e/511cdd2fc31e8067f400369c4fe9cf964ef54c.png[/img]