We write $\{a,b,c\}$ for the set of three different positive integers $a, b$, and $c$. By choosing some or all of the numbers a, b and c, we can form seven nonempty subsets of $\{a,b,c\}$. We can then calculate the sum of the elements of each subset. For example, for the set $\{4,7,42\}$ we will find sums of $4, 7, 42,11, 46, 49$, and $53$ for its seven subsets. Since $7, 11$, and $53$ are prime, the set $\{4,7,42\}$ has exactly three subsets whose sums are prime. (Recall that prime numbers are numbers with exactly two different factors, $1$ and themselves. In particular, the number $1$ is not prime.) What is the largest possible number of subsets with prime sums that a set of three different positive integers can have? Give an example of a set $\{a,b,c\}$ that has that number of subsets with prime sums, and explain why no other three-element set could have more.

16 students took part in a competition. All problems were multiple choice style. Each problem had four choices. It was said that any two students had at most one answer in common, find the maximum number of problems.

16 students took part in a competition. All problems were multiple choice style. Each problem had four choices. It was said that any two students had at most one answer in common, find the maximum number of problems.

a) Given a big square consisting of $7\times 7$ squares. You should mark the centres of $k$ points in such a way, that no quadruple of the marked points will be the vertices of a rectangle with the sides parallel to the sides of the given squares. What is the greatest $k$ such that the problem has solution? b) The same problem for $13\times 13$ square.

For real numbers $x$ and $y$, let $M$ be the maximum value of the expression $x^4y + x^3y + x^2y + xy + xy^2 + xy^3 + xy^4$, subject to $x + y = 3$. Find $[M]$.

The natural numbers $ a_1 $, $ a_2 $, $ \dots $, $ a_n $ satisfy the condition $ 1 / a_1 + 1 / a_2 + \ldots + 1 / a_n = 1 $. Prove that all these numbers do not exceed $$ n ^ {2 ^ n} $$

One side of a convex polygon is equal to $a$, the sum of exterior angles at the vertices not adjacent to this side are equal to $120^o$. Among such polygons, find the polygon of the largest area.

The world and the european champion are determined in the same tournament carried in one round. There are $20$ teams and $k$ of them are european. The european champion is determined according to the results of the games only between those $k$ teams. What is the greatest $k$ such that the situation, when the single european champion is the single world outsider, is possible if: a) it is hockey (draws allowed)? b) it is volleyball (no draws)?

Let $a, b$ be two real numbers that satisfy $a^3 + b^3 = 8-6ab$. Find the maximum value and the minimum value that $a + b$ can take.

Let $OP$ be a diagonal of a unit cube. Find the minimum and the maximum value of the area of the intersection of the cube with a plane through $OP$.

From the set of numbers $1 , 2, 3, . . . , 1985$ choose the largest subset such that the difference between any two numbers in the subset is not a prime number (the prime numbers are $2, 3 , 5 , 7,... , 1$ is not a prime number) .

All the fields of a square $n\times n$ (n>2) table are filled with $+1$ or $-1$ according to the rules: [i]At the beginning $-1$ are put in all the boundary fields. The number put in the field in turn (the field is chosen arbitrarily) equals to the product of the closest, from the different sides, numbers in its row or in its column. [/i] a) What is the minimal b) What is the maximal possible number of $+1$ in the obtained table?

1 - Prove that $55 < (1+\sqrt{3})^4 < 56$ . 2 - Find the largest power of $2$ that divides $\lceil(1+\sqrt{3})^{2n}\rceil$ for the positive integer $n$

Find maximum of the expression $(a -b^2)(b - a^2)$, where $0 \le a,b \le 1$.

In a football tournament there are n teams, with ${n \ge 4}$, and each pair of teams meets exactly once. Suppose that, at the end of the tournament, the final scores form an arithmetic sequence where each team scores ${1}$ more point than the following team on the scoreboard. Determine the maximum possible score of the lowest scoring team, assuming usual scoring for football games (where the winner of a game gets ${3}$ points, the loser ${0}$ points, and if there is a tie both teams get ${1}$ point).

Delete $100$ digits from the number $1234567891011... 9899100$ so that the remaining number were as big as possible.

Find maximal value of positive integer $n$ such that there exists subset of $S=\{1,2,...,2001\}$ with $n$ elements, such that equation $y=2x$ does not have solutions in set $S \times S$

Let $n$ be a positive integer. Determine the maximum value of $gcd(a, b) + gcd(b, c) + gcd(c, a)$ for positive integers $a, b, c$ such that $a + b + c = 5n$.

Let $A=\{n\in\mathbb{Z}\mid 0<n<2013\}$. A subset $B\subseteq A$ is called [b]reduced[/b] if for any two numbers $x,y\in B$, we must have $x\cdot y \notin B$. For example, any subset containing the numbers $3,5,15$ cannot be reduced, and same for a subset containing $4,16$. [list=a] [*] Find the maximal size of a reduced subset of $A$. [*] How many reduced subsets are there with that maximal size? [/list]

To each element of the set $S = \{1,2,... ,1000\}$ a colour is assigned. Suppose that for any two elements $a, b$ of $S$, if $15$ divides $a + b$ then they are both assigned the same colour. What is the maximum possible number of distinct colours used?

Let $x_1=a, x_2=a^{x_1}, ..., x_n=a^{x_{n-1}}$ where $a>1$. What is the maximum value of $a$ for which lim exists $\lim_{n\to \infty} x_n$ and what is this limit?

If $x$ and $y$ are nonnegative real numbers such that $x+y=1$, determine minimal and maximal value of $$A=x\sqrt{1+y}+y\sqrt{1+x}$$

Let $a,b, c$ denote the real numbers such that $1 \le a, b, c\le 2$. Consider $T = (a - b)^{2018} + (b - c)^{2018} + (c - a)^{2018}$. Determine the largest possible value of $T$.

Let $x\in\mathbb{R}$. What is the maximum value of the following expression: $\sqrt{x-2018} + \sqrt{2020-x}$ ?

Show that the maximum number of spheres of radius $1$ that can be placed touching a fixed sphere of radius $1$ so that no pair of spheres has an interior point in common is between $12$ and $14$.