Given positive integers $n,k$, $n \ge 2$. Find the minimum constant $c$ satisfies the following assertion: For any positive integer $m$ and a $kn$-regular graph $G$ with $m$ vertices, one could color the vertices of $G$ with $n$ different colors, such that the number of monochrome edges is at most $cm$.

Consider $64$ distinct natural numbers, at most equal to $2012$. Show that it is possible to choose four of them, denoted as $a,b,c,d$ such that $ a+b-c-d$ to be a multiple of $2013$

[b]p1.[/b] Find the smallest positive multiple of $9$ whose digits are all even. [b]p2.[/b] Anika writes down a positive real number $x$ in decimal form. When Nat erases everything to the left of the decimal point, the remaining value is one-fifth of x. Find the sum of all possible values of $x$. [b]p3.[/b] A star-like shape is formed by joining up the midpoints and vertices of a unit square, as shown in the diagram below. Compute the area of this shape. [img]https://cdn.artofproblemsolving.com/attachments/4/8/923b1bf26f6e9872b596e8c81ad1872137f362.png[/img] [b]p4.[/b] Benny and Daria are running a $200$ meter foot race, each at a different constant speed. When Daria finishes the race, she is $14$ meters ahead of Benny. The next time they race, Daria starts 14 meters behind Benny, who starts at the starting line. Both runners run at the same constant speed as in the first race. When Daria reaches the finish line, compute, in centimeters, how far she is ahead of Benny. [b]p5.[/b] In one semester, Ronald takes ten biology quizzes, earning a distinct integer score from $91$ to $100$ on each quiz. He notices that after the first three quizzes, the average of his three most recent scores always increased. Compute the number of ways Ronald could have earned the ten quiz scores. [b]p6.[/b] Ant and Ben are playing a game with stones. They begin with $Z$ stones on the ground. Ant and Ben take turns removing a prime number of stones. Ant moves first. The player who is first unable to make a valid move loses. Find the sum of all positive integers $Z \le 30$ such that Ben can guarantee a win with perfect play. [b]p7.[/b] Let $P$ be a point in a regular octagon as shown in the diagram below. The areas of three triangles are shown. Find the area of the octagon. [img]https://cdn.artofproblemsolving.com/attachments/0/9/6fde77eeafd04614046292175e4b1411158e85.png[/img] [b]p8.[/b] Find the number of ordered triples $(a, b, c)$ of nonnegative integers with $a \le b \le c$ for which $5a + 4b + 6c = 1200$. [b]p9.[/b] Define $$f(x) = \begin{cases} 2x \,\,\,\, ,\,\,\,\, 0 \le x < \frac12 \\ 2 - 2x \,\,\,\, , \,\,\,\, \frac12 \le x \le 1 \end{cases}$$ Michael picks a real number $0 \le x \le 1$. Michael applies $f$ repeatedly to $x$ until he reaches $x$ again. Find the number of real numbers $x$ for which Michael applies $f$ exactly $12$ times. [b]p10.[/b] In $\vartriangle ABC$, let point $H$ be the intersection of its altitudes and let $M$ be the midpoint of side $BC$. Given that $BC = 4$, $MA = 3$, and $\angle HMA = 60^o$, find the circumradius of $\vartriangle ABC$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Show that the edges of a connected simple (no loops and no multiple edges) finite graph can be oriented so that the number of edges leaving each vertex is even if and only if the total number of edges is even

Determine the planar finite configurations $C$ consisting of at least $3$ points, satisfying the following conditions; if $x$ and $y$ are distinct points of $C$, there exist $z\in C$ such that $xyz$ are three vertices of equilateral triangles

You are given some equilateral triangles and squares, all with side length 1, and asked to form convex $n$ sided polygons using these pieces. If both types must be used, what are the possible values of $n$, assuming that there is sufficient supply of the pieces?

In the plane we consider rectangles whose sides are parallel to the coordinate axes and have positive length. Such a rectangle will be called a [i]box[/i]. Two boxes [i]intersect[/i] if they have a common point in their interior or on their boundary. Find the largest $ n$ for which there exist $ n$ boxes $ B_1$, $ \ldots$, $ B_n$ such that $ B_i$ and $ B_j$ intersect if and only if $ i\not\equiv j\pm 1\pmod n$. [i]Proposed by Gerhard Woeginger, Netherlands[/i]

In his bag, Salman has a number of stones. The weight of each stone is not greater than $0.5$ kg and the total weight of the stones is not greater than $2.5$ kg. Prove that Salman can divide his stones into $4$ groups, each group has a total weight not greater than $1$ kg Trần Nam Dũng

A square is dissected into $n$ congruent non-convex polygons whose sides are parallel to the sides of the square, and no two of these polygons are parallel translates of each other. What is the maximum value of $n$? (4)

