Find the least positive integer $n$, such that there is a polynomial \[ P(x) = a_{2n}x^{2n}+a_{2n-1}x^{2n-1}+\dots+a_1x+a_0 \] with real coefficients that satisfies both of the following properties: - For $i=0,1,\dots,2n$ it is $2014 \leq a_i \leq 2015$. - There is a real number $\xi$ with $P(\xi)=0$.

Determine if there exists a (three-variable) polynomial $P(x,y,z)$ with integer coefficients satisfying the following property: a positive integer $n$ is [i]not[/i] a perfect square if and only if there is a triple $(x,y,z)$ of positive integers such that $P(x,y,z) = n$.

Solve the system equations \[\left\{\begin{array}{cc}x^{4}-y^{4}=240\\x^{3}-2y^{3}=3(x^{2}-4y^{2})-4(x-8y)\end{array}\right.\]

Determine the number of $ 8$-tuples of nonnegative integers $ (a_1,a_2,a_3,a_4,b_1,b_2,b_3,b_4)$ satisfying $ 0\le a_k\le k$, for each $ k \equal{} 1,2,3,4$, and $ a_1 \plus{} a_2 \plus{} a_3 \plus{} a_4 \plus{} 2b_1 \plus{} 3b_2 \plus{} 4b_3 \plus{} 5b_4 \equal{} 19$.

Consider a polynomial $P(x) = \prod^9_{j=1}(x+d_j),$ where $d_1, d_2, \ldots d_9$ are nine distinct integers. Prove that there exists an integer $N,$ such that for all integers $x \geq N$ the number $P(x)$ is divisible by a prime number greater than 20. [i]Proposed by Luxembourg[/i]

Let $f(n)$ and $g(n)$ be polynomials of degree $2014$ such that $f(n)+(-1)^ng(n)=2^n$ for $n=1,2,\ldots,4030$. Find the coefficient of $x^{2014}$ in $g(x)$.

Let $a_1$ , $\ldots$ , $a_n$ be positive integers and $a$ a positive integer that is greater than $1$ and is divisible by the product $a_1a_2\ldots a_n$. Prove that $a^{n+1}+a-1$ is not divisible by the product $(a+a_1-1)(a+a_2-1)\ldots(a+a_n-1)$.

Decide whether for every polynomial $P$ of degree at least $1$, there exist infinitely many primes that divide $P(n)$ for at least one positive integer $n$. [i](Walther Janous)[/i]

Let be a finite field $ K. $ Say that two polynoms $ f,g $ from $ K[X] $ are [i]neighbours,[/i] if the have the same degree and they differ by exactly one coefficient. [b]a)[/b] Show that all the neighbours of $ 1+X^2 $ from $ \mathbb{Z}_3[X] $ are reducible in $ \mathbb{Z}_3[X] . $ [b]b)[/b] If $ |K|\ge 4, $ show that any polynomial of degree $ |K|-1 $ from $ K[X] $ has a neighbour from $ K[X] $ that is reducible in $ K[X] , $ and also has a neighbour that doesn´t have any root in $ K. $

Let $ n \ge 1$ and $ k \ge 3$ be integers. A circle is divided into $ n$ sectors $ a_1,a_2,\dots,a_n$. We will color the $ n$ sectors with $ k$ different colors such that $ a_i$ and $ a_{i \plus{} 1}$ have different color for each $ i \equal{} 1,2,\dots,n$ where $ a_{n \plus{} 1}\equal{}a_1$. Find the number of ways to do such coloring.

Denote $f(x) = x^4 + 2x^3 - 2x^2 - 4x+4$. Prove that there are infinitely many primes $p$ that satisfies the following. For all positive integers $m$, $f(m)$ is not a multiple of $p$.

Let $ f(x)$ be a polynomial of second degree the roots of which are contained in the interval $ [\minus{}1,\plus{}1]$ and let there be a point $ x_0\in [\minus{}1.\plus{}1]$ such that $ |f(x_0)|\equal{}1$. Prove that for every $ \alpha \in [0,1]$, there exists a $ \zeta \in [\minus{}1,\plus{}1]$ such that $ |f'(\zeta)|\equal{}\alpha$ and that this statement is not true if $ \alpha>1$.

[b]p1.[/b] Len's Spanish class has four tests in the first term. Len scores $72$, $81$, and $78$ on the first three tests. If Len wants to have an 80 average for the term, what is the minimum score he needs on the last test? [b]p2.[/b] In $1824$, the Electoral College had $261$ members. Andrew Jackson won $99$ Electoral College votes and John Quincy Adams won $84$ votes. A plurality occurs when no candidate has more than $50\%$ of the votes. Should a plurality occur, the vote goes to the House of Representatives to break the tie. How many more votes would Jackson have needed so that a plurality would not have occurred? [b]p3.[/b] $\frac12 + \frac16 + \frac{1}{12} + \frac{1}{20} + \frac{1}{30}= 1 - \frac{1}{n}$. Find $n$. [b]p4.[/b] How many ways are there to sit Samuel, Esun, Johnny, and Prat in a row of $4$ chairs if Prat and Johnny refuse to sit on an end? [b]p5.[/b] Find an ordered quadruple $(w, x, y, z)$ that satisfies the following: $$3^w + 3^x + 3^y = 3^z$$ where $w + x + y + z = 2017$. [b]p6.[/b] In rectangle $ABCD$, $E$ is the midpoint of $CD$. If $AB = 6$ inches and $AE = 6$ inches, what is the length of $AC$? [b]p7.[/b] Call an integer interesting if the integer is divisible by the sum of its digits. For example, $27$ is divisible by $2 + 7 = 9$, so $27$ is interesting. How many $2$-digit interesting integers are there? [b]p8.[/b] Let $a\#b = \frac{a^3-b^3}{a-b}$ . If $a, b, c$ are the roots of the polynomial $x^3 + 2x^2 + 3x + 4$, what is the value of $a\#b + b\#c + c\#a$? [b]p9.[/b] Akshay and Gowri are examining a strange chessboard. Suppose $3$ distinct rooks are placed into the following chessboard. Find the number of ways that one can place these rooks so that they don't attack each other. Note that two rooks are considered attacking each other if they are in the same row or the same column. [img]https://cdn.artofproblemsolving.com/attachments/f/1/70f7d68c44a7a69eb13ce12291c0600d11027c.png[/img] [b]p10.[/b] The Earth is a very large sphere. Richard and Allen have a large spherical model of Earth, and they would like to (for some strange reason) cut the sphere up with planar cuts. If each cut intersects the sphere, and Allen holds the sphere together so it does not fall apart after each cut, what is the maximum number of pieces the sphere can be cut into after $6$ cuts? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Consider the polynomial $ f(x) \equal{} ax^2 \plus{} bx \plus{} c$, with degree less than or equal to 2. When $ f$ varies with subject to the constrain $ f(0) \equal{} 0,\ f(2) \equal{} 2$, find the minimum value of $ S\equal{}\int_0^2 |f'(x)|\ dx$.

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