Can a square of side length $5$ be covered by three squares of side length $4$?

[list] [*] A test was conducted in class. It is known that at least $\frac{2}{3}$ of the problems were hard. Each such problems were not solved by at least $\frac{2}{3}$ of the students. It is also known that at least $\frac{2}{3}$ of the students passed the test. Each such student solved at least $\frac{2}{3}$ of the suggested problems. Is this possible? [*] Previous problem with $\frac{2}{3}$ replaced by $\frac{3}{4}$. [*] Previous problem with $\frac{2}{3}$ replaced by $\frac{7}{10}$.[/list]

Let $k$ be a positive integer and $N_k$ be the number of sequences of length $2001$, all members of which are elements of the set $\{0,1,2,\ldots,2k+1\}$, and the number of zeroes among these is odd. Find the greatest power of $2$ which divides $N_k$.

On a circle, $n \geq 3$ points are marked. Each marked point is coloured red, green or blue. In one step, one can erase two neighbouring marked points of different colours and mark a new point between the locations of the erased points with the third colour. In a final state, all marked points have the same colour which is called the colour of the final state. Find all $n$ for which there exists an initial state of $n$ marked points with one missing colour, from which one can reach a final state of any of the three colours by applying a suitable sequence of steps.

The numbers $x_1,x_2,x_3, ..., x_n$ satisfy the two conditions $$\sum^n_{i=1}x_i=0 \,\, , \,\,\,\,\sum^n_{i=1}x_i^2=1$$ Prove that there are two numbers among them whose product is no greater than $- 1/n$. (Stolov, Kharkov)

Let $X$ and $Y$ be two sets of points in the plane and $M$ be a set of segments connecting points from $X$ and $Y$ . Let $k$ be a natural number. Prove that the segments from $M$ can be painted using $k$ colors in such a way that for any point $x \in X \cup Y$ and two colors $\alpha$ and $\beta$ $(\alpha \neq \beta)$, the difference between the number of $\alpha$-colored segments and the number of $\beta$-colored segments originating in $X$ is less than or equal to $1$.

The following list shows every number for which more than half of its digits are digits $2$, in increasing order: $$2, 22, 122, 202, 212, 220, 221, 222, 223, 224, \dots$$ If the $n$th term in the list is $2022$, what is $n$?

Anna and Bob are playing a game on a rectangular board with $i$ rows and $j$ columns. Anna and Bob alternate turns with Anna going first. On each turn, a player places a penny in a square and then all squares in the same row and column of that square are marked. A player cannot place a penny in any marked square. When a player cannot place a penny in any square, they lose and the other player wins. How many ordered pairs of integers $(i, j)$ with $1 \le i \le 2020, 1 \le j \le 2020$ are there such that Anna wins?

Two points are selected independently and uniformly at random inside a regular hexagon. Compute the probability that a line passing through both of the points intersects a pair of opposite edges of the hexagon.

Suppose $S= \{1,2,\dots,n\}$ and $n \geq 3$. There is $f:S^k \longmapsto S$ that if $a,b \in S^k$ and $a$ and $b$ differ in all of elements then $f(a) \neq f(b)$. Prove that $f$ is a function of one of its elements.

Consider a $4 \times 4$ grid of squares. We place coins in some of the grid squares so that no two coins are orthogonally adjacent, and each $2 \times 2$ square in the grid has at least one coin. How many ways are there to place the coins?

There are $2000$ cities in the country, some pairs of cities are connected by roads. It is known that no more than $N$ different non-self-intersecting cyclic routes of odd length. Prove that the country can be divided into $N + 2$ republics so that no two cities from the same republic are connected by a road.

There are $n$ line segments on the plane, no three intersecting at a point, and each pair intersecting once in their respective interiors. Tony and his $2n - 1$ friends each stand at a distinct endpoint of a line segment. Tony wishes to send Christmas presents to each of his friends as follows: First, he chooses an endpoint of each segment as a “sink”. Then he places the present at the endpoint of the segment he is at. The present moves as follows : $\bullet$ If it is on a line segment, it moves towards the sink. $\bullet$ When it reaches an intersection of two segments, it changes the line segment it travels on and starts moving towards the new sink. If the present reaches an endpoint, the friend on that endpoint can receive their present. Prove that Tony can send presents to exactly $n$ of his $2n - 1$ friends.