Alan is standing in the middle of a very long straight road. In addition, there is typically British fog. And he lost his bomb somewhere on the street. He doesn't know how far they are from him away or in which direction it is, and could not see it until it would be no more than $10$ meters away from him. Since he wants to be efficient, he only wants to search at most ten times the distance that the bomb was initially away from him. How he was able to to accomplish this? [hide=original wording]Alan steht mitten auf einer sehr langen geraden Straße. Zudem herrscht typisch britischer Nebel und er hat seine Bombe irgendwo auf der Straße verloren. Er weiß nicht, wie weit sie von ihm entfernt ist oder in welcher Richtung sie liegt, und k¨onnte sie auch erst sehen, wenn sie h¨ochstens 10 Meter von ihm entfernt w¨are. Da er effizient sein will, m¨ochte er maximal eine zehnmal so hohe Distanz auf der Suche zuru¨cklegen, wie die Bombe anfangs von ihm entfernt war. Wie k¨onnte er dies bewerkstelligen¿[/hide]

nic$\kappa$y is drawing kappas in the cells of a square grid. However, he does not want to draw kappas in three consecutive cells (horizontally, vertically, or diagonally). Find all real numbers $d>0$ such that for every positive integer $n,$ nic$\kappa$y can label at least $dn^2$ cells of an $n\times n$ square. [i]Proposed by Mihir Singhal and Michael Kural[/i]

There are $n\geq 2$ people at a meeting. Show that there exist two people at the meeting who have the same number of friends among the persons at the meeting. (It is assumed that if $A$ is a friend of $B,$ then $B$ is a friend of $A;$ moreover, nobody is his own friend.)

Let $n$ be a positive integer. For a finite set $M$ of positive integers and each $i \in \{0,1,..., n-1\}$, we denote $s_i$ the number of non-empty subsets of $M$ whose sum of elements gives remainder $i$ after division by $n$. We say that $M$ is "$n$-balanced" if $s_0 = s_1 =....= s_{n-1}$. Prove that for every odd number $n$ there exists a non-empty $n$-balanced subset of $\{0,1,..., n\}$. For example if $n = 5$ and $M = \{1,3,4\}$, we have $s_0 = s_1 = s_2 = 1, s_3 = s_4 = 2$ so $M$ is not $5$-balanced.(Czech Republic)

In a $1024$ person randomly seeded single elimination tournament bracket, each player has a unique skill rating. In any given match, the player with the higher rating has a $\frac34$ chance of winning the match. What is the probability the second lowest rated player wins the tournament?

In an $8\times 8$ chessboard, the rows are numbers from $1$ to $8$ and the columns are labelled from $a$ to $h$. In a two-player game on this chessboard, the first player has a White Rook which starts on the square $b2$, and the second player has a Black Rook which starts on the square $c4$. The two players take turns moving their rooks. In each move, a rook lands on another square in the same row or the same column as its starting square. However, that square cannot be under attack by the other rook, and cannot have been landed on before by either rook. The player without a move loses the game. Which player has a winning strategy?

