The convex quadrilateral $ABCD$ is has angle $A$ equal to $60^o$ , angle bisector of $A$ the diagonal $AC$ and $\angle ACD= 40^o$ and $\angle ACB = 120^o$. Inside the quadrilateral the point $P$ lies such that $\angle PDA = 40^o$ and $\angle PBA = 10^o$; a) Find the angle $\angle DPB$? b) Prove that $P$ lies on the diagonal $AC$.

Given an even positive integer $m$, find all positive integers $n$ for which there exists a bijection $f:[n]\to [n]$ so that, for all $x,y\in [n]$ for which $n\mid mx-y$, $$(n+1)\mid f(x)^m-f(y).$$ Note: For a positive integer $n$, we let $[n] = \{1,2,\dots, n\}$. [i]Proposed by Milan Haiman and Carl Schildkraut[/i]

Squares $ABCD$ and $EFGH$ have a common center and $\overline{AB}\parallel \overline{EF}$. The area of $ABCD$ is $2016$, and the area of $EFGH$ is a smaller positive integer. Square $IJKL$ is constructed so that each of its vertices lies on a side of $ABCD$ and each vertex of $EFGH$ lies on a side of $IJKL$. Find the difference between the largest and smallest possible integer values of the area of $IJKL$.

[color=darkred]Quadrilateral $ ABCD$ is inscribed in the circle of diameter $ BD$. Point $ A_1$ is reflection of point $ A$ wrt $ BD$ and $ B_1$ is reflection of $ B$ wrt $ AC$. Denote $ \{P\}\equal{}CA_1 \cap BD$ and $ \{Q\}\equal{}DB_1\cap AC$. Prove that $ AC\perp PQ$.[/color]

Let $n\geq 0$ be an integer and let $p \equiv 7 \pmod 8$ be a prime number. Prove that \[ \sum^{p-1}_{k=1} \left \{ \frac {k^{2^n}}p - \frac 12 \right\} = \frac {p-1}2 . \] [i]Călin Popescu[/i]

Determine all functions $f: \mathbb{Z}\to\mathbb{Z}$ satisfying \[f\big(f(m)+n\big)+f(m)=f(n)+f(3m)+2014\] for all integers $m$ and $n$. [i]Proposed by Netherlands[/i]

Let $H$, $I$, $O$ be the orthocenter, incenter and circumcenter of a triangle. Show that $2 \cdot IO \geq IH$. When does the equality hold ?

For how many integers $n$, there are four distinct real numbers satisfying the equation $ |x^2-4x-7|=n$? $ \textbf{(A)}\ 12 \qquad\textbf{(B)}\ 10 \qquad\textbf{(C)}\ 8 \qquad\textbf{(D)}\ 7 \qquad\textbf{(E)}\ 5 $

Let $n \geq 2$ be an integer and let \[M=\bigg\{\frac{a_1 + a_2 + ... + a_k}{k}: 1 \le k \le n\text{ and }1 \le a_1 < \ldots < a_k \le n\bigg\}\] be the set of the arithmetic means of the elements of all non-empty subsets of $\{1, 2, ..., n\}$. Find \[\min\{|a - b| : a, b \in M\text{ with } a \neq b\}.\]

Prove that the sequence $5, 12, 19, 26, 33,\cdots $ contains no term of the form $2^n -1.$

$a_1,a_2,...,a_k$ are positive integers and $\frac{1}{a_1}+\frac{1}{a_2}+...+\frac{1}{a_k}>1$. Prove that equation $$[\frac{n}{a_1}]+[\frac{n}{a_2}]+...+[\frac{n}{a_k}]=n$$ has no more than $a_1*a_2*...*a_k$ postivie integer solutions in $n$.

Let $a_1,a_2,\ldots,a_6$ be a sequence of integers such that for all $1 \le i \le 5$,$$a_{i+1}=\frac{a_i}{3} \quad \text{or} \quad a_{i+1}={-}2a_i.$$Find the number of possible positive values of $a_1+a_2+\cdots+a_6$ less than $1000$. [i]Proposed by [b]stayhomedomath[/b][/i]

You are given some equilateral triangles and squares, all with side length 1, and asked to form convex $n$ sided polygons using these pieces. If both types must be used, what are the possible values of $n$, assuming that there is sufficient supply of the pieces?

Let $ n$ be a given positive integer. In the coordinate set, consider the set of points $ \{P_{1},P_{2},...,P_{4n\plus{}1}\}\equal{}\{(x,y)|x,y\in \mathbb{Z}, xy\equal{}0, |x|\le n, |y|\le n\}.$ Determine the minimum of $ (P_{1}P_{2})^{2} \plus{} (P_{2}P_{3})^{2} \plus{}...\plus{} (P_{4n}P_{4n\plus{}1})^{2} \plus{} (P_{4n\plus{}1}P_{1})^{2}.$

