For a set $A$ of integers, define $f(A)=\{x^2+xy+y^2: x,y\in A\}$. Is there a constant $c$ such that for all positive integers $n$, there exists a set $A$ of size $n$ such that $|f(A)|\le cn$? [i]David Yang.[/i]

We call any eight squares in a diagonal of a chessboard as a fence. The rook is moved on the chessboard in such way that he stands neither on each square over one time nor on the squares of the fences (the squares which the rook passes is not considered ones it has stood on). Then what is the maximum number of times which the rook jumped over the fence?

Let $G$ be a complete bipartite graph with partition sets $A$ and $B$ of sizes $km$ and $kn$, respectively. The edges of $G$ are colored in $k$ colors. Prove that there exists a monochromatic connected component with at least $m+n$ vertices (which means that there exists a color and a set of vertices, such that between any two of them, there is a path consisting of edges only in that color).

For any column and any row in a rectangular numerical table, the product of the sum of the numbers in a column by the sum of the numbers in a row is equal to the number at the intersection of the column and the row. Prove that either the sum of all the numbers in the table is equal to $1$ or all the numbers are equal to $0$.

There are five cities $A,B,C,D,E$ on a certain island. Each city is connected to every other city by road. In how many ways can a person starting from city $A$ come back to $A$ after visiting some cities without visiting a city more than once and without taking the same road more than once? (The order in which he visits the cities also matters: e.g., the routes $A \to B \to C \to A$ and $A\to C \to B \to A$ are different.)

Find all positive integers $ n$ for which the numbers in the set $ S \equal{} \{1,2, \ldots,n \}$ can be colored red and blue, with the following condition being satisfied: The set $ S \times S \times S$ contains exactly $ 2007$ ordered triples $ \left(x, y, z\right)$ such that: [b](i)[/b] the numbers $ x$, $ y$, $ z$ are of the same color, and [b](ii)[/b] the number $ x \plus{} y \plus{} z$ is divisible by $ n$. [i]Author: Gerhard Wöginger, Netherlands[/i]

[b]p1.[/b] Farmer John wants to bring some cows to a pasture with grass that grows at a constant rate. Initially, the pasture has some nonzero amount of grass and it will stop growing if there is no grass left. The pasture sustains $100$ cows for ten days. The pasture can also sustain $100$ cows for five days, and then $120$ cows for three more days. If cows eat at a constant rate, fund the maximum number of cows Farmer John can bring to the pasture so that they can be sustained indefinitely. [b]p2.[/b] Sam is learning basic arithmetic. He may place either the operation $+$ or $-$ in each of the blank spots between the numbers below: $$5\,\, \_ \,\, 8\,\, \_ \,\,9\,\, \_ \,\,7\,\,\_ \,\,2\,\,\_ \,\,3$$ In how many ways can he place the operations so the result is divisible by $3$? [b]p3.[/b] Will loves the color blue, but he despises the color red. In the $5\times 6$ rectangular grid below, how many rectangles are there containing at most one red square and with sides contained in the gridlines? [img]https://cdn.artofproblemsolving.com/attachments/1/7/7ce55bdc9e05c7c514dddc7f8194f3031b93c4.png[/img] [b]p4.[/b] Let $r_1, r_2, r_3$ be the three roots of a cubic polynomial $P(x)$. Suppose that $$\frac{P(2) + P(-2)}{P(0)}= 200.$$ If $\frac{1}{r_1r_2}+ \frac{1}{r_2r_3}+\frac{1}{r_3r_1}= \frac{m}{n}$ for relatively prime positive integers $m$ and $n$, compute $m + n$. [b]p5.[/b] Consider a rectangle $ABCD$ with $AB = 3$ and $BC = 1$. Let $O$ be the intersection of diagonals $AC$ and $BD$. Suppose that the circumcircle of $ \vartriangle ADO$ intersects line $AB$ again at $E \ne A$. Then, the length $BE$ can be written as $\frac{m}{n}$ for relatively prime positive integers $m$ and $n$. Find $m + n$. [b]p6.[/b] Let $ABCD$ be a square with side length $100$ and $M$ be the midpoint of side $AB$. The circle with center $M$ and radius $50$ intersects the circle with center $D$ and radius $100$ at point $E$. $CE$ intersects $AB$ at $F$. If $AF = \frac{m}{n}$ for relatively prime positive integers $m$ and $n$, find $m + n$. [b]p7.[/b] How many pairs of real numbers $(x, y)$, with $0 < x, y < 1$ satisfy the property that both $3x + 5y$ and $5x + 2y$ are integers? [b]p8.[/b] Sebastian is coloring a circular spinner with $4$ congruent sections. He randomly chooses one of four colors for each of the sections. If two or more adjacent sections have the same color, he fuses them and considers them as one section. (Sections meeting at only one point are not adjacent.) Suppose that the expected number of sections in the final colored spinner is equal to $\frac{m}{n}$ for relatively prime positive integers $m$ and $n$. Compute $m + n$. [b]p9.[/b] Let $ABC$ be a triangle and $D$ be a point on the extension of segment $BC$ past $C$. Let the line through $A$ perpendicular to $BC$ be $\ell$. The line through $B$ perpendicular to $AD$ and the line through $C$ perpendicular to $AD$ intersect $\ell$ at $H_1$ and $H_2$, respectively. If $AB = 13$, $BC = 14$, $CA = 15$, and $H_1H_2 = 1001$, find $CD$. [b]p10.[/b] Find the sum of all positive integers $k$ such that $$\frac21 -\frac{3}{2 \times 1}+\frac{4}{3\times 2\times 1} + ...+ (-1)^{k+1} \frac{k+1}{k\times (k - 1)\times ... \times 2\times 1} \ge 1 + \frac{1}{700^3}$$ PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

