An epidemic influenza broke out in the elves city. First day some of them were infected by the external source of infection and nobody later was infected by the external source. The elf is infected when visiting his ill friend. In spite of the situation every healthy elf visits all his ill friends every day. The elf is ill one day exactly, and has the immunity at least on the next day. There is no graftings in the city. Prove that a) If there were some elves immunised by the external source on the first day, the epidemic influenza can continue arbitrary long time. b) If nobody had the immunity on the first day, the epidemic influenza will stop some day.

Albrecht writes numbers on the points of the first quadrant with integer coordinates in the following way: If at least one of the coordinates of a point is 0, he writes 0; in all other cases the number written on point $(a, b)$ is one greater than the average of the numbers written on points $ (a+1 , b-1) $ and $ (a-1,b+1)$ . Which numbers could he write on point $(121, 212)$? Note: The elements of the first quadrant are points where both of the coordinates are non- negative.

We consider dissections of regular $n$-gons into $n - 2$ triangles by $n - 3$ diagonals which do not intersect inside the $n$-gon. A [i]bicoloured triangulation[/i] is such a dissection of an $n$-gon in which each triangle is coloured black or white and any two triangles which share an edge have different colours. We call a positive integer $n \ge 4$ [i]triangulable[/i] if every regular $n$-gon has a bicoloured triangulation such that for each vertex $A$ of the $n$-gon the number of black triangles of which $A$ is a vertex is greater than the number of white triangles of which $A$ is a vertex. Find all triangulable numbers.

Suppose that $n\ge 8$ persons $P_1,P_2,\dots,P_n$ meet at a party. Assume that $P_k$ knows $k+3$ persons for $k=1,2,\dots,n-6$. Further assume that each of $P_{n-5},P_{n-4},P_{n-3}$ knows $n-2$ persons, and each of $P_{n-2},P_{n-1},P_n$ knows $n-1$ persons. Find all integers $n\ge 8$ for which this is possible. (It is understood that "to know" is a symmetric nonreflexive relation: if $P_i$ knows $P_j$ then $P_j$ knows $P_i$; to say that $P_i$ knows $p$ persons means: knows $p$ persons other than herself/himself.)

We define $A, B, C$ as a [i]partition[/i] of $\mathbb{N}$ if $A,B,C$ satisfies the following. (i) $A, B, C \not= \phi$ (ii) $A \cap B = B \cap C = C \cap A = \phi$ (iii) $A \cup B \cup C = \mathbb{N}$. Prove that the partition of $\mathbb{N}$ satisfying the following does not exist. (i) $\forall$ $a \in A, b \in B$, we have $a+b+2008 \in C$ (ii) $\forall$ $b \in B, c \in C$, we have $b+c+2008 \in A$ (iii) $\forall$ $c \in C, a \in A$, we have $c+a+2008 \in B$

[b]p1.[/b] Consider a normal $8 \times 8$ chessboard, where each square is labelled with either $1$ or $-1$. Let $a_k$ be the product of the numbers in the $k$th row, and let $b_k$ be the product of the numbers in the $k$th column. Find, with proof, all possible values of $\sum^8_{k=1}(a_kb_k)$. [b]p2.[/b] Let $\overline{AB}$ be a line segment with $AB = 1$, and $P$ be a point on $\overline{AB}$ with $AP = x$, for some $0 < x < 1$. Draw circles $C_1$ and $C_2$ with $\overline{AP}$, $\overline{PB}$ as diameters, respectively. Let $\overline{AB_1}$, $\overline{AB_2}$ be tangent to $C_2$ at $B_1$ and $B_2$, and let $\overline{BA_1}$;$\overline{BA_2}$ be tangent to $C_1$ at $A_1$ and $A_2$. Now $C_3$ is a circle tangent to $C_2$, $\overline{AB_1}$, and $\overline{AB_2}$; $C_4$ is a circle tangent to $C_1$, $\overline{BA_1}$, and $\overline{BA_2}$. (a) Express the radius of $C_3$ as a function of $x$. (b) Prove that $C_3$ and $C_4$ are congruent. [img]https://cdn.artofproblemsolving.com/attachments/c/a/fd28ad91ed0a4893608b92f5ccbd01088ae424.png[/img] [b]p3.[/b] Suppose that the graphs of $y = (x + a)^2$ and $x = (y + a)^2$ are tangent to one another at a point on the line $y = x$. Find all possible values of $a$. [b]p4.[/b] You may assume without proof or justification that the infinite radical expressions $\sqrt{a-\sqrt{a-\sqrt{a-\sqrt{a-...}}}}$ and $\sqrt{a-\sqrt{a+\sqrt{a-\sqrt{a+...}}}}$ represent unique values for $a > 2$. (a) Find a real number $a$ such that $$\sqrt{a-\sqrt{a-\sqrt{a-\sqrt{a+...}}}}= 2017$$ (b) Show that $$\sqrt{2018-\sqrt{2018+\sqrt{2018-\sqrt{2018+...}}}}=\sqrt{2017-\sqrt{2017-\sqrt{2017-\sqrt{2017-...}}}}$$ [b]p5.[/b] (a) Suppose that $m, n$ are positive integers such that $7n^2 - m^2 > 0$. Prove that, in fact, $7n^2 - m^2 \ge 3$. (b) Suppose that $m, n$ are positive integers such that $\frac{m}{n} <\sqrt7$. Prove that, in fact, $\frac{m}{n}+\frac{1}{mn} <\sqrt7$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

