We want to cover totally a square(side is equal to $k$ integer and $k>1$) with this rectangles: $1$ rectangle ($1\times 1$), $2$ rectangles ($2\times 1$), $4$ rectangles ($3\times 1$),...., $2^n$ rectangles ($n + 1 \times 1$), such that the rectangles can't overlap and don't exceed the limits of square. Find all $k$, such that this is possible and for each $k$ found you have to draw a solution

Let $ABCD$ be a circumscribed quadrilateral and let $P$ be the orthogonal projection of its in center on $AC$. Prove that $\angle {APB}=\angle {APD}$

Let $ D$ be a convex subset of the $ n$-dimensional space, and suppose that $ D'$ is obtained from $ D$ by applying a positive central dilatation and then a translation. Suppose also that the sum of the volumes of $ D$ and $ D'$ is $ 1$, and $ D \cap D'\not\equal{} \emptyset .$ Determine the supremum of the volume of the convex hull of $ D \cup D'$ taken for all such pairs of sets $ D,D'$. [i]L. Fejes-Toth, E. Makai[/i]

A polynomial $P(x)$ of degree $n \ge 5$ with integer coefficients has $n$ distinct integer roots, one of which is $0$. Find all integer roots of the polynomial $P(P(x))$.

Determine all the possible non-negative integer values that are able to satisfy the expression: $\frac{(m^2+mn+n^2)}{(mn-1)}$ if $m$ and $n$ are non-negative integers such that $mn \neq 1$.

Show that there is no function \(f:\mathbb{N}^* \rightarrow \mathbb{N}^*\) such that \(f^n(n)=n+1\) for all \(n\) (when \(f^n\) is the \(n\)th iteration of \(f\))

Let $m,n$ be integers so that $m \ge n > 1$. Let $F_1,...,F_k$ be a collection of $n$-element subsets of $\{1,...,m\}$ so that $F_i\cap F_j$ contains at most $1$ element, $1 \le i < j \le k$. Show that $k\le \frac{m(m-1)}{n(n-1)} $

Let $x_{n + 1} = 4x_n - x_{n - 1}$, $x_0 = 0$, $x_1 = 1$, and $y_{n + 1} = 4y_n - y_{n - 1}$, $y_0 = 1$, $y_1 = 2$. Show that for all $n \ge 0$ that $y_n^2 = 3x_n^2 + 1$.

The circle $\Gamma$ through $A$ of triangle $ABC$ meets sides $AB,AC$ at $E$,$F$ respectively, and circumcircle of $ABC$ at $P$. Prove: Reflection of $P$ across $EF$ is on $BC$ if and only if $\Gamma$ passes through $O$ (the circumcentre of $ABC$).

Let $h_k$ be an apothem of the regular $k$-gon inscribed into a circle with radius $R$. Prove that $$(n + 1)h_{n+1} - nh_n > R$$

A broken line $A_1A_2 \ldots A_n$ is drawn in a $50 \times 50$ square, so that the distance from any point of the square to the broken line is less than $1$. Prove that its total length is greater than $1248.$

Below is a diagram showing a $6 \times 8$ rectangle divided into four $6 \times 2$ rectangles and one diagonal line. Find the total perimeter of the four shaded trapezoids.

Suppose that \[ \prod_{n=1}^{\infty}\left(\frac{1+i\cot\left(\frac{n\pi}{2n+1}\right)}{1-i\cot\left(\frac{n\pi}{2n+1}\right)}\right)^{\frac{1}{n}} = \left(\frac{p}{q}\right)^{i \pi}, \] where $p$ and $q$ are relatively prime positive integers. Find $p+q$. [i]Note: for a complex number $z = re^{i \theta}$ for reals $r > 0, 0 \le \theta < 2\pi$, we define $z^{n} = r^{n} e^{i \theta n}$ for all positive reals $n$.[/i]

The velocities of a submerged and surfaced submarine are, respectively, $v$ and $kv$. It is situated at a point $P$ at $30$ miles from the center $O$ of a circle of $60$ mile radius. The surveillance of an enemy squadron forces him to navigate submerged while inside the circle. Discuss, according to the values of $k$, the fastest path to move to the opposite end of the diameter that passes through $P$ . (Consider the case particular $k =\sqrt5$.)

