Two identical jars are filled with alcohol solutions, the ratio of the volume of alcohol to the volume of water being $p : 1$ in one jar and $q : 1$ in the other jar. If the entire contents of the two jars are mixed together, the ratio of the volume of alcohol to the volume of water in the mixture is $\textbf{(A) }\frac{p+q}{2}\qquad\textbf{(B) }\frac{p^2+q^2}{p+q}\qquad\textbf{(C) }\frac{2pq}{p+q}\qquad\textbf{(D) }\frac{2(p^2+pq+q^2)}{3(p+q)}\qquad\textbf{(E) }\frac{p+q+2pq}{p+q+2}$

Let $p, q$ be two different odd prime numbers and $n$ an integer such that $pq$ divides $n^{pq} + 1$. Prove that if $p^3q^3$ divides $n^{pq} + 1$ then either $p^2$ divides $n + 1$ or $q^2$ divides $n + 1$. Malik Talbi

Trilandia is a very unusual city. The city has the shape of an equilateral triangle of side lenght 2012. The streets divide the city into several blocks that are shaped like equilateral triangles of side lenght 1. There are streets at the border of Trilandia too. There are 6036 streets in total. The mayor wants to put sentinel sites at some intersections of the city to monitor the streets. A sentinel site can monitor every street on which it is located. What is the smallest number of sentinel sites that are required to monitor every street of Trilandia?

Let $X =\{1, 2, ... , 2017\}$. Let $k$ be a positive integer. Given any $r$ such that $1\le r \le k$, there exist $k$ subsets of $X$ such that the union of any $ r$ of them is equal to $X$ , but the union of any fewer than $r$ of them is not equal to $X$ . Find, with proof, the greatest possible value for $k$.

Consider the sequence of six real numbers 60, 10, 100, 150, 30, and $x$. The average (arithmetic mean) of this sequence is equal to the median of the sequence. What is the sum of all the possible values of $x$? (The median of a sequence of six real numbers is the average of the two middle numbers after all the numbers have been arranged in increasing order.)

Two circles $\Gamma_1$ and $\Gamma_2$ meet at $A$ and $B$. A line through $B$ meets $\Gamma_1$ and $\Gamma_2$ again at $C$ and $D$ repsectively. Another line through $B$ meets $\Gamma_1$ and $\Gamma_2$ again at $E$ and $F$ repsectively. Line $CF$ meets $\Gamma_1$ and $\Gamma_2$ again at $P$ and $Q$ respectively. $M$ and $N$ are midpoints of arc $PB$ and arc $QB$ repsectively. Show that if $CD = EF$, then $C,F,M,N$ are concyclic.

An arithmetic sequence is a sequence of $(a_1, a_2, \dots, a_n) $ such that the difference between any two consecutive terms is the same. That is, $a_ {i + 1} -a_i = d $ for all $i \in \{1,2, \dots, n-1 \} $, where $d$ is the difference of the progression. A sequence $(a_1, a_2, \dots, a_n) $ is [i]tlaxcalteca [/i] if for all $i \in \{1,2, \dots, n-1 \} $, there exists $m_i $ positive integer such that $a_i = \frac {1} {m_i}$. A taxcalteca arithmetic progression $(a_1, a_2, \dots, a_n )$ is said to be [i]maximal [/i] if $(a_1-d, a_1, a_2, \dots, a_n) $ and $(a_1, a_2, \dots, a_n, a_n + d) $ are not Tlaxcalan arithmetic progressions. Is there a maximal tlaxcalteca arithmetic progression of $11$ elements?

Let $ABCDEF$ be a regular hexagon with side length 10 inscribed in a circle $\omega$. $X$, $Y$, and $Z$ are points on $\omega$ such that $X$ is on minor arc $AB$, $Y$ is on minor arc $CD$, and $Z$ is on minor arc $EF$, where $X$ may coincide with $A$ or $B$ (and similarly for $Y$ and $Z$). Compute the square of the smallest possible area of $XYZ$. [i]Proposed by Michael Ren[/i]

A string having a small loop in one end is set over a horizontal pipe so that the ends hang loosely. After that, the other end is put through the loop, pulled as far as possible from the pipe and fixed in that position whereby this end of the string is farther from the pipe than the loop. Let $\alpha$ be the angle by which the string turns at the point where it passes through the loop (see picture). Find $\alpha$. [img]https://cdn.artofproblemsolving.com/attachments/2/1/018bb16d80956699e11c641bad9bb3d0083770.png[/img]

Positive integers $a$ and $b$ have $n$ digits each in their decimal representation. Assume that $m$ is a positive integer such that $\frac n2<m<n$ and assume that each of the leftmost $m$ digits of $a$ is equal to the corresponding digit of $b$. Prove that $$a^{\frac1n}-b^{\frac1n}<\frac1n.$$

Let $n$ be a positive integer. Prove that if the number overbrace $\underbrace{\hbox{99...9}}_{\hbox{n}}$ is divisible by $n$, then the number $\underbrace{\hbox{11...1}}_{\hbox{n}}$ is also divisible by $n$. (H. Nestra)

Given $a, b, p$ arbitrary integers. Prove that there always exist relatively prime (i.e. that have no common divisor) $k$ and $l$, that $(ak + bl)$ is divisible by $p$.

Prove that for natural numbers $p$ and $q$, there exists a natural number $x$ such that $$(\sqrt{p}+\sqrt{p-1})^q=\sqrt{x}+\sqrt{x-1}$$ (As an example, if $p = 3, q = 2$, then $x$ can be taken to be $25$.)

