$13$ fractions are corrected by using each of the numbers $1,2,...,26$ once.[b]Example:[/b]$\frac{12}{5},\frac{18}{26}.... $ What is the maximum number of fractions which are integers?

15000 years ago Tilif ministry in Persia decided to define a code for $n\geq2$ cities. Each code is a sequence of $0,1$ such that no code start with another code. We know that from $2^{m}$ calls from foreign countries to Persia $2^{m-a_{i}}$ of them where from the $i$-th city (So $\sum_{i=1}^{n}\frac1{2^{a_{i}}}=1$). Let $l_{i}$ be length of code assigned to $i$-th city. Prove that $\sum_{i=1}^{n}\frac{l_{i}}{2^{i}}$ is minimum iff $\forall i,\ l_{i}=a_{i}$

Let $n$ be a positive integer. Consider $n$ points in the plane such that no three of them are collinear and no two of the distances between them are equal. One by one, we connect each point to the two points nearest to it by line segments (if there are already other line segments drawn to this point, we do not erase these). Prove that there is no point from which line segments will be drawn to more than $11$ points.

We want to split the set of natural numbers from $1$ to $3n$, where $n$ is a natural number, into $n$ mutually disjoint sets $\{x,y,z\}$ of three elements such that always holds: $x + y = 3z$. Is this possible for : a) $n = 5$? b) $n=10$? In both cases, provide either such a split or proof that such a split is not possible.

There are $3\leq n\leq 25$ passengers in a bus some of which are friends. Every passenger has exactly $k$ friends among the passengers, no two friends have a common friend and every two people, who are not friends have a common friend. Find $n$.

[b]p1.[/b] Prove that the equation $x^6 - 143x^5 - 917x^4 + 51x^3 + 77x^2 + 291x + 1575 = 0$ has no integer solutions. [b]p2.[/b] There are $81$ wheels in a 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 it can be detected with certainty after four measurements on a balance scale. [b]p3.[/b] Rob and Ann multiplied the numbers from $1$ to $100$ and calculated the sum of digits of this product. For this sum, Rob calculated the sum of its digits as well. Then Ann kept repeating this operation until he got a one-digit number. What was this number? [b]p4.[/b] Rui and Jui take turns placing bishops on the squares of the $ 8\times 8$ chessboard in such a way that bishops cannot attack one another. (In this game, the color of the rooks is irrelevant.) The player who cannot place a rook loses the game. Rui takes the first turn. Who has a winning strategy, and what is it? [b]p5.[/b] The following figure can be cut along sides of small squares into several (more than one) identical shapes. What is the smallest number of such identical shapes you can get? [img]https://cdn.artofproblemsolving.com/attachments/8/e/9cd09a04209774dab34bc7f989b79573453f35.png[/img] PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

What is the largest number of regions into which a plane can be divided by drawing $n$ pairs of parallel lines?

Consider $n$ segments in the plane which no two intersect and between their $2n$ endpoints no three are collinear. Is the following statement true? Statement: There exists a simple $2n$-gon such that it's vertices are the $2n$ endpoints of the segments and each segment is either completely inside the polygon or an edge of the polygon.

Elmo and Elmo's clone are playing a game. Initially, $n\geq 3$ points are given on a circle. On a player's turn, that player must draw a triangle using three unused points as vertices, without creating any crossing edges. The first player who cannot move loses. If Elmo's clone goes first and players alternate turns, who wins? (Your answer may be in terms of $n$.) [i]Proposed by Milan Haiman[/i]

For every point on the plane, one of $ n$ colors are colored to it such that: $ (1)$ Every color is used infinitely many times. $ (2)$ There exists one line such that all points on this lines are colored exactly by one of two colors. Find the least value of $ n$ such that there exist four concyclic points with pairwise distinct colors.

