Given the number $188188...188$ (number $188$ is written $101$ times). Some digits of this number are crossed out. What is the largest multiple of $7$, that could happen?

On an infinite sheet of graph paper a table is drawn so that in each square of the table stands a number equal to the arithmetic mean of the four adjacent numbers. Out of the table a piece is cut along the lines of the graph paper. Prove that the largest number on the piece always occurs at an edge, where $x = \frac14 (a + b + c + d)$.

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.

What is the largest area of a regular hexagon that can be drawn inside the equilateral triangle of side $3$? A. $3\sqrt7$ B. $\frac{3 \sqrt3}{2}$ C. $2\sqrt5$ D. $\frac{3\sqrt3}{8}$ E. $3\sqrt5$

What is the largest possible value of $|...| |a_1 - a_2| - a_3| - ... - a_{1990}|$, where $a_1, a_2, ... , a_{1990}$ is a permutation of $1, 2, 3, ... , 1990$?

A natural number $k$ is such that $k^2 < 2014 < (k +1)^2$. What is the largest prime factor of $k$?

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.

A natural number $N$ is written in its decimal representation . It is known that for each digit in this representation , this digit divides exactly into the number $N$ (the digit $0$ is not encountered). What is the maximum number of different digits which there can be in such a representation of $N$? (S . Fomin, Leningrad)

Given a point $E$ on the diameter $AC$ of the certain circle. Draw a chord $BD$ to maximise the area of the quadrangle $ABCD$.

Let $M$ be the maximum value of $(6x-3y-8z)$, subject to $2x^2+3y^2+4z^2 = 1$. Find $[M]$.

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 $K$ and $N > K$ be fixed positive integers. Let $n$ be a positive integer and let $a_1, a_2, ..., a_n$ be distinct integers. Suppose that whenever $m_1, m_2, ..., m_n$ are integers, not all equal to $0$, such that $\mid{m_i}\mid \le K$ for each $i$, then the sum $$\sum_{i = 1}^{n} m_ia_i$$ is not divisible by $N$. What is the largest possible value of $n$? [i]Proposed by Ilija Jovcevski, North Macedonia[/i]

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]

A number is written in each square of a chessboard, so that each number not on the border is the mean of the $4$ neighboring numbers. Show that if the largest number is $N$, then there is a number equal to $N$ in the border squares.

For any set $A = \{x_1, x_2, x_3, x_4, x_5\}$ of five distinct positive integers denote by $S_A$ the sum of its elements, and denote by $T_A$ the number of triples $(i, j, k)$ with $1 \le i < j < k \le 5$ for which $x_i + x_j + x_k$ divides $S_A$. Find the largest possible value of $T_A$.

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]$.

What is the maximum possible value of $k$ for which $2013$ can be written as a sum of $k$ consecutive positive integers?

Let $A,B,C$ be nodes of the lattice $Z\times Z$ such that inside the triangle $ABC$ lies a unique node $P$ of the lattice. Denote $E = AP \cap BC$. Determine max $\frac{AP}{PE}$ , over all such configurations.

In a triangle with integer side lengths, one side is three times as long as a second side, and the length of the third side is $17$. What is the greatest possible perimeter of the triangle?

Given regular pentagon $ABCDE$. $M$ is an arbitrary point inside $ABCDE$ or on its side. Let the distances $|MA|, |MB|, ... , |ME|$ be renumerated and denoted with $$r_1\le r_2\le r_3\le r_4\le r_5.$$ Find all the positions of the $M$, giving $r_3$ the minimal possible value. Find all the positions of the $M$, giving $r_3$ the maximal possible value.

In each cell of $5 \times 5$ table there is one number from $1$ to $5$ such that every number occurs exactly once in every row and in every column. Number in one column is [i]good positioned[/i] if following holds: - In every row, every number which is left from [i]good positoned[/i] number is smaller than him, and every number which is right to him is greater than him, or vice versa. - In every column, every number which is above from [i]good positoned[/i] number is smaller than him, and every number which is below to him is greater than him, or vice versa. What is maximal number of good positioned numbers that can occur in this table?

Consider a rectangular array of single digits $d_{i,j}$ with 10 rows and 7 columns, such that $d_{i+1,j}-d_{i,j}$ is always 1 or -9 for all $1 \leq i \leq 9$ and all $1 \leq j \leq 7$, as in the example below. For $1 \leq i \leq 10$, let $m_i$ be the median of $d_{i,1}$, ..., $d_{i,7}$. Determine the least and greatest possible values of the mean of $m_1$, $m_2$, ..., $m_{10}$. Example: [img]https://cdn.artofproblemsolving.com/attachments/8/a/b77c0c3aeef14f0f48d02dde830f979eca1afb.png[/img]

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$.

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$.

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?