Let $ ABCD$ be a trapezoid with parallel sides $ AB > CD$. Points $ K$ and $ L$ lie on the line segments $ AB$ and $ CD$, respectively, so that $AK/KB=DL/LC$. Suppose that there are points $ P$ and $ Q$ on the line segment $ KL$ satisfying \[\angle{APB} \equal{} \angle{BCD}\qquad\text{and}\qquad \angle{CQD} \equal{} \angle{ABC}.\] Prove that the points $ P$, $ Q$, $ B$ and $ C$ are concyclic. [i]Proposed by Vyacheslev Yasinskiy, Ukraine[/i]

A point $E$ lies on the extension of the side $AD$ of the rectangle $ABCD$ over $D$. The ray $EC$ meets the circumcircle $\omega$ of $ABE$ at the point $F\ne E$. The rays $DC$ and $AF$ meet at $P$. $H$ is the foot of the perpendicular drawn from $C$ to the line $\ell$ going through $E$ and parallel to $AF$. Prove that the line $PH$ is tangent to $\omega$. (A. Kuznetsov)

If $x_k \in \mathbb{R}$ ($k=1, 2, \cdots , n$) and $m \in \mathbb{N}$ then [list=1] [*] $\sum \limits_{cyc} \left (x_1^2 -x_1x_2+x_2^2 \right )^m \leq 3^m \sum \limits_{k=1}^n x_k^{2m}$ [*] $\prod \limits_{cyc} \left (x_1^2 -x_1x_2+x_2^2 \right )^m \leq \left (\frac{3^m}{n}\right )^m \left (\sum \limits_{k=1}^n x_k^{2m}\right )^n$ [/list]

How many of the first 1000 positive integers can be expressed in the form \[ \lfloor 2x \rfloor + \lfloor 4x \rfloor + \lfloor 6x \rfloor + \lfloor 8x \rfloor, \] where $x$ is a real number, and $\lfloor z \rfloor$ denotes the greatest integer less than or equal to $z$?

[color=darkred]Let $a$ , $b$ and $c$ be three complex numbers such that $a+b+c=0$ and $|a|=|b|=|c|=1$ . Prove that: \[3\le |z-a|+|z-b|+|z-c|\le 4,\] for any $z\in\mathbb{C}$ , $|z|\le 1\, .$[/color]

Find all functions $f: \mathbb R \to \mathbb R$ such that for all reals $x$ and $y$, \[f(f(x)-y^{2})=f(x)^{2}-2f(x)y^{2}+f(f(y)).\]

Find all $7$-digit numbers which use only the digits $5$ and $7$ and are divisible by $35$.

Find the 2002nd positive integer that is not the difference of two square integers

Let $n$ be a given positive integer. Sisyphus performs a sequence of turns on a board consisting of $n + 1$ squares in a row, numbered $0$ to $n$ from left to right. Initially, $n$ stones are put into square $0$, and the other squares are empty. At every turn, Sisyphus chooses any nonempty square, say with $k$ stones, takes one of these stones and moves it to the right by at most $k$ squares (the stone should say within the board). Sisyphus' aim is to move all $n$ stones to square $n$. Prove that Sisyphus cannot reach the aim in less than \[ \left \lceil \frac{n}{1} \right \rceil + \left \lceil \frac{n}{2} \right \rceil + \left \lceil \frac{n}{3} \right \rceil + \dots + \left \lceil \frac{n}{n} \right \rceil \] turns. (As usual, $\lceil x \rceil$ stands for the least integer not smaller than $x$. )

Let $P_1(x, y)$ and $P_2(x, y)$ be two relatively prime polynomials with complex coefficients. Let $Q(x, y)$ and $R(x, y)$ be polynomials with complex coefficients and each of degree not exceeding $d$. Prove that there exist two integers $A_1, A_2$ not simultaneously zero with $|A_i| \leq d + 1 \ (i = 1, 2)$ and such that the polynomial $A_1P_1(x, y) + A_2P_2(x, y)$ is coprime to $Q(x, y)$ and $R(x, y).$

Describe all closed bounded figures $\Phi$ in the plane any two points of which are connectable by a semicircle lying in $\Phi$.

