The game involves two players $A$ and $B$. Player $A$ sets the value of one of the coefficients $a, b$ or $c$ of the polynomial $$x^3 + ax^2 + bx + c.$$ Player $B$ indicates the value of any of the two remaining coefficients . Player $A$ then sets the value of the last coefficients. Is there a strategy for player A such that no matter how player $B$ plays, the equation $$x^3 + ax^2 + bx + c = 0$$ to have three different (real) solutions?

Given two sequences $x_n$ and $y_n$ defined by $x_0 = y_0 = 7$, \[x_n = 4x_{n-1}+3y_{n-1}, \text{ and}\]\[y_n = 3y_{n-1}+2x_{n-1},\] find $\lim_{n \to \infty} \frac{x_n}{y_n}$.

[b]p1.[/b] How many lines of symmetry does a square have? [b]p2.[/b] Compute$ 1/2 + 1/6 + 1/12 + 1/4$. [b]p3.[/b] What is the maximum possible area of a rectangle with integer side lengths and perimeter $8$? [b]p4.[/b] Given that $1$ printer weighs $400000$ pennies, and $80$ pennies weighs $2$ books, what is the weight of a printer expressed in books? [b]p5.[/b] Given that two sides of a triangle are $28$ and $3$ and all three sides are integers, what is the sum of the possible lengths of the remaining side? [b]p6.[/b] What is half the sum of all positive integers between $1$ and $15$, inclusive, that have an even number of positive divisors? [b]p7.[/b] Austin the Snowman has a very big brain. His head has radius $3$, and the volume of his torso is one third of his head, and the volume of his legs combined is one third of his torso. If Austin's total volume is $a\pi$ where $a$ is an integer, what is $a$? [b]p8.[/b] Neethine the Kiwi says that she is the eye of the tiger, a fighter, and that everyone is gonna hear her roar. She is standing at point $(3, 3)$. Neeton the Cat is standing at $(11,18)$, the farthest he can stand from Neethine such that he can still hear her roar. Let the total area of the region that Neeton can stand in where he can hear Neethine's roar be $a\pi$ where $a$ is an integer. What is $a$? [b]p9.[/b] Consider $2018$ identical kiwis. These are to be divided between $5$ people, such that the first person gets $a_1$ kiwis, the second gets $a_2$ kiwis, and so forth, with $a_1 \le a_2 \le a_3 \le a_4 \le a_5$. How many tuples $(a_1, a_2, a_3, a_4, a_5)$ can be chosen such that they form an arithmetic sequence? [b]p10.[/b] On the standard $12$ hour clock, each number from $1$ to $12$ is replaced by the sum of its divisors. On this new clock, what is the number of degrees in the measure of the non-reflex angle between the hands of the clock at the time when the hour hand is between $7$ and $6$ while the minute hand is pointing at $15$? [b]p11.[/b] In equiangular hexagon $ABCDEF$, $AB = 7$, $BC = 3$, $CD = 8$, and $DE = 5$. The area of the hexagon is in the form $\frac{a\sqrt{b}}{c}$ with $b$ square free and $a$ and $c$ relatively prime. Find $a+b+c$ where $a, b,$ and $c$ are integers. [b]p12.[/b] Let $\frac{p}{q} = \frac15 + \frac{2}{5^2} + \frac{3}{5^3} + ...$ . Find $p + q$, where $p$ and $q$ are relatively prime positive integers. [b]p13.[/b] Two circles $F$ and $G$ with radius $10$ and $4$ respectively are externally tangent. A square $ABMC$ is inscribed in circle $F$ and equilateral triangle $MOP$ is inscribed in circle $G$ (they share vertex $M$). If the area of pentagon $ABOPC$ is equal to $a + b\sqrt{c}$, where $a$, $b$, $c$ are integers $c$ is square free, then find $a + b + c$. [b]p14.[/b] Consider the polynomial $P(x) = x^3 + 3x^2 + ax + 8$. Find the sum of all integer $a$ such that the sum of the squares of the roots of $P(x)$ divides the sum of the coecients of $P(x)$. [b]p15.[/b] Nithin and Antonio play a number game. At the beginning of the game, Nithin picks a prime $p$ that is less than $100$. Antonio then tries to find an integer $n$ such that $n^6 + 2n^5 + 2n^4 + n^3 + (n^2 + n + 1)^2$ is a multiple of $p$. If Antonio can find such a number n, then he wins, otherwise, he loses. Nithin doesn't know what he is doing, and he always picks his prime randomly while Antonio always plays optimally. The probability of Antonio winning is $a/b$ where $a$ and $b$ are relatively prime positive integers. Find$a + b$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Given a polynomial $P$ and a positive integer $k$, we denote the $k$-fold composition of $P$ by $P^{\circ k}$. A polynomial $P$ with real coefficients is called [b]perfect[/b] if for each integer $n$ there is a positive integer $k$ so that $P^{\circ k}(n)$ is an integer. Is it true that for each perfect polynomial $P$, there exists a positive $m$ so that for each integer $n$ there is $0<k\leq m$ for which $P^{\circ k}(n)$ is an integer?