The sequence of real numbers $a_0,a_1,a_2,\ldots$ is defined recursively by \[a_0=-1,\qquad\sum_{k=0}^n\dfrac{a_{n-k}}{k+1}=0\quad\text{for}\quad n\geq 1.\]Show that $ a_{n} > 0$ for all $ n\geq 1$. [i]Proposed by Mariusz Skalba, Poland[/i]

A $ 100 \times 100$ square floor consisting of $ 10000$ squares is to be tiled by rectangular $ 1 \times 3$ tiles, fitting exactly over three squares of the floor. $ (a)$ If a $ 2 \times 2$ square is removed from the center of the floor, prove that the rest of the floor can be tiled with the available tiles. $ (b)$ If, instead, a $ 2 \times 2$ square is removed from the corner, prove that such a tiling is not possble.

Let $ x_1, x_2, \cdots, x_{25} $ real numbers such that $ 0 \le x_i \le i (i=1, 2, \cdots, 25) $. Find the maximum value of \[x_{1}^{3}+x_{2}^{3}+\cdots +x_{25}^{3} - ( x_1x_2x_3 + x_2x_3x_4 + \cdots x_{25}x_1x_2 ) \]

Find all pairs of primes $(p,q)$ such that $6pq$ divides $$p^3+q^2+38$$

[b]p1.[/b] Ben and his dog are walking on a path around a lake. The path is a loop $500$ meters around. Suddenly the dog runs away with velocity $10$ km/hour. Ben runs after it with velocity $8$ km/hour. At the moment when the dog is $250$ meters ahead of him, Ben turns around and runs at the same speed in the opposite direction until he meets the dog. For how many minutes does Ben run? [b]p2.[/b] The six interior angles in two triangles are measured. One triangle is obtuse (i.e. has an angle larger than $90^o$) and the other is acute (all angles less than $90^o$). Four angles measure $120^o$, $80^o$, $55^o$ and $10^o$. What is the measure of the smallest angle of the acute triangle? [b]p3.[/b] The figure below shows a $ 10 \times 10$ square with small $2 \times 2$ squares removed from the corners. What is the area of the shaded region? [img]https://cdn.artofproblemsolving.com/attachments/7/5/a829487cc5d937060e8965f6da3f4744ba5588.png[/img] [b]p4.[/b] Two three-digit whole numbers are called relatives if they are not the same, but are written using the same triple of digits. For instance, $244$ and $424$ are relatives. What is the minimal number of relatives that a three-digit whole number can have if the sum of its digits is $10$? [b]p5.[/b] Three girls, Ann, Kelly, and Kathy came to a birthday party. One of the girls wore a red dress, another wore a blue dress, and the last wore a white dress. When asked the next day, one girl said that Kelly wore a red dress, another said that Ann did not wear a red dress, the last said that Kathy did not wear a blue dress. One of the girls was truthful, while the other two lied. Which statement was true? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

We call the figure shown in the picture consisting of five unit squares a $\emph{plus}$, and each rectangle consisting of two such squares a $\emph{minus}$. Does there exist an odd integer $n$ with the property that a square with side length $n$ can be dissected into pluses and minuses? Justify your answer. [img] https://wiki-images.artofproblemsolving.com//6/6a/18-1-6.png [/img]

Let $P_k(x)=1+x+x^2+\ldots +x^{k-1}$. Show that \[ \sum_{k=1}^n \binom{n}{k} P_k(x)=2^{n-1} P_n \left( \frac{x+1}{2} \right) \] for every real number $x$ and every positive integer $n$.

Let $p > 3$ be a prime such that $p\equiv 3 \pmod 4.$ Given a positive integer $a_0$ define the sequence $a_0, a_1, \ldots $ of integers by $a_n = a^{2^n}_{n-1}$ for all $n = 1, 2,\ldots.$ Prove that it is possible to choose $a_0$ such that the subsequence $a_N , a_{N+1}, a_{N+2}, \ldots $ is not constant modulo $p$ for any positive integer $N.$

Several positive numbers each not exceeding 1 are written on the circle. Prove that one can divide the circle into three arcs so that the sums of numbers on any two arcs differ by no more than 1. (If there are no numbers on an arc, the sum is equal to zero.) [i](6 points)[/i]

A circle with center in $O$ is given. Two parallel tangents tangent to the circle at points $M$ and $N$. Another tangent intersects the first two tangents at points $K$ and $L$. Show that the circle having the line segment $KL$ as diameter passes through $O$.

Let $ A $ be a subset of $ \mathbb{R} $ and let be a function $ f:A\longrightarrow\mathbb{R} $ satisfying $$ f(x)-f(y)=(y-x)f(x)f(y),\quad\forall x,y\in A. $$ [b]a)[/b] Show that if $ A=\mathbb{R}, $ then $ f=0. $ [b]b)[/b] Find $ f, $ provided that $ A=\mathbb{R}\setminus\{1\} . $

There are $n$ boyfriend-girlfriend pairs at a party. Initially all the girls sit at a round table. For the first dance, each boy invites one of the girls to dance with.After each dance, a boy takes the girl he danced with to her seat, and for the next dance he invites the girl next to her in the counterclockwise direction. For which values of $n$ can the girls be selected in such a way that in every dance at least one boy danced with his girlfriend, assuming that there are no less than $n$ dances?