Determine the smallest integer $n \ge 3$ with the property that you can choose two of the numbers $1,2,\dots, n$ in such a way that their product is equal to the sum of the other $n - 2$ languages. What are the two numbers?

There is a board with $n$ rows and $12$ columns. Each cell of the board contains a $1$ or a $0$. The board has the following properties: [list=i] [*]All rows are distinct. [*]Each row contains exactly $4$ cells with $1$. [*]For every $3$ rows, there is a column that intersects them in $3$ cells with $0$. [/list] Find the largest $n$ for which a board with these properties exists.

A club provides 30 snacks to 18 members, and each member orders 3 different snacks. It is known that every snack is ordered by at least one member, and that any two members order at most one same snack. Is it possible to find 12 snacks, such that the snacks ordered by any member is not completely in these 12 snacks?

The organizers of a mathematical congress found that if they accomodate any participant in a room the rest can be accomodated in double rooms so that 2 persons living in each room know each other. Prove that every participant can organize a round table on graph theory for himself and an even number of other people so that each participant of the round table knows both his neigbours. [i]Proposed by S. Berlov, S. Ivanov[/i]

A point $M (x, y)$ of the Cartesian plane of $xOy$ coordinates is called [i]lattice [/i] if it has integer coordinates. Each lattice point is colored red or blue. Prove that in the plan there is at least one rectangle with lattice vertices of the same color.

Let $ n$ be an even positive integer. Let $ A_1, A_2, \ldots, A_{n \plus{} 1}$ be sets having $ n$ elements each such that any two of them have exactly one element in common while every element of their union belongs to at least two of the given sets. For which $ n$ can one assign to every element of the union one of the numbers 0 and 1 in such a manner that each of the sets has exactly $ \frac {n}{2}$ zeros?

A lattice point in the plane is a point both of whose coordinates are integers. Each lattice point has four neighboring points: upper, lower, left, and right. Let $k$ be a circle with radius $r \geq 2$, that does not pass through any lattice point. An interior boundary point is a lattice point lying inside the circle $k$ that has a neighboring point lying outside $k$. Similarly, an exterior boundary point is a lattice point lying outside the circle $k$ that has a neighboring point lying inside $k$. Prove that there are four more exterior boundary points than interior boundary points.

[u]Round 1[/u] [b]p1.[/b] Alice and Bob played $25$ games of rock-paper-scissors. Alice played rock $12$ times, scissors $6$ times, and paper $7$ times. Bob played rock $13$ times, scissors $9$ times, and paper $3$ times. If there were no ties, who won the most games? (Remember, in each game each player picks one of rock, paper, or scissors. Rock beats scissors, scissors beat paper, and paper beats rock. If they choose the same object, the result is a tie.) [b]p2.[/b] On the planet Vulcan there are eight big volcanoes and six small volcanoes. Big volcanoes erupt every three years and small volcanoes erupt every two years. In the past five years, there were $30$ eruptions. How many volcanoes could erupt this year? [b]p3.[/b] A tangle is a sequence of digits constructed by picking a number $N\ge 0$ and writing the integers from $0$ to $N$ in some order, with no spaces. For example, $010123459876$ is a tangle with $N = 10$. A palindromic sequence reads the same forward or backward, such as $878$ or $6226$. The shortest palindromic tangle is $0$. How long is the second-shortest palindromic tangle? [b]p4.[/b] Balls numbered $1$ to $N$ have been randomly arranged in a long input tube that feeds into the upper left square of an $8 \times 8$ board. An empty exit tube leads out of the lower right square of the board. Your goal is to arrange the balls in order from $1$ to $N$ in the exit tube. As a move, you may 1. move the next ball in line from the input tube into the upper left square of the board, 2. move a ball already on the board to an adjacent square to its right or below, or 3. move a ball from the lower right square into the exit tube. No square may ever hold more than one ball. What is the largest number $N$ for which you can achieve your goal, no matter how the balls are initially arranged? You can see the order of the balls in the input tube before you start. [img]https://cdn.artofproblemsolving.com/attachments/1/8/bbce92750b01052db82d58b96584a36fb5ca5b.png[/img] [b]p5.[/b] A $2018 \times 2018$ board is covered by non-overlapping $2 \times 1$ dominoes, with each domino covering two squares of the board. From a given square, a robot takes one step to the other square of the domino it is on and then takes one more step in the same direction. Could the robot continue moving this way forever without falling off the board? [img]https://cdn.artofproblemsolving.com/attachments/9/c/da86ca4ff0300eca8e625dff891ed1769d44a8.png[/img] [u]Round 2[/u] [b]p6.[/b] Seventeen teams participated in a soccer tournament where a win is worth $1$ point, a tie is worth $0$ points, and a loss is worth $-1$ point. Each team played each other team exactly once. At least $\frac34$ of all games ended in a tie. Show that there must be two teams with the same number of points at the end of the tournament. [b]p7.[/b] The city of Old Haven is known for having a large number of secret societies. Any person may be a member of multiple societies. A secret society is called influential if its membership includes at least half the population of Old Haven. Today, there are $2018$ influential secret societies. Show that it is possible to form a council of at most $11$ people such that each influential secret society has at least one member on the council. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Alice, Bob, Carol, and David decide that they will share meals and that one of them will cook each night. Because David enjoys cooking, he will cook on $4$ days of the week, while Alice, Bob, and Carol each pick a day of the week to cook on. If Alice, Bob, and Carol each choose the day they cook uniformly at random so as to avoid overlap, what is the probability that David does not cook on three consecutive days? For example, Monday, Tuesday and Wednesday are considered as three consecutive days, so are Saturday, Sunday and Monday.