Three groups $A, B$ and $C$ of mathematicians from different countries have invited to a ceremony. We have formed meetings such that three mathematicians participate in every meeting and there is exactly one mathematician from each group in every meeting. Also every two mathematicians have participated in exactly one meeting with each other. [b](a)[/b] Prove that if this is possible, then number of mathematicians of the groups is equal. [b](b)[/b] Prove that if there exist $3$ mathematicians in each group, then that work is possible. [b](c)[/b] Prove that if number mathematicians of the groups be equal, then that work is possible.

The towns in one country are connected with bidirectional airlines, which are paid in at least one of the two directions. In a trip from town A to town B there are exactly 22 routes that are free. Find the least possible number of towns in the country.

$200n$ diagonals are drawn in a convex $n$-gon. Prove that one of them intersects at least 10000 others. [b]proposed by D. Karpov, S. Berlov[/b]

Let $ A_1A_2...A_n$ be a convex polygon. Show that there exists an index $ j$ such that the circum-circle of the triangle $ A_j A_{j \plus{} 1} A_{j \plus{} 2}$ covers the polygon (here indices are read modulo n).

For each set $C$ of points in space, we designate by $P_C$ the set of planes containing at least three points of $C$. $\bullet$ Prove that there exists $C$ such that $\phi (P_C) = 1997$, where $\phi$ corresponds to the cardinality. $\bullet$ Determine the least number of points that $C$ must have so that the previous property can be fulfilled.

Let $n$ be a natural number. There are $n$ blue points , $n$ red points and one green point on the circle . Prove that it is possible to draw $n$ lengths whose ends are in the given points, so that a maximum of one segment emerges from each point, no more than two segments intersect and the endpoints of none of the segments are blue and red points. [hide=original wording]Нека je ? природан број. На кружници се налази ? плавих, ? црвених и једна зелена тачка. Доказати да је могуће повући ? дужи чији су крајеви у датим тачкама, тако да из сваке тачке излази максимално једна дуж, никоје две дужи се не сијеку и крајње тачке ниједне од дужи нису плава и црвена тачка.[/hide]

During the class interval, $n$ children sit in a circle and play the game described below. The teacher goes around the children clockwisely and hands out candies to them according to the following regulations: Select a child, give him a candy; and give the child next to the first child a candy too; then skip over one child and give next child a candy; then skip over two children; give the next child a candy; then skip over three children; give the next child a candy;... Find the value of $n$ for which the teacher can ensure that every child get at least one candy eventually (maybe after many circles).

Anna and Orjan play the following game: they start with a positive integer $n>1$, Anna writes it as the sum of two other positive integers, $n = n_1+n_2$. Orjan deletes one of them, $n_1$ or $n_2$. If the remaining number is larger than $1$, the process is repeated, i.e. Anna writes it as the sum of two positive integers, $ n_3+n_4$, Orjan deletes one of them etc. The game ends when the last number is $1$. Orjan is the winner if there are two equal numbers among the numbers he has deleted, otherwise Anna wins. Who is winning the game if n = 2008 and they both play optimally?

[b]p1.[/b] The numerator of the fraction was increased by 20%. By what percentage should its denominator be reduced so that the resulting fraction doubles? [b]p2.[/b] From point $O$ on the plane there are four rays $OA$, $OB$, $OC$ and $OD$ (not necessarily in that order). It is known that $\angle AOB =40^o$, $\angle BOC = 70^o$, $\angle COD = 80^o$. What values can the angle between rays $OA$ and $OD$ take? (The angle between the rays is from $0^o$ to $180^o$.) [b]p3.[/b] Three equal circles have a common interior point. Prove that there is a circle of the same radius containing the centers of these three circles. [b]p4.[/b] Two non-leap years are consecutive. The first one has more Mondays than Wednesdays. Which of the seven days of the week will occur most often in the second year? [b]p5.[/b] The difference between two four-digit numbers is $7$. How much can the sums of their digits differ? [b]p6.[/b] The numbers $1, 2, 3, 4, 5, 6, 7, 8, 9$ are written on the board. In one move you can increase any of the numbers by $3$ or $5$. What is the minimum number of moves you need to make for all the numbers to become equal? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c2416727_soros_olympiad_in_mathematics]here.[/url]

