Prove that there do not exist eleven primes, all less than $20000$, which form an arithmetic progression.

Let $p$ be an even non-negative continous function with $\int _{\mathbb{R}} p(x) dx =1$ and let $n$ be a positive integer. Let $\xi_1,\xi_2,\xi_3 \dots ,\xi_n$ be independent identically distributed random variables with density function $p$ . Define \begin{align*} X_{0} & = 0 \\ X_{1} & = X_0+ \xi_1 \\ & \vdotswithin{ = }\notag \\ X_{n} & = X_{n-1} + \xi_n \end{align*} Prove that the probability that all random variables $X_1,X_2 \dots X_{n-1}$ lie between $X_0$ and $X_n$ is $\frac{1}{n}$. [i]Proposed by Fedor Petrov (St.Petersburg State University).[/i]

The squares $ABCD$ and $AXYZ$ are given. It turns out that $CDXY$ is a cyclic quadrilateral inscribed in the circle $\Omega$, and the points $A, B$ and $Z{}$ lie inside this circle. Prove that either $AB = AX$ or $AC\perp{}XY$.

For two real numbers $ a$, $ b$, with $ ab\neq 1$, define the $ \ast$ operation by \[ a\ast b=\frac{a+b-2ab}{1-ab}.\] Start with a list of $ n\geq 2$ real numbers whose entries $ x$ all satisfy $ 0<x<1$. Select any two numbers $ a$ and $ b$ in the list; remove them and put the number $ a\ast b$ at the end of the list, thereby reducing its length by one. Repeat this procedure until a single number remains. $ a.$ Prove that this single number is the same regardless of the choice of pair at each stage. $ b.$ Suppose that the condition on the numbers $ x$ is weakened to $ 0<x\leq 1$. What happens if the list contains exactly one $ 1$?

The set $ S$ consists of $ n > 2$ points in the plane. The set $ P$ consists of $ m$ lines in the plane such that every line in $ P$ is an axis of symmetry for $ S$. Prove that $ m\leq n$, and determine when equality holds.

Oleksii wrote some \( 2n \) (\( n > 1 \)) consecutive positive integers on the board. After that, he grouped these numbers into pairs in some way, and within each pair, he multiplied the two numbers together. He then wrote the resulting \( n \) products on the board instead of the original numbers. Afterward, Anton wrote down the difference between the largest and the smallest of the numbers Oleksii wrote. Oleksii wants Anton to write the smallest possible number. What is the smallest number that can be written? [i]Proposed by Oleksii Masalitin, Anton Trygub[/i]

An urn is filled with coins and beads, all of which are either silver or gold. Twenty percent of the objects in the urn are beads. Forty percent of the coins in the urn are silver. What percent of the objects in the urn are gold coins? $ \textbf{(A)}\ 40\%\qquad\textbf{(B)}\ 48\%\qquad\textbf{(C)}\ 52\%\qquad\textbf{(D)}\ 60\%\qquad\textbf{(E)}\ 80\% $

A rectangular field has dimensions $120$ meters and $192$ meters. You want to divide it into equal square plots. The measure of the sides of these squares must be an integer number . In addition, you want to place a post in each corner of plot. Determine the smallest number of plots in which you can divide the land and the number of posts needed. [hide=Original wording]Un terreno de forma rectangular de 120 metros por 192 metros se quiere dividir en parcelas cuadradas iguales sin que sobre terreno. La medida de los lados de estos cuadrados debe ser un nu´mero entero. Adem´as se desea colocar un poste en cada esquina de parcela. Determinar el menor nu´mero de parcelas en que se puede dividir el terreno y el nu´mero de postes que se necesitan.[/hide]

For real numbers $ a$ and $ b$, define $ a\$b\equal{}(a\minus{}b)^2$. What is $ (x\minus{}y)^2\$(y\minus{}x)^2$? $ \textbf{(A)}\ 0 \qquad \textbf{(B)}\ x^2\plus{}y^2 \qquad \textbf{(C)}\ 2x^2 \qquad \textbf{(D)}\ 2y^2 \qquad \textbf{(E)}\ 4xy$

A positive integer $k\geqslant 3$ is called[i] fibby[/i] if there exists a positive integer $n$ and positive integers $d_1 < d_2 < \ldots < d_k$ with the following properties: \\ $\bullet$ $d_{j+2}=d_{j+1}+d_j$ for every $j$ satisfying $1\leqslant j \leqslant k-2$, \\ $\bullet$ $d_1, d_2, \ldots, d_k$ are divisors of $n$, \\ $\bullet$ any other divisor of $n$ is either less than $d_1$ or greater than $d_k$. Find all fibby numbers. \\ \\ [i]Proposed by Ivan Novak.[/i]

At Frank's Fruit Market, $ 3$ bananas cost as much as $ 2$ apples, and $ 6$ apples cost as much as $ 4$ oranges. How many oranges cost as much as $ 18$ bananas? $ \textbf{(A)}\ 6 \qquad \textbf{(B)}\ 8 \qquad \textbf{(C)}\ 9 \qquad \textbf{(D)}\ 12 \qquad \textbf{(E)}\ 18$

Let $A,B,C,D,E$ be five points on a circle; some segments are drawn between the points so that each of the $5C2 = 10$ pairs of points is connected by either zero or one segments. Determine the number of sets of segments that can be drawn such that: • It is possible to travel from any of the five points to any other of the five points along drawn segments. • It is possible to divide the five points into two nonempty sets $S$ and $T$ such that each segment has one endpoint in $S$ and the other endpoint in $T$.

