Do there exist two bounded sequences $a_1, a_2,\ldots$ and $b_1, b_2,\ldots$ such that for each positive integers $n$ and $m>n$ at least one of the two inequalities $|a_m-a_n|>1/\sqrt{n},$ and $|b_m-b_n|>1/\sqrt{n}$ holds?

Which pair of numbers does NOT have a product equal to $36$? $\text{(A)}\ \{ -4,-9\} \qquad \text{(B)}\ \{ -3,-12\} \qquad \text{(C)}\ \left\{ \dfrac{1}{2},-72\right\} \qquad \text{(D)}\ \{ 1,36\} \qquad \text{(E)}\ \left\{\dfrac{3}{2},24\right\}$

Let $S$ be a circle with radius $2$, let $S_1$ be a circle,with radius $1$ and tangent, internally to $S$ in $B$ and let $S_2$ be a circle, with radius $1$ and tangent to $S_1$ in $A$, but $S_2$ isn't tangent to $S$. If $K$ is the point of intersection of the line $AB$ and the circle $S$, prove that $K$ is in the circle $S_2$.

Let us denote by $<a>$ the distance from $a$ to the nearest integer. (For example, $<1,2> = 0.2$, $<\sqrt3> = 2-\sqrt3$) How many solutions does the system of equations have $$\begin{cases} <19x>=y \\ <96y>=x \end{cases} \,\,\, ?$$

Determine the lowest positive integer n such that following statement is true: If polynomial with integer coefficients gets value 2 for n different integers, then it can't take value 4 for any integer.

Given a sphere of unit radius with the big circle (i.e of unit radius) that will be called "equator". We shall use the words "pole", "parallel","meridian" as self-explanatory. a) Let $g(x)$, where $x$ is a point on the sphere, be the distance from this point to the equator plane. Prove that $g(x)$ has the property if $x_1, x_2, x_3$ are the ends of the pairwise orthogonal radiuses, then $$g(x_1)^2 + g(x_2)^2 + g(x_3)^2 = 1 \,\,\,\, (*)$$ Let function $f(x)$ be an arbitrary nonnegative function on a sphere that satisfies (*) property. b) Let $x_1$ and $x_2$ points be on the same meridian between the north pole and equator, and $x_1$ is closer to the pole than $x_2$. Prove that $f(x_1) > f(x_2)$. c) Let $y_1$ be closer to the pole than $y_2$. Prove that $f(y_1) > f(y_2)$. d) Let $z_1$ and $z_2$ be on the same parallel. Prove that $f(z_1) = f(z_2)$. e) Prove that for all $x , f(x) = g(x)$.

Prove that there are no integers $x$ and $y$ satisfying $x^{2}=y^{5}-4$.

How many distinct triangles can be drawn using three of the dots below as vertices? [asy]dot(origin^^(1,0)^^(2,0)^^(0,1)^^(1,1)^^(2,1));[/asy] $ \textbf{(A)}\ 9\qquad\textbf{(B)}\ 12\qquad\textbf{(C)}\ 18\qquad\textbf{(D)}\ 20\qquad\textbf{(E)}\ 24 $

For any integer $n\geq 2$, we compute the integer $h(n)$ by applying the following procedure to its decimal representation. Let $r$ be the rightmost digit of $n$. [list][*]If $r=0$, then the decimal representation of $h(n)$ results from the decimal representation of $n$ by removing this rightmost digit $0$. [*]If $1\leq r \leq 9$ we split the decimal representation of $n$ into a maximal right part $R$ that solely consists of digits not less than $r$ and into a left part $L$ that either is empty or ends with a digit strictly smaller than $r$. Then the decimal representation of $h(n)$ consists of the decimal representation of $L$, followed by two copies of the decimal representation of $R-1$. For instance, for the number $17,151,345,543$, we will have $L=17,151$, $R=345,543$ and $h(n)=17,151,345,542,345,542$.[/list] Prove that, starting with an arbitrary integer $n\geq 2$, iterated application of $h$ produces the integer $1$ after finitely many steps. [i]Proposed by Gerhard Woeginger, Austria[/i]

If $A$ and $B$ are vertices of a polyhedron, define the [i]distance[/i] $d(A, B)$ to be the minimum number of edges of the polyhedron one must traverse in order to connect $A$ and $B$. For example, if $\overline{AB}$ is an edge of the polyhedron, then $d(A, B) = 1$, but if $\overline{AC}$ and $\overline{CB}$ are edges and $\overline{AB}$ is not an edge, then $d(A, B) = 2$. Let $Q$, $R$, and $S$ be randomly chosen distinct vertices of a regular icosahedron (regular polyhedron made up of 20 equilateral triangles). What is the probability that $d(Q, R) > d(R, S)$? $\textbf{(A)}~\frac{7}{22}\qquad\textbf{(B)}~\frac13\qquad\textbf{(C)}~\frac38\qquad\textbf{(D)}~\frac5{12}\qquad\textbf{(E)}~\frac12$