Suppose 2017 points in a plane are given such that no three points are collinear. Among the triangles formed by any three of these 2017 points, those triangles having the largest area are said to be [i]good[/i]. Prove that there cannot be more than 2017 good triangles.

There are weights with mass $1,3,5,....,2i+1,...$ Let $A(n)$ -is number of different sets with total mass equal $n$( For example $A(9)=2$, because we have two sets $9=9=1+3+5$). Prove that $A(n) \leq A(n+1)$ for $n>1$

[u]Round 1[/u] [b]p1.[/b] Find all pairs $(a,b)$ of positive integers with $a > b$ and $a^2 -b^2 =111$. [b]p2.[/b] Alice drives at a constant rate of $2017$ miles per hour. Find all positive values of $x$ such that she can drive a distance of $x^2$ miles in a time of $x$ minutes. [b]p3.[/b] $ABC$ is a right triangle with right angle at $B$ and altitude $BH$ to hypotenuse $AC$. If $AB = 20$ and $BH = 12$, find the area of triangle $\vartriangle ABC$. [u]Round 2[/u] [b]p4.[/b] Regular polygons $P_1$ and $P_2$ have $n_1$ and $n_2$ sides and interior angles $x_1$ and $x_2$, respectively. If $\frac{n_1}{n_2}= \frac75$ and $\frac{x_1}{x_2}=\frac{15}{14}$ , find the ratio of the sum of the interior angles of $P_1$ to the sum of the interior angles of $P_2$. [b]p5.[/b] Joey starts out with a polynomial $f (x) = x^2 +x +1$. Every turn, he either adds or subtracts $1$ from $f$ . What is the probability that after $2017$ turns, $f$ has a real root? [b]p6.[/b] Find the difference between the greatest and least positive integer values $x$ such that $\sqrt[20]{\lfloor \sqrt[17]{x}\rfloor}=1$. [u]Round 3[/u] [b]p7.[/b] Let $ABCD$ be a square and suppose $P$ and $Q$ are points on sides $AB$ and $CD$ respectively such that $\frac{AP}{PB} = \frac{20}{17}$ and $\frac{CQ}{QD}=\frac{17}{20}$ . Suppose that $PQ = 1$. Find the area of square $ABCD$. [b]p8.[/b] If $$\frac{\sum_{n \ge 0} r^n}{\sum_{n \ge 0} r^{2n}}=\frac{1+r +r^2 +r^3 +...}{1+r^2 +r^4 +r^6 +...}=\frac{20}{17},$$ find $r$ . [b]p9.[/b] Let $\overline{abc}$ denote the $3$ digit number with digits $a,b$ and $c$. If $\overline{abc}_{10}$ is divisible by $9$, what is the probability that $\overline{abc}_{40}$ is divisible by $9$? [u]Round 4[/u] [b]p10.[/b] Find the number of factors of $20^{17}$ that are perfect cubes but not perfect squares. [b]p11.[/b] Find the sum of all positive integers $x \le 100$ such that $x^2$ leaves the same remainder as $x$ does upon division by $100$. [b]p12.[/b] Find all $b$ for which the base-$b$ representation of $217$ contains only ones and zeros. PS. You should use hide for answers. Rounds 5-8 have been posted [url=https://artofproblemsolving.com/community/c3h3158514p28715373]here[/url].and 9-12 [url=https://artofproblemsolving.com/community/c3h3162362p28764144]here[/url] Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].