Given an isosceles triangle. Find the set of the points inside the triangle such, that the distance from that point to the base equals to the geometric mean of the distances to the sides.

Positive integers $x,y,z$ satisfy $x^3+xy+x^2+xz+y+z=301$. Compute $y+z-x$. [i]2015 CCA Math Bonanza Individual Round #12[/i]

Let $ABC$ be an acute-angled triangle with $AB \ne BC$ and radius $k$. Let $P$ and $Q$ be the points of intersection of $k$ with the internal bisector and the external bisector of $\angle CBA$ respectively. Let $D$ be the intersection of $AC$ and $PQ$. Find the ratio $AD: DC$.

Given two odd natural numbers $ a,b$ prove that for each $ n\in\mathbb{N}$ there exists $ m\in\mathbb{N}$ such that either $ a^mb^2-1$ or $ b^ma^2-1$ is multiple of $ 2^n.$

There are villager $0$, villager $1$, . . . , villager $2015$ i.e. $2016$ people in the village. You are villager $0$. Each villager is either honest or liar. You don’t know each villager is honest or liar, but you know you are honest and the number of liar is equal or smaller than integer $T$. The villagers became to write one letter without fail from one day. For integers $1 \le n \le 2015$, there are set integers $1 < k_n < 2015$. The letter villager $i$ wrote in day $n$ of the morning is delivered to villager $i + k_n$ if villager $i$ is honest, or villager $i - k_n$ if villager $i$ is liar in day $n$ of the evening. If $i - j$ is divisible by $2016$, villager $i$ and $j$ point same villager. Villagers don’t know $k_n$, but sender is told when letters are received. Villager can write anything on a letter, and each villager receives letters from any villagers a sufficient number of times after enough time. i.e. there are $n$ satisfying $k = k_n$ infinitely for each integer $1 \le k \le 2015$. You want to know the honest persons of this village. You can gather all villagers just once and instruct in one day of noon. The honest person obeys your instruction but the liar person not always obeys and he or she writes on a letter anything possible. One day from your instruction for a while, you could determine all honest persons of this village. Find the maximum value of $T$ such that it is possible to do this if you instruct appropriate regardless of the villagers who are honest or liar.

Isabella uses one-foot cubical blocks to build a rectangular fort that is 12 feet long, 10 feet wide, and 5 feet high. The floor and the four walls are all one foot thick. How many blocks does the fort contain? [asy] import three; size(3inch); currentprojection=orthographic(-8,15,15); triple A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P; A = (0,0,0); B = (0,10,0); C = (12,10,0); D = (12,0,0); E = (0,0,5); F = (0,10,5); G = (12,10,5); H = (12,0,5); I = (1,1,1); J = (1,9,1); K = (11,9,1); L = (11,1,1); M = (1,1,5); N = (1,9,5); O = (11,9,5); P = (11,1,5); //outside box far draw(surface(A--B--C--D--cycle),white,nolight); draw(A--B--C--D--cycle); draw(surface(E--A--D--H--cycle),white,nolight); draw(E--A--D--H--cycle); draw(surface(D--C--G--H--cycle),white,nolight); draw(D--C--G--H--cycle); //inside box far draw(surface(I--J--K--L--cycle),white,nolight); draw(I--J--K--L--cycle); draw(surface(I--L--P--M--cycle),white,nolight); draw(I--L--P--M--cycle); draw(surface(L--K--O--P--cycle),white,nolight); draw(L--K--O--P--cycle); //inside box near draw(surface(I--J--N--M--cycle),white,nolight); draw(I--J--N--M--cycle); draw(surface(J--K--O--N--cycle),white,nolight); draw(J--K--O--N--cycle); //outside box near draw(surface(A--B--F--E--cycle),white,nolight); draw(A--B--F--E--cycle); draw(surface(B--C--G--F--cycle),white,nolight); draw(B--C--G--F--cycle); //top draw(surface(E--H--P--M--cycle),white,nolight); draw(surface(E--M--N--F--cycle),white,nolight); draw(surface(F--N--O--G--cycle),white,nolight); draw(surface(O--G--H--P--cycle),white,nolight); draw(M--N--O--P--cycle); draw(E--F--G--H--cycle); label("10",(A--B),SE); label("12",(C--B),SW); label("5",(F--B),W);[/asy] $\textbf{(A)}\ 204 \qquad \textbf{(B)}\ 280 \qquad \textbf{(C)}\ 320 \qquad \textbf{(D)}\ 340 \qquad \textbf{(E)}\ 600$