[b]p1.[/b] Find the largest possible number of consecutive $9$’s in which an integer between $10,000,000$ and $13,371,337$ can end. For example, $199$ ends in two $9$’s, while $92,999$ ends in three $9$’s. [b]p2.[/b] Let $ABCD$ be a square of side length $2$. Equilateral triangles $ABP$, $BCQ$, $CDR$, and $DAS$ are constructed inside the square. Compute the area of quadrilateral $PQRS$. [b]p3.[/b] Evaluate the expression $7 \cdot 11 \cdot 13 \cdot 1003 - 3 \cdot 17 \cdot 59 \cdot 331$. [b]p4.[/b] Compute the number of positive integers $c$ such that there is a non-degenerate obtuse triangle with side lengths $21$, $29$, and $c$. [b]p5.[/b] Consider a $5\times 5$ board, colored like a chessboard, such that the four corners are black. Determine the number of ways to place $5$ rooks on black squares such that no two of the rooks attack one another, given that the rooks are indistinguishable and the board cannot be rotated. (Two rooks attack each other if they are in the same row or column.) [b]p6.[/b] Let $ABCD$ be a trapezoid of height $6$ with bases $AB$ and $CD$. Suppose that $AB = 2$ and $CD = 3$, and let $F$ and $G$ be the midpoints of segments $AD$ and $BC$, respectively. If diagonals $AC$ and $BD$ intersect at point $E$, compute the area of triangle $FGE$. [b]p7.[/b] A regular octahedron is a solid with eight faces that are congruent equilateral triangles. Suppose that an ant is at the center of one face of a regular octahedron of edge length $10$. The ant wants to walk along the surface of the octahedron to reach the center of the opposite face. (Two faces of an octahedron are said to be opposite if they do not share a vertex.) Determine the minimum possible distance that the ant must walk. [b]p8.[/b] Let $A_1A_2A_3$, $B_1B_2B_3$, $C_1C_2C_3$, and $D_1D_2D_3$ be triangles in the plane. All the sides of the four triangles are extended into lines. Determine the maximum number of pairs of these lines that can meet at $60^o$ angles. [b]p9.[/b] For an integer $n$, let $f_n(x)$ denote the function $f_n(x) =\sqrt{x^2 - 2012x + n}+1006$. Determine all positive integers $a$ such that $f_a(f_{2012}(x)) = x$ for all $x \ge 2012$. [b]p10.[/b] Determine the number of ordered triples of integers $(a, b, c)$ such that $(a + b)(b + c)(c + a) = 1800$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

