How many integers are there in $(b,2008b]$, where $b$ ($b > 0$) is given.

Consider an arrangement of tokens in the plane, not necessarily at distinct points. We are allowed to apply a sequence of moves of the following kind: select a pair of tokens at points $A$ and $B$ and move both of them to the midpoint of $A$ and $B$. We say that an arrangement of $n$ tokens is [i]collapsible[/i] if it is possible to end up with all $n$ tokens at the same point after a finite number of moves. Prove that every arrangement of $n$ tokens is collapsible if and only if $n$ is a power of $2$.

In a triangle $\triangle XYZ$, $\tan(x)\tan(z)=2$, $\tan(y)\tan(z)=18$. Then what is $\tan^2(z)$?

Let the real parameter $p$ be such that the system $\begin{cases} p(x^2 - y^2) = (p^2- 1)xy \\ |x - 1|+ |y| = 1 \end{cases}$ has at least three different real solutions. Find $p$ and solve the system for that $p$.

Prove that if $0<x<\frac{\pi}{2}$ and $n>m$, where $n$,$m$ are natural numbers, \[ 2 \left| \sin^n x - \cos^n x \right| \le 3 \left| \sin^m x - \cos^m x \right|.\]

Two regular polygons, a $7$-gon and a $17$-gon are given. For each of them two circles are drawn, an inscribed circle and a circumscribed circle. It happened that rings containing the polygons have equal areas. Prove that sides of the polygons are equal. (3)

Find all non-negative integers $n$ so that $\sqrt{n + 3}+ \sqrt{n +\sqrt{n + 3}} $ is an integer.

How many $x$ are there such that $x,[x],\{x\}$ are in harmonic progression (i.e, the reciprocals are in arithmetic progression)? (Here $[x]$ is the largest integer less than equal to $x$ and $\{x\}=x-[ x]$ ) [list=1] [*] 0 [*] 1 [*] 2 [*] 3 [/list]

Regular polygons with $5, 6, 7, $ and $8$ sides are inscribed in the same circle. No two of the polygons share a vertex, and no three of their sides intersect at a common point. At how many points inside the circle do two of their sides intersect? $\textbf{(A)}\ 52 \qquad\textbf{(B)}\ 56 \qquad\textbf{(C)}\ 60 \qquad\textbf{(D)}\ 64 \qquad\textbf{(E)}\ 68$

Let $L_i,\ i=1,2,3$, be line segments on the sides of an equilateral triangle, one segment on each side, with lengths $l_i,\ i=1,2,3$. By $L_i^{\ast}$ we denote the segment of length $l_i$ with its midpoint on the midpoint of the corresponding side of the triangle. Let $M(L)$ be the set of points in the plane whose orthogonal projections on the sides of the triangle are in $L_1,L_2$, and $L_3$, respectively; $M(L^{\ast})$ is defined correspondingly. Prove that if $l_1\ge l_2+l_3$, we have that the area of $M(L)$ is less than or equal to the area of $M(L^{\ast})$.

Let $\{u_{n}\}_{n \ge 0}$ be a sequence of integers satisfying the recurrence relation $u_{n+2}=u_{n+1}^2 -u_{n}$ $(n \in \mathbb{N})$. Suppose that $u_{0}=39$ and $u_{1}=45$. Prove that $1986$ divides infinitely many terms of this sequence.

Given two perpendicular diameters $AB$ and $CD$ of an ellipse, we say that the diameter $A'B'$ is conjugate to $AB$ if $A'B'$ is parallel to the tangent to the ellipse at $A$. Let $A'B'$ be conjugate to $AB$ and $C'D'$ be conjugate to $CD$. Prove that the rectangular hyperbola through $A', B', C'$ and $D'$ passes through the foci of the ellipse.

Let $a_1,a_2,a_3, \ldots$ be a sequence of positive integers and let $b_1,b_2,b_3,\ldots$ be the sequence of real numbers given by $$b_n = \dfrac{a_1a_2\cdots a_n}{a_1+a_2+\cdots + a_n},\ \mbox{for}\ n\geq 1$$ Show that, if there exists at least one term among every million consecutive terms of the sequence $b_1,b_2,b_3,\ldots$ that is an integer, then there exists some $k$ such that $b_k > 2021^{2021}$.

The periods of two periodic sequences are $7$ and $13$. What is the maximal length of initial sections of the two sequences which can coincide? (The period $p$ of a sequence $a_1$,$a_2$, $...$ is the minimal $p$ such that $a_n = a_{n+p}$ for all $n$.) (AY Belov)

Let $\mathbb{Z}$ be the set of integers. Find all functions $f : \mathbb{Z} \rightarrow \mathbb{Z}$ such that \[xf(2f(y)-x)+y^2f(2x-f(y))=\frac{f(x)^2}{x}+f(yf(y))\] for all $x, y \in \mathbb{Z}$ with $x \neq 0$.

Let $k$ be a given positive integer. The sequence $x_n$ is defined as follows: $x_1 =1$ and $x_{n+1}$ is the least positive integer which is not in $\{x_{1}, x_{2},..., x_{n}, x_{1}+k, x_{2}+2k,..., x_{n}+nk \}$. Show that there exist real number $a$ such that $x_n = \lfloor an\rfloor$ for all positive integer $n$.

