Let $ABCD$ be a convex quadrileteral such that $m(\widehat{ABD})=40^\circ$, $m(\widehat{DBC})=70^\circ$, $m(\widehat{BDA})=80^\circ$, and $m(\widehat{BDC})=50^\circ$. What is $m(\widehat{CAD})$? $ \textbf{(A)}\ 25^\circ \qquad\textbf{(B)}\ 30^\circ \qquad\textbf{(C)}\ 35^\circ \qquad\textbf{(D)}\ 38^\circ \qquad\textbf{(E)}\ 40^\circ $

Let $I$ be the incenter of scalene triangle ABC and denote by $a,$ $b$ the circles with diameters $IC$ and $IB$, respectively. If $c,$ $d$ mirror images of $a,$ $b$ in $IC$ and $IB$ prove that the circumcenter $O$ of triangle $ABC$ lies on the radical axis of $c$ and $d$.

Carmen takes a long bike ride on a hilly highway. The graph indicates the miles traveled during the time of her ride. What is Carmen's average speed for her entire ride in miles per hour? [asy] import graph; size(8.76cm); real lsf=0.5; pen dps=linewidth(0.7)+fontsize(10); defaultpen(dps); pen ds=black; real xmin=-3.58,xmax=10.19,ymin=-4.43,ymax=9.63; draw((0,0)--(0,8)); draw((0,0)--(8,0)); draw((0,1)--(8,1)); draw((0,2)--(8,2)); draw((0,3)--(8,3)); draw((0,4)--(8,4)); draw((0,5)--(8,5)); draw((0,6)--(8,6)); draw((0,7)--(8,7)); draw((1,0)--(1,8)); draw((2,0)--(2,8)); draw((3,0)--(3,8)); draw((4,0)--(4,8)); draw((5,0)--(5,8)); draw((6,0)--(6,8)); draw((7,0)--(7,8)); label("$1$",(0.95,-0.24),SE*lsf); label("$2$",(1.92,-0.26),SE*lsf); label("$3$",(2.92,-0.31),SE*lsf); label("$4$",(3.93,-0.26),SE*lsf); label("$5$",(4.92,-0.27),SE*lsf); label("$6$",(5.95,-0.29),SE*lsf); label("$7$",(6.94,-0.27),SE*lsf); label("$5$",(-0.49,1.22),SE*lsf); label("$10$",(-0.59,2.23),SE*lsf); label("$15$",(-0.61,3.22),SE*lsf); label("$20$",(-0.61,4.23),SE*lsf); label("$25$",(-0.59,5.22),SE*lsf); label("$30$",(-0.59,6.2),SE*lsf); label("$35$",(-0.56,7.18),SE*lsf); draw((0,0)--(1,1),linewidth(1.6)); draw((1,1)--(2,3),linewidth(1.6)); draw((2,3)--(4,4),linewidth(1.6)); draw((4,4)--(7,7),linewidth(1.6)); label("HOURS",(3.41,-0.85),SE*lsf); label("M",(-1.39,5.32),SE*lsf); label("I",(-1.34,4.93),SE*lsf); label("L",(-1.36,4.51),SE*lsf); label("E",(-1.37,4.11),SE*lsf); label("S",(-1.39,3.7),SE*lsf); clip((xmin,ymin)--(xmin,ymax)--(xmax,ymax)--(xmax,ymin)--cycle); [/asy] $ \textbf{(A)}2\qquad\textbf{(B)}2.5\qquad\textbf{(C)}4\qquad\textbf{(D)}4.5\qquad\textbf{(E)}5 $

For a polynomial $f(x)$ with integer coefficients and degree no less than $1$, prove that there are infinitely many primes $p$ which satisfies the following. There exists an integer $n$ such that $f(n) \not= 0$ and $|f(n)|$ is a multiple of $p$.

For positive integers $n, k, r$, denote by $A(n, k, r)$ the number of integer tuples $(x_1, x_2, \ldots, x_k)$ satisfying the following conditions. [list] [*] $x_1 \ge x_2 \ge \cdots \ge x_k \ge 0$ [*] $x_1+x_2+ \cdots +x_k = n$ [*] $x_1-x_k \le r$ [/list] For all positive integers $m, s, t$, prove that $$A(m, s, t)=A(m, t, s).$$

The real numbers $a$, $b$, $c$, $d$ satisfy simultaneously the equations \[abc -d = 1, \ \ \ bcd - a = 2, \ \ \ cda- b = 3, \ \ \ dab - c = -6.\] Prove that $a + b + c + d \not = 0$.

Parabola $y^2=2px$, two fixed points $A(a,b),B(-a,0)(ab\neq0,b^2\neq 2pa)$. $M$ is a point on the parabola, $AM$ intersects the parabola at $M_1$, $BM$ intersects the parabola at $M_2$. Prove: When $M$ changes, line $M_1M_2$ passes a fixed point, and find the fixed point.

Let $n$ be a positive integer. Define a sequence by setting $a_{1}= n$ and, for each $k > 1$, letting $a_{k}$ be the unique integer in the range $0\leq a_{k}\leq k-1$ for which $a_{1}+a_{2}+...+a_{k}$ is divisible by $k$. For instance, when $n = 9$ the obtained sequence is $9,1,2,0,3,3,3,...$. Prove that for any $n$ the sequence $a_{1},a_{2},...$ eventually becomes constant.