(A.Zaslavsky) Given three points $ C_0$, $ C_1$, $ C_2$ on the line $ l$. Find the locus of incenters of triangles $ ABC$ such that points $ A$, $ B$ lie on $ l$ and the feet of the median, the bisector and the altitude from $ C$ coincide with $ C_0$, $ C_1$, $ C_2$.

A crate with a base of $4 \times 2$ and a height of $2$ is open at the top. Tomas wants to completely fill the crate with some of his cubes. It has $16$ equal cubes of volume $1$ and two equal cubes of volume $8$. A cube of volume $1$ can only be placed on the top layer if the cube on the bottom layer has already been placed. In how many ways can Tom'as fill the box with cubes, placing them one by one?

Let $k$ be a fixed even positive integer, $N$ is the product of $k$ distinct primes $p_1,...,p_k$, $a,b$ are two positive integers, $a,b\leq N$. Denote $S_1=\{d|$ $d|N, a\leq d\leq b, d$ has even number of prime factors$\}$, $S_2=\{d|$ $d|N, a\leq d\leq b, d$ has odd number of prime factors$\}$, Prove: $|S_1|-|S_2|\leq C^{\frac{k}{2}}_k$

There are two non-decreasing sequences $\{a_i\}$ and $\{b_i\}$ of $n$ real numbers each, such that $a_i\le a_{i+1}$ for each $1\le i\le n-1$, and $b_i\le b_{i+1}$ for each $1\le i\le n-1$, and $\sum_{k=1}^{m}{a_k}\ge \sum_{k=1}^{m}{b_k}$ where $m\le n$ with equality for $m=n$. For a convex function $f$ defined on the real numbers, prove that $\sum_{k=1}^{n}{f(a_k)}\le \sum_{k=1}^{n}{f(b_k)}$.

Determine all integers $m$ for which the $m \times m$ square can be dissected into five rectangles, the side lengths of which are the integers $1,2,3,\ldots,10$ in some order.

Let $S$ be a set of 1980 points in the plane such that the distance between every pair of them is at least 1. Prove that $S$ has a subset of 220 points such that the distance between every pair of them is at least $\sqrt{3}.$

Let n be a positve integer. prove there exists a positive integer n st $n^{2013}-n^{20}+n^{13}-2013$ has at least N distinct prime factors.

Bessie and her $2015$ bovine buddies work at the Organic Milk Organization, for a total of $2016$ workers. They have a hierarchy of bosses, where obviously no cow is its own boss. In other words, for some pairs of employees $(A, B)$, $B$ is the boss of $A$. This relationship satisfies an obvious condition: if $B$ is the boss of $A$ and $C$ is the boss of $B$, then $C$ is also a boss of $A$. Business has been slow, so Bessie hires an outside organizational company to partition the company into some number of groups. To promote growth, every group is one of two forms. Either no one in the group is the boss of another in the group, or for every pair of cows in the group, one is the boss of the other. Let $G$ be the minimum number of groups needed in such a partition. Find the maximum value of $G$ over all possible company structures. [i]Proposed by Yang Liu[/i]

A convex polygon $ A_1,A_2,\cdots ,A_n$ is inscribed in a circle with center $ O$ and radius $ R$ so that $ O$ lies inside the polygon. Let the inradii of the triangles $ A_1A_2A_3, A_1A_3A_4, \cdots , A_1A_{n \minus{} 1}A_n$ be denoted by $ r_1,r_2,\cdots ,r_{n \minus{} 2}$. Prove that $ r_1 \plus{} r_2 \plus{} ... \plus{} r_{n \minus{} 2}\leq R(n\cos \frac {\pi}{n} \minus{} n \plus{} 2)$.

$(MON 3)$ Let $A_k (1 \le k \le h)$ be $n-$element sets such that each two of them have a nonempty intersection. Let $A$ be the union of all the sets $A_k,$ and let $B$ be a subset of $A$ such that for each $k (1\le k \le h)$ the intersection of $A_k$ and $B$ consists of exactly two different elements $a_k$ and $b_k$. Find all subsets $X$ of the set $A$ with $r$ elements satisfying the condition that for at least one index $k,$ both elements $a_k$ and $b_k$ belong to $X$.

Let $ABC$ be a triangle with $AB > AC$ with incenter $I{}$. The internal bisector of the angle $BAC$ intersects the $BC$ at the point $D{}$. Let $M{}$ the midpoint of the segment $AD{}$, and let $F{}$ be the second intersection point of $MB$ with the circumcircle of the triangle $BIC$. Prove that $AF$ is perpendicular to $FC$.