Let $p$ be a prime number. Let $\mathbb F_p$ denote the integers modulo $p$, and let $\mathbb F_p[x]$ be the set of polynomials with coefficients in $\mathbb F_p$. Define $\Psi : \mathbb F_p[x] \to \mathbb F_p[x]$ by \[ \Psi\left( \sum_{i=0}^n a_i x^i \right) = \sum_{i=0}^n a_i x^{p^i}. \] Prove that for nonzero polynomials $F,G \in \mathbb F_p[x]$, \[ \Psi(\gcd(F,G)) = \gcd(\Psi(F), \Psi(G)). \] Here, a polynomial $Q$ divides $P$ if there exists $R \in \mathbb F_p[x]$ such that $P(x) - Q(x) R(x)$ is the polynomial with all coefficients $0$ (with all addition and multiplication in the coefficients taken modulo $p$), and the gcd of two polynomials is the highest degree polynomial with leading coefficient $1$ which divides both of them. A non-zero polynomial is a polynomial with not all coefficients $0$. As an example of multiplication, $(x+1)(x+2)(x+3) = x^3+x^2+x+1$ in $\mathbb F_5[x]$. [i]Proposed by Mark Sellke[/i]

A rhombus with sidelength $1$ has an inscribed circle with radius $\frac{1}{3}.$ If the area of the rhombus can be expressed as $\frac{a}{b}$ for relatively prime, positive $a,b,$ evaluate $a+b.$ [i]Proposed by Alex Li[/i]

Given an arbitrary angle $\alpha$, compute $cos \alpha + cos \big( \alpha +\frac{2\pi }{3 }\big) + cos \big( \alpha +\frac{4\pi }{3 }\big)$ and $sin \alpha + sin \big( \alpha +\frac{2\pi }{3 } \big) + sin \big( \alpha +\frac{4\pi }{3 } \big)$ . Generalize this result and justify your answer.

Determine all tuples of positive integers $(x, y, z, t)$ such that: $$ xyz = t!$$ $$ (x+1)(y+1)(z+1) = (t+1)!$$ holds simultaneously.

What is the area of the letter $O$ made by Dürer? The two circles have a unit radius. Their centers, or the angle of a triangle formed by an intersection point of the circles is $30^o$. [img]https://cdn.artofproblemsolving.com/attachments/b/c/fe052393871a600fc262bd60047433972ae1be.png[/img]

Prove that for $k>10$ Nazar may replace in the following product some one $\cos$ by $\sin$ so that the new function $f_{1}(x)$ would satisfy inequality $|f_{1}(x)|\le 3\cdot 2^{-1-k}$ for all real $x$. \[f(x) = \cos x \cos 2x \cos 3x \dots \cos 2^{k}x \] [i]N. Agakhanov[/i]

Let $a_1, a_2, \cdots , a_n$ be real numbers, with $n\geq 3,$ such that $a_1 + a_2 +\cdots +a_n = 0$ and $$ 2a_k\leq a_{k-1} + a_{k+1} \ \ \ \text{for} \ \ \ k = 2, 3, \cdots , n-1.$$ Find the least number $\lambda(n),$ such that for all $k\in \{ 1, 2, \cdots, n\} $ it is satisfied that $|a_k|\leq \lambda (n)\cdot \max \{|a_1|, |a_n|\} .$

Consider $A = \{1, 2, ..., 16\}$. A partition of $A$ into nonempty sets $A_1, A_2,..., A_n$ is said to be good if none of the Ai contains elements $a, b, c$ (not necessarily distinct) such that $a = b + c$. (a) Find a good partition $\{A_1, A_2, A_3, A_4\}$ of $A$. (b) Prove that no partition $\{A_1, A_2, A_3\}$ of $A$ is good