A graph has $n$ points and $\frac{n(n-1)}{2}$ edges. Each edge is colored with one of $k$ colors so that there are no closed monochrome paths. What is the largest possible value of $n$ (given $k$)?

Given regular $45$-gon. Can you mark its corners with the digits $\{0,1,...,9\}$ in such a way, that for every pair of digits there would be a side with both ends marked with those digits?

[u]Round 1 [/u] [b]p1.[/b] Pirate Jim had $8$ boxes with gun powder weighing $1, 2, 3, 4, 5, 6, 7$, and $8$ pounds (the weight is printed on top of every box). Pirate Bob hid a $1$-pound gold bar in one of these boxes. Pirate Jim has a balance scale that he can use, but he cannot open any of the boxes. Help him find the box with the gold bar using two weighings on the balance scale. [b]p2.[/b] James Bond will spend one day at Dr. Evil's mansion to try to determine the answers to two questions: a) Is Dr. Evil at home? b) Does Dr. Evil have an army of ninjas? The parlor in Dr. Evil's mansion has three windows. At noon, Mr. Bond will sneak into the parlor and use open or closed windows to signal his answers. When he enters the parlor, some windows may already be opened, and Mr. Bond will only have time to open or close one window (or leave them all as they are). Help Mr. Bond and Moneypenny design a code that will tell Moneypenny the answers to both questions when she drives by later that night and looks at the windows. Note that Moneypenny will not have any way to know which window Mr. Bond opened or closed. [b]p3.[/b] Suppose that you have a triangle in which all three side lengths and all three heights are integers. Prove that if these six lengths are all different, there cannot be four prime numbers among them. p4. Fred and George have designed the Amazing Maze, a $5\times 5$ grid of rooms, with Adorable Doors in each wall between rooms. If you pass through a door in one direction, you gain a gold coin. If you pass through the same door in the opposite direction, you lose a gold coin. The brothers designed the maze so that if you ever come back to the room in which you started, you will find that your money has not changed. Ron entered the northwest corner of the maze with no money. After walking through the maze for a while, he had $8$ shiny gold coins in his pocket, at which point he magically teleported himself out of the maze. Knowing this, can you determine whether you will gain or lose a coin when you leave the central room through the north door? [b]p5.[/b] Bill and Charlie are playing a game on an infinite strip of graph paper. On Bill’s turn, he marks two empty squares of his choice (not necessarily adjacent) with crosses. Charlie, on his turn, can erase any number of crosses, as long as they are all adjacent to each other. Bill wants to create a line of $2013$ crosses in a row. Can Charlie stop him? [u]Round 2 [/u] [b]p6.[/b] $1000$ non-zero numbers are written around a circle and every other number is underlined. It happens that each underlined number is equal to the sum of its two neighbors and that each non-underlined number is equal to the product of its two neighbors. What could the sum of all the numbers written on the circle be? [b]p7.[/b] A grasshopper is sitting at the edge of a circle of radius $3$ inches. He can hop exactly $4$ inches in any direction, as long as he stays within the circle. Which points inside the circle can the grasshopper reach if he can make as many jumps as he likes? [img]https://cdn.artofproblemsolving.com/attachments/1/d/39b34b2b4afe607c1232f4ce9dec040a34b0c8.png[/img] PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Recall that a plane divides $\mathbb{R}^3$ into two regions, two parallel planes divide it into three regions, and two intersecting planes divide space into four regions. Consider the six planes which the faces of the cube $ABCD-A_1B_1C_1D_1$ lie on, and the four planes that the tetrahedron $ACB_1D_1$ lie on. How many regions do these ten planes split the space into?

Given a graph with $99$ vertices and degrees in $\{81,82,\dots,90\}$, prove that there exist $10$ vertices of this graph with equal degrees and a common neighbour. [i]Proposed by Alireza Alipour[/i]

Given some $m\times n$ table, and some numbers in its fields. You are allowed to change the sign in one row or one column simultaneously. Prove that you can obtain a table, with nonnegative sums over each row and over each column.

In how many ways can $n$ identical balls be distributed to nine persons $A,B,C,D,E,F,G,H,I$ so that the number of balls recieved by $A$ is the same as the total number of balls recieved by $B,C,D,E$ together,.

