Let $ABC$ be a triangle such that $AB > AC$, with a circumcircle $\omega$. Draw the tangents to $\omega$ at $B$ and $C$ and these intersect at $P$. The perpendicular to $AP$ through $A$ cuts $BC$ at $R$. Let $S$ be a point on the segment $PR$ such that $PS = PC$. (a) Prove that the lines $CS$ and $AR$ intersect on $\omega$. (b) Let $M$ be the midpoint of $BC$ and $Q$ be the point of intersection of $CS$ and $AR$. Circle $\omega$ and the circumcircle of $\vartriangle AMP$ intersect at a point $J$ ($J \ne A$), prove that $P$, $J$ and $Q$ are collinear.

Prove the equality:\\ $\tan (\frac{3\pi}{7})-4\sin (\frac{\pi}{7})= \sqrt{7}$ .

Larry and Rob are two robots travelling in one car from Argovia to Zillis. Both robots have control over the steering and steer according to the following algorithm: Larry makes a 90 degrees left turn after every $ \ell$ kilometer driving from start, Rob makes a 90 degrees right turn after every $ r$ kilometer driving from start, where $ \ell$ and $ r$ are relatively prime positive integers. In the event of both turns occurring simultaneously, the car will keep going without changing direction. Assume that the ground is flat and the car can move in any direction. Let the car start from Argovia facing towards Zillis. For which choices of the pair ($ \ell$, $ r$) is the car guaranteed to reach Zillis, regardless of how far it is from Argovia?

Jim starts with a positive integer $ n$ and creates a sequence of numbers. Each successive number is obtained by subtracting the largest possible integer square less than or equal to the current number until zero is reached. For example, if Jim starts with $ n=55$, then his sequence contains $ 5$ numbers: \begin{align*} &55\\ 55-7^2=&\ 6\\ 6-2^2=&\ 2\\ 2-1^2=&\ 1\\ 1-1^2=&\ 0 \end{align*}Let $ N$ be the smallest number for which Jim's sequence has 8 numbers. What is the units digit of $ N$? $ \textbf{(A)}\ 1 \qquad \textbf{(B)}\ 3 \qquad \textbf{(C)}\ 5 \qquad \textbf{(D)}\ 7 \qquad \textbf{(E)}\ 9$

Let $f_n$ be the Fibonacci numbers, defined by $f_0 = 1$, $f_1 = 1$, and $f_n = f_{n-1}+f_{n-2}$. For each $i$, $1 \le i \le 200$, we calculate the greatest common divisor $g_i$ of $f_i$ and $f_{2007}$. What is the sum of the distinct values of $g_i$?

Prove the equality $$\frac{2}{x^2-1}+\frac{4}{x^2-4} +\frac{6}{x^2-9}+...+\frac{20}{x^2-100} =\frac{11}{(x-1)(x+10)}+\frac{11}{(x-2)(x+9)}+...+\frac{11}{(x-10)(x+1)}$$

Let $a$, $b$ and $c$ be numbers with $0 < a < b < c$. Which of the following is impossible? $\textbf{(A)}\ a+c<b \qquad \textbf{(B)}\ a\cdot b<c \qquad \textbf{(C)}\ a+b<c \qquad \textbf{(D)}\ a\cdot c<b \qquad \textbf{(E)}\ \frac{b}{c}=a$

Let $ \{f_n \}_{n=0}^{\infty}$ be a uniformly bounded sequence of real-valued measurable functions defined on $ [0,1]$ satisfying \[ \int_0^1 f_n^2=1.\] Further, let $ \{ c_n \}$ be a sequence of real numbers with \[ \sum_{n=0}^{\infty} c_n^2= +\infty.\] Prove that some re-arrangement of the series $ \sum_{n=0}^{\infty} c_nf_n$ is divergent on a set of positive measure. [i]J. Komlos[/i]

In a school, \( n \) different languages are taught. It is known that for any subset of these languages (including the empty set), there is exactly one student who knows these and only these languages (there are \( 2^n \) students in total). Each day, the students are divided into pairs and teach each other the languages that only one of them knows. If students are not allowed to be in the same pair twice, what is the minimum number of days the school administration needs to guarantee that all their students know all \( n \) languages? [i]Proposed by Oleksii Masalitin[/i]

