Trapezoid $ABCD,$ with $AB \parallel CD,$ has side lengths $AB=11, BC=8, CD=19,$ and $DA=4.$ Compute the area of the convex quadrilateral whose vertices are the circumcenters of $\triangle{ABC}, \triangle{BCD}, \triangle{CDA},$ and $\triangle{DAB}.$

Evaluate $1 + 2 + 4 + 7$ $\textbf{(A) }14\qquad\textbf{(B) }15\qquad\textbf{(C) }16\qquad\textbf{(D) }17\qquad\textbf{(E) }18$

For each integer $n \ge 2$, let $A(n)$ be the area of the region in the coordinate plane defined by the inequalities $1\le x \le n$ and $0\le y \le x \left\lfloor \sqrt x \right\rfloor$, where $\left\lfloor \sqrt x \right\rfloor$ is the greatest integer not exceeding $\sqrt x$. Find the number of values of $n$ with $2\le n \le 1000$ for which $A(n)$ is an integer.

A student wrote a correct addition operation $A/B+C/D = E/F$ on the blackboard, where both summands are irreducible and $F$ is the least common multiple of $B$ and $D$. After that, the student reduced the sum $E/F$ correctly by an integer $d$. Prove that $d$ is a common divisor of $B$ and $D$.

A can contains a mixture of two liquids A and B in the ratio $7:5$. When $9$ litres of the mixture are drawn and replaced by the same amount of liquid $B$, the ratio of $A$ and $B$ becomes $7:9$. How many litres of liquid A was contained in the can initially? $\textbf{(A)}~18$ $\textbf{(B)}~19$ $\textbf{(C)}~20$ $\textbf{(D)}~\text{None of the above}$

Let $a,b,c$ be real numbers for which $a+b+c+d=19$ and $a^2+b^2+c^2+d^2=91$. Find the maximal value of $\frac{1}{a}+\frac{1}{b}+\frac{1}{c}+\frac{1}{d}$.

$(x_{n})_{-\infty<n<\infty}$ is a sequence of real numbers which satisfies $x_{n+1}=\frac{x_{n}^2+10}{7}$ for every $n \in \mathbb{Z}$. If there exist a real upperbound for this sequence, find all the values $x_{0}$ can take.

Let $n>1$ be a given integer. In a deck of cards the cards are of $n$ different suites and $n$ different values, and for each pair of a suite and a value there is exactly one such card. We shuffle the deck and distribute the cards among $n$ players giving each player $n$ cards. The players' goal is to choose a way to sit down around a round table so that they will be able to do the following: the first player puts down an arbitrary card, and then each consecutive player puts down a card that has a different suite and different value compared to the previous card that was put down on the table. For which $n$ is it possible that the cards were distributed in such a way that the players cannot achieve their goal? (The players work together, and they can see each other's cards.) Proposed by [i]Anett Kocsis[/i], Budapest

Can three persons, having one double motorcycle, overcome the distance of $70$ km in $3$ hours? Pedestrian speed is $5$ km / h and motorcycle speed is $50$ km / h.

Show that there exists a positive integer $ k$ such that $ k \cdot 2^{n} \plus{} 1$ is composite for all $ n \in \mathbb{N}_{0}$.

Let $f(n)$ count the number of values $0\le k\le n^2$ such that $43\nmid\binom{n^2}{k}$. Find the least positive value of $n$ such that $$43^{43}\mid f\left(\frac{43^{n}-1}{42}\right)$$ [i]Proposed by Adam Bertelli[/i]

What is the difference between the median and the mean of the following data set: $12,41, 44, 48, 47, 53, 60, 62, 56, 32, 23, 25, 31$?

Find all real $x,y$ such that \[x^2 + 2y^2 + \frac{1}{2} \le x(2y+1) \]

1. In a triangle $ABC$, $O$ is the circumcenter and $I$ is the incenter. $X$ is the reflection of $I$ to $O$. $A_1$ is foot of the perpendicular from $X$ to $BC$. $B_1$ and $C_1$ are defined similarly. prove that $AA_1$,$BB_1$ and $CC_1$ are concurrent.(12 points)

