How many sums $$x_1+x_2+x_3, \ \ 1\leq x_j\leq 300, \ j=1,2,3$$ are multiples of $3$;

Initially, ten consecutive natural numbers are written on the board. In one turn, you may pick any two numbers from the board (call them $a$ and $b$) and replace them with the numbers $a^2-2011b^2$ and $ab$. After several turns, there were no initial numbers left on the board. Could there, at this point, be again, ten consecutive natural numbers?

A convex polyhedron has $m$ triangular faces (there can be faces of other kind too). From each vertex there are exactly 4 edges. Find the least possible value of $m$.

Kate bakes a $20$-inch by $18$-inch pan of cornbread. The cornbread is cut into pieces that measure $2$ inches by $2$ inches. How many pieces of cornbread does the pan contain? $ \textbf{(A) }90 \qquad \textbf{(B) }100 \qquad \textbf{(C) }180 \qquad \textbf{(D) }200 \qquad \textbf{(E) }360 \qquad $

Determine the smallest positive integer $n$ such that, for any coloring of the elements of the set $\{2,3,...,n\}$ with two colors, the equation $x + y = z$ has a monochrome solution with $x \ne y$. (We say that the equation $x + y = z$ has a monochrome solution if there exist $a, b, c$ distinct, having the same color, such that $a + b = c$.)

Peter added a positive integer $M{}$ to a positive integer $N{}$ and noticed that the sum of the digits of the resulting integer is the same as the sum of the digits of $N{}$. Then he added $M{}$ to the result again, and so on. Will Peter eventually get a number with the same digit sum as the number $N{}$ again?

Let $a > 1$ be a positive integer and $d > 1$ be a positive integer coprime to $a$. Let $x_1=1$, and for $k\geq 1$, define $$x_{k+1} = \begin{cases} x_k + d &\text{if } a \text{ does not divide } x_k \\ x_k/a & \text{if } a \text{ divides } x_k \end{cases}$$ Find, in terms of $a$ and $d$, the greatest positive integer $n$ for which there exists an index $k$ such that $x_k$ is divisible by $a^n$.

Charles has some marbles. Their colors are either red, green, or blue. The total number of red and green marbles is $38\%$ more than that of blue marbles. The total number of green and blue marbles is $150\%$ more than that of red marbles. If the total number of blue and red marbles is more than that of green marbles by $n\%$, find $n$. [i]Proposed by [b]stayhomedomath[/b][/i]

[b]p1.[/b] The Evergreen School booked buses for a field trip. Altogether, $138$ people went to West Lake, while $115$ people went to East Lake. The buses all had the same number of seats and every bus has more than one seat. All seats were occupied and everybody had a seat. How many seats were on each bus? [b]p2.[/b] In New Scotland there are three kinds of coins: $1$ cent, $6$ cent, and $36$ cent coins. Josh has $99$ of the $36$-cent coins (and no other coins). He is allowed to exchange a $36$ cent coin for $6$ coins of $6$ cents, and to exchange a $6$ cent coin for $6$ coins of $1$ cent. Is it possible that after several exchanges Josh will have $500$ coins? [b]p3.[/b] Find all solutions $a, b, c, d, e, f, g, h$ if these letters represent distinct digits and the following multiplication is correct: $\begin{tabular}{ccccc} & & a & b & c \\ + & & & d & e \\ \hline & f & a & g & c \\ x & b & b & h & \\ \hline f & f & e & g & c \\ \end{tabular}$ [b]p4.[/b] Is it possible to find a rectangle of perimeter $10$ m and cut it in rectangles (as many as you want) so that the sum of the perimeters is $500$ m? [b]p5.[/b] The picture shows a maze with chambers (shown as circles) and passageways (shown as segments). A cat located in chamber $C$ tries to catch a mouse that was originally in the chamber $M$. The cat makes the first move, moving from chamber $C$ to one of the neighboring chambers. Then the mouse moves, then the cat, and so forth. At each step, the cat and the mouse can move to any neighboring chamber or not move at all. The cat catches the mouse by moving into the chamber currently occupied by the mouse. Can the cat get the mouse? [img]https://cdn.artofproblemsolving.com/attachments/9/9/25f61e1499ff1cfeea591cb436d33eb2cdd682.png[/img] PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