For each positive integer $n$ whose canonical decomposition is $n = p_1^{a_1} \cdot p_2^{a_2} \cdot\cdot\cdot p_k^{a_k}$, we define $t(n) = (p_1 + 1) \cdot (p_2 + 1) \cdot\cdot\cdot (p_k + 1)$. For example, $t(20) = t(2^2\cdot 5^1) = (2 + 1) (5 + 1) = 18$, $t(30) = t(2^1\cdot 3^1\cdot 5^1) = (2 + 1) (3 + 1) (5 + 1) = 72$ and $t(125) = t(5^3) = (5 + 1) = 6$ . We say that a positive integer $n$ is [i]special [/i]if $t(n)$ is a divisor of $n$. How many positive divisors of the number $54610$ are special?

The figure below was made by gluing together 5 non-overlapping congruent squares. The figure has area 45. Find the perimeter of the figure. [center][img]https://snag.gy/ZeKf4q.jpg[/center][/img]

The sequences $(a_n)$ and (c_n) are given by $a_0 =\frac12$, $c_0=4$ , and for $n \ge 0$ , $a_{n+1}=\frac{2a_n}{1+a_n^2}$, $c_{n+1}=c_n^2-2c_n+2$ Prove that for all $n\ge 1$, $a_n=\frac{2c_0c_1...c_{n-1}}{c_n}$

$n$ real numbers are written in increasing order in a line. The same numbers are written in the second line below in unknown order. The third line contains the sums of the pairs of numbers above from two previous lines. It comes out, that the third line is arranged in increasing order. Prove that the second line coincides with the first one.

There is a board with three rows and $2019$ columns. In the first row are written the numbers integers from $1$ to $2019$ inclusive, ordered from smallest to largest. In the second row, $Ana$ writes those same numbers but ordered at your choice. In each box in the third row write the difference between the two numbers already written in the same column (the largest minus the smallest). $Beto$ have to paint some numbers in the third row so that the sum of the numbers painted is equal to the sum of the numbers in that row that were left unpainted. Can $Ana$ complete the second row so that $Beto$ does not achieve his goal?

In the figure, $ABCD$ is an isosceles trapezoid with side lengths $AD = BC = 5, AB = 4,$ and $DC = 10$. The point $C$ is on $\overline{DF}$ and $B$ is the midpoint of hypotenuse $\overline{DE}$ in the right triangle $DEF$. Then $CF =$ [asy] size(200); defaultpen(fontsize(10)); pair D=origin, A=(3,4), B=(7,4), C=(10,0), E=(14,8), F=(14,0); draw(B--C--F--E--B--A--D--B^^C--D, linewidth(0.7)); dot(A^^B^^C^^D^^E^^F); pair point=(5,3); label("$A$", A, N); label("$B$", B, N); label("$C$", C, S); label("$D$", D, S); label("$E$", E, dir(point--E)); label("$F$", F, dir(point--F)); markscalefactor=0.05; draw(rightanglemark(E,F,D), linewidth(0.7));[/asy] $\text{(A)} \ 3.25 \qquad \text{(B)} \ 3.5 \qquad \text{(C)} \ 3.75 \qquad \text{(D)} \ 4.0 \qquad \text{(E)} \ 4.25$

A pair of integers $ (m,n)$ is called [i]good[/i] if \[ m\mid n^2 \plus{} n \ \text{and} \ n\mid m^2 \plus{} m\] Given 2 positive integers $ a,b > 1$ which are relatively prime, prove that there exists a [i]good[/i] pair $ (m,n)$ with $ a\mid m$ and $ b\mid n$, but $ a\nmid n$ and $ b\nmid m$.

The graph of the function $ f$ is shown below. How many solutions does the equation $ f(f(x)) \equal{} 6$ have? [asy]size(220); defaultpen(fontsize(10pt)+linewidth(.8pt)); dotfactor=4; pair P1=(-7,-4), P2=(-2,6), P3=(0,0), P4=(1,6), P5=(5,-6); real[] xticks={-7,-6,-5,-4,-3,-2,-1,1,2,3,4,5,6}; real[] yticks={-6,-5,-4,-3,-2,-1,1,2,3,4,5,6}; draw(P1--P2--P3--P4--P5); dot("(-7, -4)",P1); dot("(-2, 6)",P2,LeftSide); dot("(1, 6)",P4); dot("(5, -6)",P5); xaxis("$x$",-7.5,7,Ticks(xticks),EndArrow(6)); yaxis("$y$",-6.5,7,Ticks(yticks),EndArrow(6));[/asy]$ \textbf{(A)}\ 2 \qquad \textbf{(B)}\ 4 \qquad \textbf{(C)}\ 5 \qquad \textbf{(D)}\ 6 \qquad \textbf{(E)}\ 7$

Alice and Bob play a game where they start from a complete graph with $n$ vertices and take turns removing a single edge from the graph, with Alice taking the first turn. The first player to disconnect the graph loses. Compute the sum of all $n$ between $2$ and $100$ inclusive such that Alice has a winning strategy. (A complete graph is one where there is an edge between every pair of vertices.)