Peter is chasing after Rob. Rob is running on the line $y=2x+5$ at a speed of $2$ units a second, starting at the point $(0,5)$. Peter starts running $t$ seconds after Rob, running at $3$ units a second. Peter also starts at $(0,5)$ and catches up to Rob at the point $(17,39)$. What is the value of t?

Let $a, b, c$ be positive numbers such that $a^2+b^2+c^2+abc = 4$. Prove that $$\frac{a + b}{c} +\frac{b + c}{a} +\frac{c + a}{b} \ge a + b + c + \frac{1}{a} + \frac{1}{b} +\frac{1}{c}$$

5. Let $a,b,c,d,e$ be positive rational numbers. Consider integral expressions $f(x)=ax^2+bx+c$ $g(x)=dx+e$ Put $\frac{f(n)}{g(n)}$ an integer for all positive integers $n$. Then, show that $f(x)$ is dividible by $g(x)$.

Find all positive integer $n$ such that for all $i=1,2,\cdots,n$, $\frac{n!}{i!(n-i+1)!}$ is an integer. [i]Proposed by ckliao914[/i]

Let $P(x)$ and $Q(x)$ be (monic) polynomials with real coefficients (the first coefficient being equal to $1$), and $\deg P(x)=\deg Q(x)=10$. Prove that if the equation $P(x)=Q(x)$ has no real solutions, then $ P(x+1)=Q(x-1) $ has a real solution.

Students have taken a test paper in each of $n \ge 3$ subjects. It is known that in any subject exactly three students got the best score, and for any two subjects exactly one student got the best scores in both subjects. Find the smallest $n$ for which the above conditions imply that exactly one student got the best score in each of the $n$ subjects.

If $x$ is a positive real number, and $n$ is a positive integer, prove that \[[ nx] > \frac{[ x]}1 + \frac{[ 2x]}2 +\frac{[ 3x]}3 + \cdots + \frac{[ nx]}n,\] where $[t]$ denotes the greatest integer less than or equal to $t$. For example, $[ \pi] = 3$ and $\left[\sqrt2\right] = 1$.

A hundred tourists arrive to a hotel at night. They know that in the hotel there are single rooms numbered as $1, 2, \ldots , n$, and among them $k{}$ (the tourists do not know which) are under repair, the other rooms are free. The tourists, one after another, check the rooms in any order (maybe different for different tourists), and the first room not under repair is taken by the tourist. The tourists don’t know whether a room is occupied until they check it. However it is forbidden to check an occupied room, and the tourists may coordinate their strategy beforehand to avoid this situation. For each $k{}$ find the smallest $n{}$ for which the tourists may select their rooms for sure. [i]Fyodor Ivlev[/i]

Let $P_0$, $P_1$, $P_2$ be three points on the circumference of a circle with radius $1$, where $P_1P_2 = t < 2$. For each $i \ge 3$, define $P_i$ to be the centre of the circumcircle of $\triangle P_{i-1} P_{i-2} P_{i-3}$. (1) Prove that the points $P_1, P_5, P_9, P_{13},\cdots$ are collinear. (2) Let $x$ be the distance from $P_1$ to $P_{1001}$, and let $y$ be the distance from $P_{1001}$ to $P_{2001}$. Determine all values of $t$ for which $\sqrt[500]{ \frac xy}$ is an integer.

Let $a,b,$ and $c$ be pairwise distinct complex numbers such that $$a^2=b+6, \quad b^2=c+6, \quad \text{and} \quad c^2=a+6.$$ Compute the two possible values of $a+b+c.$

A frog starts a journey at $(6,9).$ A skip is the act of traveling a positive integer number of units straight south or a positive integer number of units straight west. A jump is the act of traveling one unit straight west. A hop consists of any skip followed by a jump. How many different sequences of hops can the frog take so that the frog's final destination is $(0,0)$? [i]Proposed by Jack Ma[/i]