A triangular array of $2016$ coins has $1$ coin in the first row, $2$ coins in the second row, $3$ coins in the third row, and so on up to $N$ coins in the $N$th row. What is the sum of the digits of $N$? $\textbf{(A)}\ 6\qquad\textbf{(B)}\ 7\qquad\textbf{(C)}\ 8\qquad\textbf{(D)}\ 9\qquad\textbf{(E)}\ 10$

An [i]anti-Pascal[/i] triangle is an equilateral triangular array of numbers such that, except for the numbers in the bottom row, each number is the absolute value of the difference of the two numbers immediately below it. For example, the following is an anti-Pascal triangle with four rows which contains every integer from $1$ to $10$. \[\begin{array}{ c@{\hspace{4pt}}c@{\hspace{4pt}} c@{\hspace{4pt}}c@{\hspace{2pt}}c@{\hspace{2pt}}c@{\hspace{4pt}}c } \vspace{4pt} & & & 4 & & & \\\vspace{4pt} & & 2 & & 6 & & \\\vspace{4pt} & 5 & & 7 & & 1 & \\\vspace{4pt} 8 & & 3 & & 10 & & 9 \\\vspace{4pt} \end{array}\] Does there exist an anti-Pascal triangle with $2018$ rows which contains every integer from $1$ to $1 + 2 + 3 + \dots + 2018$? [i]Proposed by Morteza Saghafian, Iran[/i]

There are $11$ empty boxes. In one move, a player can put one coin in each of some $10$ boxes. Two people play, taking turns. The winner is the player after whose move in one of the boxes there will be $21$ coins. Who has a winning strategy?