In every cell of a board $9 \times 9$ is written an integer. For any $k$ numbers in the same row (column), their sum is also in the same row (column). Find the smallest possible number of zeroes in the board for $a)$ $k=5;$ $b)$ $k=8.$

In a test, $3n$ students participate, who are located in three rows of $n$ students in each. The students leave the test room one by one. If $N_1(t), N_2(t), N_3(t)$ denote the numbers of students in the first, second, and third row respectively at time $t$, find the probability that for each t during the test, \[|N_i(t) - N_j(t)| < 2, i \neq j, i, j = 1, 2, \dots .\]

There are $100$ white points on a circle. Asya and Borya play the following game: they alternate, starting with Asya, coloring a white point in green or blue. Asya wants to obtain as much as possible pairs of adjacent points of distinct colors, while Borya wants these pairs to be as less as possible. What is the maximal number of such pairs Asya can guarantee to obtain, no matter how Borya plays.

Does there exist a number $N$ so that there are $N - 1$ infinite arithmetic progressions with differences $2 , 3 , 4 ,..., N$ , and every natural number belongs to at least one of these progressions?

Can be colored the positive integers with 2009 colors if we know that each color paints infinitive integers and that we can not find three numbers colored by three different colors for which the product of two numbers equal to the third one?

Consider a horizontal line $L$ with $n\ge 4$ different points $P_1, P_2, ..., P_n$. For each pair of points $P_i$ ,$P_j $a circle is drawn such that the segment $P_iP_j$ is a diameter. Determine the maximum number of intersections between circles that can occur, considering only those that occur strictly above $L$. [hide=original wording]Considere una recta horizontal $L$ con $n\ge 4$ puntos $P_1, P_2, ..., P_n$ distintos en ella. Para cada par de puntos $P_i,P_j$ se traza un circulo de manera tal que el segmento $P_iP_j$ es un diametro. Determine la cantidad maxima de intersecciones entre circulos que pueden ocurrir, considerando solo aquellas que ocurren estrictamente arriba de $L$.[/hide]

A panel contains $100$ light bulbs, arranged in a $10$ by $10$ square array. Some of them are on, the others are off. The electrical system is such that when the switch corresponding to a light bulb is pressed, all the light bulbs that are on the same row or column of it (including the bulb linked to the pressed switch) change their state (that is they are turned on or off). [list] [*] From which starting configurations, pressing the right sequence of switches, is it possible to achieve that all bulbs are on at the same time? [*] What is the answer to the previous question if the bulbs are $81$, arranged in a $9$ by $9$ panel?[/list]

Let $k$ and $n$ be positive integers and let $$S=\{(a_1,\ldots,a_k)\in \mathbb{Z}^{k}\;|\; 0\leq a_k\leq\cdots\leq a_1 \leq n,a_1+\cdots+a_k=n\}$$. Determine, with proof, the value of $$\sum_{(a_1,\ldots,a_k)\in S}\binom{n}{a_1}\binom{a_1}{a_2}\cdots\binom{a_{k-1}}{a_k}$$ in terms of $k$ and $n$, where the sum is over all $k$-tuples in $S$.

Consider $2n+1$ points in space, no four of which are coplanar where $n>1$. Each line segment connecting any two of these points is either colored red, white or blue. A subset $M$ of these points is called a [i]connected monochromatic[/i] subset, if for each $a,b \in M$, there are points $a=x_0,x_1, \dots, x_l = b$ that belong to $M$ such that the line segments $x_0x_1, x_1x_2, \dots, x_{l-1}x_1$ are all have the same color. No matter how the points are colored, if there always exists a connected monochromatic $k-$subset, find the largest value of $k$. ($l > 1$)

A black pawn and a white pawn are placed on the first square and the last square of a $ 1\times n$ chessboard, respectively. Wiwit and Siti move alternatingly. Wiwit has the white pawn, and Siti has the black pawn. The white pawn moves first. In every move, the player moves her pawn one or two squares to the right or to the left, without passing the opponent's pawn. The player who cannot move anymore loses the game. Which player has the winning strategy? Explain the strategy.