Basil drew several circles on the plane and drew all common tangent lines for all pairs of circles. It turned out that the lines contain all sides of a regular polygon with 2011 vertices. What is the smallest possible number of circles? (Author: N. Agahanov)

Let $ A_0 \equal{} (a_1,\dots,a_n)$ be a finite sequence of real numbers. For each $ k\geq 0$, from the sequence $ A_k \equal{} (x_1,\dots,x_k)$ we construct a new sequence $ A_{k \plus{} 1}$ in the following way. 1. We choose a partition $ \{1,\dots,n\} \equal{} I\cup J$, where $ I$ and $ J$ are two disjoint sets, such that the expression \[ \left|\sum_{i\in I}x_i \minus{} \sum_{j\in J}x_j\right| \] attains the smallest value. (We allow $ I$ or $ J$ to be empty; in this case the corresponding sum is 0.) If there are several such partitions, one is chosen arbitrarily. 2. We set $ A_{k \plus{} 1} \equal{} (y_1,\dots,y_n)$ where $ y_i \equal{} x_i \plus{} 1$ if $ i\in I$, and $ y_i \equal{} x_i \minus{} 1$ if $ i\in J$. Prove that for some $ k$, the sequence $ A_k$ contains an element $ x$ such that $ |x|\geq\frac n2$. [i]Author: Omid Hatami, Iran[/i]

Consider coins with positive real denominations not exceeding 1. Find the smallest $C>0$ such that the following holds: if we have any $100$ such coins with total value $50$, then we can always split them into two stacks of $50$ coins each such that the absolute difference between the total values of the two stacks is at most $C$. [i]Merlijn Staps[/i]

Determine if it is possible to choose nine points in the plane such that there are $n=10$ lines in the plane each of which passes through exactly three of the chosen points. What if $n=11$?

[b]6.1 [/b] Three people with one double seater motorbike simultaneously headed from city A to city B . How should they act so that time, for which the last of them will get to , was the smallest? Determine this time. Pedestrian speed - 5 km/h, motorcycle speed - 45 km/h, distance from A to B is equal to 60 kilometers . [b]6.2 / 7.2[/b] The numbers $A$ and $B$ are relatively prime. What common divisors can have the numbers $A+B$ and $A-B$? [b]6.3.[/b] A person's age in $1962$ was one more than the sum of digits of the year of his birth. How old is he? [b]6.4. / 7.3[/b] $15$ magazines lie on the table, completely covering it. Prove that it is possible to remove eight of them so that the remaining magz cover at least $7/15$ of the table area. [b]6.5.[/b] Prove that a $201 \times 201$ chessboard can be bypassed by moving a chess knight, visiting each square exactly once. [b]6.6.[/b] Can an integer whose last two digits are odd be the square of another integer? PS. You should use hide for answers.Collected [url=https://artofproblemsolving.com/community/c3983459_1962_leningrad_math_olympiad]here[/url].

