$(CZS 3)$ Let $a$ and $b$ be two positive real numbers. If $x$ is a real solution of the equation $x^2 + px + q = 0$ with real coefficients $p$ and $q$ such that $|p| \le a, |q| \le b,$ prove that $|x| \le \frac{1}{2}(a +\sqrt{a^2 + 4b})$ Conversely, if $x$ satisfies the above inequality, prove that there exist real numbers $p$ and $q$ with $|p|\le a, |q|\le b$ such that $x$ is one of the roots of the equation $x^2+px+ q = 0.$

Juan chooses a five-digit positive integer. Maria erases the ones digit and gets a four-digit number. The sum of this four-digit number and the original five-digit number is $52,713$. What can the sum of the five digits of the original number be?

Let $x_1, x_2, \dots, x_n$ be different real numbers. Prove that \[\sum_{1 \leqslant i \leqslant n} \prod_{j \neq i} \frac{1-x_{i} x_{j}}{x_{i}-x_{j}}=\left\{\begin{array}{ll} 0, & \text { if } n \text { is even; } \\ 1, & \text { if } n \text { is odd. } \end{array}\right.\]

What is the smallest $n$ for which there is a solution to $$\begin{cases} \sin x_1 + \sin x_2 + ... + \sin x_n = 0 \\ \sin x_1 + 2 \sin x_2 + ... + n \sin x_n = 100 \end{cases}$$ ?

Let $ P (x) $ be a polynomial with real coefficients such that $ P (x)> 0 $ for all $ x \geq 0 $. Prove that there is a positive integer $ n $ such that $ (1 + x) ^ n P (x) $ polynomial with nonnegative coefficients.

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

Let $n$ be a natural number and $f(x)$ be a polynomial with real coefficients having $n$ different positive real roots. Is it possible the polynomial: $$x(x+1)(x+2)(x+4)f(x)+a$$ to be presented as the $k$-th power of a polynomial with real coefficients, for some natural $k\geq 2$ and real $a$?

[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 first term of a sequence is 2005. Each succeeding term is the sum of the cubes of the digits of the previous terms. What is the 2005th term of the sequence? $ \textbf{(A)}\ 29\qquad \textbf{(B)}\ 55\qquad \textbf{(C)}\ 85\qquad \textbf{(D)}\ 133\qquad \textbf{(E)}\ 250$

Let $ f(x)$ be a monic polynomial of degree $ 1991$ with integer coefficients. Define $ g(x) \equal{} f^2(x) \minus{} 9.$ Show that the number of distinct integer solutions of $ g(x) \equal{} 0$ cannot exceed $ 1995.$

a) Show that you can divide an angle $\theta$ to three equal parts using compass and ruler if and only if the polynomial $4t^3-3t-\cos (\theta)$ is reducible over $\mathbb{Q}(\cos (\theta))$. b) Is it always possible to divide an angle into five equal parts?

Suppose that $x$ is measured in radians. Find the maximum value of \[\frac{\sin2x+\sin4x+\sin6x}{\cos2x+\cos4x+\cos6x}\] for $0\le x\le \frac{\pi}{16}$

Prove that $ \forall n > 1, n \in \mathbb{N}$ the equation \[ \sum^n_{k\equal{}1} \frac{x^k}{k!} \plus{} 1 \equal{} 0\] has no rational roots.

Consider a sequence of polynomials $P_0(x), P_1(x), P_2(x), \ldots, P_n(x), \ldots$, where $P_0(x) = 2, P_1(x) = x$ and for every $n \geq 1$ the following equality holds: \[P_{n+1}(x) + P_{n-1}(x) = xP_n(x).\] Prove that there exist three real numbers $a, b, c$ such that for all $n \geq 1,$ \[(x^2 - 4)[P_n^2(x) - 4] = [aP_{n+1}(x) + bP_n(x) + cP_{n-1}(x)]^2.\]

Find all polynomials $f\in \mathbb{Z}[X]$ such that if $p$ is prime then $f(p)$ is also prime.