The following problem is open in the sense that the answer to part (b) is not currently known. Let $n$ be an odd positive integer and let \[ f_n(x,y,z) = x^n + y^n + z^n + (x+y+z)^n. \] $(a)$ Prove that there exist infinitely many values of $n$ such that \[ f_n(x,y,z) \equiv (x+y)(y+z)(z+x) g_n(x,y,z) h_n(x,y,z) \pmod{2}, \] for some integer polynomials $g_n(x,y,z)$ and $h_n(x,y,z)$, neither of which is constant modulo 2. $(b)$ Determine all values of $n$ such that \[ f_n(x,y,z) \equiv (x+y)(y+z)(z+x) g_n(x,y,z) h_n(x,y,z) \pmod{2}, \] for some integer polynomials $g_n(x,y,z)$ and $h_n(x,y,z)$, neither of which is constant modulo 2. (Two integer polynomials are $\emph{congruent modulo 2}$ if every coefficient of their difference is even. A polynomial is $\emph{constant modulo 2}$ if it is congruent to a constant polynomial modulo 2.)

Let the function $f:N^*\to N^*$ such that [b](1)[/b] $(f(m),f(n))\le (m,n)^{2014} , \forall m,n\in N^*$; [b](2)[/b] $n\le f(n)\le n+2014 , \forall n\in N^*$ Show that: there exists the positive integers $N$ such that $ f(n)=n $, for each integer $n \ge N$. (High School Affiliated to Nanjing Normal University )

Let $z_1,z_2,z_3,\dots,z_{12}$ be the 12 zeroes of the polynomial $z^{12}-2^{36}$. For each $j$, let $w_j$ be one of $z_j$ or $i z_j$. Then the maximum possible value of the real part of $\displaystyle\sum_{j=1}^{12} w_j$ can be written as $m+\sqrt{n}$ where $m$ and $n$ are positive integers. Find $m+n$.

For $a$ a positive real number, let $x_1$, $x_2$, $x_3$ be the roots of the equation $x^3-ax^2+ax-a=0$. Determine the smallest possible value of $x_1^3+x_2^3+x_3^3-3x_1x_2x_3$.

Suppose $x$ is in the interval $[0,\pi/2]$ and $\log_{24\sin{x}}(24\cos{x})=\frac{3}{2}$. Find $24\cot^2{x}$.

For each odd integer $p\ge 3$ find the number of real roots of the polynomial $$f_p(x)=(x-1)(x-2)\cdots (x-p+1)+1.$$

Determine all polynomials $p(x)$ with real coefficients such that $p((x+1)^3)=(p(x)+1)^3$ and $p(0)=0$.

(1) Determine if there exists an infinite sequence $\{a_n\}$ with positive integer terms, such that $a^2_{n+1}\ge 2a_na_{n+2}$ for any positive integer $n$. (2) Determine if there exists an infinite sequence $\{a_n\}$ with positive irrational terms, such that $a^2_{n+1}\ge 2a_na_{n+2}$ for any positive integer $n$.

Let $P(x) = x^4-x^3+x$. a) Prove that for all positive real numbers $a$, the polynomial $P(x) - a$ has a unique positive zero. b) A sequence $(a_n)$ is defined by $a_1 = \dfrac{1}{3}$ and for all $n \geq 1$, $a_{n+1}$ is the positive zero of the polynomial $P(x) - a_n$. Prove that the sequence $(a_n)$ converges, and find the limit of the sequence.

The two polynomials $(x) =x^4+ax^3+bx^2+cx+d$ and $Q(x) = x^2+px+q$ take negative values on an interval $I$ of length greater than $2$, and nonnegative values outside of $I$. Prove that there exists $x_0 \in \mathbb R$ such that $P(x_0) < Q(x_0)$.