[u]Round 1[/u] [b]p1.[/b] In a chemical lab there are three vials: one that can hold $1$ oz of fluid, another that can hold $2$ oz, and a third that can hold $3$ oz. The first is filled with grape juice, the second with sulfuric acid, and the third with water. There are also $3$ empty vials in the cupboard, also of sizes $1$ oz, $2$ oz, and $3$ oz. In order to save the world with grape-flavored acid, James Bond must make three full bottles, one of each size, filled with a mixture of all three liquids so that each bottle has the same ratio of juice to acid to water. How can he do this, considering he was silly enough not to bring any equipment? [b]p2.[/b] Twelve people, some are knights and some are knaves, are sitting around a table. Knaves always lie and knights always tell the truth. At some point they start up a conversation. The first person says, “There are no knights around this table.” The second says, “There is at most one knight at this table.” The third – “There are at most two knights at the table.” And so on until the $12$th says, “There are at most eleven knights at the table.” How many knights are at the table? Justify your answer. [b]p3.[/b] Aquaman has a barrel divided up into six sections, and he has placed a red herring in each. Aquaman can command any fish of his choice to either ‘jump counterclockwise to the next sector’ or ‘jump clockwise to the next sector.’ Using a sequence of exactly $30$ of these commands, can he relocate all the red herrings to one sector? If yes, show how. If no, explain why not. [img]https://cdn.artofproblemsolving.com/attachments/0/f/956f64e346bae82dee5cbd1326b0d1789100f3.png[/img] [b]p4.[/b] Is it possible to place $13$ integers around a circle so that the sum of any $3$ adjacent numbers is exactly $13$? [b]p5.[/b] Two girls are playing a game. The first player writes the letters $A$ or $B$ in a row, left to right, adding one letter on her turn. The second player switches any two letters after each move by the first player (the letters do not have to be adjacent), or does nothing, which also counts as a move. The game is over when each player has made $2011$ moves. Can the second player plan her moves so that the resulting letters form a palindrome? (A palindrome is a sequence that reads the same forward and backwards, e.g. $AABABAA$.) [u]Round 2[/u] [b]p6.[/b] Eight students participated in a math competition. There were eight problems to solve. Each problem was solved by exactly five people. Show that there are two students who solved all eight problems between them. [b]p7.[/b] There are $3n$ checkers of three different colors: $n$ red, $n$ green and $n$ blue. They were used to randomly fill a board with $3$ rows and $n$ columns so that each square of the board has one checker on it. Prove that it is possible to reshuffle the checkers within each row so that in each column there are checkers of all three colors. Moving checkers to a different row is not allowed. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

The table size $8 \times 8$ contains the numbers $1,2,...,8$ in each amount as much as you want provided that two numbers that are adjacent vertically, horizontally, diagonally are relative primes. Prove that some number appears in the table at least $12$ times. [i](PP-nine)[/i]

Determine the maximal length $L$ of a sequence $a_1,\dots,a_L$ of positive integers satisfying both the following properties: [list=disc] [*]every term in the sequence is less than or equal to $2^{2023}$, and [*]there does not exist a consecutive subsequence $a_i,a_{i+1},\dots,a_j$ (where $1\le i\le j\le L$) with a choice of signs $s_i,s_{i+1},\dots,s_j\in\{1,-1\}$ for which \[s_ia_i+s_{i+1}a_{i+1}+\dots+s_ja_j=0.\] [/list]

A white equilateral triangle $T$ with side length $2022$ is divided into equilateral triangles with side $1$ (cells) by lines parallel to the sides of $T$. We'll call two cells $\textit{adjacent}$ if they have a common vertex. Ivan colours some of the cells in black. Without knowing which cells are black, Peter chooses a set $S$ of cells and Ivan tells him the parity of the number of black cells in $S$. After knowing this, Peter is able to determine the parity of the number of $\textit{adjacent}$ cells of different colours. Find all possible cardinalities of $S$ such that this is always possible independent of how Ivan chooses to colour the cells.

SQUARING OFF: Master Chief and Samus Aran take turns firing rockets at one another from across the Cartesian plane. Master Chief’s movement is restricted to lattice points within the $10\times 10$ square with vertices $(0,0)$, $(0,10)$, $(10,0)$, and $(10,10)$, while Samus Aran’s movement is restricted to lattice points inside the $10\times 10$ square with vertices $(0,0)$, $(-10,0)$, $(0,-10)$, and $(-10,-10)$. Neither player can be located on or beyond the border of his or her square. Both players randomly choose a lattice point at which they begin the game, and do not move the rest of the game (until either they are killed or kill the other player). Each player’s turn consists of firing a rocket, targeted at a specific undestroyed lattice point inside the border of the opponent’s movement square, which hits immediately. When a rocket hits its intended lattice point, it explodes, destroying the surrounding $3\times 3$ square ($8$ additional adjacent lattice points). The game ends when one player is hit by a rocket (when the player is located within the $3\times 3$ grid hit by a rocket). If the highest possible probability that Samus Aran wins the game in three turns or less, assuming Master Chief goes first, is expressed as $a/b$, where $a$ and $b$ are relatively prime integers, find $a+b$.

