$\frac{16+8}{4-2}=$ $\text{(A)}\ 4 \qquad \text{(B)}\ 8 \qquad \text{(C)}\ 12 \qquad \text{(D)}\ 16 \qquad \text{(E)}\ 20$

Let $x\neq y$. Two sequences $x,a_1,a_2,a_3,y$ and $b_1,x,b_2,b_3,y,b_4$ are arithmetic sequence. Then $\frac{b_4-b_3}{a_2-a_1}=$________.

Let $n \geq 2$ be an integer. Let $P(x_1, x_2, \ldots, x_n)$ be a nonconstant $n$-variable polynomial with real coefficients. Assume that whenever $r_1, r_2, \ldots , r_n$ are real numbers, at least two of which are equal, we have $P(r_1, r_2, \ldots , r_n) = 0$. Prove that $P(x_1, x_2, \ldots, x_n)$ cannot be written as the sum of fewer than $n!$ monomials. (A monomial is a polynomial of the form $cx^{d_1}_1 x^{d_2}_2\ldots x^{d_n}_n$, where $c$ is a nonzero real number and $d_1$, $d_2$, $\ldots$, $d_n$ are nonnegative integers.) [i]Proposed by Ankan Bhattacharya[/i]

Given a triangle $ABC$, on the side $BC$ which marked the point $E$ such that $BE \ge CE$. Construct on the sides $AB$ and $AC$ the points $D$ and $F$, respectively, such that $\angle DEF = 90 {} ^ \circ$ and the segment $BF$ is bisected by the segment $DE $. (Black Maxim)

The six-digit number $\underline{2}\,\underline{0}\,\underline{2}\,\underline{1}\,\underline{0}\,\underline{A}$ is prime for only one digit $A.$ What is $A?$ $(\textbf{A})\: 1\qquad(\textbf{B}) \: 3\qquad(\textbf{C}) \: 5 \qquad(\textbf{D}) \: 7\qquad(\textbf{E}) \: 9$

For $2k$ real numbers $a_1, a_2, ..., a_k$, $b_1, b_2, ..., b_k$ define a sequence of numbers $X_n$ by \[ X_n = \sum_{i=1}^k [a_in + b_i] \quad (n=1,2,...). \] If the sequence $X_N$ forms an arithmetic progression, show that $\textstyle\sum_{i=1}^k a_i$ must be an integer. Here $[r]$ denotes the greatest integer less than or equal to $r$.

Consider a regular cube with side length $2$. Let $A$ and $B$ be $2$ vertices that are furthest apart. Construct a sequence of points on the surface of the cube $A_1$, $A_2$, $\ldots$, $A_k$ so that $A_1=A$, $A_k=B$ and for any $i = 1,\ldots, k-1$, the distance from $A_i$ to $A_{i+1}$ is $3$. Find the minimum value of $k$.

The integers $a_1,a_2,...,a_{2012}$ are given. Exactly $29$ of them are divisible by $3$. Prove that the sum $a_1^2+a_2^2+...+a_{2012}^2$ is divisible by $3$.

In a village there are only $10$ houses, arranged in a circle of a radius $r$ meters. Each has is the same distance from each of the two closest houses. Every year on Sunday of Pascoa, the village priest makes the Easter visit, leaving the parish house (point $A$) and following the path described in Figure 1. This year the priest decided to take the path represented in the Figure 2. Prove that this year the priest will walk another $10r$ meters. [img]https://cdn.artofproblemsolving.com/attachments/a/9/a6315f4a63f28741ca6fbc75c19a421eb1da06.png[/img]

Let $B'$ and $C'$ be points in the circumcircle of triangle $\triangle ABC$ such that $AB=AB'$ and $AC=AC'$. Let $E$ and $F$ be the foot of altitudes from $B$ and $C$ to $AC$ and $AB$, respectively. Show that $B'E$ and $C'F$ intersect on the circumcircle of triangle $\triangle ABC$.

Twenty cubes of the same size and appearance are made of either aluminum or of heavier duralumin. How can one find the number of duralumin cubes using not more than $11$ weighings on a balance without weights? (We assume that all cubes can be made of aluminum, but not all of duralumin.)

Two planes, $P$ and $Q$, intersect along the line $p$. The point $A$ is given in the plane $P$, and the point $C$ in the plane $Q$; neither of these points lies on the straight line $p$. Construct an isosceles trapezoid $ABCD$ (with $AB \parallel CD$) in which a circle can be inscribed, and with vertices $B$ and $D$ lying in planes $P$ and $Q$ respectively.

Let $n$ be a positive integer and let $k$ be an integer between $1$ and $n$ inclusive. There is a white board of $n \times n$. We do the following process. We draw $k$ rectangles with integer sides lenghts and sides parallel to the ones of the $n \times n$ board, and such that each rectangle covers the top-right corner of the $n \times n$ board. Then, the $k$ rectangles are painted of black. This process leaves a white figure in the board. How many different white figures are possible to do with $k$ rectangles that can't be done with less than $k$ rectangles? Proposed by David Torres Flores

Let $\gamma_1, \gamma_2, \gamma_3$ be mutually externally tangent circles and $\Gamma_1, \Gamma_2, \Gamma_3$ also be mutually externally tangent circles. For each $1 \le i \le 3$, $\gamma_i$ and $\Gamma_{i+1}$ are externally tangent at $A_i$, $\gamma_i$ and $\Gamma_{i+2}$ are externally tangent at $B_i$, and $\gamma_i$ and $\Gamma_i$ do not meet. Show that the six points $A_1, A_2, A_3, B_1, B_2, B_3$ lie on either a line or a circle.

