Let $ABCD$ be a square, $E$ and $F$ midpoints of $AB$ and $AD$ respectively, and $P$ the intersection of $CF$ and $DE$. a) Show that $DE \perp CF$. b) Determine the ratio $CF : PC : EP$

For an integer $m\geq 1$, we consider partitions of a $2^m\times 2^m$ chessboard into rectangles consisting of cells of chessboard, in which each of the $2^m$ cells along one diagonal forms a separate rectangle of side length $1$. Determine the smallest possible sum of rectangle perimeters in such a partition. [i]Proposed by Gerhard Woeginger, Netherlands[/i]

Let $S = \{1,2,3,4,5\}$. Find the number of functions $f : S \to S$ such that $f ^{50}(x)= x$ for all $x \in S$.

The polynomial $ f(x) \equal{} x^{4} \plus{} ax^{3} \plus{} bx^{2} \plus{} cx \plus{} d$ has real coefficients, and $ f(2i) \equal{} f(2 \plus{} i) \equal{} 0.$ What is $ a \plus{} b \plus{} c \plus{} d?$ $ \textbf{(A)}\ 0 \qquad \textbf{(B)}\ 1 \qquad \textbf{(C)}\ 4 \qquad \textbf{(D)}\ 9 \qquad \textbf{(E)}\ 16$

Let ABC be a triangle, G its centroid, M the midpoint of AB, D the point on the line $AG$ such that $AG = GD, A \neq D$, E the point on the line $BG$ such that $BG = GE, B \neq E$. Show that the quadrilateral BDCM is cyclic if and only if $AD = BE$.

As the Kubiks head homeward, away from the beach in the family van, Jerry decides to take a different route away from the beach than the one they took to get there. The route involves lots of twists and turns, prompting Hannah to wonder aloud if Jerry's "shortcut" will save any time at all. Michael offers up a problem as an analogy to his father's meandering: "Suppose dad drives around, making right-angled turns after $\textit{every}$ mile. What is the farthest he could get us from our starting point after driving us $500$ miles assuming that he makes exactly $300$ right turns?" "Sounds almost like an energy efficiency problem," notes Hannah only half jokingly. Hannah is always encouraging her children to think along these lines. Let $d$ be the answer to Michael's problem. Compute $\lfloor d\rfloor$.

We define the sets $A_1,A_2,...,A_{160}$ such that $\left|A_{i} \right|=i$ for all $i=1,2,...,160$. With the elements of these sets we create new sets $M_1,M_2,...M_n$ by the following procedure: in the first step we choose some of the sets $A_1,A_2,...,A_{160}$ and we remove from each of them the same number of elements. These elements that we removed are the elements of $M_1$. In the second step we repeat the same procedure in the sets that came of the implementation of the first step and so we define $M_2$. We continue similarly until there are no more elements in $A_1,A_2,...,A_{160}$, thus defining the sets $M_1,M_2,...,M_n$. Find the minimum value of $n$.

$6$ musicians gathered at a chamber music festival. At each scheduled concert, some of the musicians played while the others listened as members of the audience. What is the least number of such concerts which would need to be scheduled so that every $2$ musicians each must play for the other in some concert?

If for numbers $a$, $b$ and $c$ holds $a : b=4:3$ and $b : c=2:5$, find the value $$(3a-2b):(b+2c)$$

Determine all polynomials $P$ with integer coefficients satisfying \[P(P(P(P(P(x)))))=x^{28}\cdot P(P(x))\qquad \forall x\in\mathbb{R}\]

Let $ABC$ be an acute triangle with $\displaystyle{AB<AC<BC}$ inscribed in circle $ \displaystyle{c(O,R)}$.The excircle $\displaystyle{(c_A)}$ has center $\displaystyle{I}$ and touches the sides $\displaystyle{BC,AC,AB}$ of the triangle $ABC$ at $\displaystyle{D,E,Z} $ respectively.$ \displaystyle{AI}$ cuts $\displaystyle{(c)}$ at point $M$ and the circumcircle $\displaystyle{(c_1)}$ of triangle $\displaystyle{AZE}$ cuts $\displaystyle{(c)}$ at $K$.The circumcircle $\displaystyle{(c_2)}$ of the triangle $\displaystyle{OKM}$ cuts $\displaystyle{(c_1)} $ at point $N$.Prove that the point of intersection of the lines $AN,KI$ lies on $ \displaystyle{(c)}$.

