Let $a=-\sqrt{3}+\sqrt{5}+\sqrt{7}, b=\sqrt{3}-\sqrt{5}+\sqrt{7}, c=\sqrt{3}+\sqrt{5}-\sqrt{7}$. Evaluate \[\frac{a^4}{(a-b)(a-c)}+\frac{b^4}{(b-c)(b-a)}+\frac{c^4}{(c-a)(c-b)}.\]

Let $A\in M_4(\mathbb R)$ be an invertible matrix s.t. $\det(A+^tA)=5\det A$ and $\det (A-^tA)=\det A$. Prove that for every complex root $\omega$ of order 5 of unitity (i.e. $\omega^5=1,\omega\not\in\mathbb R$) the following relation holds $\det(\omega A+^tA)=0$. [i]Dan Popescu[/i]

Find all polynomials $P(x)$ with real coefficients such that for all real $x$ holds the equality $$(1 + 2x)P(2x) = (1 + 2^{1999}x)P(x) .$$

Find all cubic polynomials $x^3 +ax^2 +bx+c$ admitting the rational numbers $a$, $b$ and $c$ as roots.

Find all non-zero real numbers $a, b, c$ such that the following polynomial has four (not necessarily distinct) positive real roots. $$P(x) = ax^4 - 8ax^3 + bx^2 - 32cx + 16c$$

Let $(F_n)_{n\geq 1} $ be the Fibonacci sequence $F_1 = F_2 = 1, F_{n+2} = F_{n+1} + F_n (n \geq 1),$ and $P(x)$ the polynomial of degree $990$ satisfying \[ P(k) = F_k, \qquad \text{ for } k = 992, . . . , 1982.\] Prove that $P(1983) = F_{1983} - 1.$

Prove that there exist infinitely many positive integers $n$ such that the largest prime divisor of $n^4 + n^2 + 1$ is equal to the largest prime divisor of $(n+1)^4 + (n+1)^2 +1$.

Let $p$ be a positive integer, $p>1.$ Find the number of $m\times n$ matrices with entries in the set $\left\{ 1,2,\dots,p\right\} $ and such that the sum of elements on each row and each column is not divisible by $p.$

A finite set $S$ of unit squares is chosen out of a large grid of unit squares. The squares of $S$ are tiled with isosceles right triangles of hypotenuse $2$ so that the triangles do not overlap each other, do not extend past $S$, and all of $S$ is fully covered by the triangles. Additionally, the hypotenuse of each triangle lies along a grid line, and the vertices of the triangles lie at the corners of the squares. Show that the number of triangles must be a multiple of $4$.

If $a_i \ (i = 1, 2, \ldots, n)$ are distinct non-zero real numbers, prove that the equation \[\frac{a_1}{a_1-x} + \frac{a_2}{a_2-x}+\cdots+\frac{a_n}{a_n-x} = n\] has at least $n - 1$ real roots.

Let $ A\equal{}(a_{ij})_{1\leq i,j\leq n}$ be a real $ n\times n$ matrix, such that $ a_{ij} \plus{} a_{ji} \equal{} 0$, for all $ i,j$. Prove that for all non-negative real numbers $ x,y$ we have \[ \det(A\plus{}xI_n)\cdot \det(A\plus{}yI_n) \geq \det (A\plus{}\sqrt{xy}I_n)^2.\]

Determine all polynomials $P(x)$ with degree $n\geq 1$ and integer coefficients so that for every real number $x$ the following condition is satisfied $$P(x)=(x-P(0))(x-P(1))(x-P(2))\cdots (x-P(n-1))$$

Let $S$ denote the sum of the 2011th powers of the roots of the polynomial $(x-2^0)(x-2^1) \cdots (x-2^{2010}) - 1$. How many ones are in the binary expansion of $S$? [i]Author: Alex Zhu[/i]

Write the sum $\sum_{i=0}^{n}{\frac{(-1)^i\cdot\binom{n}{i}}{i^3 +9i^2 +26i +24}}$ as the ratio of two explicitly defined polynomials with integer coefficients.

For which positive integers $n$ can the polynomial $p(x) = 1 + x^n + x^{2n}$ is written as a product of two polynomials with integer coefficients (of degree $\ge 1$)?

Find all polynomials whose coefficients are all $\pm1$ and whose roots are all real.

Let $A,B\in \mathcal{M}_n(\mathbb{C})$ be two $n \times n$ matrices such that \[ A^2B+BA^2=2ABA \] Prove there exists $k\in \mathbb{N}$ such that \[ (AB-BA)^k=\mathbf{0}_n\] Here $\mathbf{0}_n$ is the null matrix of order $n$.