In each cell of a table with $m$ rows and $n$ columns, where $m<n$, we put a non-negative real number such that each column contains at least one positive number. Show that there is a cell with a positive number such that the sum of the numbers in its row is larger than the sum of the numbers in its column.

Let $r>1$ be a rational number. Alice plays a solitaire game on a number line. Initially there is a red bead at $0$ and a blue bead at $1$. In a move, Alice chooses one of the beads and an integer $k \in \mathbb{Z}$. If the chosen bead is at $x$, and the other bead is at $y$, then the bead at $x$ is moved to the point $x'$ satisfying $x'-y=r^k(x-y)$. Find all $r$ for which Alice can move the red bead to $1$ in at most $2021$ moves.

We are given a balance with two bowls and a number of weights. (a) Give an example of four integer weights using which one can measure any weight of $1,2,...,40$ grams. (b) Are there four weights using which one can measure any weight of $1,2,...,50$ grams?

The President of the Bank "Glavny Central" Gerasim Shchenkov announced that from January $2$, $2001$ until January $31$ of the same year, the dollar exchange rate would not go beyond the boundaries of the corridor of $27$ rubles $50$ kopecks. and $28$ rubles $30$ kopecks for the dollar. On January $2$, the rate will be a multiple of $5$ kopecks, and starting from January 3, each day will differ from the rate of the previous day by exactly $5$ kopecks. Mr. Shchenkov suggested that citizens try to guess what the dollar exchange rate will be during the specified period. Anyone who can give an accurate forecast for at least one day, he promised to give a cash prize. One interesting person lives in our house, a tireless arguer. For his passion for arguments and constant winnings, he was even nicknamed Zhora Sporos. Zhora claims that he can give such a forecast of the dollar exchange rate for every day from January 424 to January 4314, which he will surely guess at least once, if, of course, the banker strictly acts in accordance with the announced rules. Is Zhora right? Note: 1 ruble =100 kopecks [hide=original wording]10-I-7. Президент банка "Главный централ" Герасим Щенков объявил, что со 2-го января 2001 года и до 31-го января этого же года курс доллара не будет выходить за границы коридора 27 руб. 50 коп. и 28 руб. 30 коп. за доллар. 2-го января курс будет кратен 5 копейкам, а, начиная с 3-го января, каждый день будет отличаться от курса предыдущего дня ровно на 5 копеек. Господин Щенков предложил гражданам попробовать угадать, каким будет курс доллара в течение указанного периода. Тому, кто сумеет дать точный прогноз хотя бы на один день, он обещал выдать денежный приз. В нашем доме живет один интересный человек, неутомимый спорщик. За страсть к спорам и постоянные выигрыши его даже прозвали Жора Спорос. Жора утверждает, что может дать такой прогноз курса доллара на каждый день со 2-го по 31-е января, что обязательно хотя бы один раз угадает, если, конечно, банкир будет строго действовать в соответствии с объявленными правилами. Прав ли Жора? [/hide]

The squares of a rectangular chessboard with 10 rows and 14 columns are colored alternatingly black and white in the usual manner. Some stones are placed the board (possibly more than one on the same square) so that there are an odd number of stones in each row and each column. Show that the total number of stones on black squares is even.

Let $X$ be a set of $n$ elements. Prove that the sum of the numbers of elements of sets $A\cap B$, where $A$ and $B$ run over all subsets of $X$, is equal to $n4^{n-1}$.

In cells of a $2022 \times 2022$ table numbers from $1$ to $2022^2$ are written, in each cell exactly one number, all numbers are used once. For every row Vlad marks the second biggest number in it, Dima does the same for every column. It turned out that boys marked $4044$ pairwise distinct numbers, and there are $k$ numbers marked by Vlad, each of which is less than all numbers marked by Dima. Find the maximum possible value of $k$

A music streaming service proposes songs classified in $10$ musical genres, so that each song belong to one and only one gender. The songs are played one after the other: the first $17$ are chosen by the user, but starting from the eighteenth the service automatically determines which song to play. Elisabetta has noticed that, if one makes the classification of which genres they appear several times during the last $17$ songs played, the new song always belongs to the genre at the top of the ranking or, in case of same merit, at one of the first genres. Prove that, however, the first $17$ tracks are chosen, from a certain point onwards the songs proposed are all of the same kind.

Given is a positive integer $k$. There are $n$ points chosen on a line, such the distance between any two adjacent points is the same. The points are colored in $k$ colors. For each pair of monochromatic points such that there are no points of the same color between them, we record the distance between these two points. If all distances are distinct, find the largest possible $n$.