[u]Set 1[/u] [b]p1.[/b] Assume the speed of sound is $343$ m/s. Anastasia and Bananastasia are standing in a field in front of you. When they both yell at the same time, you hear Anastasia’s yell $5$ seconds before Bananastasia’s yell. If Bananastasia yells first, and then Anastasia yells when she hears Bananastasia yell, you hear Anastasia’s yell $5$ seconds after Bananastasia’s yell. What is the distance between Anastasia and Bananastasia in meters? [b]p2.[/b] Michelle picks a five digit number with distinct digits. She then reverses the digits of her number and adds that to her original number. What is the largest possible sum she can get? [b]p3.[/b] Twain is trying to crack a $4$-digit number combination lock. They know that the second digit must be even, the third must be odd, and the fourth must be different from the previous three. If it takes Twain $10$ seconds to enter a combination, how many hours would it take them to try every possible combination that satisfies these rules? PS. You should use hide for answers.

Let $n$ be an integer. For pair of integers $0 \leq i,$ $j\leq n$ there exist real number $f(i,j)$ such that: 1) $ f(i,i)=0$ for all integers $0\leq i \leq n$ 2) $0\leq f(i,l) \leq 2\max \{ f(i,j), f(j,k), f(k,l) \}$ for all integers $i$, $j$, $k$, $l$ satisfying $0\leq i\leq j\leq k\leq l\leq n$. Prove that $$f(0,n) \leq 2\sum_{k=1}^{n}f(k-1,k)$$

For each polynomial $P(x)$ with real coefficients, define $P_0=P(0)$ and $P_j(x)=x^j\cdot P^{(j)}(x)$ where $P^{(j)}$ denotes the $j$-th derivative of $P$ for $j\geq 1$. Prove that there exists one unique sequence of real numbers $b_0, b_1, b_2, \dots$ such that for each polynomial $P(x)$ with real coefficients and for each $x$ real, we have $P(x)=b_0P_0+\sum_{k\geq 1}b_kP_k(x)=b_0P_0+b_1P_1(x)+b_2P_2(x)+\dots$

Find the number of nonzero terms of the polynomial $P(x)$ if $$x^{2018}+x^{2017}+x^{2016}+x^{999}+1=(x^4+x^3+x^2+x+1)P(x).$$

Find all the finite sequences with $ n$ consecutive natural numbers $ a_1, a_2,..., a_n$, with $ n\geq3$ such that $ a_1\plus{} a_2\plus{}...\plus{} a_n\equal{}2009$.

If for real numbers $x$ and $y$ holds $\left(x+\sqrt{1+y^2}\right)\left(y+\sqrt{1+x^2}\right)=1$ prove that $$\left(x+\sqrt{1+x^2}\right)\left(y+\sqrt{1+y^2}\right)=1$$

Two friends $A$ and $B$ must solve the following puzzle. Each of them receives a number from the set $\{1,2,…,250\}$, but they don’t see the number that the other received. The objective of each friend is to discover the other friend’s number. The procedure is as follows: each friend, by turns, announces various not necessarily distinct positive integers: first $A$ says a number, then $B$ says one, $A$ says a number again, etc., in such a way that the sum of all the numbers said is $20$. Demonstrate that there exists a strategy that $A$ and $B$ have previously agreed on such that they can reach the objective, no matter which number each one received at the beginning of the puzzle.

If $0\le x_k<k$, for any $k\in\{1,2,\ldots,n\}$, $m\in\mathbb R_{\ge2}$, then prove that $$\frac1{\sqrt[m]{(1-x_1)(2-x_2)\cdots(n-x_n)}}+\frac1{\sqrt[m]{(1+x_1)(2+x_2)\cdots(n+x_n)}}\ge\frac2{\sqrt[m]{n!}}$$ [i]Proposed by Dorin Mărghidanu[/i]

Let $S$ be the set of $10$-tuples of non-negative integers that have sum $2019$. For any tuple in $S$, if one of the numbers in the tuple is $\geq 9$, then we can subtract $9$ from it, and add $1$ to the remaining numbers in the tuple. Call thus one operation. If for $A,B\in S$ we can get from $A$ to $B$ in finitely many operations, then denote $A\rightarrow B$. (1) Find the smallest integer $k$, such that if the minimum number in $A,B\in S$ respectively are both $\geq k$, then $A\rightarrow B$ implies $B\rightarrow A$. (2) For the $k$ obtained in (1), how many tuples can we pick from $S$, such that any two of these tuples $A,B$ that are distinct, $A\not\rightarrow B$.

Which of the following describes the set of values of $a$ for which the curves $x^2+y^2=a^2$ and $y=x^2-a$ in the real $xy$-plane intersect at exactly $3$ points? $ \textbf{(A) }a=\frac14 \qquad \textbf{(B) }\frac14 < a < \frac12 \qquad \textbf{(C) }a>\frac14 \qquad \textbf{(D) }a=\frac12 \qquad \textbf{(E) }a>\frac12 \qquad $

If $f$ is a polynomial, and $f(-2)=3$, $f(-1)=-3=f(1)$, $f(2)=6$, and $f(3)=5$, then what is the minimum possible degree of $f$?