Figures $ 0$, $ 1$, $ 2$, and $ 3$ consist of $ 1$, $ 5$, $ 13$, and $ 25$ nonoverlapping squares, respectively. If the pattern were continued, how many nonoverlapping squares would there be in figure $ 100$? [asy] unitsize(8); draw((0,0)--(1,0)--(1,1)--(0,1)--cycle); draw((9,0)--(10,0)--(10,3)--(9,3)--cycle); draw((8,1)--(11,1)--(11,2)--(8,2)--cycle); draw((19,0)--(20,0)--(20,5)--(19,5)--cycle); draw((18,1)--(21,1)--(21,4)--(18,4)--cycle); draw((17,2)--(22,2)--(22,3)--(17,3)--cycle); draw((32,0)--(33,0)--(33,7)--(32,7)--cycle); draw((29,3)--(36,3)--(36,4)--(29,4)--cycle); draw((31,1)--(34,1)--(34,6)--(31,6)--cycle); draw((30,2)--(35,2)--(35,5)--(30,5)--cycle); label("Figure",(0.5,-1),S); label("$0$",(0.5,-2.5),S); label("Figure",(9.5,-1),S); label("$1$",(9.5,-2.5),S); label("Figure",(19.5,-1),S); label("$2$",(19.5,-2.5),S); label("Figure",(32.5,-1),S); label("$3$",(32.5,-2.5),S);[/asy]$ \textbf{(A)}\ 10401 \qquad \textbf{(B)}\ 19801 \qquad \textbf{(C)}\ 20201 \qquad \textbf{(D)}\ 39801 \qquad \textbf{(E)}\ 40801$

Suppose the polynomial $P(x) \equiv x^3 + ax^2 + bx +c$ has only real zeroes and let $Q(x) \equiv 5x^2 - 16x + 2004$. Assume that $P(Q(x)) = 0$ has no real roots. Prove that $P(2004) > 2004$

[b]a)[/b] Prove that for every natural numbers $n$ and $k$, we have monic polynomials of degree $n$, with integer coefficients like $A=\{P_1(x),.....,P_k(x)\}$ such that no two of them have a common factor and for every subset of $A$, the sum of elements of $A$ has all its roots real. [b]b)[/b] Are there infinitely many monic polynomial of degree $n$ with integer coefficients like $P_1(x),P_2(x),....$ such that no two of them have a common factor and the sum of a finite number of them has all it's roots real? [i]proposed by Mohammad Mansouri[/i]

Provided that the roots of the polynom $ X^n+a_1X^{n-1} +a_2X^{n-2} +\cdots +a_{n-1}X +a_n:\in\mathbb{R}[X] , $ of degree $ n\ge 2, $ are all real and pairwise distinct, prove that there exists is a neighbourhood $ \mathcal{V} $ of $ \left( a_1,a_2,\ldots ,a_n \right) $ in $ \mathbb{R}^n $ and $ n $ functions $ x_1,x_2,\ldots ,x_n\in\mathcal{C}^{\infty } \left( \mathcal{V} \right) $ whose values at $ \left( a_1,a_2,\ldots ,a_n \right) $ are roots of the mentioned polynom.

Do there exist a sequence $a_{1}, a_{2}, a_{3}, \ldots$ of real numbers and a non-constant polynomial $P(x)$ such that $a_{m}+a_{n}=P(mn)$ for every positive integral $m$ and $n?$ [i]Proposed by A. Golovanov[/i]

Let $P(x)=x^4+5x^3+mx^2+5nx+4$ have $2$ distinct real roots, which sum up to $-5$. If $m,n \in \mathbb {Z_+}$, find the values of $m,n$ and their corresponding roots.

Let $c$ denote the largest possible real number such that there exists a nonconstant polynomial $P$ with \[P(z^2)=P(z-c)P(z+c)\] for all $z$. Compute the sum of all values of $P(\tfrac13)$ over all nonconstant polynomials $P$ satisfying the above constraint for this $c$.

Let $ n \geq 2, n \in \mathbb{N}$ and let $ p, a_1, a_2, \ldots, a_n, b_1, b_2, \ldots, b_n \in \mathbb{R}$ satisfying $ \frac{1}{2} \leq p \leq 1,$ $ 0 \leq a_i,$ $ 0 \leq b_i \leq p,$ $ i \equal{} 1, \ldots, n,$ and \[ \sum^n_{i\equal{}1} a_i \equal{} \sum^n_{i\equal{}1} b_i.\] Prove the inequality: \[ \sum^n_{i\equal{}1} b_i \prod^n_{j \equal{} 1, j \neq i} a_j \leq \frac{p}{(n\minus{}1)^{n\minus{}1}}.\]