$T$ is a set of all the positive integers of the form $2^k 3^l$, where $k, l$ are some non-negetive integers. Show that there exists $1998$ different elements of $T$ that satisfy the following condition. [b]Condition[/b] The sum of the $1998$ elements is again an element of $T$.

We have $ 100$ equal cubes. Player $ A$ has to paint the faces of the cubes, each white or black, such that every cube has at least one face of each colour, at least $ 50$ cubes have more than one black face and at least $ 50$ cubes have more than one white face . Player $ B$ has to place the coloured cubes in a table in a way that their bases form the frame that surrounds a $ 40*12$ rectangle. There are some faces that can not been seen because they are overlapped with other faces or based on the table, we call them invisible faces. On the other hand, the ones which can be seen are called visible faces. Prove that player $ B$ can always place the cubes in such a way that the number of visible faces is the the same as the number of invisible faces, despite the initial colouring of player $ A$ Note: It is easy to see that in the configuration, each cube has three visible faces and three invisible faces

Let $ z_1,z_2,z_3\in\mathbb{C} , $ different two by two, having the same modulus $ \rho . $ Show that: $$ \frac{1}{\left| z_1-z_2\right|\cdot \left| z_1-z_3\right|} +\frac{1}{\left| z_2-z_1\right|\cdot \left| z_2-z_3\right|} +\frac{1}{\left| z_3-z_1\right|\cdot \left| z_3-z_2\right|}\ge\frac{1}{\rho^2} . $$

The roots of $64x^3-144x^2+92x-15=0$ are in arithmetic progression. The difference between the largest and smallest roots is: $\textbf{(A)}\ 2\qquad \textbf{(B)}\ 1\qquad \textbf{(C)}\ \frac{1}{2}\qquad \textbf{(D)}\ \frac{3}{8}\qquad \textbf{(E)}\ \frac{1}{4}$

Let $n$ be a given positive integer. Sisyphus performs a sequence of turns on a board consisting of $n + 1$ squares in a row, numbered $0$ to $n$ from left to right. Initially, $n$ stones are put into square $0$, and the other squares are empty. At every turn, Sisyphus chooses any nonempty square, say with $k$ stones, takes one of these stones and moves it to the right by at most $k$ squares (the stone should say within the board). Sisyphus' aim is to move all $n$ stones to square $n$. Prove that Sisyphus cannot reach the aim in less than \[ \left \lceil \frac{n}{1} \right \rceil + \left \lceil \frac{n}{2} \right \rceil + \left \lceil \frac{n}{3} \right \rceil + \dots + \left \lceil \frac{n}{n} \right \rceil \] turns. (As usual, $\lceil x \rceil$ stands for the least integer not smaller than $x$. )

Let $\omega$ be the semicircle on diameter $AB$. A line parallel to $AB$ intersects $\omega$ at $C$ and $D$ so that $B$ and $C$ lie on opposite sides of $AD$. The line through $C$ parallel to $AD$ meets $\omega$ again in $E$. Lines $BE$ and $CD$ meet in $F$ and the line through $F$ parallel to $AD$ meets $AB$ in $P$. Prove that $PC$ is tangent to $\omega$.

Let $D_{x,y}$ denote the half-disk of radius $1$ with its curved boundary externally tangent to the unit circle at the point $(x, y)$, such that the straight boundary of the disk is parallel to the tangent line (so the point of tangency is the middle of the curved boundary). Find the area of the union of the $D_{x,y}$ over all $(x, y)$ with $x^2 + y^2 = 1$ (that is, $(x,y)$ is on the unit circle).

Does there exist a function $ f: {\Bbb N} \to {\Bbb N}$ such that $ f(f(n \minus{} 1)) \equal{} f(n \plus{} 1) \minus{} f(n)$ for all $ n > 2$.

The sequence $x_0, x_1, x_2, ...$ is defined by $x_0 = 0$, $x_{k+1} = [(n - \sum_0^k x_i)/2]$. Show that $x_k = 0$ for all sufficiently large $k$ and that the sum of the non-zero terms $x_k$ is $n-1$.

The product of $10$ natural numbers is equal to $10^{10}$. What is the largest possible sum of these numbers?

Find the number of rearrangements of the letters in the word MATHMEET that begin and end with the same letter such as TAMEMHET.

Let $n$ and $k$ be two positive integers. Consider a group of $k$ people such that, for each group of $n$ people, there is a $(n+1)$-th person that knows them all (if $A$ knows $B$ then $B$ knows $A$). 1) If $k=2n+1$, prove that there exists a person who knows all others. 2) If $k=2n+2$, give an example of such a group in which no-one knows all others.

