Is it possible to find $2008$ infinite arithmetical progressions such that there exist finitely many positive integers not in any of these progressions, no two progressions intersect and each progression contains a prime number bigger than $2008$?

Two circles with centers $O_{1}$ and $O_{2}$ meet at two points $A$ and $B$ such that the centers of the circles are on opposite sides of the line $AB$. The lines $BO_{1}$ and $BO_{2}$ meet their respective circles again at $B_{1}$ and $B_{2}$. Let $M$ be the midpoint of $B_{1}B_{2}$. Let $M_{1}$, $M_{2}$ be points on the circles of centers $O_{1}$ and $O_{2}$ respectively, such that $\angle AO_{1}M_{1}= \angle AO_{2}M_{2}$, and $B_{1}$ lies on the minor arc $AM_{1}$ while $B$ lies on the minor arc $AM_{2}$. Show that $\angle MM_{1}B = \angle MM_{2}B$. [i]Ciprus[/i]

Find the sum \[\frac{1}{1(3)}+\frac{1}{3(5)}+\dots+\frac{1}{(2n-1)(2n+1)}+\dots+\frac{1}{255(257)}.\] $\textbf{(A) }\frac{127}{255}\qquad\textbf{(B) }\frac{128}{255}\qquad\textbf{(C) }\frac{1}{2}\qquad\textbf{(D) }\frac{128}{257}\qquad \textbf{(E) }\frac{129}{257}$

For a positive integer $n$, let $\Omega(n)$ denote the number of prime factors of $n$, counting multiplicity. Let $f_1(n)$ and $f_3(n)$ denote the sum of positive divisors $d|n$ where $\Omega(d)\equiv 1\pmod 4$ and $\Omega(d)\equiv 3\pmod 4$, respectively. For example, $f_1(72) = 72 + 2 + 3 = 77$ and $f_3(72) = 8+12+18 = 38$. Determine $f_3(6^{2020}) - f_1(6^{2020})$.

Consider the areas of the four triangles obtained by drawing the diagonals $AC$ and $BD$ of a trapezium $ABCD$. The product of these areas, taken two at time, are computed. If among the six products so obtained, two products are 1296 and 576, determine the square root of the maximum possible area of the trapezium to the nearest integer.

A cat is trying to catch a mouse in the non-negative quadrant \[N=\{(x_1,x_2)\in \mathbb{R}^2: x_1,x_2\geq 0\}.\] At time $t=0$ the cat is at $(1,1)$ and the mouse is at $(0,0)$. The cat moves with speed $\sqrt{2}$ such that the position $c(t)=(c_1(t),c_2(t))$ is continuous, and differentiable except at finitely many points; while the mouse moves with speed $1$ such that its position $m(t)=(m_1(t),m_2(t))$ is also continuous, and differentiable except at finitely many points. Thus $c(0)=(1,1)$ and $m(0)=(0,0)$; $c(t)$ and $m(t)$ are continuous functions of $t$ such that $c(t),m(t)\in N$ for all $t\geq 0$; the derivatives $c'(t)=(c'_1(t),c'_2(t))$ and $m'(t)=(m'_1(t),m'_2(t))$ each exist for all but finitely many $t$ and \[(c'_1(t)^2+(c'_2(t))^2=2 \qquad (m'_1(t)^2+(m'_2(t))^2=1,\] whenever the respective derivative exists. At each time $t$ the cat knows both the mouse's position $m(t)$ and velocity $m'(t)$. Show that, no matter how the mouse moves, the cat can catch it by time $t=1$; that is, show that the cat can move such that $c(\tau)=m(\tau)$ for some $\tau\in[0,1]$.

Find all positive integers with two or more digits such that if we insert a $0$ between the units and tens digits we get a multiple of the original number.

Find the number of arithmetic sequences $a_1,a_2,a_3$ of three nonzero integers such that the sum of the terms in the sequence is equal to the product of the terms in the sequence. [i]Proposed by Sammy Charney[/i]

Solve in $ \mathbb{C} $ the following equation: $ |z|+|z-5i|=|z-2i|+|z-3i|. $

Two touching balls with radii $a$ and $b$ are enclosed in a cylindrical tin of diameter $d$ . Both balls hit the top surface and the shell of the cylinder. The largest ball also hits the bottom surface. Show that $\sqrt{d} =\sqrt{a} +\sqrt{b}$ [img]https://1.bp.blogspot.com/-O4B3P3bghFs/Xy1fDv9zGkI/AAAAAAAAMSQ/ePLVnsXsRi0mz3SWBpIzfGdsizWoLmGVACLcBGAsYHQ/s0/flanders%2B2019%2Bp1.png[/img]

From a two-digit number $ N$ we subtract the number with the digits reversed and find that the result is a positive perfect cube. Then: $ \textbf{(A)}\ {N}\text{ cannot end in 5}\qquad\\ \textbf{(B)}\ {N}\text{ can end in any digit other than 5}\qquad \\ \textbf{(C)}\ {N}\text{ does not exist}\qquad \\ \textbf{(D)}\ \text{there are exactly 7 values for }{N}\qquad \\ \textbf{(E)}\ \text{there are exactly 10 values for }{N}$

(a) FInd the number of complex roots of $Z^6 = Z + \bar{Z}$ (b) Find the number of complex solutions of $Z^n = Z + \bar{Z}$ for $n \in \mathbb{Z}^+$

Let $a$, $b$, $c$, and $d$ be positive real numbers such that $a+b=c+d$ and $a^2+b^2>c^2+d^2$. Prove that $a^3+b^3>c^3+d^3$.

A convex $n$-side polygon has angles $v_1,v_2,\dots,v_n$ (in degrees), where all $v_k$ ($k = 1,2,\dots,n$) are positive integers divisible by $36$. (a) Determine the largest $n$ for which this is possible. (b) Show that if $n>5$, two of the sides of the $n$-polygon must be parallel.

$ABCD$ is a rectangular sheet of paper that has been folded so that corner $B$ is matched with point $B'$ on edge $AD$. The crease is $EF$, where $E$ is on $AB$ and $F$is on $CD$. The dimensions $AE=8$, $BE=17$, and $CF=3$ are given. The perimeter of rectangle $ABCD$ is $m/n$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$. [asy] size(200); defaultpen(linewidth(0.7)+fontsize(10)); pair A=origin, B=(25,0), C=(25,70/3), D=(0,70/3), E=(8,0), F=(22,70/3), Bp=reflect(E,F)*B, Cp=reflect(E,F)*C; draw(F--D--A--E); draw(E--B--C--F, linetype("4 4")); filldraw(E--F--Cp--Bp--cycle, white, black); pair point=( 12.5, 35/3 ); label("$A$", A, dir(point--A)); label("$B$", B, dir(point--B)); label("$C$", C, dir(point--C)); label("$D$", D, dir(point--D)); label("$E$", E, dir(point--E)); label("$F$", F, dir(point--F)); label("$B^\prime$", Bp, dir(point--Bp)); label("$C^\prime$", Cp, dir(point--Cp));[/asy]

A man gets lost in a large forest, the boundary of which is a straight line. (We can assume that the forest fills the half-plane.) It is known that the distance from a person to Granina forest does not exceed $2$ km. a) Suggest a path along which he will certainly be able to get out of the forest after walking no more than $14$ km. (Of course, a person does not know in which direction the border of the forest is, BUT he has the opportunity to move along any pre-selected curve. It is believed that a person left the forest as soon as he reached its border, while the border of the forest is invisible to him, no matter how close he would have approached it.) b) Find a path with the same property and length no more than $13$ km.