Let $n$ be an even natural number and let $A$ be the set of all non-zero sequences of length $n$, consisting of numbers $0$ and $1$ (length $n$ binary sequences, except the zero sequence $(0,0,\ldots,0)$). Prove that $A$ can be partitioned into groups of three elements, so that for every triad $\{(a_1,a_2,\ldots,a_n), (b_1,b_2,\ldots,b_n), (c_1,c_2,\ldots,c_n)\}$, and for every $i = 1, 2,\ldots,n$, exactly zero or two of the numbers $a_i, b_i, c_i$ are equal to $1$.

Three grasshoppers are on a straight line. Every second one grasshopper jumps. It jumps across one (but not across two) of the other grasshoppers . Prove that after $1985$ seconds the grasshoppers cannot be in the initial position . (Leningrad Mathematical Olympiad 1985)

The city of Bridge Village has some highways. Highways are closed curves that have intersections with each other or themselves in $4$-way crossroads. Mr.Bridge Lover, mayor of the city, wants to build a bridge on each crossroad in order to decrease the number of accidents. He wants to build the bridges in such a way that in each highway, cars pass above a bridge and under a bridge alternately. By knowing the number of highways determine that this action is possible or not. [i]Proposed by Erfan Salavati[/i]

Prove that one can always mark $50$ points inside of any convex $100$-gon, so that each its vertix is on a straight line connecting some two marked points. (4)

There is a table with $n$ rows and $18$ columns. Each of its cells contains a $0$ or a $1$. The table satisfies the following properties: [list=1] [*]Every two rows are different. [*]Each row contains exactly $6$ cells that contain $1$. [*]For every three rows, there exists a column so that the intersection of the column with the three rows (the three cells) all contain $0$. [/list] What is the greatest possible value of $n$?

$\forall n \in \mathbb{N}$, $P(n)$ denotes the number of the partition of $n$ as the sum of positive integers (disregarding the order of the parts), e.g. since $4 = 1+1+1+1 = 1+1+2 = 1+3 = 2+2 = 4$, so $P(4)=5$. "Dispersion" of a partition denotes the number of different parts in that partitation. And denote $q(n)$ is the sum of all the dispersions, e.g. $q(4)=1+2+2+1+1=7$. $n \geq 1$. Prove that (1) $q(n) = 1 + \sum^{n-1}_{i=1} P(i).$ (2) $1 + \sum^{n-1}_{i=1} P(i) \leq \sqrt{2} \cdot n \cdot P(n)$.

Let $S$ be a set of at least three points of the plane in general position. Prove that there exists a non-intersecting polygon whose vertices are exactly the points of $S$.

A game is played by $n$ girls ($n \geq 2$), everybody having a ball. Each of the $\binom{n}{2}$ pairs of players, is an arbitrary order, exchange the balls they have at the moment. The game is called nice [b]nice[/b] if at the end nobody has her own ball and it is called [b]tiresome[/b] if at the end everybody has her initial ball. Determine the values of $n$ for which there exists a nice game and those for which there exists a tiresome game.

Given $k$ parallel lines $l_1, \ldots, l_k$ and $n_i$ points on the line $l_i, i = 1, 2, \ldots, k$, find the maximum possible number of triangles with vertices at these points.