For positive integer $x>1$, define set $S_x$ as $$S_x=\{p^\alpha|p \textup{ is one of the prime divisor of }x,\alpha \in \mathbb{N},p^\alpha|x,\alpha \equiv v_p(x)(\textup{mod} 2)\},$$ where $v_p(n)$ is the power of prime divisor $p$ in positive integer $n.$ Let $f(x)$ be the sum of all the elements of $S_x$ when $x>1,$ and $f(1)=1.$ Let $m$ be a given positive integer, and the sequence $a_1,a_2,\cdots,a_n,\cdots$ satisfy that for any positive integer $n>m,$ $a_{n+1}=\max\{ f(a_n),f(a_{n-1}+1),\cdots,f(a_{n-m}+m)\}.$ Prove that (1)there exists constant $A,B(0<A<1),$ such that when positive integer $x$ has at least two different prime divisors, $f(x)<Ax+B$ holds; (2)there exists positive integer $Q$, such that for any positive integer $n,a_n<Q.$

Each of the 2001 students at a high school studies either Spanish or French, and some study both. The number who study Spanish is between 80 percent and 85 percent of the school population, and the number who study French is between 30 percent and 40 percent. Let $m$ be the smallest number of students who could study both languages, and let $M$ be the largest number of students who could study both languages. Find $M-m$.

Integers $ a$, $ b$, $ c$, and $ d$, not necessarily distinct, are chosen independently and at random from $ 0$ to $ 2007$, inclusive. What is the probability that $ ad \minus{} bc$ is even? $ \textbf{(A)}\ \frac {3}{8}\qquad \textbf{(B)}\ \frac {7}{16}\qquad \textbf{(C)}\ \frac {1}{2}\qquad \textbf{(D)}\ \frac {9}{16}\qquad \textbf{(E)}\ \frac {5}{8}$

Jerry buys a bottle of 150 pills. Using a standard 12 hour clock, he sees that the clock reads exactly 12 when he takes the first pill. If he takes one pill every five hours, what hour will the clock read when he takes the last pill in the bottle?

Let $E$ denote the set of $25$ points $(m,n)$ in the $\text{xy}$-plane, where $m,n$ are natural numbers, $1\leq m\leq5,1\leq n\leq5$. Suppose the points of $E$ are arbitrarily coloured using two colours, red and blue. SHow that there always exist four points in the set $E$ of the form $(a,b),(a+k,b),(a+k,b+k),(a,b+k)$ for some positive integer $k$ such that at least three of these four points have the same colour. (That is, there always exist four points in the set $E$ which form the vertices of a square with sides parallel to the axes and having at least three points of the same colour.)

A right triangle $ABC$ with hypotenuse $AB$ is inscribed in a circle. Let $K$ be the midpoint of the arc $BC$ not containing $A, N$ the midpoint of side $AC$, and $M$ a point of intersection of ray $KN$ with the circle. Let $E$ be a point of intersection of tangents to the circle at points $A$ and $C$. Prove that $\angle EMK = 90^\circ$.

Let $ n$ be a composite. Prove that there exists positive integer $ m$ satisfying $ m|n, m\le\sqrt {n},$ and $ d(n)\le d^3(m).$ Where $ d(k)$ denotes the number of positive divisors of positive integer $ k.$

Two circles $\gamma_1, \gamma_2$ are given, with centers at points $O_1, O_2$ respectively. Select a point $K$ on circle $\gamma_2$ and construct two circles, one $\gamma_3$ that touches circle $\gamma_2$ at point $K$ and circle $\gamma_1$ at a point $A$, and the other $\gamma_4$ that touches circle $\gamma_2$ at point $K$ and circle $\gamma_1$ at a point $B$. Prove that, regardless of the choice of point K on circle $\gamma_2$, all lines $AB$ pass through a fixed point of the plane.

Given is a prime number $p$ and natural $n$ such that $p \geq n \geq 3$. Set $A$ is made of sequences of lenght $n$ with elements from the set $\{0,1,2,...,p-1\}$ and have the following property: For arbitrary two sequence $(x_1,...,x_n)$ and $(y_1,...,y_n)$ from the set $A$ there exist three different numbers $k,l,m$ such that: $x_k \not = y_k$, $x_l \not = y_l$, $x_m \not = y_m$. Find the largest possible cardinality of $A$.

It is given the function $f:\mathbb{R}\rightarrow \mathbb{R}$ fow which $f(1)=1$ and for all $x\in\mathbb{R}$ satisfied $f(x+5)\geq f(x)+5$ and $f(x+1)\leq f(x)+1$ If $g(x)=f(x)-x+1$ then find $g(2016)$ .

For a real number $x,$ let $\lfloor x\rfloor$ denote the greatest integer less than or equal to $x,$ and let $\{x\} = x -\lfloor x\rfloor$ denote the fractional part of $x.$ The sum of all real numbers $\alpha$ that satisfy the equation $$\alpha^2+\{\alpha\}=21$$ can be expressed in the form $$\frac{\sqrt{a}-\sqrt{b}}{c}-d$$ where $a, b, c,$ and $d$ are positive integers, and $a$ and $b$ are not divisible by the square of any prime. Compute $a + b + c + d.$