[u]Round 1[/u] [b]p1.[/b] What is the remainder when $2021$ is divided by $102$? [b]p2.[/b] Brian has $2$ left shoes and $2$ right shoes. Given that he randomly picks $2$ of the $4$ shoes, the probability he will get a left shoe and a right shoe is $\frac{p}{q}$ , where $p$ and $q$ are relatively prime positive integers. Compute $p + q$. [b]p3.[/b] In how many ways can $59$ be written as a sum of two perfect squares? (The order of the two perfect squares does not matter.) [u]Round 2 [/u] [b]p4.[/b] Two positive integers have a sum of $60$. Their least common multiple is $273$. What is the positive diffeerence between the two numbers? [b]p5.[/b] How many ways are there to distribute $13$ identical apples among $4$ identical boxes so that no two boxes receive the same number of apples? A box may receive zero apples. [b]p6.[/b] In square $ABCD$ with side length $5$, $P$ lies on segment $AB$ so that $AP = 3$ and $Q$ lies on segment $AD$ so that $AQ = 4$. Given that the area of triangle $CPQ$ is $x$, compute $2x$. [u]Round 3 [/u] [b]p7.[/b] Find the number of ordered triples $(a, b, c)$ of nonnegative integers such that $2a+3b+5c = 15$. [b]p8.[/b] What is the greatest integer $n \le 15$ such that $n + 1$ and $n^2 + 3$ are both prime? [b]p9.[/b] For positive integers $a, b$, and $c$, suppose that $gcd \,\,(a, b) = 21$, $gcd \,\,(a, c) = 10$, and $gcd \,\,(b,c) = 11$. Find $\frac{abc}{lcm \,\,(a,b,c)}$ . (Note: $gcd$ is the greatest common divisor function and $lcm$ is the least common multiple function.) [u]Round 4[/u] [b]p10.[/b] The vertices of a square in the coordinate plane are at $(0, 0)$, $(0, 6)$, $(6, 0)$, and $(6, 6)$. Line $\ell$ intersects the square at exactly two lattice points (that is, points with integer coordinates). How many such lines $\ell$ are there that divide the square into two regions, one of them having an area of $12$? [b]p11.[/b] Let $f(n)$ be defined as follows for positive integers $n$: $f(1) = 0$, $f(n) = 1$ if $n$ is prime, and $f(n) = f(n - 1) + 1$ otherwise. What is the maximum value of $f(n)$ for $n \le 120$? [b]p12.[/b] The graph of the equation $y = x^3 + ax^2 + bx + c$ passes through the points $(2,4)$, $(3, 9)$, and $(4, 16)$. What is $b$? PS. You should use hide for answers. Rounds 5- 8 have been posted [url=https://artofproblemsolving.com/community/c3h2949415p26408227]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

We have an 8x8 chessboard with 64 squares. Then we have 3x1 dominoes which cover exactly 3 squares. Such dominoes can only be moved parallel to the borders of the chessboard and also only if the passing squares are free. If no dominoes can be moved, then the position is called stable. a. Find the smalles number of covered squares neccessary for a stable position. b. Prove: There exist a stable position with only one square uncovered. c. Find all Squares which are uncoverd in at least one position of b).

Three schools each have $n$ students. Each student knows a total of $n + 1$ students at the other two schools. Show that there must be three students, one from each school, who know each other.

For each positive integer $n$, define $s(n) =\sum_{k=0}^n r_k$, where $r_k$ is the remainder when $n \choose k$ is divided by $3$. Find all positive integers $n$ such that $s(n) \ge n$. Malik Talbi

Is it possible to fill a $40 \times 41$ table with integers so that each integer equals the number of adjacent (by an edge) cells with the same integer? Alexandr Gribalko

A cube side $5$ is divided into $125$ unit cubes. $N$ of the small cubes are black and the rest white. Find the smallest $N$ such that there must be a row of $5$ black cubes parallel to one of the edges of the large cube.

Let $A$ and $E$ be opposite vertices of an octagon. A frog starts at vertex $A.$ From any vertex except $E$ it jumps to one of the two adjacent vertices. When it reaches $E$ it stops. Let $a_n$ be the number of distinct paths of exactly $n$ jumps ending at $E$. Prove that: \[ a_{2n-1}=0, \quad a_{2n}={(2+\sqrt2)^{n-1} - (2-\sqrt2)^{n-1} \over\sqrt2}. \]