[u]Round 9[/u] [b]p25.[/b] Let $a$, $b$, and $c$ be positive numbers with $a +b +c = 4$. If $a,b,c \le 2$ and $$M =\frac{a^3 +5a}{4a^2 +2}+\frac{b^3 +5b}{4b^2 +2}+\frac{c^3 +5c}{4c^2 +2},$$ then find the maximum possible value of $\lfloor 100M \rfloor$. [b]p26.[/b] In $\vartriangle ABC$, $AB = 15$, $AC = 16$, and $BC = 17$. Points $E$ and $F$ are chosen on sides $AC$ and $AB$, respectively, such that $CE = 1$ and $BF = 3$. A point $D$ is chosen on side $BC$, and let the circumcircles of $\vartriangle BFD$ and $\vartriangle CED$ intersect at point $P \ne D$. Given that $\angle PEF = 30^o$, the length of segment $PF$ can be expressed as $\frac{m}{n}$ . Find $m+n$. [b]p27.[/b] Arnold and Barnold are playing a game with a pile of sticks with Arnold starting first. Each turn, a player can either remove $7$ sticks or $13$ sticks. If there are fewer than $7$ sticks at the start of a player’s turn, then they lose. Both players play optimally. Find the largest number of sticks under $200$ where Barnold has a winning strategy [u]Round 10[/u] [b]p28.[/b] Let $a$, $b$, and $c$ be positive real numbers such that $\log_2(a)-2 = \log_3(b) =\log_5(c)$ and $a +b = c$. What is $a +b +c$? [b]p29.[/b] Two points, $P(x, y)$ and $Q(-x, y)$ are selected on parabola $y = x^2$ such that $x > 0$ and the triangle formed by points $P$, $Q$, and the origin has equal area and perimeter. Find $y$. [b]p30.[/b] $5$ families are attending a wedding. $2$ families consist of $4$ people, $2$ families consist of $3$ people, and $1$ family consists of $2$ people. A very long row of $25$ chairs is set up for the families to sit in. Given that all members of the same family sit next to each other, let the number of ways all the people can sit in the chairs such that no two members of different families sit next to each other be $n$. Find the number of factors of $n$. [u]Round 11[/u] [b]p31.[/b] Let polynomial $P(x) = x^3 +ax^2 +bx +c$ have (not neccessarily real) roots $r_1$, $r_2$, and $r_3$. If $2ab = a^3 -20 = 6c -21$, then the value of $|r^3_1+r^3_2+r^3_3|$ can be written as $\frac{m}{n}$ where $m$ and $n$ are relatively prime positive integers. Find the value of $m+n$. [b]p32.[/b] In acute $\vartriangle ABC$, let $H$, $I$ , $O$, and $G$ be the orthocenter, incenter, circumcenter, and centroid of $\vartriangle ABC$, respectively. Suppose that there exists a circle $\omega$ passing through $B$, $I$ , $H$, and $C$, the circumradius of $\vartriangle ABC$ is $312$, and $OG = 80$. Let $H'$, distinct from $H$, be the point on $\omega$ such that $\overline{HH'}$ is a diameter of $\omega$. Given that lines $H'O$ and $BC$ meet at a point $P$, find the length $OP$. [b]p33.[/b] Find the number of ordered quadruples $(x, y, z,w)$ such that $0 \le x, y, z,w \le 1000$ are integers and $$x!+ y! =2^z \cdot w!$$ holds (Note: $0! = 1$). [u]Round 12[/u] [b]p34.[/b] Let $Z$ be the product of all the answers from the teams for this question. Estimate the number of digits of $Z$. If your estimate is $E$ and the answer is $A$, your score for this problem will be $$\max \left( 0, \lceil 15- |A-E| \rceil \right).$$ Your answer must be a positive integer. [b]p35.[/b] Let $N$ be number of ordered pairs of positive integers $(x, y)$ such that $3x^2 -y^2 = 2$ and $x < 2^{75}$. Estimate $N$. If your estimate is $E$ and the answer is $A$, your score for this problem will be $$\max \left( 0, \lceil 15- 2|A-E| \rceil \right).$$ [b]p36.[/b] $30$ points are located on a circle. How many ways are there to draw any number of line segments between the points such that none of the line segments overlap and none of the points are on more than one line segment? (It is possible to draw no line segments). If your estimate is $E$ and the answer is $A$, your score for this problem will be $$\max \left( 0, \left \lceil 15- \ln \frac{A}{E} \right \rceil \right).$$ PS. You should use hide for answers. Rounds 1-4 have been posted [url=https://artofproblemsolving.com/community/c3h3166472p28814057]here [/url] and 5-8 [url=https://artofproblemsolving.com/community/c3h3166476p28814111]here[/url].. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Teeradet is a student in a class with $19$ people. He and his classmates form clubs, so that each club must have at least one student, and each student can be in more than one club. Suppose that any two clubs differ by at least one student, and all clubs Teeradet is in have an odd number of students. What is the maximum possible number of clubs?

On the sides of triangle $\vartriangle ABC$, $17$ points are added, so that there are $20$ points in total (including the vertices of $\vartriangle ABC$.) What is the maximum possible number of (nondegenerate) triangles that can be formed by these points.

In how many ways can we place the numbers from $1$ to $100$ in a $2\times 50$ rectangle (divided into $100$ unit squares) so that any two consecutive numbers are always placed in squares with a common side?

Is it possible to divide a $6 \times 6$ chessboard into $18$ rectangles, each either $1 \times 2$ or $2 \times 1$, and to draw exactly one diagonal on each rectangle such that no two of these diagonals have a common endpoint? (A Shapovalov)

Let $n$ be an odd integer. Placing no more than one $X$ in each cell of a $n \times n$ grid, what is the greatest number of $X$ 's that can be put on the grid without getting $n$ $X$'s together vertically, horizontally or diagonally? [list=1] [*] $2{{n}\choose {2}}$ [*] ${{n}\choose {2}}$ [*] $2n $ [*] $2{{n}\choose {2}}-1$ [/list]

Consider two finite sequences of real numbers \( a_1, a_2, \dots, a_n \) and \( b_1, b_2, \dots, b_n \). Let \( \alpha(x) = \#\{i | a_i = x \} \) and \( \beta(x) = \#\{i | b_i = -x \} \). Prove that there exists a permutation \( \sigma \in S_n \) (the symmetric group of \( n \) elements) such that \( a_{\sigma(i)} + b_i \neq 0 \) for all \( i = 1, \dots, n \) if and only if \( \alpha(x) + \beta(x) \leq n \) for all \( x \in \mathbb{R} \).

Determine the greatest positive integer $k$ that satisfies the following property: The set of positive integers can be partitioned into $k$ subsets $A_1, A_2, \ldots, A_k$ such that for all integers $n \geq 15$ and all $i \in \{1, 2, \ldots, k\}$ there exist two distinct elements of $A_i$ whose sum is $n.$ [i]Proposed by Igor Voronovich, Belarus[/i]

You have to divide a square paper into three parts, by two straight cuts, so that by locating these parts properly, without gaps or overlaps, an obtuse triangle is formed. Indicate how to cut the square and how to assemble the triangle with the three parts.

Given two positive integers $r > s$, and let $F$ be an infinite family of sets, each of size $r$, no two of which share fewer than $s$ elements. Prove that there exists a set of size $r -1$ that shares at least $s$ elements with each set in $F$.