Find all positive integers $n$ for which all positive divisors of $n$ can be put into the cells of a rectangular table under the following constraints: [list] [*]each cell contains a distinct divisor; [*]the sums of all rows are equal; and [*]the sums of all columns are equal. [/list]

Let $\triangle ABC$ be a right-angled triangle with $\angle BAC = 90^{\circ}$ and let $E$ be the foot of the perpendicular from $A$ to $BC$. Let $Z \ne A$ be a point on the line $AB$ with $AB = BZ$. Let $(c)$ be the circumcircle of the triangle $\triangle AEZ$. Let $D$ be the second point of intersection of $(c)$ with $ZC$ and let $F$ be the antidiametric point of $D$ with respect to $(c)$. Let $P$ be the point of intersection of the lines $FE$ and $CZ$. If the tangent to $(c)$ at $Z$ meets $PA$ at $T$, prove that the points $T$, $E$, $B$, $Z$ are concyclic. Proposed by [i]Theoklitos Parayiou, Cyprus[/i]

Let $a_1,a_2,\ldots$ be a bounded sequence of reals. Is it true that the fact $$\lim_{N\to\infty}\frac1N\sum_{n=1}^Na_n=b\enspace\text{ and }\enspace\lim_{N\to\infty}\frac1{\log N}\sum_{n=1}^N\frac{a_n}n=c$$implies $b=c$?

We are given a convex quadrilateral $ABCD$ with $AD=CD$ and $\angle BAD=\angle ABC.$ Points $K$ and $L$ are middle points of $AB$ and $BC$, respectively. The rays $\overrightarrow{DL}$ and $\overrightarrow{AB}$ intersect in $M$ and the rays $\overrightarrow{DK}$ and $\overrightarrow{BC}$ – in $N$. On segment $AN$ a point $X$ is chosen, such that $AX=CM$, and on segment $AC$ – point $Y$, such that $AY=MN$. Prove that the line $AB$ bisects segment $XY$.

There is a reunion of $201$ people from $5$ different countries. It is known that in each group of $6$ people, at least two have the same age. Show that there must be at least $5$ people with the same country, age and sex.

Consider a rectangle whose lengths of sides are natural numbers. If someone places as many squares as possible, each with area $3$, inside of the given rectangle, such that the sides of the squares are parallel to the rectangle sides, then the maximal number of these squares fill exactly half of the area of the rectangle. Determine the dimensions of all rectangles with this property.

The function f has the following properties : $f(x + y) = f(x) + f(y) + xy$ for all real $x$ and $y$ $f(4) = 10$ Calculate $f(2001)$.

Find all functions $g:\mathbb{N}\rightarrow\mathbb{N}$ such that \[\left(g(m)+n\right)\left(g(n)+m\right)\] is a perfect square for all $m,n\in\mathbb{N}.$ [i]Proposed by Gabriel Carroll, USA[/i]

$\mathbb{N}$ is the set of positive integers and $a\in\mathbb{N}$. We know that for every $n\in\mathbb{N}$, $4(a^n+1)$ is a perfect cube. Prove that $a=1$.

Let $\triangle ABC$ be an acute-angled triangle with altitudes $AD$ and $BE$ meeting at $H$. Let $M$ be the midpoint of segment $AB$, and suppose that the circumcircles of $\triangle DEM$ and $\triangle ABH$ meet at points $P$ and $Q$ with $P$ on the same side of $CH$ as $A$. Prove that the lines $ED, PH,$ and $MQ$ all pass through a single point on the circumcircle of $\triangle ABC$.

The families of second degree functions $f_m, g_m: R\to R, $ are considered , $f_m (x) = (m^2 + 1) x^2 + 3mx + m^2 - 1$, $g_m (x) = m^2x^2 + mx - 1$, where $m$ is a real nonzero parameter. Show that, for any function $h$ of the second degree with the property that $g_m (x) \le h (x) \le f_m (x)$ for any real $x$, there exists $\lambda \in [0, 1]$ which verifies the condition $h (x) = \lambda f_m (x) + (1- \lambda) g_m (x)$, whatever real $x$ is.

