Determine the least real number $M$ such that the inequality \[|ab(a^{2}-b^{2})+bc(b^{2}-c^{2})+ca(c^{2}-a^{2})| \leq M(a^{2}+b^{2}+c^{2})^{2}\] holds for all real numbers $a$, $b$ and $c$.

A finite set $S$ of unit squares is chosen out of a large grid of unit squares. The squares of $S$ are tiled with isosceles right triangles of hypotenuse $2$ so that the triangles do not overlap each other, do not extend past $S$, and all of $S$ is fully covered by the triangles. Additionally, the hypotenuse of each triangle lies along a grid line, and the vertices of the triangles lie at the corners of the squares. Show that the number of triangles must be a multiple of $4$.

Find the unique real number $c$ such that the polynomial $x^3+cx+c$ has exactly two real roots.

The escalator of the department store, which at any given time can be seen at $75$ steps section, moves up one step in $2$ seconds. At time $0$, Juku is standing on an escalator step equidistant from each end, facing the direction of travel. He goes by a certain rule: one step forward, two steps back, then again one step forward, two back, etc., taking one every second in increments of one step. Which end will Juku finally get out and at what point will it happen?

Prove that if the numbers $ x $, $ y $, $ z $ satisfy the equationw $$x + y + z = a,$$ $$ \frac{1}{x} + \frac{1}{y} + \frac{1}{z} = \frac{1}{a},$$ then at least one of them is equal to $ a $.

If $a_i \ (i = 1, 2, \ldots, n)$ are distinct non-zero real numbers, prove that the equation \[\frac{a_1}{a_1-x} + \frac{a_2}{a_2-x}+\cdots+\frac{a_n}{a_n-x} = n\] has at least $n - 1$ real roots.

Let $ A\equal{}(a_{ij})_{1\leq i,j\leq n}$ be a real $ n\times n$ matrix, such that $ a_{ij} \plus{} a_{ji} \equal{} 0$, for all $ i,j$. Prove that for all non-negative real numbers $ x,y$ we have \[ \det(A\plus{}xI_n)\cdot \det(A\plus{}yI_n) \geq \det (A\plus{}\sqrt{xy}I_n)^2.\]

Prove the following equalities of sets: \[ \text{i)} \{x\in \mathbb{R}\ |\ \log_2 \lfloor x \rfloor \equal{} \lfloor \log_2 x\rfloor \} \equal{} \bigcup_{m\in \mathbb{N}} \left[2^m,2^m \plus{} 1\right)\] \[ \text{ii)} \{x\in \mathbb{R}\ |\ 2^{\lfloor x\rfloor} \equal{} \left\lfloor 2^x\right\rfloor \} \equal{} \bigcup_{m\in \mathbb{N}} \left[m, \log_2 (2^m \plus{} 1) \right)\]

Determine all polynomials $P(x)$ with degree $n\geq 1$ and integer coefficients so that for every real number $x$ the following condition is satisfied $$P(x)=(x-P(0))(x-P(1))(x-P(2))\cdots (x-P(n-1))$$

Let $S$ denote the sum of the 2011th powers of the roots of the polynomial $(x-2^0)(x-2^1) \cdots (x-2^{2010}) - 1$. How many ones are in the binary expansion of $S$? [i]Author: Alex Zhu[/i]

$a;b\in\mathbb{R^+}$. Prove the following inequality: $$\sqrt[3]{\frac{a}{b}}+\sqrt[3]{\frac{b}{a}}\leq\sqrt[3]{2(a+b)(\frac1{a}+\frac1{b})}$$

Choose positive integers $b_1, b_2, \dotsc$ satisfying \[1=\frac{b_1}{1^2} > \frac{b_2}{2^2} > \frac{b_3}{3^2} > \frac{b_4}{4^2} > \dotsb\] and let $r$ denote the largest real number satisfying $\tfrac{b_n}{n^2} \geq r$ for all positive integers $n$. What are the possible values of $r$ across all possible choices of the sequence $(b_n)$? [i]Carl Schildkraut and Milan Haiman[/i]

Find the minimum value of $x^2+2x+ \frac{24}{x}$ for $x > 0$.

Write the sum $\sum_{i=0}^{n}{\frac{(-1)^i\cdot\binom{n}{i}}{i^3 +9i^2 +26i +24}}$ as the ratio of two explicitly defined polynomials with integer coefficients.

For which positive integers $n$ can the polynomial $p(x) = 1 + x^n + x^{2n}$ is written as a product of two polynomials with integer coefficients (of degree $\ge 1$)?

Let $A,B\in \mathcal{M}_n(\mathbb{C})$ be two $n \times n$ matrices such that \[ A^2B+BA^2=2ABA \] Prove there exists $k\in \mathbb{N}$ such that \[ (AB-BA)^k=\mathbf{0}_n\] Here $\mathbf{0}_n$ is the null matrix of order $n$.

