Let $m, n, k > 1$ be positive integers. For a set $S$ of positive integers, define $S(i,j)$ for $i<j$ to be the number of elements in $S$ strictly between $i$ and $j$. We say two sets $(X,Y)$ are a [i]fat[/i] pair if \[ X(i,j)\equiv Y(i,j) \pmod{n} \] for every $i,j \in X \cap Y$. (In particular, if $\left\lvert X \cap Y \right\rvert < 2$ then $(X,Y)$ is fat.) If there are $m$ distinct sets of $k$ positive integers such that no two form a fat pair, show that $m<n^{k-1}$. [i]Proposed by Allen Liu[/i]

For any positive real $r$, let $d(r)$ be the distance of the nearest lattice point from the circle center the origin and radius $r$. Show that $d(r)$ tends to zero as $r$ tends to infinity.

$2n-1$ distinct positive real numbers with sum $S $ are given. Prove that there are at least $\binom {2n-2}{n-1}$ different ways to choose $n $ numbers among them such that their sum is at least $\frac {S}{2}$. [i]Proposed by Amirhossein Gorzi[/i]

In equality $$1 * 2 * 3 * 4 * 5 * ... * 60 * 61 * 62 = 2023$$ Instead of each asterisk, you need to put one of the signs “+” (plus), “-” (minus), “•” (multiply) so that the equality becomes true. What is the smallest number of "•" characters that can be used?

Let $ A\equal{}\{A_1,\dots,A_m\}$ be a family distinct subsets of $ \{1,2,\dots,n\}$ with at most $ \frac n2$ elements. Assume that $ A_i\not\subset A_j$ and $ A_i\cap A_j\neq\emptyset$ for each $ i,j$. Prove that: \[ \sum_{i\equal{}1}^m\frac1{\binom{n\minus{}1}{|A_i|\minus{}1}}\leq1\]

Let $G$ be the complete graph on $2015$ vertices. Each edge of $G$ is dyed red, blue or white. For a subset $V$ of vertices of $G$, and a pair of vertices $(u,v)$, define \[ L(u,v) = \{ u,v \} \cup \{ w | w \in V \ni \triangle{uvw} \text{ has exactly 2 red sides} \}\]Prove that, for any choice of $V$, there exist at least $120$ distinct values of $L(u,v)$.

Billy let his herd freely. Enjoying their time the horses started to jump on the squares of a lattice of meadow that is infinite in both directions. Each horse can jump as follows: horizontally or vertically moves three, then turn to left and moves two. Naturally, under the jump a horse don’t touch the ground. The horses are standing on squares that no two can meet by such a jump. How many horses does Billy have if their number is the maximum possible? [i]The figure below shows where a horse can jump to. Notice that there 4 places and not 8 like in chess.[/i] [img]https://cdn.artofproblemsolving.com/attachments/c/6/8b6f9ca4e0aad46a13e133d87bcd4dd4384e7a.png[/img]

There are $2014$ balls with $106$ different colors, $19$ of each color. Determine the least possible value of $n$ so that no matter how these balls are arranged around a circle, one can choose $n$ consecutive balls so that amongst them, there are $53$ balls with different colors.

A set $A$ of positive integers is called [i]uniform[/i] if, after any of its elements removed, the remaining ones can be partitioned into two subsets with equal sum of their elements. Find the least positive integer $n>1$ such that there exist a uniform set $A$ with $n$ elements.

Find the smallest positive integer $n$ for which there exist integers $x_{1} < x_{2} <...< x_{n}$ such that every integer from $1000$ to $2000$ can be written as a sum of some of the integers from $x_1,x_2,..,x_n$ without repetition.

Alice is performing a magic trick. She has a standard deck of 52 cards, which she may order beforehand. She invites a volunteer to pick an integer \(0\le n\le 52\), and cuts the deck into a pile with the top \(n\) cards and a pile with the remaining \(52-n\). She then gives both piles to the volunteer, who riffles them together and hands the deck back to her face down. (Thus, in the resulting deck, the cards that were in the deck of size \(n\) appear in order, as do the cards that were in the deck of size \(52-n\).) Alice then flips the cards over one-by-one from the top. Before flipping over each card, she may choose to guess the color of the card she is about to flip over. She stops if she guesses incorrectly. What is the maximum number of correct guesses she can guarantee? [i]Proposed by Espen Slettnes[/i]