[b]p1.[/b] There is a string of numbers $1234567891023...910134 ...91012...$ that concatenates the numbers $1$, $2$, $3$, $4$, $5$, $6$, $7$, $8$, $9$, $10$, then $2$, $3$, $4$, $5$, $6$, $7$, $8$, $9$, $10$, $1$, then $3$, $4$, $5$, $6$, $7$, $8$, $9$, $10$, $1$, $2$, and so on. After $10$, $1$, $2$, $3$, $4$, $5$, $6$, $7$, $8$, $9$, the string will be concatenated with $1$, $2$, $3$, $4$, $5$, $6$, $7$, $8$, $9$, $10$ again. What is the $2021$st digit? [b]p2.[/b] Bob really likes eating rice. Bob starts eating at the rate of $1$ bowl of rice per minute. Every minute, the number of bowls of rice Bob eats per minute increases by $1$. Given there are $78$ bowls of rice, find number of minutes Bob needs to finish all the rice. [b]p3.[/b] Suppose John has $4$ fair coins, one red, one blue, one yellow, one green. If John flips all $4$ coins at once, the probability he will land exactly $3$ heads and land heads on both the blue and red coins can be expressed as $\frac{a}{b}$ for relatively prime positive integers $a$, $b$, Find $a + b$. [b]p4.[/b] Three of the sides of an isosceles trapezoid have lengths $1$, $10$, $20$ Find the sum of all possible values of the fourth side. [b]p5.[/b] An number two-three-delightful if and only if it can be expressed as the product of $2$ consecutive integers larger than $1$ and as the product of $3$ consecutive integers larger than $1$. What is the smallest two-three-delightful number? [b]p6.[/b] There are $3$ students total in Justin's online chemistry class. On a $100$ point test, Justin's two classmates scored $4$ and $7$ points. The teacher notices that the class median score is equal to $gcd(x, 42)$, where the positive integer $x$ is Justin's score. Find the sum of all possible values of Justin's score. [b]p7.[/b] Eddie's gym class of $10$ students decides to play ping pong. However, there are only $4$ tables and only $2$ people can play at a table. If $8$ students are randomly selected to play and randomly assigned a partner to play against at a table, the probability that Eddie plays against Allen is $\frac{a}{b}$ for relatively prime positive integers $a$, $b$, Find $a + b$. [b]p8.[/b] Let $S$ be the set of integers $k$ consisting of nonzero digits, such that $300 < k < 400$ and $k - 300$ is not divisible by $11$. For each $k$ in $S$, let $A(k)$ denote the set of integers in $S$ not equal to $k$ that can be formed by permuting the digits of $k$. Find the number of integers $k$ in $S$ such that $k$ is relatively prime to all elements of $A(k)$. [b]p9.[/b] In $\vartriangle ABC$, $AB = 6$ and $BC = 5$. Point $D$ is on side $AC$ such that $BD$ bisects angle $\angle ABC$. Let $E$ be the foot of the altitude from $D$ to $AB$. Given $BE = 4$, find $AC^2$. [b]p10.[/b] For each integer $1 \le n \le 10$, Abe writes the number $2^n + 1$ on a blackboard. Each minute, he takes two numbers $a$ and $b$, erases them, and writes $\frac{ab-1}{a+b-2}$ instead. After $9$ minutes, there is one number $C$ left on the board. The minimum possible value of $C$ can be expressed as $\frac{p}{q}$ for relatively prime positive integers $p, q$. Find $p + q$. [b]p11.[/b] Estimation (Tiebreaker) Let $A$ and $B$ be the proportions of contestants that correctly answered Questions $9$ and $10$ of this round, respectively. Estimate $\left \lfloor \dfrac{1}{(AB)^2} \right \rfloor$ PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

The Hawking Space Agency operates $n-1$ space flights between the $n$ habitable planets of the Local Galaxy Cluster. Each flight has a fixed price which is the same in both directions, and we know that using these flights, we can travel from any habitable planet to any habitable planet. In the headquarters of the Agency, there is a clearly visible board on a wall, with a portrait, containing all the pairs of different habitable planets with the total price of the cheapest possible sequence of flights connecting them. Suppose that these prices are precisely $1,2, ... , \binom{n}{2}$ monetary units in some order. prove that $n$ or $n-2$ is a square number.

A crazy physicist discovered a new kind of particle wich he called an imon, after some of them mysteriously appeared in his lab. Some pairs of imons in the lab can be entangled, and each imon can participate in many entanglement relations. The physicist has found a way to perform the following two kinds of operations with these particles, one operation at a time. (i) If some imon is entangled with an odd number of other imons in the lab, then the physicist can destroy it. (ii) At any moment, he may double the whole family of imons in the lab by creating a copy $I'$ of each imon $I$. During this procedure, the two copies $I'$ and $J'$ become entangled if and only if the original imons $I$ and $J$ are entangled, and each copy $I'$ becomes entangled with its original imon $I$; no other entanglements occur or disappear at this moment. Prove that the physicist may apply a sequence of such operations resulting in a family of imons, no two of which are entangled.

Find all pair $(m,n)$ of integer ($m >1,n \geq 3$) with the following property:If an $n$-gon can be partitioned into $m$ isoceles triangles,then the $n$-gon has two congruent sides.

$n^2$ real numbers are written in a square $n \times n$ table so that the sum of the numbers in each row and column equals zero. A move is to add a row to one column and subtract it from another (so if the entries are $a_{ij}$ and we select row $i$, column $h$ and column $k$, then column h becomes $a_{1h} + a_{i1}, a_{2h} + a_{i2}, ... , a_{nh} + a_{in}$, column $k$ becomes $a_{1k} - a_{i1}, a_{2k} - a_{i2}, ... , a_{nk} - a_{in}$, and the other entries are unchanged). Show that we can make all the entries zero by a series of moves.

