Define $ P(\tau ) = (\tau + 1)^3$ . If $x + y = 0$, what is the minimum possible value of $P(x) + P(y)$?

Written on a blackboard is the polynomial $x^2+x+2014$. Calvin and Hobbes take turns alternately (starting with Calvin) in the following game. At his turn, Calvin should either increase or decrease the coefficient of $x$ by $1$. And at this turn, Hobbes should either increase or decrease the constant coefficient by $1$. Calvin wins if at any point of time the polynomial on the blackboard at that instant has integer roots. Prove that Calvin has a winning stratergy.

$m < n$ are positive integers. Let $p=\frac{n^2+m^2}{\sqrt{n^2-m^2}}$. [b](a)[/b] Find three pairs of positive integers $(m,n)$ that make $p$ prime. [b](b)[/b] If $p$ is prime, then show that $p \equiv 1 \pmod 8$.

Twelve pigeons can eat $28$ slices of bread in $5$ minutes. Find the number of slices of bread $5$ pigeons can eat in $48$ minutes. [i]Individual #1[/i]

Prove the complex inequality $ |x|+|y|+|z|\le |x+y+z| +|x-z| +|z-y|+|y-z|. $

Find all positive real solutions to: \begin{eqnarray*} (x_1^2-x_3x_5)(x_2^2-x_3x_5) &\le& 0 \\ (x_2^2-x_4x_1)(x_3^2-x_4x_1) &\le& 0 \\ (x_3^2-x_5x_2)(x_4^2-x_5x_2) &\le& 0 \\ (x_4^2-x_1x_3)(x_5^2-x_1x_3) &\le & 0 \\ (x_5^2-x_2x_4)(x_1^2-x_2x_4) &\le& 0 \\ \end{eqnarray*}

Find all pairs of positive integers $(a,b)$ such that $5a^b - b = 2004$.

For all positive integer $n$, define $f_n(x)$ such that $f_n(x) = \sum_{k=1}^n{|x - k|}$. Determine all solution from the inequality $f_n(x) < 41$ for all positive $2$-digit integers $n$ (in decimal notation).

Consider a $10 \times 10$ grid. On every move, we colour $4$ unit squares that lie in the intersection of some two rows and two columns. A move is allowed if at least one of the $4$ squares is previously uncoloured. What is the largest possible number of moves that can be taken to colour the whole grid?

Given a quadratic trinomial $f\left(x\right)=x^2+ax+b$. Assume that the equation $f\left(f\left(x\right)\right)=0$ has four different real solutions, and that the sum of two of these solutions is $-1$. Prove that $b\leq -\frac14$.

Prove that for all real $x > 0$ holds the inequality $$\sqrt{\frac{1}{3x+1}}+\sqrt{\frac{x}{x+3}}\ge 1.$$ For what values of $x$ does the equality hold?

In the plane there are two disjoint sets $ A $ and $ B $, each of which consists of $ n $ points, and no three points of the set $ A \cup B $ lie on one straight line. Prove that there is a set of $ n $ disjoint closed segments, each of which has one end in the set $ A $ and the other in the set $ B $.

Find the greatest real number $M$ for which \[ a^2+b^2+c^2+3abc \geq M(ab+bc+ca) \] for all non-negative real numbers $a,b,c$ satisfying $a+b+c=4.$

A natural number $n$ is at least two digits long. If we write a certain digit between the tens digit and the units digit of this number, we obtain six times the number $n$. Find all numbers $n$ with this property.

Prove that in the set $ \{1,2, \ldots, 1989\}$ can be expressed as the disjoint union of subsets $ A_i, \{i \equal{} 1,2, \ldots, 117\}$ such that [b]i.)[/b] each $ A_i$ contains 17 elements [b]ii.)[/b] the sum of all the elements in each $ A_i$ is the same.

Let $D_n$ denote the value of the $(n -1) \times (n - 1)$ determinant $$ \begin{pmatrix} 3 & 1 &1 & \ldots & 1\\ 1 & 4 &1 & \ldots & 1\\ 1 & 1 & 5 & \ldots & 1\\ \vdots & \vdots & \vdots & \ddots & \vdots\\ 1 & 1 & 1 & \ldots & n+1 \end{pmatrix}.$$ Is the set $\left\{ \frac{D_n }{n!} \, | \, n \geq 2\right\}$ bounded?