[b]p1.[/b] It takes $12$ months for Santa Claus to pack gifts. It would take $20$ months for his apprentice to do the job. If they work together, how long will it take for them to pack the gifts? [b]p2.[/b] All passengers on a bus sit in pairs. Exactly $2/5$ of all men sit with women, exactly $2/3$ of all women sit with men. What part of passengers are men? [b]p3.[/b] There are $100$ colored balls in a box. Every $10$-tuple of balls contains at least two balls of the same color. Show that there are at least $12$ balls of the same color in the box. [b]p4.[/b] There are $81$ wheels in storage marked by their two types, say first and second type. Wheels of the same type weigh equally. Any wheel of the second type is much lighter than a wheel of the first type. It is known that exactly one wheel is marked incorrectly. Show that one can determine which wheel is incorrectly marked with four measurements. [b]p5.[/b] Remove from the figure below the specified number of matches so that there are exactly $5$ squares of equal size left: (a) $8$ matches (b) $4$ matches [img]https://cdn.artofproblemsolving.com/attachments/4/b/0c5a65f2d9b72fbea50df12e328c024a0c7884.png[/img] PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Amir enters Fine Hall and sees the number $2$ written on the blackboard. Amir can perform the following operation: he flips a coin, and if it is heads, he replaces the number $x$ on the blackboard with $3x+1;$ otherwise, he replaces $x$ with $\lfloor x/3\rfloor.$ If Amir performs the operation four times, let $\tfrac{m}{n}$ denote the expected number of times that he writes the digit $1$ on the blackboard, where $m,n$ are relatively prime positive integers. Find $m+n.$

A $12 \times 12$ board is divided into $144$ unit squares by drawing lines parallel to the sides. Two rooks placed on two unit squares are said to be non-attacking if they are not in the same column or same row. Find the least number $N$ such that if $N$ rooks are placed on the unit squares, one rook per square, we can always find $7$ rooks such that no two are attacking each other.

Consider a $12$-card deck containing all four suits of $2, 3,$ and $4.$ A [i]double[/i] is defined as two cards directly next to each other in the deck, with the same value. Suppose we scan the deck left to right, and whenever we encounter a double, we remove all the cards up to that point (including the double). Let $N$ denote the number of times we have to remove cards. What is the expected value of $N$?

We have a bipartite graph $G$ (with parts $X$ and $Y$). We orient each edge arbitrarily. [i]Hessam[/i] chooses a vertex at each turn and reverse the orientation of all edges that $v$ is one of their endpoint. Prove that with these steps we can reach to a graph that for each vertex $v$ in part $X$, $\deg^{+}(v)\geq \deg^{-}(v)$ and for each vertex in part $Y$, $\deg^{+}v\leq \deg^{-}v$

Let n be a positive integer and $x_1, x_2, ..., x_n > 0$ be real numbers so that $x_1 + x_2 +... + x_n =\frac{1}{x_1^2}+\frac{1}{x_2^2}+...+\frac{1}{x_n^2}$ Show that for each positive integer $k \le n$, there are $k$ numbers among $x_1, x_2, ..., x_n $ whose sum is at least $k$.

A $10$ digit number is called interesting if its digits are distinct and is divisible by $11111$. Then find the number of interesting numbers.

Let $n \in \mathbb{N}^*$ and consider a circle of length $6n$ along with $3n$ points on the circle which divide it into $3n$ arcs: $n$ of them have length $1,$ some other $n$ have length $2$ and the remaining $n$ have length $3.$ Prove that among these points there must be two such that the line that connects them passes through the center of the circle.

Let $m,n \geqslant 2$ be integers, let $X$ be a set with $n$ elements, and let $X_1,X_2,\ldots,X_m$ be pairwise distinct non-empty, not necessary disjoint subset of $X$. A function $f \colon X \to \{1,2,\ldots,n+1\}$ is called [i]nice[/i] if there exists an index $k$ such that \[\sum_{x \in X_k} f(x)>\sum_{x \in X_i} f(x) \quad \text{for all } i \ne k.\] Prove that the number of nice functions is at least $n^n$.