We can change a natural number $n$ in three ways: a) If the number $n$ has at least two digits, we erase the last digit and we subtract that digit from the remaining number (for example, from $123$ we get $12 - 3 = 9$); b) If the last digit is different from $0$, we can change the order of the digits in the opposite one (for example, from $123$ we get $321$); c) We can multiply the number $n$ by a number from the set $ \{1, 2, 3,..., 2010\}$. Can we get the number $21062011$ from the number $1012011$?

Kevin likes drawing. He takes a large piece of paper and draws on it every rectangle with positive integer side lengths and perimeter at most 2017, with no two rectangles overlapping. Compute the total area of the paper that is covered by a rectangle.

Let $n$ be the number of isosceles triangles whose vertices are also the vertices of a regular 2019-gon. Then the remainder when $n$ is divided by 100 [list=1] [*] 15 [*] 25 [*] 35 [*] 65 [/list]

A solid figure consisting of unit cubes is shown in the picture. Is it possible to exactly fill a cube with these figures if the side length of the cube is a) 15; b) 30?

Let $n$ be an integer greater than 2. A positive integer is said to be [i]attainable [/i]if it is 1 or can be obtained from 1 by a sequence of operations with the following properties: 1.) The first operation is either addition or multiplication. 2.) Thereafter, additions and multiplications are used alternately. 3.) In each addition, one can choose independently whether to add 2 or $n$ 4.) In each multiplication, one can choose independently whether to multiply by 2 or by $n$. A positive integer which cannot be so obtained is said to be [i]unattainable[/i]. [b]a.)[/b] Prove that if $n\geq 9$, there are infinitely many unattainable positive integers. [b]b.)[/b] Prove that if $n=3$, all positive integers except 7 are attainable.

Set $u_0 = \frac{1}{4},$ and for $k \geq 0$ let $u_{k+1}$ be determined by the recurrence $u_{k+1} = 2u_k - 2u_k^2.$ This sequence tends to a limit, call it $L.$ What is the least value of $k$ such that $$|u_k - L| \leq \frac{1}{2^{1000}}?$$ $\textbf{(A)}\ 10 \qquad\textbf{(B)}\ 97 \qquad\textbf{(C)}\ 253 \qquad\textbf{(D)}\ 329 \qquad\textbf{(E)}\ 401$

Show that for all positive integers $n$, \[\lfloor \sqrt{n}+\sqrt{n+1}\rfloor =\lfloor \sqrt{4n+1}\rfloor =\lfloor \sqrt{4n+2}\rfloor =\lfloor \sqrt{4n+3}\rfloor.\]

For every edge of a tetrahedron, we consider a plane through its midpoint that is perpendicular to the opposite edge. Prove that these six planes intersect in a point symmetric to the circumcenter of the tetrahedron with respect to its centroid.

The equations of $L_1$ and $L_2$ are $y=mx$ and $y=nx$, respectively. Suppose $L_1$ makes twice as large of an angle with the horizontal (measured counterclockwise from the positive x-axis ) as does $L_2$, and that $L_1$ has 4 times the slope of $L_2$. If $L_1$ is not horizontal, then $mn$ is $\text{(A)} \ \frac{\sqrt{2}}{2} \qquad \text{(B)} \ -\frac{\sqrt{2}}{2} \qquad \text{(C)} \ 2 \qquad \text{(D)} \ -2 \qquad \text{(E)} \ \text{not uniquely determined}$

Let $A$ be a vertex of a cube $\omega$ circumscribed about a sphere $k$ of radius $1$. We consider lines $g$ through $A$ containing at least one point of $k$. Let $P$ be the intersection point of $g$ and $k$ closer to $A$, and $Q$ be the second intersection point of $g$ and $\omega$. Determine the maximum value of $AP\cdot AQ$ and characterize the lines $g$ yielding the maximum.

One side of the rectangle is $1$ cm. It is known that the rectangle can be divided by two orthogonal lines onto four rectangles, and each of the smaller rectangles has the area not less than $1$ square centimetre, and one of them is not less than $2$ square centimetres. What is the least possible length of another side of big rectangle?

Find the number of strictly increasing sequences of nonnegative integers with the first term $0$ and the last term $15$, and among any two consecutive terms, exactly one of them is even. Lê Anh Vinh

Do there exist points $A, B, C, D$ in space, such that $AB = CD = 8, AC = BD = 10$, and $AD = BC = 13$?

Find all positive integers $abcd=a^{a+b+c+d} - a^{-a+b-c+d} + a$, where $abcd$ is a four-digit number