In the rectangle $ABCD, M, N, P$ and $Q$ are the midpoints of the sides. If the area of the shaded triangle is $1$, calculate the area of the rectangle $ABCD$. [img]https://2.bp.blogspot.com/-9iyKT7WP5fc/XNYuXirLXSI/AAAAAAAAKK4/10nQuSAYypoFBWGS0cZ5j4vn_hkYr8rcwCK4BGAYYCw/s400/may3.gif[/img]

For a non-empty finite set $A$ of positive integers, let $\text{lcm}(A)$ denote the least common multiple of elements in $A$, and let $d(A)$ denote the number of prime factors of $\text{lcm}(A)$ (counting multiplicity). Given a finite set $S$ of positive integers, and $$f_S(x)=\sum_{\emptyset \neq A \subset S} \frac{(-1)^{|A|} x^{d(A)}}{\text{lcm}(A)}.$$ Prove that, if $0 \le x \le 2$, then $-1 \le f_S(x) \le 0$.

$S$ ist the set of all cubic polynomials $f$ with $|f(\pm 1)| \leq 1$ and $|f(\pm \frac{1}{2})| \leq 1$. Find $\sup_{f \in S} \max_{-1 \leq x \leq 1} |f''(x)|$ and all members of $f$ which give equality.

Let $m$ be the product of the first 100 primes, and let $S$ denote the set of divisors of $m$ greater than 1 (hence $S$ has exactly $2^{100} - 1$ elements). We wish to color each element of $S$ with one of $k$ colors such that $\ \bullet \ $ every color is used at least once; and $\ \bullet \ $ any three elements of $S$ whose product is a perfect square have exactly two different colors used among them. Find, with proof, all values of $k$ for which this coloring is possible.

For every positive integer $n$ let $$f(n) = \frac{n^4+n^3+n^2-n+1}{n^6-1}$$ Given $$\sum_{n = 2}^{20} f(n) = \frac{a}{b}$$ for relatively prime positive integers $a$ and $b$, find the sum of the prime factors of $b$. [i]Proposed by Harry Kim[/i]

Let $n, k \ge 1$ be natural numbers. Find the number $A(n, k)$ of solutions in integers of the equation \[|x_1| + |x_2| +\cdots + |x_k| = n\]

For how many of the following types of quadrilaterals does there exist a point in the plane of the quadrilateral that is equidistant from all four vertices of the quadrilateral? [list] [*] a square [*]a rectangle that is not a square [*] a rhombus that is not a square [*] a parallelogram that is not a rectangle or a rhombus [*] an isosceles trapezoid that is not a parallelogram [/list] $\textbf{(A) } 1 \qquad\textbf{(B) } 2 \qquad\textbf{(C) } 3 \qquad\textbf{(D) } 4 \qquad\textbf{(E) } 5$

Let $ a, b, c$ be positive integers satisfying the conditions $ b > 2a$ and $ c > 2b.$ Show that there exists a real number $ \lambda$ with the property that all the three numbers $ \lambda a, \lambda b, \lambda c$ have their fractional parts lying in the interval $ \left(\frac {1}{3}, \frac {2}{3} \right].$

The numbers $1,2,3,\ldots ,n$ are written in a row. Two players, Maris and Filips, take turns making moves with Maris starting. A move consists of crossing out a number from the row which has not yet been crossed out. The game ends when there are exactly two uncrossed numbers left in the row. If the two remaining uncrossed numbers are coprime, Maris wins, otherwise Filips is the winner. For each positive integer $n\ge 4$ determine which player can guarantee a win.

Each unit square of a $4 \times 4$ square grid is colored either red, green, or blue. Over all possible colorings of the grid, what is the maximum possible number of L-trominos that contain exactly one square of each color? (L-trominos are made up of three unit squares sharing a corner, as shown below.) [asy] draw((0,0) -- (2,0) -- (2,1) -- (0,1)); draw((0,0) -- (0,2) -- (1,2) -- (1,0)); draw((4,1) -- (6,1) -- (6,2) -- (4,2)); draw((4,2) -- (4,0) -- (5,0) -- (5,2)); draw((10,0) -- (8,0) -- (8,1) -- (10,1)); draw((9,0) -- (9,2) -- (10,2) -- (10,0)); draw((14,1) -- (12,1) -- (12,2) -- (14,2)); draw((13,2) -- (13,0) -- (14,0) -- (14,2)); [/asy] [i]Proposed by Andrew Lin.[/i]

Find all positive integers $n$ such that all prime factors of $2^n-1$ are less than or equal to $7$.

Let $g(x)$ be a polynomial with leading coefficient $1,$ whose three roots are the reciprocals of the three roots of $f(x)=x^3+ax^2+bx+c,$ where $1<a<b<c.$ What is $g(1)$ in terms of $a,b,$ and $c?$ $\textbf{(A) }\frac{1+a+b+c}c \qquad \textbf{(B) }1+a+b+c \qquad \textbf{(C) }\frac{1+a+b+c}{c^2}\qquad \textbf{(D) }\frac{a+b+c}{c^2} \qquad \textbf{(E) }\frac{1+a+b+c}{a+b+c}$

Find the number of ordered pairs of positive integers for which $$\frac1a+\frac1b=\frac4{2019}$$

Find the equation of cylinder that passes three straight lines $L_1= \begin{cases} x=0\\ y-z=2 \end{cases}, L_2= \begin{cases} x=0\\ x+y-z+2=0 \end{cases}, L_3= \begin{cases} x=\sqrt{2}\\ y-z=0 \end{cases}$.

