Katie begins juggling five balls. After every second elapses, there is a chance she will drop a ball. If she is currently juggling $ k$ balls, this probability is $ \frac{k}{10}$. Find the expected number of seconds until she has dropped all the balls.

\[\int_{-10}^{10}|4-|3-|2-|1-|x|||||\,\mathrm dx\] [i]Proposed by Connor Gordon[/i]

From each of the vertices of a regular $n$-gon a car starts to move with constant speed along the perimeter of the $n$-gon in the same direction. Prove that if all the cars end up at a vertex $A$ at the same time, then they never again meet at any other vertex of the $n$-gon. Can they meet again at $A \ ?$

To obtain a square $P$ of side length $2$ cm divided into $4$ unit squares it is sufficient to draw $3$ squares: $P$ and another $2$ unit squares with a common vertex, as shown below: [img]https://cdn.artofproblemsolving.com/attachments/1/d/827516518871ec8ff00a66424f06fda9812193.png[/img] Find the minimum number of squares sufficient to obtain a square.of side length $n$ cm divided into $n^2$ unit squares ($n \ge 3$ is an integer).

The numbers $1,2,\dots,2000$ are written on the board. Two players are playing a game with alternating moves. A move consists of erasing two number $a,b$ and writing $a^b$. After some time only one number is left. The first player wins, if the numbers last digit is $2$, $7$ or $8$. If not, the second player wins. Who has a winning strategy? [I]Proposed by V. Frank[/i]

Find the greatest integer less than the number $1+\frac{1}{\sqrt{2}}+\frac{1}{\sqrt{3}}+\cdots+\frac{1}{\sqrt{1000000}}$

Is it true that for any positive integer $n>1$, there exists an infinite arithmetic progression $M_n$ of positive integers, such that for any $m \in M_n$, the number $n^m-1$ is not a perfect power (a positive integer is a perfect power if it is of the form $a^b$ for positive integers $a, b>1$)?

Prove that there exists a nonzero complex number $c$ and a real number $d$ such that \[\left|\left|\dfrac1{1+z+z^2}\right|-\left|\dfrac1{1+z+z^2}-c\right|\right|=d\] for all $z$ with $|z|=1$ and $1+z+z^2\neq 0$. (Here, $|z|$ denotes the absolute value of the complex number $z$, so that $|a+bi|=\sqrt{a^2+b^2}$ for real numbers $a,b$.)

For an integer $n$ let $M (n) = \{n, n + 1, n + 2, n + 3, n + 4\}$. Furthermore, be $S (n)$ sum of squares and $P (n)$ the product of the squares of the elements of $M (n)$. For which integers $n$ is $S (n)$ a divisor of $P (n)$ ?

We are given $2001$ lines in the plane, no two of which are parallel and no three of which are concurrent. These lines partition the plane into regions (not necessarily finite) bounded by segments of these lines. These segments are called [i]sides[/i], and the collection of the regions is called a [i]map[/i]. Intersection points of the lines are called [i]vertices[/i]. Two regions are [i]neighbors [/i]if they share a side, and two vertices are neighbors if they lie on the same side. A [i]legal coloring[/i] of the regions (resp. vertices) is a coloring in which each region (resp. vertex) receives one color, such that any two neighboring regions (vertices) have different colors. (a) What is the minimum number of colors required for a legal coloring of the regions? (b) What is the minimum number of colors required for a legal coloring of the vertices?

Let ${a_n}$ be a non-increasing sequence of positive numbers. Prove that if for $n \ge 2001$, $na_{n} \le 1$, then for any positive integer $m \ge 2001$ and $x \in \mathbb{R}$, the following inequality holds: $\left | \sum_{k=2001}^{m} a_{k} \sin kx \right | \le 1 + \pi$

Given $ n$ points on the plane, which are the vertices of a convex polygon, $ n > 3$. There exists $ k$ regular triangles with the side equal to $ 1$ and the vertices at the given points. [list][*] Prove that $ k < \frac {2}{3}n$. [*] Construct the configuration with $ k > 0.666n$.[/list]