The roots of $x^2+bx+c=0$ are both real and greater than $1$. Let $s=b+c+1$. Then $s:$ $ \textbf{(A)}\ \text{may be less than zero}\qquad\textbf{(B)}\ \text{may be equal to zero}\qquad$ $\textbf{(C)}\ \text{must be greater than zero}\qquad\textbf{(D)}\ \text{must be less than zero}\qquad $ $\textbf{(E)}\text{ must be between -1 and +1} $

If $a,b,c\in(0,\infty)$ such that $a+b+c=3$, then $$\frac{a}{3a+bc+12}+\frac{b}{3b+ca+12}+\frac{c}{3c+ab+12}\le \frac{3}{16}$$

Determine all pairs of real numbers $(x,y)$ satisfying \begin{align*} x^3+9x^2y&=10,\\ y^3+xy^2 &=2. \end{align*}

The sequence $ \{x_{n}\}$ is defined by $ x_{1} \equal{} 2,x_{2} \equal{} 12$, and $ x_{n \plus{} 2} \equal{} 6x_{n \plus{} 1} \minus{} x_{n}$, $ (n \equal{} 1,2,\ldots)$. Let $ p$ be an odd prime number, let $ q$ be a prime divisor of $ x_{p}$. Prove that if $ q\neq2,3,$ then $ q\geq 2p \minus{} 1$.

Let $ \mathbb{R} ^{+} $ denote the set of all positive real numbers. Find all functions $ \mathbb{R} ^{+} \to \mathbb{R} ^{+} $ such that \[ f(x+f(y)) = yf(xy+1)\] holds for all $ x, y \in \mathbb{R} ^{+} $.

$1600$ bananas are distributed among $100$ monkeys (it is possible that some monkeys do not receive bananas). Prvove that at least four monkeys receive the same amount of bananas.

[b]p19.[/b] Sequences $a_n$ and $b_n$ of positive integers satisfy the following properties: (1) $a_1 = b_1 = 1$ (2) $a_5 = 6, b_5 \ge 7$ (3) Both sequences are strictly increasing (4) In each sequence, the difference between consecutive terms is either $1$ or $2$ (5) $\sum^5_{n=1}na_n =\sum^5_{n=1}nb_n = S$ Compute $S$. [b]p20.[/b] Let $A$, $B$, and $C$ be points lying on a line in that order such that $AB = 4$ and $BC = 2$. Let $I$ be the circle centered at B passing through $C$, and let $D$ and $E$ be distinct points on $I$ such that $AD$ and $AE$ are tangent to $I$. Let $J$ be the circle centered at $C$ passing through $D$, and let $F$ and $G$ be distinct points on $J$ such that $AF$ and $AG$ are tangent to $J$ and $DG < DF$. Compute the area of quadrilateral $DEFG$. [b]p21.[/b] Twain is walking randomly on a number line. They start at $0$, and flip a fair coin $10$ times. Every time the coin lands heads, they increase their position by 1, and every time the coin lands tails, they decrease their position by $1$. What is the probability that at some point the absolute value of their position is at least $3$? PS. You should use hide for answers.

Suppose $a_0,\ldots, a_{100}$ are positive reals. Consider the following polynomial for each $k$ in $\{0,1,\ldots, 100\}$: $$a_{100+k}x^{100}+100a_{99+k}x^{99}+a_{98+k}x^{98}+a_{97+k}x^{97}+\dots+a_{2+k}x^2+a_{1+k}x+a_k,$$where indices are taken modulo $101$, [i]i.e.[/i], $a_{100+i}=a_{i-1}$ for any $i$ in $\{1,2,\dots, 100\}$. Show that it is impossible that each of these $101$ polynomials has all its roots real. [i]Proposed by Prithwijit De[/i]

Let $a$ and $b$ be two positive real numbers with $a \le 2b \le 4a$. Prove that $4ab \le2 (a^2+ b^2) \le 5 ab$.