Find all roots of the equation :- $1-\frac{x}{1}+\frac{x(x-1)}{2!} - \cdots +(-1)^n\frac{x(x-1)(x-2)...(x-n+1)}{n!}=0$.

Consider a polynomial \[f(x)=x^{2012}+a_{2011}x^{2011}+\dots+a_1x+a_0.\] Albert Einstein and Homer Simpson are playing the following game. In turn, they choose one of the coefficients $a_0,a_1,\dots,a_{2011}$ and assign a real value to it. Albert has the first move. Once a value is assigned to a coefficient, it cannot be changed any more. The game ends after all the coefficients have been assigned values. Homer's goal is to make $f(x)$ divisible by a fixed polynomial $m(x)$ and Albert's goal is to prevent this. (a) Which of the players has a winning strategy if $m(x)=x-2012$? (b) Which of the players has a winning strategy if $m(x)=x^2+1$? [i]Proposed by Fedor Duzhin, Nanyang Technological University.[/i]

How many times per day do at least two of the three hands on a clock coincide?

Let $n$ be an even positive integer. An $n$-degree monic polynomial $P(x)$ has $n$ real roots (not necessarily distinct). Suppose $y$ is a positive real number such that for any real number $t<y$, we have $P(t)>0$. Prove that \[P(0)^{\frac{1}{n}}-P(y)^{\frac{1}{n}}\ge y.\]

Let $a_1,a_2,\ldots a_n,k$, and $M$ be positive integers such that $$\frac{1}{a_1}+\frac{1}{a_2}+\cdots+\frac{1}{a_n}=k\quad\text{and}\quad a_1a_2\cdots a_n=M.$$ If $M>1$, prove that the polynomial $$P(x)=M(x+1)^k-(x+a_1)(x+a_2)\cdots (x+a_n)$$ has no positive roots.

The positive integers $ \alpha, \beta, \gamma$ are the roots of a polynomial $ f(x)$ with degree $ 4$ and the coefficient of the first term is $ 1$. If there exists an integer such that $ f(\minus{}1)\equal{}f^2(s)$. Prove that $ \alpha\beta$ is not a perfect square.

Let $\mathbb{Q}$ be the set of rational numbers. Determine all functions $f : \mathbb{Q}\to\mathbb{Q}$ satisfying both of the following conditions. [list=disc] [*] $f(a)$ is not an integer for some rational number $a$. [*] For any rational numbers $x$ and $y$, both $f(x + y) - f(x) - f(y)$ and $f(xy) - f(x)f(y)$ are integers. [/list]

Find all real values of $\alpha$, for which there exists one and only one function $f: \mathbb{R} \mapsto \mathbb{R}$ and satisfying the equation \[ f(x^2 + y + f(y)) = (f(x))^2 + \alpha \cdot y \] for all $x, y \in \mathbb{R}$.

Graph $G_1$ of a quadratic trinomial $y = px^2 + qx + r$ with real coefficients intersects the graph $G_2$ of a quadratic trinomial $y = x^2$ in points $A$, $B$. The intersection of tangents to $G_2$ in points $A$, $B$ is point $C$. If $C \in G_1$, find all possible values of $p$.

The numbers $1, 2, 3, . . . , 101$ are written in a row in some order. Prove that it is always possible to erase $90 $ of the numbers so that the remaining $11$ numbers remain arranged in either increasing or decreasing order.

Let $x_0, x_1, \ldots$ be a sequence of real numbers such that $x_n = \frac{1 + x_{n -1}}{x_{n - 2}}$ for $n \geq 2$. Find the number of ordered pairs of positive integers $(x_0, x_1)$ such that the sequence gives $x_{2018} = \frac{1}{1000}$.

$f(0) = 0$ $f(1) = 1$ $f(2) = 3$ $f(3) = 5$ $f(4) = 9$ $f(5) = 11$ $f(6) = 29$ $f(11) = 31$ $f(20) = ? $