[b]p1.[/b] Find the smallest positive integer $N$ such that $2N -1$ and $2N +1$ are both composite. [b]p2.[/b] Compute the number of ordered pairs of integers $(a, b)$ with $1 \le a, b \le 5$ such that $ab - a - b$ is prime. [b]p3.[/b] Given a semicircle $\Omega$ with diameter $AB$, point $C$ is chosen on $\Omega$ such that $\angle CAB = 60^o$. Point $D$ lies on ray $BA$ such that $DC$ is tangent to $\Omega$. Find $\left(\frac{BD}{BC} \right)^2$. [b]p4.[/b] Let the roots of $x^2 + 7x + 11$ be $r$ and $s$. If $f(x)$ is the monic polynomial with roots $rs + r + s$ and $r^2 + s^2$, what is $f(3)$? [b]p5.[/b] Regular hexagon $ABCDEF$ has side length $3$. Circle $\omega$ is drawn with $AC$ as its diameter. $BC$ is extended to intersect $\omega$ at point $G$. If the area of triangle $BEG$ can be expressed as $\frac{a\sqrt{b}}{c}$ for positive integers $a, b, c$ with $b$ squarefree and $gcd(a, c) = 1$, find $a + b + c$. [b]p6.[/b] Suppose that $x$ and $y$ are positive real numbers such that $\log_2 x = \log_x y = \log_y 256$. Find $xy$. [b]p7.[/b] Call a positive three digit integer $\overline{ABC}$ fancy if $\overline{ABC} = (\overline{AB})^2 - 11 \cdot \overline{C}$. Find the sum of all fancy integers. [b]p8.[/b] Let $\vartriangle ABC$ be an equilateral triangle. Isosceles triangles $\vartriangle DBC$, $\vartriangle ECA$, and $\vartriangle FAB$, not overlapping $\vartriangle ABC$, are constructed such that each has area seven times the area of $\vartriangle ABC$. Compute the ratio of the area of $\vartriangle DEF$ to the area of $\vartriangle ABC$. [b]p9.[/b] Consider the sequence of polynomials an(x) with $a_0(x) = 0$, $a_1(x) = 1$, and $a_n(x) = a_{n-1}(x) + xa_{n-2}(x)$ for all $n \ge 2$. Suppose that $p_k = a_k(-1) \cdot a_k(1)$ for all nonnegative integers $k$. Find the number of positive integers $k$ between $10$ and $50$, inclusive, such that $p_{k-2} + p_{k-1} = p_{k+1} - p_{k+2}$. [b]p10.[/b] In triangle $ABC$, point $D$ and $E$ are on line segments $BC$ and $AC$, respectively, such that $AD$ and $BE$ intersect at $H$. Suppose that $AC = 12$, $BC = 30$, and $EC = 6$. Triangle BEC has area 45 and triangle $ADC$ has area $72$, and lines CH and AB meet at F. If $BF^2$ can be expressed as $\frac{a-b\sqrt{c}}{d}$ for positive integers $a$, $b$, $c$, $d$ with c squarefree and $gcd(a, b, d) = 1$, then find $a + b + c + d$. [b]p11.[/b] Find the minimum possible integer $y$ such that $y > 100$ and there exists a positive integer x such that $x^2 + 18x + y$ is a perfect fourth power. [b]p12.[/b] Let $ABCD$ be a quadrilateral such that $AB = 2$, $CD = 4$, $BC = AD$, and $\angle ADC + \angle BCD = 120^o$. If the sum of the maximum and minimum possible areas of quadrilateral $ABCD$ can be expressed as $a\sqrt{b}$ for positive integers $a$, $b$ with $b$ squarefree, then find $a + b$. PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

You are playing a game. A $2 \times 1$ rectangle covers two adjacent squares (oriented either horizontally or vertically) of a $3 \times 3$ grid of squares, but you are not told which two squares are covered. Your goal is to find at least one square that is covered by the rectangle. A "turn" consists of you guessing a square, after which you are told whether that square is covered by the hidden rectangle. What is the minimum number of turns you need to ensue that at least one of your guessed squares is covered by the rectangle? $\textbf{(A)}~3\qquad\textbf{(B)}~5\qquad\textbf{(C)}~4\qquad\textbf{(D)}~8\qquad\textbf{(E)}~6$

A set $S \subseteq \mathbb{N}$ satisfies the following conditions: (a) If $x, y \in S$ (not necessarily distinct), then $x + y \in S$. (b) If $x$ is an integer and $2x \in S$, then $x \in S$. Find the number of pairs of integers $(a, b)$ with $1 \le a, b\le 50$ such that if $a, b \in S$ then $S = \mathbb{N}.$ [i] Proposed by Yang Liu [/i]

Let $x$ be a real number such that $x^2 -x+1 = 7$ and $x^2 +x+1 = 13$. Compute the value of $x^4$.