[b]p1.[/b] Compute the sum of sharp angles at all five nodes of the star below. ( [url=http://www.math.msu.edu/~mshapiro/NewOlympiad/Olymp2009/10_12_2009.pdf]figure missing[/url] ) [b]p2.[/b] Arrange the integers from $1$ to $15$ in a row so that the sum of any two consecutive numbers is a perfect square. In how many ways this can be done? [b]p3.[/b] Prove that if $p$ and $q$ are prime numbers which are greater than $3$ then $p^2 -q^2$ is divisible by $ 24$. [b]p4.[/b] A city in a country is called Large Northern if comparing to any other city of the country it is either larger or farther to the North (or both). Similarly, a city is called Small Southern. We know that in the country all cities are Large Northern city. Show that all the cities in this country are simultaneously Small Southern. [b]p5.[/b] You have four tall and thin glasses of cylindrical form. Place on the flat table these four glasses in such a way that all distances between any pair of centers of the glasses' bottoms are equal. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Find the number of ordered $2012$-tuples of integers $(x_1, x_2, . . . , x_{2012})$, with each integer between $0$ and $2011$ inclusive, such that the sum $x_1 + 2x_2 + 3x_3 + · · · + 2012x_{2012}$ is divisible by $2012$.

Let $Q$ be a $(2n+1) \times (2n+1)$ board. Some of its cells are colored black in such a way that every $2 \times 2$ board of $Q$ has at most $2$ black cells. Find the maximum amount of black cells that the board may have.

Determine all such pairs pf positive integers $(a, b)$ such that $a + b + (gcd (a, b))^ 2 = lcm (a, b) = 2 \cdot lcm(a -1, b)$, where $lcm (a, b)$ denotes the smallest common multiple, and $gcd (a, b)$ denotes the greatest common divisor of numbers $a, b$.

A $ 1$ by $ 1$ square $ABCD$ is inscribed in the circle $m$. Circle $n$ has radius $1$ and is centered around $A$. Let $S$ be the set of points inside of $m$ but outside of $n$. What is the area of $S$?

Solve the equation $p^3-q^3=pq^3-1$ in primes $p,q$.

Numbers $m$ and $n$ are given positive integers. There are $mn$ people in a party, standing in the shape of an $m\times n$ grid. Some of these people are police officers and the rest are the guests. Some of the guests may be criminals. The goal is to determine whether there is a criminal between the guests or not.\\ Two people are considered \textit{adjacent} if they have a common side. Any police officer can see their adjacent people and for every one of them, know that they're criminal or not. On the other hand, any criminal will threaten exactly one of their adjacent people (which is likely an officer!) to murder. A threatened officer will be too scared, that they deny the existence of any criminal between their adjacent people.\\ Find the least possible number of officers such that they can take position in the party, in a way that the goal is achievable. (Note that the number of criminals is unknown and it is possible to have zero criminals.) [i]Proposed by Abolfazl Asadi[/i]

Let $a, b$ be positive integers and $p, q$ be prime numbers for which $p \nmid q - 1$ and $q \mid a^p - b^p$. Prove that $q \mid a - b$.

Given a finite string $S$ of symbols $X$ and $O$, we write $@(S)$ for the number of $X$'s in $S$ minus the number of $O$'s. (For example, $@(XOOXOOX) =-1$.) We call a string $S$ [b]balanced[/b] if every substring $T$ of (consecutive symbols) $S$ has the property $-2 \leq @(T) \leq 2$. (Thus $XOOXOOX$ is not balanced since it contains the sub-string $OOXOO$ whose $@$-value is $-3$.) Find, with proof, the number of balanced strings of length $n$.

Alice and Bob play a game on a strip of $n \ge 3$ squares with two game pieces. At the beginning, Alice’s piece is on the first square while Bob’s piece is on the last square. The figure shows the starting position for a strip of $ n = 7$ squares. [img]https://cdn.artofproblemsolving.com/attachments/1/7/c636115180fd624cbeec0c6adda31b4b89ed60.png[/img] The players alternate. In each move, they advance their own game piece by one or two squares in the direction of the opponent’s piece. The piece has to land on an empty square without jumping over the opponent’s piece. Alice makes the first move with her own piece. If a player cannot move, they lose. For which $n$ can Bob ensure a win no matter how Alice plays? For which $n$ can Alice ensure a win no matter how Bob plays? [i](Karl Czakler)[/i]

Given $x,y,z\in \mathbb{R} ^+$ , that are the solutions to the system of equations : $$x^2+xy+y^2=57$$ $$y^2+yz+z^2=84$$ $$z^2+zx+x^2=111$$ What is the value of $xy+3yz+5zx$? [i](maphybich)[/i]

Prove the inequality: \[\sum_{i < j}{\frac {a_{i}a_{j}}{a_{i} \plus{} a_{j}}}\leq \frac {n}{2(a_{1} \plus{} a_{2} \plus{}\cdots \plus{} a_{n})}\cdot \sum_{i < j}{a_{i}a_{j}}\] for positive reals $ a_{1},a_{2},\ldots,a_{n}$. [i]Proposed by Dusan Dukic, Serbia[/i]

Walter gets up at 6:30 a.m., catches the school bus at 7:30 a.m., has 6 classes that last 50 minutes each, has 30 minutes for lunch, and has 2 hours additional time at school. He takes the bus home and arrives at 4:00 p.m. How many minutes has he spent on the bus? $\textbf{(A)}\ 30 \qquad \textbf{(B)}\ 60 \qquad \textbf{(C)}\ 75 \qquad \textbf{(D)}\ 90 \qquad \textbf{(E)}\ 120$

Let $S$ be the set of all rational numbers $x \in [0, 1]$ with repeating base $6$ expansion $$x = 0.\overline{a_1a_2 ... a_k} = 0.a_1a_2...a_ka_1a_2...a_k...$$ for some finite sequence $\{a_i\}^{k}_{i=1}$ of distinct nonnegative integers less than $6$. What is the sum of all numbers that can be written in this form? (Put your answer in base $10$.)

Let $X$ be a set with $n\ge 2$ elements. Define $\mathcal{P}(X)$ to be the set of all subsets of $X$. Find the number of functions $f:\mathcal{P}(X)\mapsto \mathcal{P}(X)$ such that $$|f(A)\cap f(B)|=|A\cap B|$$ whenever $A$ and $B$ are two distinct subsets of $X$. [i] (Sergiu Novac)[/i]

Let $H$ be the orthocenter of triangle $\mathrm T$. The sidelines of triangle $\mathrm T_1$ pass through the midpoints of $\mathrm T$ and are perpendicular to the corresponding bisectors of $\mathrm T$. The vertices of triangle $\mathrm T_2$ bisect the bisectors of $\mathrm T$. Prove that the lines joining $H$ with the vertices of $\mathrm T_1$ are perpendicular to the sidelines of $\mathrm T_2$.