Find a function $f(x)$ defined for all real values of $x$ such that for all $x$, \[f(x+ 2) - f(x) = x^2 + 2x + 4,\] and if $x \in [0, 2)$, then $f(x) = x^2.$

The Fibonacci sequence $f_1,f_2,f_3,\dots$ is defined by $f_1=f_2=1$, $f_{n+2}=f_{n+1}+f_n$. Find all $n$ such that $f_n = n^2$.

Prove that the functional equations \[f(x + y) = f(x) + f(y),\] \[ \text{and} \qquad f(x + y + xy) = f(x) + f(y) + f(xy) \quad (x, y \in \mathbb R)\] are equivalent.

Define a sequence $\{a_n\}_{n\geq 1}$ of real numbers by \[a_1=2,\qquad a_{n+1} = \frac{a_n^2+1}{2}, \text{ for } n\geq 1.\] Prove that \[\sum_{j=1}^{N} \frac{1}{a_j + 1} < 1\] for every natural number $N$.

[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].

Figures $ 0$, $ 1$, $ 2$, and $ 3$ consist of $ 1$, $ 5$, $ 13$, and $ 25$ nonoverlapping squares, respectively. If the pattern were continued, how many nonoverlapping squares would there be in figure $ 100$? [asy] unitsize(8); draw((0,0)--(1,0)--(1,1)--(0,1)--cycle); draw((9,0)--(10,0)--(10,3)--(9,3)--cycle); draw((8,1)--(11,1)--(11,2)--(8,2)--cycle); draw((19,0)--(20,0)--(20,5)--(19,5)--cycle); draw((18,1)--(21,1)--(21,4)--(18,4)--cycle); draw((17,2)--(22,2)--(22,3)--(17,3)--cycle); draw((32,0)--(33,0)--(33,7)--(32,7)--cycle); draw((29,3)--(36,3)--(36,4)--(29,4)--cycle); draw((31,1)--(34,1)--(34,6)--(31,6)--cycle); draw((30,2)--(35,2)--(35,5)--(30,5)--cycle); label("Figure",(0.5,-1),S); label("$0$",(0.5,-2.5),S); label("Figure",(9.5,-1),S); label("$1$",(9.5,-2.5),S); label("Figure",(19.5,-1),S); label("$2$",(19.5,-2.5),S); label("Figure",(32.5,-1),S); label("$3$",(32.5,-2.5),S);[/asy]$ \textbf{(A)}\ 10401 \qquad \textbf{(B)}\ 19801 \qquad \textbf{(C)}\ 20201 \qquad \textbf{(D)}\ 39801 \qquad \textbf{(E)}\ 40801$

Does there exists two functions $f,g :\mathbb{R}\rightarrow \mathbb{R}$ such that: $\forall x\not =y : |f(x)-f(y)|+|g(x)-g(y)|>1$ Time allowed for this problem was 75 minutes.

[b]p1.[/b] There are $5$ weights of masses $1,2,3,5$, and $10$ grams. One of the weights is counterfeit (its weight is different from what is written, it is unknown if the weight is heavier or lighter). How to find the counterfeit weight using simple balance scales only twice? [b]p2.[/b] There are $998$ candies and chocolate bars and $499$ bags. Each bag may contain two items (either two candies, or two chocolate bars, or one candy and one chocolate bar). Ann distributed candies and chocolate bars in such a way that half of the candies share a bag with a chocolate bar. Helen wants to redistribute items in the same bags in such a way that half of the chocolate bars would share a bag with a candy. Is it possible to achieve that? [b]p3.[/b] Insert in sequence $2222222222$ arithmetic operations and brackets to get the number $999$ (For instance, from the sequence $22222$ one can get the number $45$: $22*2+2/2 = 45$). [b]p4.[/b] Put numbers from $15$ to $23$ in a $ 3\times 3$ table in such a way to make all sums of numbers in two neighboring cells distinct (neighboring cells share one common side). [b]p5.[/b] All integers from $1$ to $200$ are colored in white and black colors. Integers $1$ and $200$ are black, $11$ and $20$ are white. Prove that there are two black and two white numbers whose sums are equal. [b]p6.[/b] Show that $38$ is the sum of few positive integers (not necessarily, distinct), the sum of whose reciprocals is equal to $1$. (For instance, $11=6+3+2$, $1/16+1/13+1/12=1$.) PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Show that the following implication holds for any two complex numbers $x$ and $y$: if $x+y$, $x^2+y^2$, $x^3+y^3$, $x^4+y^4\in\mathbb Z$, then $x^n+y^n\in\mathbb Z$ for all natural n.