Simon is playing chess. He wins with probability 1/4, loses with probability 1/4, and draws with probability 1/2. What is the probability that, after Simon has played 5 games, he has won strictly more games than he has lost? [i]2016 CCA Math Bonanza Individual #7[/i]

Equal line segments are marked in triangle $ABC$. Find its angles. [img]https://cdn.artofproblemsolving.com/attachments/0/2/bcb756bba15ba57013f1b6c4cbe9cc74171543.png[/img]

Determine the remainder when \[\prod_{i=1}^{2016} (i^4+5)\] is divided by $2017$.

We have a row of 203 cells. Initially the leftmost cell contains 203 tokens, and the rest are empty. On each move we can do one of the following: 1)Take one token, and move it to an adjacent cell (left or right). 2)Take exactly 20 tokens from the same cell, and move them all to an adjacent cell (all left or all right). After 2023 moves each cell contains one token. Prove that there exists a token that moved left at least nine times.

Prove the following statement: If a polynomial $p(x) = x^3 + Ax^2 + Bx +C$ has three real positve roots at least two of which are distinct, then $A^2 +B^2 +18C > 0$.

Determine all polynomials $P$ such that for every real number $x$, $P(x)^2 +P(-x) = P(x^2)+P(x)$

Let $a, b, \alpha, \beta$ be real numbers such that $0 \leq a, b \leq 1$, and $0 \leq \alpha, \beta \leq \frac{\pi}{2}$. Show that if \[ ab\cos(\alpha - \beta) \leq \sqrt{(1-a^2)(1-b^2)}, \] then \[ a\cos\alpha + b\sin\beta \leq 1 + ab\sin(\beta - \alpha). \]

There are $n$ pieces on the squares of a $5 \times 9$ board, at most one on each square at any time during the game. A move in the game consists of simultaneously moving each piece to a neighboring square by side, under the restriction that a piece having been moved horizontally in the previous move must be moved vertically and vice versa. Find the greatest value of $n$ for which there exists an initial position starting at which the game can be continued until the end of the world.

Let $1,\alpha_1,\alpha_2,...,\alpha_{10}$ be the roots of the polynomial $x^{11}-1$. It is a fact that there exists a unique polynomial of the form $f(x) = x^{10}+c_9x^9+ \dots + c_1x$ such that each $c_i$ is an integer, $f(0) = f(1) = 0$, and for any $1 \leq i \leq 10$ we have $(f(\alpha_i))^2 = -11$. Find $\left|c_1+2c_2c_9+3c_3c_8+4c_4c_7+5c_5c_6\right|$.

Let $p$ be a prime. Define $f_n(k)$ to be the number of positive integers $1\leq x\leq p-1$ such that $$\left(\left\{\frac{x}{p}\right\}-\left\{\frac{k}{p}\right\}\right)\left(\left\{\frac{nx}{p}\right\}-\left\{\frac{k}{p}\right\}\right)<0.$$ Let $a_n=f_n\left(\frac 12\right)+f_n\left(\frac 32\right)+\dots+f_n\left(\frac{2p-1}{2}\right)$, find $\min\{a_2, a_3, \dots, a_{p-1}\}$.

[asy] size(5cm); defaultpen(fontsize(6pt)); draw((0,0)--(4,0)--(4,4)--(0,4)--cycle); draw((0,0)--(-4,0)--(-4,-4)--(0,-4)--cycle); draw((1,-1)--(1,3)--(-3,3)--(-3,-1)--cycle); draw((-1,1)--(-1,-3)--(3,-3)--(3,1)--cycle); draw((-4,-4)--(0,-4)--(0,-3)--(3,-3)--(3,0)--(4,0)--(4,4)--(0,4)--(0,3)--(-3,3)--(-3,0)--(-4,0)--cycle, red+1.2); label("1", (-3.5,0), S); label("2", (-2,0), S); label("1", (-0.5,0), S); label("1", (3.5,0), S); label("2", (2,0), S); label("1", (0.5,0), S); label("1", (0,3.5), E); label("2", (0,2), E); label("1", (0,0.5), E); label("1", (0,-3.5), E); label("2", (0,-2), E); label("1", (0,-0.5), E); [/asy] Compute the area of the resulting shape, drawn in red above. [i]Proposed by Nathan Xiong[/i]

See all the problems from 5-th Kyiv math festival [url=http://www.mathlinks.ro/Forum/viewtopic.php?p=506789#p506789]here[/url] Triangle $ABC$ and straight line $l$ are given at the plane. Construct using a compass and a ruler the straightline which is parallel to $l$ and bisects the area of triangle $ABC.$

The $ 2007\ \text{AMC}\ 12$ contests will be scored by awarding $ 6$ points for each correct response, $ 0$ points for each incorrect response, and $ 1.5$ points for each problem left unanswered. After looking over the $ 25$ problems, Sarah has decided to attempt the first $ 22$ and leave the last three unanswered. How many of the first $ 22$ problems must she solve correctly in order to score at least $ 100$ points? $ \textbf{(A)}\ 13 \qquad \textbf{(B)}\ 14 \qquad \textbf{(C)}\ 15 \qquad \textbf{(D)}\ 16 \qquad \textbf{(E)}\ 17$