[u]Round 1 [/u] [b]p1. [/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 12th says, “There are at most eleven knights at the table.” How many knights are at the table? Justify your answer. [b]p2.[/b] Show that in the sequence $10017$, $100117$, $1001117$, $...$ all numbers are divisible by $53$. [b]p3.[/b] Harry and Draco have three wands: a bamboo wand, a willow wand, and a cherry wand, all of the same length. They must perform a spell wherein they take turns picking a wand and breaking it into three parts – first Harry, then Draco, then Harry again. But in order for the spell to work, Harry has to make sure it is possible to form three triangles out of the pieces of the wands, where each triangle has a piece from each wand. How should he break the wands to ensure the success of the spell? [b]p4.[/b] A $2\times 2\times 2$ cube has $4$ equal squares on each face. The squares that share a side are called neighbors (thus, each square has $4$ neighbors – see picture). Is it possible to write an integer in each square in such a way that the sum of each number with its $4$ neighbors is equal to $13$? If yes, show how. If no, explain why not. [img]https://cdn.artofproblemsolving.com/attachments/8/4/0f7457f40be40398dee806d125ba26780f9d3a.png[/img] [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] A red square is placed on a table. $2010$ white squares, each the same size as the red square, are then placed on the table in such a way that the red square is fully covered and the sides of every white square are parallel to the sides of the red square. Is it always possible to remove one of the white squares so the red square remains completely covered? [b]p7.[/b] A computer starts with a given positive integer to which it randomly adds either $54$ or $77$ every second and prints the resulting sum after each addition. For example, if the computer is given the number $1$, then a possible output could be: $1$, $55$, $109$, $186$, $…$ Show that after finitely many seconds the computer will print a number whose last two digits are the same. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $n$ be a positive integer relatively prime to $6$. We paint the vertices of a regular $n$-gon with three colours so that there is an odd number of vertices of each colour. Show that there exists an isosceles triangle whose three vertices are of different colours.

Let $p$ be a prime number such that $p\equiv 1\pmod{4}$. Determine $\sum_{k=1}^{\frac{p-1}{2}}\left \lbrace \frac{k^2}{p} \right \rbrace$, where $\{x\}=x-[x]$.

Prove that if $A$ is a commutative finite ring with at least two elements and $n$ is a positive integer, then there exists a polynomial of degree $n$ with coefficients in $A$ which does not have any roots in $A$.

The circle $\Gamma$ and the line $\ell$ have no common points. Let $AB$ be the diameter of $\Gamma$ perpendicular to $\ell$, with $B$ closer to $\ell$ than $A$. An arbitrary point $C\not= A$, $B$ is chosen on $\Gamma$. The line $AC$ intersects $\ell$ at $D$. The line $DE$ is tangent to $\Gamma$ at $E$, with $B$ and $E$ on the same side of $AC$. Let $BE$ intersect $\ell$ at $F$, and let $AF$ intersect $\Gamma$ at $G\not= A$. Let $H$ be the reflection of $G$ in $AB$. Show that $F,C$, and $H$ are collinear.

In the unit squares of a transparent $1 \times 100$ tape, numbers $1,2,\cdots,100$ are written in the ascending order.We fold this tape on it's lines with arbitrary order and arbitrary directions until we reach a $1 \times1$ tape with $100$ layers.A permutation of the numbers $1,2,\cdots,100$ can be seen on the tape, from the top to the bottom. Prove that the number of possible permutations is between $2^{100}$ and $4^{100}$. ([i]e.g.[/i] We can produce all permutations of numbers $1,2,3$ with a $1\times3$ tape) [i]Proposed by Morteza Saghafian[/i]

A subset $S$ of the set of integers 0 - 99 is said to have property $A$ if it is impossible to fill a crossword-puzzle with 2 rows and 2 columns with numbers in $S$ (0 is written as 00, 1 as 01, and so on). Determine the maximal number of elements in the set $S$ with the property $A.$

Given a triangle $ABC$, let $P$ be a point inside the triangle such that $| BP | > | AP |, | BP | > | CP |$. Show that $\angle ABC <90^o$

Let $a_{1},a_{2},...,a_{n+1}(n>1)$ are positive real numbers such that $a_{2}-a_{1}=a_{3}-a_{2}=...=a_{n+1}-a_{n}$. Prove that $\sum_{k=2}^{n}\frac{1}{a_{k}^{2}}\leq\frac{n-1}{2}.\frac{a_{1}a_{n}+a_{2}a_{n+1}}{a_{1}a_{2}a_{n}a_{n+1}}$

For a given quadrilateral $A_1A_2B_1B_2,$ a point $P$ is called [i]phenomenal[/i], if line segments $A_1A_2$ and $B_1B_2$ subtend the same angle at point $P$ (i.e. triangles $PA_1A_2$ and $PB_1B_2$ which can be also also degenerate have equal inner angles at point $P$ disregarding orientation). Three non-collinear points, $A_1,A_2,$ and $B_1$ are given in the plane. Prove that it is possible to find a disc in the plane such that for every point $B_2$ on the disc, the quadrilateral $A_1A_2B_1B_2$ is convex and it is possible to construct seven distinct phenomenal points (with respect to $A_1A_2B_1B_2$) only using a right ruler. With a right ruler the following two operations are allowed: [list=1] [*]Given two points it is possible to draw the straight line connecting them; [*]Given a point and a straight line, it is possible to draw the straight line passing through the given point which is perpendicular to the given line. [/list] [i]Proposed by Á. Bán-Szabó, Budapest[/i]

Several points on the plane are given, no three of them lie on the same line. Some of these points are connected by line segments. Assume that any line that does not pass through any of these points intersects an even number of these segments. Prove that from each point exits an even number of the segments.

The logarithm of $ 27\sqrt[4]{9}\sqrt[3]{9}$ to the base $ 3$ is: $ \textbf{(A)}\ 8\frac{1}{2} \qquad\textbf{(B)}\ 4\frac{1}{6} \qquad\textbf{(C)}\ 5 \qquad\textbf{(D)}\ 3 \qquad\textbf{(E)}\ \text{none of these}$

Let $ ABCD $ be a cyclic quadrilateral and let $ M $ be the set of incenters and excenters of the triangles $ BCD $, $ CDA $, $ DAB $, $ ABC $ (so 16 points in total). Prove that there exist two sets $ \mathcal{K} $ and $ \mathcal{L} $ of four parallel lines each, such that every line in $ \mathcal{K} \cup \mathcal{L} $ contains exactly four points of $ M $.