[b]p1.[/b] What is the maximum amount of a $12\%$ acid solution that can be obtained from $1$ liter of $5\%$, $10\%$ and $15\%$ solutions? [b]p2.[/b] Which number is greater: $199,719,971,997^2$ or $199,719,971,996 * 19,9719,971,998$ ? [b]p3.[/b] Is there a convex $1998$-gon whose angles are all integer degrees? [b]p4.[/b] Is there a ten-digit number divisible by $11$ that uses all the digits from$ 0$ to $9$? [b]p5.[/b] There are $20$ numbers written in a circle, each of which is equal to the sum of its two neighbors. Prove that the sum of all numbers is $0$. [b]p6.[/b] Is there a convex polygon that has neither an axis of symmetry nor a center of symmetry, but which transforms into itself when rotated around some point through some angle less than $180$ degrees? [b]p7.[/b] In a convex heptagon, draw as many diagonals as possible so that no three of them are sides of the same triangle, the vertices of which are at the vertices of the original heptagon. [b]p8.[/b] Give an example of a natural number that is divisible by $30$ and has exactly $105$ different natural factors, including $1$ and the number itself. [b]p9.[/b] In the writing of the antipodes, numbers are also written with the digits $0, ..., 9$, but each of the numbers has different meanings for them and for us. It turned out that the equalities are also true for the antipodes $5 * 8 + 7 + 1 = 48$ $2 * 2 * 6 = 24$ $5* 6 = 30$ a) How will the equality $2^3 = ...$ in the writing of the antipodes be continued? b) What does the number$ 9$ mean among the Antipodes? Clarifications: a) It asks to convert $2^3$ in antipodes language, and write with what number it is equal and find a valid equality in both numerical systems. b) What does the digit $9$ mean among the antipodes, i.e. with which digit is it equal in our number system? [b]p10.[/b] Is there a convex quadrilateral that can be cut along a straight line into two parts of the same size and shape, but neither the diagonal nor the straight line passing through the midpoints of opposite sides divides it into two equal parts? PS.1. There was typo in problem $9$, it asks for $2^3$ and not $23$. PS.2. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c2416727_soros_olympiad_in_mathematics]here.[/url]

Can the squares of a $1990 \times 1990$ chessboard be colored black or white so that half the squares in each row and column are black and cells symmetric with respect to the center are of opposite color?

Let $C$ be a finite set of chords in a circle such that each chord passes through the midpoint of some other chord. Prove that any two of these chords intersect inside the circle.

Rosa and Sara play with a triangle $ABC$, right at $B$. Rosa begins by marking two interior points of the hypotenuse $AC$, then Sara marks an interior point of the hypotenuse $AC$ different from those of Rosa. Then, from these three points the perpendiculars to the sides $AB$ and $BC$ are drawn, forming the following figure. [img]https://cdn.artofproblemsolving.com/attachments/9/9/c964bbacc4a5960bee170865cc43902410e504.png[/img] Sara wins if the area of the shaded surface is equal to the area of the unshaded surface, in other case wins Rosa. Determine who of the two has a winning strategy.

[b]p1.[/b] There are $2000$ cans of paint. Show that at least one of the following two statements must be true. There are at least $45$ cans of the same color. There are at least $45$ cans all of different colors. [b]p2.[/b] The measures of the $3$ angles of one triangle are all different from each other but are the same as the measures of the $3$ angles of a second triangle. The lengths of $2$ sides of the first triangle are different from each other but are the same as the lengths of $2$ sides of the second triangle. Must the length of the remaining side of the first triangle be the same as the length of the remaining side of the second triangle? If yes, prove it. If not, provide an example. [b]p3.[/b] Consider the sequence $a_1=1$, $a_2=2$, $a_3=5/2$, ... satisfying $a_{n+1}=a_n+(a_n)^{-1}$ for $n>1$. Show that $a_{10000}>141$. [b]p4.[/b] Prove that no matter how $250$ points are placed in a disk of radius $1$, there is a disk of radius $1/10$ that contains at least $3$ of the points. [b]p5.[/b] Prove that: Given any $11$ integers (not necessarily distinct), one can select $6$ of them so that their sum is divisible by $6$. Given any $71$ integers (not necessarily distinct), one can select $36$ of them so that their sum is divisible by $36$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].