Through a given point inside a circle, construct two perpendicular chords such that the sum of their lengths would be: [b]a)[/b] maximum. [b]b)[/b] minimum.

Polynomial P(x) with integer coefficient is called [i]cube-presented[/i] if it can be represented as sum of several cube of polynomials with integer coefficients. Examples: $3x + 3x^2$ is cube-represented because $3x + 3x^2 = (x + 1)^3 +(-x)^3 + (-1)^3$. a) Is $3x^2$ a cube-represented polynomial? b). How many quadratic polynomial P(x) with integer coefficients belong to the set $\{1,2, 3, ...,2017\}$ which is cube-represented?

A certain number of cubes are painted in six colours, each cube having six faces of different colours (the colours in different cubes may be arranged differently) . The cubes are placed on a table so as to form a rectangle. We are allowed to take out any column of cubes, rotate it (as a whole) along its long axis and replace it in the rectangle. A similar operation with rows is also allowed. Can we always make the rectangle monochromatic (i.e. such that the top faces of all the cubes are the same colour) by means of such operations? ( D. Fomin , Leningrad)

A circle $\omega$ with diameter $AK$ is given. The point $M$ lies in the interior of the circle, but not on $AK$. The line $AM$ intersects $\omega$ in $A$ and $Q$. The tangent to $\omega$ at $Q$ intersects the line through $M$ perpendicular to $AK$, at $P$. The point $L$ lies on $\omega$, and is such that $PL$ is tangent to $\omega$ and $L\neq Q$. Show that $K, L$, and $M$ are collinear.

Prove that $3^n + 1$ is not divisible by $2^n$ for any integer $n > 1$.

Line segment $\overline{AB}$ is a diameter of a circle with $AB=24$. Point $C$, not equal to $A$ or $B$, lies on the circle. As point $C$ moves around the circle, the centroid (center of mass) of $\triangle{ABC}$ traces out a closed curve missing two points. To the nearest positive integer, what is the area of the region bounded by this curve? $\textbf{(A)} \text{ 25} \qquad \textbf{(B)} \text{ 38} \qquad \textbf{(C)} \text{ 50} \qquad \textbf{(D)} \text{ 63} \qquad \textbf{(E)} \text{ 75}$

Do there exist polynomials $p(x)$ and $q(x)$ with real coefficients such that $p^3(x)-q^2(x)$ is linear but not constant?

[i]Super number[/i] is a sequence of numbers $0,1,2,\ldots,9$ such that it has infinitely many digits at left. For example $\ldots 3030304$ is a [i]super number[/i]. Note that all of positive integers are [i]super numbers[/i], which have zeros before they're original digits (for example we can represent the number $4$ as $\ldots, 00004$). Like positive integers, we can add up and multiply [i]super numbers[/i]. For example: \[ \begin{array}{cc}& \ \ \ \ldots 3030304 \\ &+ \ldots4571378\\ &\overline{\qquad \qquad \qquad }\\ & \ \ \ \ldots 7601682 \end{array} \] And \[ \begin{array}{cl}& \ \ \ \ldots 3030304 \\ &\times \ldots4571378\\ &\overline{\qquad \qquad \qquad }\\ & \ \ \ \ldots 4242432 \\ & \ \ \ \ldots 212128 \\ & \ \ \ \ldots 90912 \\ & \ \ \ \ldots 0304 \\ & \ \ \ \ldots 128 \\ & \ \ \ \ldots 20 \\ & \ \ \ \ldots 6 \\ &\overline{\qquad \qquad \qquad } \\ & \ \ \ \ldots 5038912 \end{array}\] [b]a)[/b] Suppose that $A$ is a [i]super number[/i]. Prove that there exists a [i]super number[/i] $B$ such that $A+B=\stackrel{\leftarrow}{0}$ (Note: $\stackrel{\leftarrow}{0}$ means a super number that all of its digits are zero). [b]b)[/b] Find all [i]super numbers[/i] $A$ for which there exists a [i]super number[/i] $B$ such that $A \times B=\stackrel{\leftarrow}{0}1$ (Note: $\stackrel{\leftarrow}{0}1$ means the super number $\ldots 00001$). [b]c)[/b] Is this true that if $A \times B= \stackrel{\leftarrow}{0}$, then $A=\stackrel{\leftarrow}{0}$ or $B=\stackrel{\leftarrow}{0}$? Justify your answer.

Four positive integers $x,y,z$ and $t$ satisfy the relations \[ xy - zt = x + y = z + t. \] Is it possible that both $xy$ and $zt$ are perfect squares?

Define the sequence ($x_n$) as follows: the first term is $1$, the next two are $2,4$, the next three are $5,7,9$, the next four are $10,12,14,16$, and so on. Express $x_n$ as a function of $n$.