[u]Round 1[/u] [b]p1.[/b] Evaluate the sum $1-2+3-...-208+209-210$. [b]p2.[/b] Tony has $14$ beige socks, $15$ blue socks, $6$ brown socks, $8$ blond socks and $7$ black socks. If Tony picks socks out randomly, how many socks does he have to pick in order to guarantee a pair of blue socks? [b]p3.[/b] The price of an item is increased by $25\%$, followed by an additional increase of $20\%$. What is the overall percentage increase? [u]Round 2[/u] [b]p4.[/b] A lamp post is $20$ feet high. How many feet away from the base of the post should a person who is $5$ feet tall stand in order to cast an 8-foot shadow? [b]p5.[/b] How many positive even two-digit integers are there that do not contain the digits $0$, $1$, $2$, $3$ or $4$? [b]p6.[/b] In four years, Jack will be twice as old as Jill. Three years ago, Jack was three times as old as Jill. How old is Jack? [u]Round 3[/u] [b]p7.[/b] Let $x \Delta y = x y^2 -2y$. Compute $20\Delta 18$. [u]p8.[/u] A spider crawls $14$ feet up a wall. If Cheenu is standing $6$ feet from the wall, and is $6$ feet tall, how far must the spider jump to land on his head? [b]p9.[/b] There are fourteen dogs with long nails and twenty dogs with long fur. If there are thirty dogs in total, and three do not have long fur or long nails, how many dogs have both long hair and long nails? [u]Round 4[/u] [b]p10.[/b] Exactly $420$ non-overlapping square tiles, each $1$ inch by $1$ inch, tesselate a rectangle. What is the least possible number of inches in the perimeter of the rectangle? [b]p11.[/b] John drives $100$ miles at fifty miles per hour to see a cat. After he discovers that there was no cat, he drives back at a speed of twenty miles per hour. What was John’s average speed in the round trip? [b]p12.[/b] What percent of the numbers $1,2,3,...,1000$ are divisible by exactly one of the numbers $4$ and $5$? PS. You should use hide for answers. Rounds 5-8 have been posted [url=https://artofproblemsolving.com/community/c3h3165992p28809294]here [/url] and 9-12 [url=https://artofproblemsolving.com/community/c3h3166045p28809814]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

There is a polynomial $P$ such that for every real number $x$, \[ x^{512} + x^{256} + 1 = (x^2 + x + 1) P(x). \] When $P$ is written in standard polynomial form, how many of its coefficients are nonzero?

Prove that for all $ n\geq 2,$ there exists $ n$-degree polynomial $ f(x) \equal{} x^n \plus{} a_{1}x^{n \minus{} 1} \plus{} \cdots \plus{} a_{n}$ such that (1) $ a_{1},a_{2},\cdots, a_{n}$ all are unequal to $ 0$; (2) $ f(x)$ can't be factorized into the product of two polynomials having integer coefficients and positive degrees; (3) for any integers $ x, |f(x)|$ isn't prime numbers.

Solve the equation $\sqrt{7-x}=7-x^2$, where $x>0$.

Mykhailo chose three distinct positive real numbers \( a, b, c \) and wrote the following numbers on the board: \[ a + b, \quad b + c, \quad c + a, \quad ab, \quad bc, \quad ca. \] What is the minimum possible number of distinct numbers that can be written on the board? [i]Proposed by Anton Trygub[/i]

Two circles of equal radius can tightly fit inside right triangle $ABC$, which has $AB=13$, $BC=12$, and $CA=5$, in the three positions illustrated below. Determine the radii of the circles in each case. [asy] size(400); defaultpen(linewidth(0.7)+fontsize(12)); picture p = new picture; pair s1 = (20,0), s2 = (40,0); real r1 = 1.5, r2 = 10/9, r3 = 26/7; pair A=(12,5), B=(0,0), C=(12,0); draw(p,A--B--C--cycle); label(p,"$B$",B,SW); label(p,"$A$",A,NE); label(p,"$C$",C,SE); add(p); add(shift(s1)*p); add(shift(s2)*p); draw(circle(C+(-r1,r1),r1)); draw(circle(C+(-3*r1,r1),r1)); draw(circle(s1+C+(-r2,r2),r2)); draw(circle(s1+C+(-r2,3*r2),r2)); pair D=s2+156/17*(A-B)/abs(A-B), E=s2+(169/17,0), F=extension(D,E,s2+A,s2+C); draw(incircle(s2+B,D,E)); draw(incircle(s2+A,D,F)); label("Case (i)",(6,-3)); label("Case (ii)",s1+(6,-3)); label("Case (iii)",s2+(6,-3));[/asy]

It is known that the equation$ |x - 1| + |x - 2| +... + |x - 2001| = a$ has exactly one solution. Find $a$.

Define the sequences $a_n$ and $b_n$ as follows: $a_1 = 2017$ and $b_1 = 1$. For $n > 1$, if there is a greatest integer $k > 1$ such that $a_n$ is a perfect $k$th power, then $a_{n+1} =\sqrt[k]{a_n}$, otherwise $a_{n+1} = a_n + b_n$. If $a_{n+1} \ge a_n$ then $b_{n+1} = b_n$, otherwise $b_{n+1} = b_n + 1$. Find $a_{2017}$.

Given an integer $N \geq 4$, determine the largest value the sum $$\sum_{i=1}^{\left \lfloor{\frac{k}{2}}\right \rfloor+1}\left( \left \lfloor{\frac{n_i}{2}}\right \rfloor+1\right)$$ may achieve, where $k, n_1, \ldots, n_k$ run through the integers subject to $k \geq 3$, $n_1 \geq \ldots\geq n_k\geq 1$ and $n_1 + \ldots + n_k = N$.

It is known that unequal numbers $a$,$b$ and $c$ are successive members of an arithmetic progression, all of them are greater than $1000$ and all are squares of natural numbers. Find the smallest possible value of $b$.

Determine all quadruples $ (a,b,c,d)$ of real numbers satisfying the equation: $ 256a^3 b^3 c^3 d^3\equal{}(a^6\plus{}b^2\plus{}c^2\plus{}d^2)(a^2\plus{}b^6\plus{}c^2\plus{}d^2)(a^2\plus{}b^2\plus{}c^6\plus{}d^2)(a^2\plus{}b^2\plus{}c^2\plus{}d^6).$

There are $n$ people at a party. Prove that there are two people such that, of the remaining $n-2$ people, there are at least $\left\lfloor\frac{n}{2}\right\rfloor-1$ of them, each of whom either knows both or else knows neither of the two. Assume that knowing is a symmetric relation, and that $\lfloor x\rfloor$ denotes the greatest integer less than or equal to $x$.

Prove that: for all positive integers $n\ge 2,$ the polynomial$$(x^2-1)^2(x^2-1)^2...(x^2-2023)^2+1$$ is irreducible in $\mathbb{Q}[x].$