a) Prove that $\lfloor x\rfloor$ is odd iff $\Big\lfloor 2\{\frac{x}{2}\}\Big\rfloor=1$ ($\lfloor x\rfloor$ denotes the largest integer less than or equal to $x$ and $\{x\}=x-\lfloor x\rfloor$). b) Let $n$ be a natural number. Find the number of [i]square free[/i] numbers $a$, such that $\Big\lfloor\frac{n}{\sqrt{a}}\Big\rfloor$ is odd. (A natural number is [i]square free[/i] if it's not divisible by any square of a prime number).

We have $2^m$ sheets of paper, with the number $1$ written on each of them. We perform the following operation. In every step we choose two distinct sheets; if the numbers on the two sheets are $a$ and $b$, then we erase these numbers and write the number $a + b$ on both sheets. Prove that after $m2^{m -1}$ steps, the sum of the numbers on all the sheets is at least $4^m$ . [i]Proposed by Abbas Mehrabian, Iran[/i]

[u]Round 1[/u] [b]p1.[/b] If $2m = 200 cm$ and $m \ne 0$, find $c$. [b]p2.[/b] A right triangle has two sides of lengths $3$ and $4$. Find the smallest possible length of the third side. [b]p3.[/b] Given that $20(x + 17) = 17(x + 20)$, determine the value of $x$. [u]Round 2[/u] [b]p4.[/b] According to the Egyptian Metropolitan Culinary Community, food service is delayed on $\frac23$ of flights departing from Cairo airport. On average, if flights with delayed food service have twice as many passengers per flight as those without, what is the probability that a passenger departing from Cairo airport experiences delayed food service? [b]p5.[/b] In a positive geometric sequence $\{a_n\}$, $a_1 = 9$, $a_9 = 25$. Find the integer $k$ such that $a_k = 15$ [b]p6.[/b] In the Delicate, Elegant, and Exotic Music Organization, pianist Hans is selling two types of owers with different prices (per ower): magnolias and myosotis. His friend Alice originally plans to buy a bunch containing $50\%$ more magnolias than myosotis for $\$50$, but then she realizes that if she buys $50\%$ less magnolias and $50\%$ more myosotis than her original plan, she would still need to pay the same amount of money. If instead she buys $50\%$ more magnolias and $50\%$ less myosotis than her original plan, then how much, in dollars, would she need to pay? [u]Round 3[/u] [b]p7.[/b] In square $ABCD$, point $P$ lies on side $AB$ such that $AP = 3$,$BP = 7$. Points $Q,R, S$ lie on sides $BC,CD,DA$ respectively such that $PQ = PR = PS = AB$. Find the area of quadrilateral $PQRS$. [b]p8.[/b] Kristy is thinking of a number $n < 10^4$ and she says that $143$ is one of its divisors. What is the smallest number greater than $143$ that could divide $n$? [b]p9.[/b] A positive integer $n$ is called [i]special [/i] if the product of the $n$ smallest prime numbers is divisible by the sum of the $n$ smallest prime numbers. Find the sum of the three smallest special numbers. [u]Round 4[/u] [b]p10.[/b] In the diagram below, all adjacent points connected with a segment are unit distance apart. Find the number of squares whose vertices are among the points in the diagram and whose sides coincide with the drawn segments. [img]https://cdn.artofproblemsolving.com/attachments/b/a/923e4d2d44e436ccec90661648967908306fea.png[/img] [b]p11.[/b] Geyang tells Junze that he is thinking of a positive integer. Geyang gives Junze the following clues: $\bullet$ My number has three distinct odd digits. $\bullet$ It is divisible by each of its three digits, as well as their sum. What is the sum of all possible values of Geyang's number? [b]p12.[/b] Regular octagon $ABCDEFGH$ has center $O$ and side length $2$. A circle passes through $A,B$, and $O$. What is the area of the part of the circle that lies outside of the octagon? PS. You should use hide for answers. Rounds 5-8 have been posted [url=https://artofproblemsolving.com/community/c3h2936505p26278645]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

In every row of a grid $100 \times n$ is written a permutation of the numbers $1,2 \ldots, 100$. In one move you can choose a row and swap two non-adjacent numbers with difference $1$. Find the largest possible $n$, such that at any moment, no matter the operations made, no two rows may have the same permutations.