How many functions $f : \{1,2,3,4,5,6\} \to \{1,2,3,4,5,6\}$ have the property that $f(f(x))+f(x)+x$ is divisible by $3$ for all $x \in \{1,2,3,4,5,6\}?$ [i]Proposed by Kyle Lee[/i]

Black and white checkers are placed on an $8 \times 8$ chessboard, with at most one checker on each cell. What is the maximum number of checkers that can be placed such that each row and each column contains twice as many white checkers as black ones?

Each of Mahdi and Morteza has drawn an inscribed $93$-gon. Denote the first one by $A_1A_2…A_{93}$ and the second by $B_1B_2…B_{93}$. It is known that $A_iA_{i+1} // B_iB_{i+1}$ for $1 \le i \le 93$ ($A_{93} = A_1, B_{93} = B_1$). Show that $\frac{A_iA_{i+1} }{ B_iB_{i+1}}$ is a constant number independent of $i$. by Morteza Saghafian

Each positive integer $a$ undergoes the following procedure in order to obtain the number $d = d\left(a\right)$: (i) move the last digit of $a$ to the first position to obtain the numb er $b$; (ii) square $b$ to obtain the number $c$; (iii) move the first digit of $c$ to the end to obtain the number $d$. (All the numbers in the problem are considered to be represented in base $10$.) For example, for $a=2003$, we get $b=3200$, $c=10240000$, and $d = 02400001 = 2400001 = d(2003)$.) Find all numbers $a$ for which $d\left( a\right) =a^2$. [i]Proposed by Zoran Sunic, USA[/i]

Prove that the product of the sides of a quadrilateral inscribed in a circle with radius $1$ does not exceed $4$.

a) Pupils of the $8$-th form are standing in a row. There is the pupil of the $7$-th form in before each, and he is smaller (in height) than the elder. Prove that if you will sort the pupils in each of rows with respect to their height, every 8-former will still be taller than the $7$-former standing before him. b) An infantry detachment soldiers stand in the rectangle, being arranged in columns with respect to their height. Prove that if you rearrange them with respect to their height in every separate row, they will still be staying with respect to their height in columns.

The digits $2$, $0$, $2$, and $3$ are placed in the expression below, one digit per box. What is the maximum possible value of the expression? [asy] // Diagram by TheMathGuyd. I can compress this later size(5cm); real w=2.2; pair O,I,J; O=(0,0);I=(1,0);J=(0,1); path bsqb = O--I; path bsqr = I--I+J; path bsqt = I+J--J; path bsql = J--O; path lsqb = shift((1.2,0.75))*scale(0.5)*bsqb; path lsqr = shift((1.2,0.75))*scale(0.5)*bsqr; path lsqt = shift((1.2,0.75))*scale(0.5)*bsqt; path lsql = shift((1.2,0.75))*scale(0.5)*bsql; draw(bsqb,dashed); draw(bsqr,dashed); draw(bsqt,dashed); draw(bsql,dashed); draw(lsqb,dashed); draw(lsqr,dashed); draw(lsqt,dashed); draw(lsql,dashed); label(scale(3)*"$\times$",(w,1/3)); draw(shift(1.3w,0)*bsqb,dashed); draw(shift(1.3w,0)*bsqr,dashed); draw(shift(1.3w,0)*bsqt,dashed); draw(shift(1.3w,0)*bsql,dashed); draw(shift(1.3w,0)*lsqb,dashed); draw(shift(1.3w,0)*lsqr,dashed); draw(shift(1.3w,0)*lsqt,dashed); draw(shift(1.3w,0)*lsql,dashed); [/asy]$\textbf{(A) } 0\qquad\textbf{(B) } 8\qquad\textbf{(C) } 9\qquad\textbf{(D) } 16\qquad\textbf{(E) } 18$

