A V-tromino is a diagram formed by three unit squares.(As attachment.) (a)Is it possible to cover a $3\times 2013$ table by $3\times 671$ V-trominoes? (b)Is it possible to cover a $5\times 2013$ table by $5\times 671$ V-trominoes?

Consider the sequence of polynomials $P_0(x) = 2$, $P_1(x) = x$ and $P_n(x) = xP_{n-1}(x) - P_{n-2}(x)$ for $n \geq 2$. Let $x_n$ be the greatest zero of $P_n$ in the the interval $|x| \leq 2$. Show that $$\lim \limits_{n \to \infty}n^2\left(4-2\pi +n^2\int \limits_{x_n}^2P_n(x)dx\right)=2\pi - 4-\frac{\pi^3}{12}$$

Let $ABC$ be a cute triangle.$(O)$ is circumcircle of $\triangle ABC$.$D$ is on arc $BC$ not containing $A$.Line $\triangle$ moved through $H$($H$ is orthocenter of $\triangle ABC$ cuts circumcircle of $\triangle ABH$,circumcircle $\triangle ACH$ again at $M,N$ respectively. a.Find $\triangle$ satisfy $S_{AMN}$ max b.$d_{1},d_{2}$ are the line through $M$ perpendicular to $DB$,the line through $N$ perpendicular to $DC$ respectively. $d_{1}$ cuts $d_{2}$ at $P$.Prove that $P$ move on a fixed circle.

Determine all nonzero integers $a$ for which there exists two functions $f,g:\mathbb Q\to\mathbb Q$ such that \[f(x+g(y))=g(x)+f(y)+ay\text{ for all } x,y\in\mathbb Q.\] Also, determine all pairs of functions with this property. [i]Vasile Pop[/i]

Determine the number of quadratic polynomials $P(x) = p_1x^2 + p_2x - p_3$, where $p_1$, $p_2$, $p_3$ are not necessarily distinct (positive) prime numbers less than $50$, whose roots are distinct rational numbers.

find all functions $f:\mathbb{Z} \to \mathbb{Z} $ such that $f(m+n)+f(m)f(n)=n^2(f(m)+1)+m^2(f(n)+1)+mn(2-mn)$ holds for all $m,n \in \mathbb{Z}$

Forty-two cubes with 1 cm edges are glued together to form a solid rectangular block. If the perimeter of the base of the block is 18 cm, then the height, in cm, is $\textbf{(A)}\ 1 \qquad \textbf{(B)}\ 2 \qquad \textbf{(C)}\ \dfrac{7}{3} \qquad \textbf{(D)}\ 3 \qquad \textbf{(E)}\ 4$

Define the function $f_k(x)$ (where $k$ is a positive integer) as follows: \[f_k(x)=(\cos kx)(\cos x)^k+(\sin kx)(\sin x)^k-(\cos 2x)^k.\] Find the sum of all distinct value(s) of $k$ such that $f_k(x)$ is a constant function.

Let all distances between the vertices of a convex $n$-gon ($n > 3$) be different. a) A vertex is called uninteresting if the closest vertex is adjacent to it. What is the minimal possible number of uninteresting vertices (for a given $n$)? b) A vertex is called unusual if the farthest vertex is adjacent to it. What is the maximal possible number of unusual vertices (for a given $n$)? [i](Proposed by B.Frenkin)[/i]

Given are $n$ different concentric circles on the plane.Inside the disk with the smallest radius (strictly inside it),we consider two distinct points $A,B$.We consider $k$ distinct lines passing through $A$ and $m$ distinct lines passing through $B$.There is no line passing through both $A$ and $B$ and all the lines passing through $k$ intersect with all the lines passing through $B$.The intersections do not lie on some of the circles.Determine the maximum and the minimum number of regions formed by the lines and the circles and are inside the circles.

Let $A$ be a finite subset of prime numbers and $a> 1$ be a positive integer. Show that the number of positive integers $m$ for which all prime divisors of $a^m-1$ are in $A$ is finite.

For $ 0\leq x <\frac{\pi}{2}$, prove the following inequality. $ x\plus{}\ln (\cos x)\plus{}\int_0^1 \frac{t}{1\plus{}t^2}\ dt\leq \frac{\pi}{4}$

Prove that for any convex pentagon $A_1A_2A_3A_4A_5$, there exists a unique pair of points $\{P,Q\}$ (possibly with $P=Q$) such that $\measuredangle{PA_i A_{i-1}} = \measuredangle{A_{i+1}A_iQ}$ for $1\le i\le 5$, where indices are taken $\pmod5$ and angles are directed $\pmod\pi$. [i]Calvin Deng.[/i]