Solve the system of equations: $$\begin{cases}\sqrt{\frac{y(t-y)}{t-x}-\frac4x}+\sqrt{\frac{z(t-z)}{t-x}-\frac4x}=\sqrt x\\\sqrt{\frac{z(t-z)}{t-y}-\frac4y}+\sqrt{\frac{x(t-x)}{t-y}-\frac4y}=\sqrt y\\\sqrt{\frac{x(t-x)}{t-z}-\frac4z}+\sqrt{\frac{y(t-y)}{t-z}-\frac4z}=\sqrt z\\x+y+z=2t\end{cases}$$ if the following conditions are satisfied: $0<x<t$, $0<y<t$, $0<z<t$. [i]H. Lesov[/i]

Prove that it is impossible to divide a square with side length $7$ into exactly $36$ squares with integer side lengths.

Inscribe the equilateral triangle of the largest perimeter in a given semicircle.

A right triangle $ABC$ with $\angle C=90^o$ is inscribed in a circle. Suppose that $K$ is the midpoint of the arc $BC$ that does not contain $A$. Let $N$ be the midpoint of the segment $AC$, and $M$ be the intersection point of the ray $KN$ and the circle.The tangents to the circle drawn at $A$ and $C$ meet at $E$. prove that $\angle EMK = 90^o$

Let $ABC$ be an equilateral triangle with the side of $20$ units. Amir divides this triangle into $400$ smaller equilateral triangles with the sides of $1$ unit. Reza then picks $4$ of the vertices of these smaller triangles. The vertices lie inside the triangle $ABC$ and form a parallelogram with sides parallel to the sides of the triangle $ABC.$ There are exactly $46$ smaller triangles that have at least one point in common with the sides of this parallelogram. Find all possible values for the area of this parallelogram. [asy] unitsize(150); defaultpen(linewidth(0.7)); int n = 20; /* # of vertical lines, including BC */ pair A = (0,0), B = dir(-30), C = dir(30); draw(A--B--C--cycle,linewidth(1)); dot(A,UnFill(0)); dot(B,UnFill(0)); dot(C,UnFill(0)); label("$A$",A,W); label("$C$",C,NE); label("$B$",B,SE); for(int i = 1; i < n; ++i) { draw((i*A+(n-i)*B)/n--(i*A+(n-i)*C)/n); draw((i*B+(n-i)*A)/n--(i*B+(n-i)*C)/n); draw((i*C+(n-i)*A)/n--(i*C+(n-i)*B)/n); }[/asy] [Thanks azjps for drawing the diagram.] [hide="Note"][i]Note:[/i] Vid changed to Amir, and Eva change to Reza![/hide]

In 1772 Euler discovered the curious fact that $n^2 +n+41$ is prime when $n$ is any of $0,1,2, \cdots, 39$. Show that there exist $40$ consecutive integer values of $n$ for which this polynomial is not prime.

Let $a$ and $b$ be positive integers such that $1\leq a<b\leq 100$. If there exists a positive integer $k$ such that $ab|a^k+b^k$, we say that the pair $(a, b)$ is good. Determine the number of good pairs.

Let $p$ and $q$ be relatively prime positive integers. A subset $S\subseteq \mathbb{N}_0$ is called ideal if $0 \in S$ and, for each element $n \in S$, the integers $n+p$ and $n+q$ belong to $S$. Determine the number of ideal subsets of $\mathbb{N}_0$.

An acute triangle $ABC$ is given. Let us denote $X$ for each of its inner points $X_a, X_b, X_c$ its images in axial symmetries sequentially along the lines $BC, CA, AB$. Prove that all $X_aX_bX_c$ triangles have a common interior point. (Josef Tkadlec)

Prove that the equation $ 2x^2 - 215y^2 = 1 $ has no integer solutions.

Find the area of the part bounded by two curves $y=\sqrt{x},\ \sqrt{x}+\sqrt{y}=1$ and the $x$-axis. 1956 Tokyo Institute of Technology entrance exam

There is a rectangular field that measures $20\text{m}$ by $15\text{m}$. Xiaoyu the butterfly is sitting at the perimeter of the field on one of the $20\text{m}$ sides such that he is $6\text{m}$ from a corner. He flies in a straight line to another point on the perimeter. His flying path splits the field into two parts with equal area. How far in meters did Xiaoyu fly?

Let $ABCDEFGHIJ$ be a regular $10$-sided polygon that has all its vertices in one circle with center $O$ and radius $5$. The diagonals $AD$ and $BE$ intersect at $P$ and the diagonals $AH$ and $BI$ intersect at $Q$. Calculate the measure of the segment $PQ$.