Let $ABCD$ be a square inscribed in circle $K$. Let $P$ be a point on the small arc $CD$ of circle $K$. The line $PB$ intersects $AC$ in $E$. The line $PA$ intersects $DB$ in $F$. The circle circumscribed to triangle $PEF$ intersects for second time $K$ in $Q$. Prove that $PQ$ is parallel to $CD$.

Kevin colors three distinct squares in a $3\times 3$ grid red. Given that there exist two uncolored squares such that coloring one of them would create a horizontal or vertical red line, find the number of ways he could have colored the original three squares.

In a triangle $ABC$, two lines are drawn that together trisect the angle at $A$. These intersect the side $BC$ at points $P$ and $Q$ so that $P$ is closer to $B$ and $Q$ is closer to $C$. Determine the smallest constant $k$ such that $| P Q | \le k (| BP | + | QC |)$, for all such triangles. Determine if there are triangles for which equality applies.

If $b_k \geq a_k \geq 0$ $(k = 1, 2, 3)$ and $\alpha \geq 1$ then$$(\alpha+3)\sum \limits_{cyc}(b_1-a_1)\left((b_2+b_3)^{\alpha+2}+(a_2+a_3)^{\alpha+2}-(a_2+b_3)^{\alpha+1}-(b_2+a_3)^{\alpha+1}\right)$$ $$\leq (\alpha+2)(\alpha+3)\sum \limits_{cyc}(b_1-a_1)(b_2-a_2)(b_3^{\alpha+1}-a_3^{\alpha+1})$$ $$+ (b_3 + b_2 + a_1)^{\alpha+3}+(b_3 + a_2 + a_1)^{\alpha+3}+(a_3 + b_2 + a_1)^{\alpha+3}+(a_3 + a_2 + b_1)^{\alpha+3}$$ $$-(b_3 + b_2 + b_1)^{\alpha+3}-(b_3 + a_2 + a_1)^{\alpha+3}-(a_3 + b_2 + b_1)^{\alpha+3}-(a_3 + a_2 + a_1)^{\alpha+3}$$

Let $ a, b, c, d,m, n \in \mathbb{Z}^\plus{}$ such that \[ a^2\plus{}b^2\plus{}c^2\plus{}d^2 \equal{} 1989,\] \[ a\plus{}b\plus{}c\plus{}d \equal{} m^2,\] and the largest of $ a, b, c, d$ is $ n^2.$ Determine, with proof, the values of $m$ and $ n.$

A foreman noticed an inspector checking a $ 3"$-hole with a $ 2"$-plug and a $ 1"$-plug and suggested that two more gauges be inserted to be sure that the fit was snug. If the new gauges are alike, then the diameter, $ d$, of each, to the nearest hundredth of an inch, is: $ \textbf{(A)}\ .87 \qquad \textbf{(B)}\ .86 \qquad \textbf{(C)}\ .83 \qquad \textbf{(D)}\ .75 \qquad \textbf{(E)}\ .71$

In the following diagram (not to scale), $A$, $B$, $C$, $D$ are four consecutive vertices of an 18-sided regular polygon with center $O$. Let $P$ be the midpoint of $AC$ and $Q$ be the midpoint of $DO$. Find $\angle OPQ$ in degrees. [asy] pathpen = rgb(0,0,0.6)+linewidth(0.7); pointpen = black+linewidth(3); pointfontpen = fontsize(10); pen dd = rgb(0,0,0.6)+ linewidth(0.7) + linetype("4 4"); real n = 10, start = 360/n*6-15; pair O=(0,0), A=dir(start), B=dir(start+360/n), C=dir(start+2*360/n), D=dir(start+3*360/n), P=(A+C)/2, Q=(O+D)/2; D(D("O",O,NE)--D("A",A,W)--D("B",B,SW)--D("C",C,S)--D("D",D,SE)--O--D("P",P,1.6*dir(95))--D("Q",Q,NE)); D(A--C); D(A--(A+dir(start-360/n))/2, dd); D(D--(D+dir(start+4*360/n))/2, dd); [/asy]