Let $a_1,a_2,\ldots,a_n$ be non-negative real numbers. Define $M$ to be the sum of all products of pairs $a_ia_j$ $(i<j)$, $\textit{i.e.}$, \[ M = a_1(a_2+a_3+\cdots+a_n)+a_2(a_3+a_4+\cdots+a_n)+\cdots+a_{n-1}a_n. \] Prove that the square of at least one of the numbers $a_1,a_2,\ldots,a_n$ does not exceed $2M/n(n-1)$.

In a non-obtuse triangle $ABC$, prove that \[ \frac{\sin A \sin B}{\sin C} + \frac{\sin B \sin C}{\sin A} + \frac{\sin C \sin A}{ \sin B} \ge \frac 52. \][i]Proposed by Ryan Alweiss[/i]

Let $n \ge 2$ and $k \ge1$ be positive integers. In a country there are $n$ cities and between each pair of cities there is a bus connection in both directions. Let $A$ and $B$ be two different cities. Prove that the number of ways in which you can travel from $A$ to $B$ by using exactly $k$ buses is equal to $\frac{(n - 1)^k - (-1)^k}{n}$ .

Find all real pairs $(x,y)$ that solve the system of equations \begin{align} x^5 &= 21x^3+y^3 \\ y^5 &= x^3+21y^3. \end{align}

Let $S$ be the set of all polynomials of the form $z^3+az^2+bz+c$, where $a$, $b$, and $c$ are integers. Find the number of polynomials in $S$ such that each of its roots $z$ satisfies either $\left\lvert z \right\rvert = 20$ or $\left\lvert z \right\rvert = 13$.

Given three automates that deal with the cards with the pairs of natural numbers. The first, having got the card with ($a,b)$, produces new card with $(a+1,b+1)$, the second, having got the card with $(a,b)$, produces new card with $(a/2,b/2)$, if both $a$ and $b$ are even and nothing in the opposite case; the third, having got the pair of cards with $(a,b)$ and $(b,c)$ produces new card with $(a,c)$. All the automates return the initial cards also. Suppose there was $(5,19)$ card initially. Is it possible to obtain a) $(1,50)$? b) $(1,100)$? c) Suppose there was $(a,b)$ card initially $(a<b)$. We want to obtain $(1,n)$ card. For what $n$ is it possible?

Does there exist a hexagon (not necessarily convex) with side lengths $1, 2, 3, 4, 5, 6$ (not necessarily in this order) that can be tiled with a) $31$ b) $32$ equilateral triangles with side length $1?$

Pasha and Vova play the game crossing out the cells of the $3\times 101$ board by turns. At the start, the central cell is crossed out. By one move the player chooses the diagonal (there can be $1, 2$ or $3$ cells in the diagonal) and crosses out cells of this diagonal which are still uncrossed. At least one new cell must be crossed out by any player's move. Pasha begins, the one who can not make any move loses. Who has a winning strategy?

The coordinate of $ P$ at time $ t$, moving on a plane, is expressed by $ x = f(t) = \cos 2t + t\sin 2t,\ y = g(t) = \sin 2t - t\cos 2t$. (1) Find the acceleration vector $ \overrightarrow{\alpha}$ of $ P$ at time $ t$ . (2) Let $ L$ denote the line passing through the point $ P$ for the time $ t%Error. "neqo" is a bad command. $, which is parallel to the acceleration vector $ \overrightarrow{\alpha}$ at the time. Prove that $ L$ always touches to the unit circle with center the origin, then find the point of tangency $ Q$. (3) Prove that $ f(t)$ decreases in the interval $ 0\leq t \leqq \frac {\pi}{2}$. (4) When $ t$ varies in the range $ \frac {\pi}{4}\leq t\leq \frac {\pi}{2}$, find the area $ S$ of the figure formed by moving the line segment $ PQ$.

Benedek scripted a program which calculated the following sum: $1^1+2^2+3^3+. . .+2021^{2021}$. What is the remainder when the sum is divided by $35$?

Is it possible to arrange 1400 positive integer ( not necessarily distinct ) ,at least one of them being 2021 , around a circle such that any number on this circle equals to the sum of gcd of the two previous numbers and two next numbers? for example , if $a,b,c,d,e$ are five consecutive numbers on this circle , $c=\gcd(a,b)+\gcd(d,e)$

Let $m$ and $n$ be positive integers such that $m>n$. Define $x_k=\frac{m+k}{n+k}$ for $k=1,2,\ldots,n+1$. Prove that if all the numbers $x_1,x_2,\ldots,x_{n+1}$ are integers, then $x_1x_2\ldots x_{n+1}-1$ is divisible by an odd prime.