Let $(a_n)_{n=1}^{\infty}$ be a strictly increasing sequence such that inequality $$a_n(a_n-2a_{n-1})+a_{n-1}(a_{n-1}-2a_{n-2})\geq 0$$ holds for all $n \geq 3$. Prove that for all $n\geq2$ the inequality $$a_n \geq a_{n-1}+a_{n-2}+\dots+a_1$$ holds as well.

How many whole numbers between $ 100$ and $ 400$ contain the digit $ 2$? \[ \textbf{(A)}\ 100 \qquad \textbf{(B)}\ 120 \qquad \textbf{(C)}\ 138 \qquad \textbf{(D)}\ 140 \qquad \textbf{(E)}\ 148 \]

Let $A_1A_2\dotsm A_{2025}$ be a convex 2025-gon, and let $A_i = A_{i+2025}$ for all integers $i$. Distinct points $P$ and $Q$ lie in its interior such that $\angle A_{i-1}A_iP = \angle QA_iA_{i+1}$ for all $i$. Define points $P^{j}_{i}$ and $Q^{j}_{i}$ for integers $i$ and positive integers $j$ as follows: [list] [*] For all $i$, $P^1_i = Q^1_i = A_i$. [*] For all $i$ and $j$, $P^{j+1}_{i}$ and $Q^{j+1}_i$ are the circumcenters of $PP^j_iP^j_{i+1}$ and $QQ^j_iQ^{j}_{i+1}$, respectively. [/list] Let $\mathcal{P}$ and $\mathcal{Q}$ be the polygons $P^{2025}_{1}P^{2025}_{2}\dotsm P^{2025}_{2025}$ and $Q^{2025}_{1}Q^{2025}_{2}\dotsm Q^{2025}_{2025}$, respectively. [list=a] [*] Prove that $\mathcal{P}$ and $\mathcal{Q}$ are cyclic. [*] Let $O_P$ and $O_Q$ be the circumcenters of $\mathcal{P}$ and $\mathcal{Q}$, respectively. Assuming that $O_P\neq O_Q$, show that $O_PO_Q$ is parallel to $PQ$. [/list] [i]Ruben Carpenter[/i]

Consider all arithmetical sequences of real numbers $(x_i)^{\infty}=1$ and $(y_i)^{\infty} =1$ with the common first term, such that for some $k > 1, x_{k-1}y_{k-1} = 42, x_ky_k = 30$, and $x_{k+1}y_{k+1} = 16$. Find all such pairs of sequences with the maximum possible $k$.

Let $ABC$ an acute triangle and $D,E$ and $F$ be the feet of altitudes from $A,B$ and $C$, respectively. The line $EF$ and the circumcircle of $ABC$ intersect at $P$, such that $F$ it´s between $E$ and $P$. Lines $BP$ and $DF$ intersect at $Q$. Prove that if $ED=EP$, then $CQ$ and $DP$ are parallel.

For each positive integer $m$, we define $L_m$ as the figure that is obtained by overlapping two $1 \times m$ and $m \times 1$ rectangles in such a way that they coincide at the $1 \times 1$ square at their ends, as shown in the figure. [asy] pair h = (1, 0), v = (0, 1), o = (0, 0); for(int i = 1; i < 5; ++i) { o = (i*i/2 + i, 0); draw(o -- o + i*v -- o + i*v + h -- o + h + v -- o + i*h + v -- o + i*h -- cycle); string s = "$L_" + (string)(i) + "$"; label(s, o + ((i / 2), -1)); for(int j = 1; j < i; ++j) { draw(o + j*v -- o + j*v + h); draw(o + j*h -- o + j*h + v); } } label("...", (18, 0.5)); [/asy] Using some figures $L_{m_1}, L_{m_2}, \dots, L_{m_k}$, we cover an $n \times n$ board completely, in such a way that the edges of the figure coincide with lines in the board. Among all possible coverings of the board, find the minimal possible value of $m_1 + m_2 + \dots + m_k$. Note: In covering the board, the figures may be rotated or reflected, and they may overlap or not be completely contained within the board.

If $\alpha$ and $\beta$ are the roots of the equation $3x^2+x-1=0$, where $\alpha>\beta$, find the value of $\frac{\alpha}{\beta}+\frac{\beta}{\alpha}$. $ \textbf{(A) }\frac{7}{9}\qquad\textbf{(B) }-\frac{7}{9}\qquad\textbf{(C) }\frac{7}{3}\qquad\textbf{(D) }-\frac{7}{3}\qquad\textbf{(E) }-\frac{1}{9} $

Let $ n$ be positive integer, $ A,B\subseteq[0,n]$ are sets of integers satisfying $ \mid A\mid \plus{} \mid B\mid\ge n \plus{} 2.$ Prove that there exist $ a\in A, b\in B$ such that $ a \plus{} b$ is a power of $ 2.$

Three boxes each contain four bags. Each bag contains five marbles. How many marbles are there altogether in the three boxes?

Let $O$ be the circumcenter and $R$ be the circumradius of an acute triangle $ABC$. Let $AO$ meet the circumcircle of $OBC$ again at $D$, $BO$ meet the circumcircle of $OCA$ again at $E$, and $CO$ meet the circumcircle of $OAB$ again at $F$. Show that $OD.OE.OF\geq 8R^{3}$.

In the class, every talker is friends with at least one silent person. At this chatterbox is silent if there is an odd number of his friends in the office —silent. Prove that the teacher can invite you to an elective class without less than half the class so that all talkers are silent. [hide=original wording]В классе каждый болтун дружит хотя бы с одним молчуном. При этом болтун молчит, если в кабинете находится нечетное число его друзей - молчунов. Докажите, что учительмо жет пригласитьна факультатив не менее половины класса так, чтобы все болтуны молчали[/hide]