The vertices of a regular nonagon are colored such that $1)$ adjacent vertices are different colors and $2)$ if $3$ vertices form an equilateral triangle, they are all different colors. Let $m$ be the minimum number of colors needed for a valid coloring, and n be the total number of colorings using $m$ colors. Determine $mn$. (Assume each vertex is distinguishable.)

Consider the set of all rectangles with a given area $S$. Find the largest value o $ M = \frac{16-p}{p^2+2p}$ where $p$ is the perimeter of the rectangle.

For each positive integer $k$, let $n_k$ be the smallest positive integer such that there exists a finite set $A$ of integers satisfy the following properties: [list] [*]For every $a\in A$, there exists $x,y\in A$ (not necessary distinct) that $$n_k\mid a-x-y$$[/*] [*]There's no subset $B$ of $A$ that $|B|\leq k$ and $$n_k\mid \sum_{b\in B}{b}.$$ [/list] Show that for all positive integers $k\geq 3$, we've $$n_k<\Big( \frac{13}{8}\Big)^{k+2}.$$

Find the number of pairs $(n, q)$, where $n$ is a positive integer and $q$ a non-integer rational number with $0 < q < 2000$, that satisfy $\{q^2\}=\left\{\frac{n!}{2000}\right\}$

Find all sets of real numbers $\{a_1,a_2,\ldots, _{1375}\}$ such that \[2 \left( \sqrt{a_n - (n-1)}\right) \geq a_{n+1} - (n-1), \quad \forall n \in \{1,2,\ldots,1374\},\] and \[2 \left( \sqrt{a_{1375}-1374} \right) \geq a_1 +1.\]

Let $ABC$ be an equilateral triangle. For an arbitrary line $\ell$. through $B$, the orthogonal projections of $A$ and $C$ on $\ell$ are denoted by $D$ and $E$ respectively. If $D\ne E$, equilateral triangles $DEP$ and $DET$ are constructed on different sides of $\ell$. Find the loci of $P$ and $T$.

We consider triangles $ABC$, in which the point $M$ lies on the side $AB$, $AM = a$, $BM = b$, $CM = c$ ($c <a, c <b$). Find the smallest radius of the circumcircle of such triangles.

Bob proposes the following game to Johanna. The board in the figure is an equilateral triangle subdivided in turn into $256$ small equilateral triangles, one of which is painted in black. Bob chooses any point inside the board and places a small token. Johanna can make three types of plays. Each of them consists of choosing any of the $3$ vertices of the board and move the token to the midpoint between the current position of the tile and the chosen vertex. In the second figure we see an example of a move in which Johana chose vertex $A$. Johanna wins if she manages to place her piece inside the triangle black. Prove that Johanna can always win in at most $4$ moves. [asy] unitsize(8 cm); pair A, B, C; int i; A = dir(60); C = (0,0); B = (1,0); fill((6/16*(1,0) + 1/16*dir(60))--(7/16*(1,0) + 1/16*dir(60))--(6/16*(1,0) + 2/16*dir(60))--cycle, gray(0.7)); draw(A--B--C--cycle); for (i = 1; i <= 15; ++i) { draw(interp(A,B,i/16)--interp(A,C,i/16)); draw(interp(B,C,i/16)--interp(B,A,i/16)); draw(interp(C,A,i/16)--interp(C,B,i/16)); } label("$A$", A, N); label("$B$", B, SE); label("$C$", C, SW); [/asy] [asy] unitsize(8 cm); pair A, B, C, X, Y, Z; int i; A = dir(60); C = (0,0); B = (1,0); X = 9.2/16*(1,0) + 3.3/16*dir(60); Y = (A + X)/2; Z = rotate(60,X)*(Y); fill((6/16*(1,0) + 1/16*dir(60))--(7/16*(1,0) + 1/16*dir(60))--(6/16*(1,0) + 2/16*dir(60))--cycle, gray(0.7)); draw(A--B--C--cycle); for (i = 1; i <= 15; ++i) { draw(interp(A,B,i/16)--interp(A,C,i/16)); draw(interp(B,C,i/16)--interp(B,A,i/16)); draw(interp(C,A,i/16)--interp(C,B,i/16)); } draw(A--X, dotted); draw(arc(Z,abs(X - Y),-12,40), Arrow(6)); label("$A$", A, N); label("$B$", B, SE); label("$C$", C, SW); dot(A); dot(X); dot(Y); [/asy]

Discuss the solvability of the equations \begin{align*}\lambda x+y+z&=a\\x+\lambda y+z&=b\\x+y+\lambda z&=c\end{align*}for all numbers $\lambda,a,b,c\in\mathbb R$.

[color=blue][size=150]PERU TST IMO - 2006[/size] Saturday, may 20.[/color] [b]Question 04[/b] In an actue-angled triangle $ABC$ draws up: its circumcircle $w$ with center $O$, the circumcircle $w_1$ of the triangle $AOC$ and the diameter $OQ$ of $w_1$. The points are chosen $M$ and $N$ on the straight lines $AQ$ and $AC$, respectively, in such a way that the quadrilateral $AMBN$ is a parallelogram. Prove that the intersection point of the straight lines $MN$ and $BQ$ belongs the circumference $w_1.$ --- [url=http://www.mathlinks.ro/Forum/viewtopic.php?t=88513]Spanish version[/url] $\text{\LaTeX}{}$ed by carlosbr

Consider the following array: \[ 3, 5\\3, 8, 5\\3, 11, 13, 5\\3, 14, 24, 18, 5\\3, 17, 38, 42, 23, 5\\ \ldots \] Find the 5-th number on the $ n$-th row with $ n>5$.

Let $p$ be a prime number and $A$ an infinite subset of the natural numbers. Let $f_A(n)$ be the number of different solutions of $x_1+x_2+\ldots +x_p=n$, with $x_1,x_2,\ldots x_p\in A$. Does there exist a number $N$ for which $f_A(n)$ is constant for all $n<N$?

Let $A_1$ be the center of the square inscribed in acute triangle $ABC$ with two vertices of the square on side $BC$. Thus one of the two remaining vertices of the square is on side $AB$ and the other is on $AC$. Points $B_1,\ C_1$ are defined in a similar way for inscribed squares with two vertices on sides $AC$ and $AB$, respectively. Prove that lines $AA_1,\ BB_1,\ CC_1$ are concurrent.

Consider points $ P$ which are inside the square with side length $ a$ such that the distance from $ P$ to the center of the square equals to the least distance from $ P$ to each side of the square.Find the area of the figure formed by the whole points $ P$.

Ten test papers are to be prepared for the National Olympiad. Each paper has 4 problems, and no two papers have more than 1 problem in common. At least how many problems are needed?

Find the number of ways to partition $S = \{1, 2, 3, \dots, 2020\}$ into two disjoint sets $A$ and $B$ with $A \cup B = S$ so that if you choose an element $a$ from $A$ and an element $b$ from $B$, $a+b$ is never a multiple of $20$. $A$ or $B$ can be the empty set, and the order of $A$ and $B$ doesn't matter. In other words, the pair of sets $(A,B)$ is indistinguishable from the pair of sets $(B,A)$. [i]Proposed by Timothy Qian[/i]

Let $ABC$ be a triangle and let $A' \in BC$, $B' \in CA$ and $C' \in AB$ be three collinear points. a) Prove that each pair of circles of diameters $AA'$, $BB'$ and $CC'$ has the same radical axis; b) Prove that the circumcenter of the triangle formed by the intersections of the lines $AA' , BB'$ and $CC'$ lies on the common radical axis found above.

Two circles with radii a and b respectively touch each other externally. Let c be the radius of a circle that touches these two circles as well as a common tangent to the two circles. Prove that \[ \frac{1}{\sqrt{c}}\equal{}\frac{1}{\sqrt{a}}\plus{}\frac{1}{\sqrt{b}}\]

Consider the acute-angled triangle $ABC$, with orthocentre $H$ and circumcentre $O$. $D$ is the intersection point of lines $AH$ and $BC$ and $E$ lies on $\overline{AH}$ such that $AE=DH$. Suppose $EO$ and $BC$ meet at $F$. Prove that $BD=CF$. [i] (Călin Pop & Vlad Robu) [/i]

Let $S$ be a planar region. A $\emph{domino-tiling}$ of $S$ is a partition of $S$ into $1\times2$ rectangles. (For example, a $2\times3$ rectangle has exactly $3$ domino-tilings, as shown below.) [asy] import graph; size(7cm); pen dps = linewidth(0.7); defaultpen(dps); draw((0,0)--(3,0)--(3,2)--(0,2)--cycle, linewidth(2)); draw((4,0)--(4,2)--(7,2)--(7,0)--cycle, linewidth(2)); draw((8,0)--(8,2)--(11,2)--(11,0)--cycle, linewidth(2)); draw((1,0)--(1,2)); draw((2,1)--(3,1)); draw((0,1)--(2,1), linewidth(2)); draw((2,0)--(2,2), linewidth(2)); draw((4,1)--(7,1)); draw((5,0)--(5,2), linewidth(2)); draw((6,0)--(6,2), linewidth(2)); draw((8,1)--(9,1)); draw((10,0)--(10,2)); draw((9,0)--(9,2), linewidth(2)); draw((9,1)--(11,1), linewidth(2)); [/asy] The rectangles in the partition of $S$ are called $\emph{dominoes}$. (a) For any given positive integer $n$, find a region $S_n$ with area at most $2n$ that has exactly $n$ domino-tilings. (b) Find a region $T$ with area less than $50000$ that has exactly $100002013$ domino-tilings.

Rectangle $ ABCD$ has $ AB\equal{}8$ and $ BC\equal{}6$. Point $ M$ is the midpoint of diagonal $ \overline{AC}$, and E is on $ \overline{AB}$ with $ \overline{ME}\perp\overline{AC}$. What is the area of $ \triangle AME$? $ \textbf{(A)}\ \frac{65}{8} \qquad \textbf{(B)}\ \frac{25}{3} \qquad \textbf{(C)}\ 9 \qquad \textbf{(D)}\ \frac{75}{8} \qquad \textbf{(E)}\ \frac{85}{8}$

Let $f : (0,+\infty) \to \mathbb R$ be a function having the property that $f(x) = f\left(\frac{1}{x}\right)$ for all $x > 0.$ Prove that there exists a function $u : [1,+\infty) \to \mathbb R$ satisfying $u\left(\frac{x+\frac 1x }{2} \right) = f(x)$ for all $x > 0.$

Given that $a$ is a real solution to the polynomial equation $$nx^n-x^{n-1}-x^{n-2}-\cdots-x-1=0$$ where $n$ is a positive integer, show that $a=1$ or $-1<a<0$.

Consider a table with $n$ rows and $2n$ columns. we put some blocks in some of the cells. After putting blocks in the table we put a robot on a cell and it starts moving in one of the directions right, left, down or up. It can change the direction only when it reaches a block or border. Find the smallest number $m$ such that we can put $m$ blocks on the table and choose a starting point for the robot so it can visit all of the unblocked cells. (the robot can't enter the blocked cells.) Proposed by Seyed Mohammad Seyedjavadi and Alireza Tavakoli

The numbers $1- \sqrt{2}$, $\sqrt{2}$ and $1+\sqrt{2}$ are written on a blackboard. Every minute, if $x, y, z$ are the numbers written, then they are erased and the numbers, $x^2 + xy + y^2$, $y^2 + yz + z^2$ and $z^2 + zx + x^2$ are written. Determine whether it is possible for all written numbers to be rational numbers after a finite number of minutes.