[b]p1.[/b] A band of pirates unloaded some number of treasure chests from their ship. The number of pirates was between $60$ and $69$ (inclusive). Each pirate handled exactly $11$ treasure chests, and each treasure chest was handled by exactly $7$ pirates. Exactly how many treasure chests were there? Show that your answer is the only solution. [b]p2.[/b] Let $a$ and $b$ be the lengths of the legs of a right triangle, let $c$ be the length of the hypotenuse, and let $h$ be the length of the altitude drawn from the vertex of the right angle to the hypotenuse. Prove that $c+h>a+b$. [b]p3.[/b] Prove that $$\frac{1}{70}< \frac{1}{2} \frac{3}{4} \frac{5}{6} ... \frac{2001}{2002} < \frac{1}{40}$$ [b]p4.[/b] Given a positive integer $a_1$ we form a sequence $a_1 , a_2 , a _3,...$ as follows: $a_2$ is obtained from $a_1$ by adding together the digits of $a_1$ raised to the $2001$-st power; $a_3$ is obtained from $a_2$ using the same rule, and so on. For example, if $a_1 =25$, then $a_2 =2^{2001}+5^{2001}$, which is a $1399$-digit number containing $106$ $0$'s, $150$ $1$'s, 4124$ 42$'s, $157$ $3$'s, $148$ $4$'s, $141$ $5$'s, $128$ $6$'s, $1504 47$'s, $152$ $8$'s, $143$ $9$'s. So $a_3 = 106 \times 0^{2001}+ 150 \times 1^{2001}+ 124 \times 2^{2001}+ 157 \times 3^{2001}+ ...+ 143 \times 9^{2001}$ which is a $1912$-digit number, and so forth. Prove that if any positive integer $a_1$ is chosen to start the sequence, then there is a positive integer $M$ (which depends on $a_1$ ) that is so large that $a_n < M$ for all $n=1,2,3,...$ [b]p5.[/b] Let $P(x)$ be a polynomial with integer coefficients. Suppose that there are integers $a$, $b$, and $c$ such that $P(a)=0$, $P(b)=1$, and $P(c)=2$. Prove that there is at most one integer $n$ such that $P(n)=4$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

There are \(n^2 + n\) numbers, none of which appears more than \(\frac{n^2 + n}{2}\) times. Prove that they can be divided into \((n+1)\) groups of \(n\) numbers each in such a way that the sums of the numbers in these groups are pairwise distinct. [i]Proposed by Anton Trygub[/i]

Let $n\geq1$ be an integer and let $t_1<t_2<\dots<t_n$ be positive integers. In a group of $t_n+1$ people, some games of chess are played. Two people can play each other at most once. Prove that it is possible for the following two conditions to hold at the same time: (i) The number of games played by each person is one of $t_1,t_2,\dots,t_n$. (ii) For every $i$ with $1\leq i\leq n$, there is someone who has played exactly $t_i$ games of chess.

Determine maximum real $ k$ such that there exist a set $ X$ and its subsets $ Y_{1}$, $ Y_{2}$, $ ...$, $ Y_{31}$ satisfying the following conditions: (1) for every two elements of $ X$ there is an index $ i$ such that $ Y_{i}$ contains neither of these elements; (2) if any non-negative numbers $ \alpha_{i}$ are assigned to the subsets $ Y_{i}$ and $ \alpha_{1}+\dots+\alpha_{31}=1$ then there is an element $ x\in X$ such that the sum of $ \alpha_{i}$ corresponding to all the subsets $ Y_{i}$ that contain $ x$ is at least $ k$.

The numbers $1,2,\ldots,49,50$ are written on the blackboard. Ann performs the following operation: she chooses three arbitrary numbers $a,b,c$ from the board, replaces them by their sum $a+b+c$ and writes $(a+b)(b+c)(c+a)$ to her notebook. Ann performs such operations until only two numbers remain on the board (in total 24 operations). Then she calculates the sum of all $24$ numbers written in the notebook. Let $A$ and $B$ be the maximum and the minimum possible sums that Ann san obtain. Find the value of $\frac{A}{B}$. [i](I. Voronovich)[/i]

There are given in a table numbers $1,2,...,18$. What is minimal number of numbers we should erase such that the sum of every two remaining numbers is not perfect square of a positive integer.

There are a number of cards on a table. A number is written on each card. The "pick and replace" operation involves the following: two random cards are taken from the table and replaced by one new card. If the numbers $a$ and $b$ appear on the two packed cards, the number $a + b + ab$ is set on the new card. If we start with ten cards with the numbers $1, 2, 3, 4, 5, 6, 7, 8, 9$ and $10$ respectively, what value(s) can the number have that "grab and replace" nine times is on the only card still on the table? Prove your answer

Find the maximum number $E$ such that the following holds: there is an edge-colored graph with 60 vertices and $E$ edges, with each edge colored either red or blue, such that in that coloring, there is no monochromatic cycles of length 3 and no monochromatic cycles of length 5.