[b]p1.[/b] Find the sum of all $3$-digit positive integers $\overline{abc}$ that satisfy $$\overline{abc} = {n \choose a}+{n \choose b}+ {n \choose c}$$ for some $n \le 10$. [b]p2.[/b] Feng and Trung play a game. Feng chooses an integer $p$ from $1$ to $90$, and Trung tries to guess it. In each round, Trung asks Feng two yes-or-no questions about $p$. Feng must answer one question truthfully and one question untruthfully. After $15$ rounds, Trung concludes there are n possible values for $p$. What is the least possible value of $n$, assuming Feng chooses the best strategy to prevent Trung from guessing correctly? [b]p3.[/b] A hypercube $H_n$ is an $n$-dimensional analogue of a cube. Its vertices are all the points $(x_1, .., x_n)$ that satisfy $x_i = 0$ or $1$ for all $1 \le i \le n$ and its edges are all segments that connect two adjacent vertices. (Two vertices are adjacent if their coordinates differ at exactly one $x_i$ . For example, $(0,0,0,0)$ and $(0,0,0,1)$ are adjacent on $H_4$.) Let $\phi (H_n)$ be the number of cubes formed by the edges and vertices of $H_n$. Find $\phi (H_4) + \phi (H_5)$. [b]p4.[/b] Denote the legs of a right triangle as $a$ and $b$, the radius of the circumscribed circle as $R$ and the radius of the inscribed circle as $r$. Find $\frac{a+b}{R+r}$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

On a blackboard there are $ n \geq 2, n \in \mathbb{Z}^{\plus{}}$ numbers. In each step we select two numbers from the blackboard and replace both of them by their sum. Determine all numbers $ n$ for which it is possible to yield $ n$ identical number after a finite number of steps.

In the coordinate plane the points with both coordinates being rational numbers are called rational points. For any positive integer $n$, is there a way to use $n$ colours to colour all rational points, every point is coloured one colour, such that any line segment with both endpoints being rational points contains the rational points of every colour?

Two persons are dividing a piece of cheese. The first person cuts it into two pieces, then the second person cuts one of these pieces into two, then again the first person cuts one of the pieces into two, and so until they have 5 pieces. After that the first person chooses one of the pieces, then the second person chooses one of remaining pieces and so on until all pieces are taken. For each of the players, what is the maximal amount of cheese he can get for certain, regardless of the other's actions?

Let $ f(n,k)$ be the number of ways of distributing $ k$ candies to $ n$ children so that each child receives at most $ 2$ candies. For example $ f(3,7) \equal{} 0,f(3,6) \equal{} 1,f(3,4) \equal{} 6$. Determine the value of $ f(2006,1) \plus{} f(2006,4) \plus{} \ldots \plus{} f(2006,1000) \plus{} f(2006,1003) \plus{} \ldots \plus{} f(2006,4012)$.

What is the smallest number of $3$-cell corners that you need to paint in a $5 \times5$ square so that you cannot paint more than one corner of one it? (Shaded corners should not overlap.)

Each of the players in a tennis tournament played one match against each of the others. If every player won at least one match, show that there are three players A,B, and C such that A beats B, B beats C, and C beats A. Such a triple of player is called a cycle. Determine the number of maximum cycles such a tournament can have.

Let $\triangle ABC$ be a triangle, and let $P_1,\cdots,P_n$ be points inside where no three given points are collinear. Prove that we can partition $\triangle ABC$ into $2n+1$ triangles such that their vertices are among $A,B,C,P_1,\cdots,P_n$, and at least $n+\sqrt{n}+1$ of them contain at least one of $A,B,C$.

We want to draw a number of straight lines such that for each square of a chessboard, at least one of the lines passes through an interior point of the square. What is the smallest number of lines needed for a (a) $3\times 3$; (b) $4\times 4$ chessboard? Use a picture to show that this many lines are enough, and prove that no smaller number would do. (M Vyalyi)

Let $O_1, O_2, ..., O_{2012}$ be $2012$ circles in the plane such that no circle intersects or contains anyother circle and no two circles have the same radius. For each $1\le i < j \le 2012$, let $P_{i,j}$ denotethe point of intersection of the two external tangent lines to $O_i$ and $O_j$, and let $T$ be the set of all $P_{i,j}$ (so $|T|=\binom {2012}{2}= 2023066$). Suppose there exists a subset $S\subset T$ with $|S|= 2021056$ such that all points in $S$ lie on the same line. Prove that all points in $T$ lie on the same line.

Some cities in country are connected with oneway road. It is known that every closed cyclic route, that don`t break traffic laws, consists of even roads. Prove that king of city can place military bases in some cities such that there are not roads between these cities, but for every city without base we can go from city with base by no more than $1$ road. [hide=PS]I think it should be one more condition, like there is cycle that connect all cities [/hide]