[b]p1.[/b] If $x + z = v$, $w + z = 2v$, $z - w = 2y$, and $y \ne 0$, compute the value of $$\left(x + y +\frac{x}{y} \right)^{101}.$$ [b]p2. [/b]Every minute, a snail picks one cardinal direction (either north, south, east, or west) with equal probability and moves one inch in that direction. What is the probability that after four minutes the snail is more than three inches away from where it started? [b]p3.[/b] What is the probability that a point chosen randomly from the interior of a cube is closer to the cube’s center than it is to any of the cube’s eight vertices? [b]p4.[/b] Let $ABCD$ be a rectangle where $AB = 4$ and $BC = 3$. Inscribe circles within triangles $ABC$ and $ACD$. What is the distance between the centers of these two circles? [b]p5.[/b] $C$ is a circle centered at the origin that is tangent to the line $x - y\sqrt3 = 4$. Find the radius of $C$. [b]p6.[/b] I have a fair $100$-sided die that has the numbers $ 1$ through $100$ on its sides. What is the probability that if I roll this die three times that the number on the first roll will be greater than or equal to the sum of the two numbers on the second and third rolls? [b]p7. [/b] List all solutions $(x, y, z)$ of the following system of equations with x, y, and z positive real numbers: $$x^2 + y^2 = 16$$ $$x^2 + z^2 = 4 + xz$$ $$y^2 + z^2 = 4 + yz\sqrt3$$ [b]p8.[/b] $A_1A_2A_3A_4A_5A_6A_7$ is a regular heptagon ($7$ sided-figure) centered at the origin where $A_1 = (\sqrt[91]{6}, 0)$. $B_1B_2B_3... B_{13}$ is a regular triskaidecagon ($13$ sided-figure) centered at the origin where $B_1 =(0,\sqrt[91]{41})$. Compute the product of all lengths $A_iB_j$ , where $i$ ranges between $1$ and $7$, inclusive, and $j$ ranges between $1$ and $13$, inclusive. [b]p9.[/b] How many three-digit integers are there such that one digit of the integer is exactly two times a digit of the integer that is in a different place than the first? (For example, $100$, $122$, and $124$ should be included in the count, but $42$ and $130$ should not.) [b]p10.[/b] Let $\alpha$ and $\beta$ be the solutions of the quadratic equation $$x^2 - 1154x + 1 = 0.$$ Find $\sqrt[4]{\alpha}+\sqrt[4]{\beta}$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

A set $ E$ of points in the 3D space let $ L(E)$ denote the set of all those points which lie on lines composed of two distinct points of $ E.$ Let $ T$ denote the set of all vertices of a regular tetrahedron. Which points are in the set $ L(L(T))?$

Two circles pass through points $A$ and $B$. A third circle touches both these circles and meets $AB$ at points $C$ and $D$. Prove that the tangents to this circle at these points are parallel to the common tangents of two given circles. [i]Proposed by A.Zaslavsky[/i]

A polynomial $f(x)$ with integer coefficients is said to be [i]tri-divisible[/i] if $3$ divides $f(k)$ for any integer $k$. Determine necessary and sufficient conditions for a polynomial to be tri-divisible.

A positive integer $n$ is [i]magical[/i] if $\lfloor \sqrt{\lceil \sqrt{n} \rceil} \rfloor=\lceil \sqrt{\lfloor \sqrt{n} \rfloor} \rceil$. Find the number of magical integers between $1$ and $10,000$ inclusive.

Five people form several commissions to prepare a competition. Here any commission must be nonempty and any two commissions cannot contain the same members. Moreover, any two commissions have at least one common member. There are already $14$ commissions. Prove that at least one additional commission can be formed.

Baklavas with nuts are laid out on the table in a row at the Nowruz celebration. Kosa and Kechel saw this and decided to play a game. Kosa eats one baklava from either the beginning or the end of the row in each move. Kechel either doesn't touch anything in each move or chooses the baklava he wants and just eats the nut on it. They agree that the first Kosa will start the game and make $20$ moves in each step, and the Kechel will only make $1$ move in each step. If the last baklava eaten by the Kosa is a nut, he wins the game. It is given that the number of baklavas is a multiple of $20.$ $A)$ If the number of baklavas is $400,$ prove that Kosa will win the game regardless of which strategy Kechel chooses. $B)$ Is it always true that no matter how many baklavas there are and what strategy Kechel chooses, Kosa will always win the game?

Let $S$ be a subset of $\{1, 2, . . . , 500\}$ such that no two distinct elements of S have a product that is a perfect square. Find, with proof, the maximum possible number of elements in $S$.

There is a pack of 27 distinct cards, and each card has three values on it. The first value is a shape from $\{\Delta,\square,\odot\}$; the second value is a letter from $\{A,B,C\}$; and the third value is a number from $\{1,2,3\}$. In how many ways can we choose an unordered set of 3 cards from the pack, so that no two of the chosen cards have two matching values. For example we can chose $\{\Delta A1,\Delta B2,\odot C3\}$ But we cannot choose $\{\Delta A1,\square B2,\Delta C1\}$