Show that for all real numbers $ a,b,c,d,$ the following inequality holds: \[ (a\plus{}b\plus{}c\plus{}d)^2 \leq 3 (a^2 \plus{} b^2 \plus{} c^2 \plus{} d^2) \plus{} 6ab\]

Prove that for every positive $x_1, x_2, x_3, x_4, x_5$ holds inequality: $$(x_1 + x_2 + x_3 + x_4 + x_5)^2 \ge 4(x_1x_2 + x_3x_4 + x_5x_1 + x_2x_3 + x_4x_5)$$

Find the sum of all three digit numbers (written in base $10$) such that the leading digit is the sum of other two digits. Express your answer in base $10$.

$\sqrt{3+2\sqrt{2}}-\sqrt{3-2\sqrt{2}}$ is equal to $\textbf{(A) }2\qquad\textbf{(B) }2\sqrt{3}\qquad\textbf{(C) }4\sqrt{2}\qquad\textbf{(D) }\sqrt{6}\qquad \textbf{(E) }2\sqrt{2}$

Let $\omega$ be the circumcircle of $\triangle{ABC}$. $P$ is an interior point of $\triangle{ABC}$. $A_{1}, B_{1}, C_{1}$ are the intersections of $AP, BP, CP$ respectively and $A_{2}, B_{2}, C_{2}$ are the symmetrical points of $A_{1}, B_{1}, C_{1}$ with respect to the midpoints of side $BC, CA, AB$. Show that the circumcircle of $\triangle{A_{2}B_{2}C_{2}}$ passes through the orthocentre of $\triangle{ABC}$.

There are balls that look identical, but their weights all dier by a little. We have a balance that can compare only two balls at a time. What is the minimum number of times, in the worst case, we have to use to balance to rank all balls by weight?

In some village there are $1000$ inhabitants. Every day, each of them shares the news they learned yesterday with all their friends. It is known that any news becomes known to all residents of the village. Prove that it is possible to select $90$ residents so that if you tell all of them at the same time some news, then in $10$ days it will become known to all residents of the village.

Let $n$ be a positive integer. Let $T_n$ be a set of positive integers such that: \[{T_n={ \{11(k+h)+10(n^k+n^h)| (1 \leq k,h \leq 10)}}\}\] Find all $n$ for which there don't exist two distinct positive integers $a, b \in T_n$ such that $a\equiv b \pmod{110}$

For a finite set $ X$ of positive integers, let $ \Sigma(X) \equal{} \sum_{x \in X} \arctan \frac{1}{x}.$ Given a finite set $ S$ of positive integers for which $ \Sigma(S) < \frac{\pi}{2},$ show that there exists at least one finite set $ T$ of positive integers for which $ S \subset T$ and $ \Sigma(S) \equal{} \frac{\pi}{2}.$ [i]Kevin Buzzard, United Kingdom[/i]

A triangle with side lengths in the ratio $ 3: 4: 5$ is inscribed in a circle of radius $ 3$. What is the area of the triangle? $ \textbf{(A)}\ 8.64 \qquad \textbf{(B)}\ 12 \qquad \textbf{(C)}\ 5\pi \qquad \textbf{(D)}\ 17.28 \qquad \textbf{(E)}\ 18$

The sides of the triangle $ABC$ are extended in both directions and on these extensions $6$ equal segments $AA_1 , AA_2, BB_1,BB_2, CC_1, CC_2$ are drawn (fig.). It turned out that all $6$ points $A_1,A_2,B_1,B_2,C_1, C_2$ lie on the same circle, is $\vartriangle ABC$ necessarily equilateral? (Bogdan Rublev) [img]https://cdn.artofproblemsolving.com/attachments/0/3/a499f6e6d978ce63d2ab40460dc73b62882863.png[/img]

Decide if it is possible to choose $330$ points in the plane so that among all the distances that are formed between two of them there are at least $1700$ that are equal.

Given are $50$ points in the plane, no three of them belonging to a same line. Each of these points is colored using one of four given colors. Prove that there is a color and at least $130$ scalene triangles with vertices of that color.

Let $\lfloor \bullet \rfloor$ denote the floor function. For nonnegative integers $a$ and $b$, their [i]bitwise xor[/i], denoted $a \oplus b$, is the unique nonnegative integer such that $$ \left \lfloor \frac{a}{2^k} \right \rfloor+ \left\lfloor\frac{b}{2^k} \right\rfloor - \left\lfloor \frac{a\oplus b}{2^k}\right\rfloor$$ is even for every $k \ge 0$. Find all positive integers $a$ such that for any integers $x>y\ge 0$, we have \[ x\oplus ax \neq y \oplus ay. \] [i]Carl Schildkraut[/i]

Prove that the functional equations \[f(x + y) = f(x) + f(y),\] \[ \text{and} \qquad f(x + y + xy) = f(x) + f(y) + f(xy) \quad (x, y \in \mathbb R)\] are equivalent.