Find the least natural number $ n$ such that, if the set $ \{1,2, \ldots, n\}$ is arbitrarily divided into two non-intersecting subsets, then one of the subsets contains 3 distinct numbers such that the product of two of them equals the third.

Consider the function $y(x)$ satisfying the differential equation $y'' = -(1+\sqrt{x})y$ with $y(0)=1$ and $y'(0)=0.$ Prove that $y(x)$ vanishes exactly once on the interval $0< x< \pi \slash 2,$ and find a positive lower bound for the zero.

Let $f:\mathbb{R}_{\geq 0} \rightarrow \mathbb{R}_{\geq 0}$ be a continuous function such that $f(0)=0$ and $$f(x)+f(f(x))+f(f(f(x)))=3x$$ for all $x>0$. Show that $f(x)=x$ for all $x>0$.

Let $AC$ and $BD$ be two chords of a circle with center $O$ such that they intersect at right angles inside the circle at the point $M$. Suppose $K$ and $L$ are midpoints of the chords $AB$ and $CD$ respectively. Prove that $OKML$ is a parallelogram.

A cross-section of a river is a trapezoid with bases $10$ and $16$ and slanted sides of length $5$. At this section the water is flowing at $\pi$ mph. A little ways downstream is a dam where the water flows through $4$ identical circular holes at $16$ mph. What is the radius of the holes?

Let $ ABC$ be an acute-angled triangle with altitude $ AK$. Let $ H$ be its ortho-centre and $ O$ be its circum-centre. Suppose $ KOH$ is an acute-angled triangle and $ P$ its circum-centre. Let $ Q$ be the reflection of $ P$ in the line $ HO$. Show that $ Q$ lies on the line joining the mid-points of $ AB$ and $ AC$.

At the vertices of a regular hexagon are written six nonnegative integers whose sum is $2003^{2003}$. Bert is allowed to make moves of the following form: he may pick a vertex and replace the number written there by the absolute value of the difference between the numbers written at the two neighboring vertices. Prove that Bert can make a sequence of moves, after which the number 0 appears at all six vertices.

Let $ a_1,a_2, \cdots ,a_{2015} $ be $2015$-tuples of positive integers (not necessary distinct) and let $ k $ be a positive integers. Denote $\displaystyle f(i)=a_i+\frac{a_1a_2 \cdots a_{2015}}{a_i} $. a) Prove that if $ k=2015^{2015} $, there exist $ a_1, a_2, \cdots , a_{2015} $ such that $ f(i)= k $ for all $1\le i\le 2015 $.\\ b) Find the maximum $k_0$ so that for $k\le k_0$, there are no $k$ such that there are at least $ 2 $ different $2015$-tuples which fulfill the above condition.

Point $P$ lies inside the triangle $ABC$. Points $K, L, M$ are symmetrics of point $P$ wrt the midpoints of the sides $BC, CA, AB$. Prove that the straight $AK, BL, CM$ intersect at one point.

Let $(a,b,c,d)$ be a solution to the system \begin{align*}a+b&=15,\\ab+c+d&=78,\\ad+bc&=160,\\cd&=96.\end{align*} Find the greatest possible value of $a^2+b^2+c^2+d^2$.

Given a positive integer \(n\), let \(\phi(n)\) denote the number of positive integers less than or equal to \(n\) that are relatively prime to \(n\). Find all possible positive integers \(k\) for which there exist positive integers \(1 \leq a_1 < a_2 < \dots < a_k\) such that: \[ \left\lfloor \frac{\phi(a_1)}{a_1} + \frac{\phi(a_2)}{a_2} + \dots + \frac{\phi(a_k)}{a_k} \right\rfloor = 2024 \]

Let $A_0A_1A_2$ be a scalene triangle. Find the locus of the centres of the equilateral triangles $X_0X_1X_2$ , such that $A_k$ lies on the line $X_{k+1}X_{k+2}$ for each $k=0,1,2$ (with indices taken modulo $3$).

Let $\{a_{n}\}$ be a strictly increasing positive integers sequence such that $\gcd(a_{i}, a_{j})=1$ and $a_{i+2}-a_{i+1}>a_{i+1}-a_{i}$. Show that the infinite series \[\sum^{\infty}_{i=1}\frac{1}{a_{i}}\] converges.

An $8\times 8$ chessboard is made of unit squares. We put a rectangular piece of paper with sides of length 1 and 2. We say that the paper and a single square overlap if they share an inner point. Determine the maximum number of black squares that can overlap the paper.

In an attempt to copy down from the board a sequence of six positive integers in arithmetic progression, a student wrote down the five numbers, \[ 113,137,149,155,173, \] accidentally omitting one. He later discovered that he also miscopied one of them. Can you help him and recover the original sequence?

Find all derivable functions that have real domain and codomain, and are equal to their second functional power.

A strip consists of $n$ squares which are numerated in their order by integers $1,2,3,..., n$. In the beginning, one square is empty while each remaining square contains one piece. Whenever a square contains a piece and its some neighbouring square contains another piece while the square immediately following the neighbouring square is empty, one may raise the first piece over the second one to the empty square, removing the second piece from the strip. Find all possibilites which square can be initially empty, if it is possible to reach a state where the strip contains only one piece and a) $n = 2008$, b) $n = 2009$.