$(BEL 6)$ Evaluate $\left(\cos\frac{\pi}{4} + i \sin\frac{\pi}{4}\right)^{10}$ in two different ways and prove that $\dbinom{10}{1}-\dbinom{10}{3}+\frac{1}{2}\dbinom{10}{5}=2^4$

Members of the State Duma formed factions in such a way that for any two fractions $A $ and $B$ (not necessarily different), $\overline{A \cup B}$ is also faction ($\overline{C}$ denotes the set of all members of the Duma, not including in $C$). Prove that for any two factions $A$ and $B$, $A \cup B$ is also a faction.

Given integers $0 < a_1 < a_2 <... < a_{101} < 5050$, prove that one can always choose for different numbers $a_k,a_l,a_m,a_n$ such that $5050 | a_k +a_l -a_m -a_n$

Fifteen stones are placed on a $4 \times 4$ board, one in each cell, the remaining cell being empty. Whenever two stones are on neighbouring cells (having a common side), one may jump over the other to the opposite neighbouring cell, provided this cell is empty. The stone jumped over is removed from the board. For which initial positions of the empty cell is it possible to end up with exactly one stone on the board?

Let $a$ and $b$ be distinct positive integers. The following infinite process takes place on an initially empty board. [list=i] [*] If there is at least a pair of equal numbers on the board, we choose such a pair and increase one of its components by $a$ and the other by $b$. [*] If no such pair exists, we write two times the number $0$. [/list] Prove that, no matter how we make the choices in $(i)$, operation $(ii)$ will be performed only finitely many times. Proposed by [I]Serbia[/I].

Suppose we have a $8\times8$ chessboard. Each edge have a number, corresponding to number of possibilities of dividing this chessboard into $1\times2$ domino pieces, such that this edge is part of this division. Find out the last digit of the sum of all these numbers. (Day 1, 3rd problem author: Michal Rolínek)

Determine the largest positive integer $k$ for which there exists a simple graph $G$ of $2014$ vertices that simultaneously satisfies the following conditions: $a)$ $G$ does not contain triangles $b)$ For each $i$ between $1$ and $k$, inclusive, at least one vertex of $G$ has degree $i$ $c)$ No vertex of $G$ has a degree greater than $k$

Find the smallest integer $n\ge3$ for which there exists an $n$-gon and a point within it such that, if a light bulb is placed at that point, on each side of the polygon there will be a point that is not lightened. Show that for this smallest value of $n$ there always exist two points within the $n$-gon such that the bulbs placed at these points will lighten up the whole perimeter of the $n$-gon.

[b][u]BdMO National 2015 Secondary Problem 1.[/u][/b] A crime is committed during the hartal.There are four witnesses.The witnesses are logicians and make the following statement: Witness [b]One[/b] said exactly one of the four witnesses is a liar. Witness [b]Two[/b] said exactly two of the four witnesses is a liar. Witness [b]Three[/b] said exactly three of the four witnesses is a liar. Witness [b]Four[/b] said exactly four of the four witnesses is a liar. Assume that each of the statements is either true or false.How many of the winesses are liars?

Let $n \geq 2$ be an integer. Let $S$ be a subset of $\{1,2,\dots,n\}$ such that $S$ neither contains two elements one of which divides the other, nor contains two elements which are coprime. What is the maximal possible number of elements of such a set $S$?

In an $8$-square board -like the one in the figure- there is initially one checker in each square. $ \begin{tabular}{ | l | c | c |c | c| c | c | c | r| } \hline & & & & & & & \\ \hline \end{tabular} $ A move consists of choosing two tokens and moving one of them one square to the right and the other one one square to the left. If after $4$ moves the $8$ checkers are distributed in only $2$ boxes, determine what those boxes can be and how many checkers are in each one.

Is it possible to tile an $8\times8$ board with dominoes ($2\times1$ tiles) so that no two dominoes form a $2\times2$ square?