Given positive integer $n$, find the largest real number $\lambda=\lambda(n)$, such that for any degree $n$ polynomial with complex coefficients $f(x)=a_n x^n+a_{n-1} x^{n-1}+\cdots+a_0$, and any permutation $x_0,x_1,\cdots,x_n$ of $0,1,\cdots,n$, the following inequality holds $\sum_{k=0}^n|f(x_k)-f(x_{k+1})|\geq \lambda |a_n|$, where $x_{n+1}=x_0$.

A polynomial with integer coefficients takes the value $5$ at five distinct integers. Show that it does not take the value $9$ at any integer.

Let $ n\ge 3$ be an integer. Let $ f(x)$ and $ g(x)$ be polynomials with real coefficients such that the points $ (f(1),g(1)),(f(2),g(2)),\dots,(f(n),g(n))$ in $ \mathbb{R}^2$ are the vertices of a regular $ n$-gon in counterclockwise order. Prove that at least one of $ f(x)$ and $ g(x)$ has degree greater than or equal to $ n\minus{}1.$

Let $f$ be a polynomial of degree $n$ with integer coefficients and $p$ a prime for which $f$, considered modulo $p$, is a degree-$k$ irreducible polynomial over $\mathbb{F}_p$. Show that $k$ divides the degree of the splitting field of $f$ over $\mathbb{Q}$.

Do there exist polynomials $p(x)$ and $q(x)$ with real coefficients such that $p^3(x)-q^2(x)$ is linear but not constant?

Determine all positive integers $n$ such that the following statement holds: If a convex polygon with with $2n$ sides $A_1 A_2 \ldots A_{2n}$ is inscribed in a circle and $n-1$ of its $n$ pairs of opposite sides are parallel, which means if the pairs of opposite sides \[(A_1 A_2, A_{n+1} A_{n+2}), (A_2 A_3, A_{n+2} A_{n+3}), \ldots , (A_{n-1} A_n, A_{2n-1} A_{2n})\] are parallel, then the sides \[ A_n A_{n+1}, A_{2n} A_1\] are parallel as well.

Let $p = \overline{abcd}$ be a $4$-digit prime number. Prove that the equation $ax^3+bx^2+cx+d=0$ has no rational roots.

find all real coefficient polynomial $ P(x)$ such that $ P(x)P(x\plus{}1)\equal{}P(x^2\plus{}x\plus{}1)$ for all $ x$

Let $f(X)$ be a monic irreducible polynomial over $\mathbb{Z}$; therefore, by Gauss's Lemma, $f$ is also irreducible over $\mathbb{Q}$ (you may assume this). Moreover, assume $f(X) \mid f\left(X^2+n\right)$ where $n$ is an integer such that $n \notin\{-1,0,1\}$. Show that $n^2 \nmid f(0)$.

Polynomials $u_i(x) = a_ix+b_i$ ($a_i,b_i \in R$, $ i = 1,2,3$) satisfy $$u_1(x)^n +u_2(x)^n = u_3(x)^n$$ for some integer $n \ge 2.$ Prove that there exist real numbers $A$,$B$,$c_1$,$c_2$,$c_3$ such that $u_i(x) = c_i(Ax+B)$ for $i = 1,2,3$.

Let $ p(x)\equal{}a_0 \plus{}a_1 x\plus{}...\plus{}a_n x^n$ be a polynomial with nonnegative real coefficients. Suppose that $ p(4)\equal{}2$ and $ p(16)\equal{}8$. Prove that $ p(8) \le 4$ and find all such $ p$ with $ p(8)\equal{}4$.

Find a non-zero polynomial $f(x, y)$ such that $f(\lfloor 3t \rfloor, \lfloor 5t \rfloor) = 0$ for all real numbers $t$.

Determine all intergers $n\geq 2$ such that $a+\sqrt{2}$ and $a^n+\sqrt{2}$ are both rational for some real number $a$ depending on $n$

Let $\mathcal{M}=\mathbb{Q}[x,y,z]$ be the set of three-variable polynomials with rational coefficients. Prove that for any non-zero polynomial $P\in \mathcal{M}$ there exists non-zero polynomials $Q,R\in \mathcal{M}$ such that \[ R(x^2y,y^2z,z^2x) = P(x,y,z)Q(x,y,z). \]

Let $n$ be a positive integer. Find all polynomials $P$ with real coefficients such that $$P(x^2+x-n^2)=P(x)^2+P(x)$$ for all real numbers $x$.

Let $ I$ be an ideal of the ring $\mathbb{Z}\left[x\right]$ of all polynomials with integer coefficients such that a) the elements of $ I$ do not have a common divisor of degree greater than $ 0$, and b) $ I$ contains of a polynomial with constant term $ 1$. Prove that $ I$ contains the polynomial $ 1 + x + x^2 + ... + x^{r-1}$ for some natural number $ r$. [i]Gy. Szekeres[/i]

Suppose that $P(x, y, z)$ is a homogeneous degree 4 polynomial in three variables such that $P(a, b, c) = P(b, c, a)$ and $P(a, a, b) = 0$ for all real $a$, $b$, and $c$. If $P(1, 2, 3) = 1$, compute $P(2, 4, 8)$. Note: $P(x, y, z)$ is a homogeneous degree $4$ polynomial if it satisfies $P(ka, kb, kc) = k^4P(a, b, c)$ for all real $k, a, b, c$.

Let $p(x)=x^n+a_{n-1}x^{n-1}+\cdots+a_1x+a_0$ be a monic polynomial of degree $n>2$, with real coefficients and all its roots real and different from zero. Prove that for all $k=0,1,2,\cdots,n-2$, at least one of the coefficients $a_k,a_{k+1}$ is different from zero.

Does there exist functions $ f,g: \mathbb{R}\to\mathbb{R}$ such that $ f(g(x)) \equal{} x^2$ and $ g(f(x)) \equal{} x^k$ for all real numbers $ x$ a) if $ k \equal{} 3$? b) if $ k \equal{} 4$?

Prove that the polynomial $P(x) = x^5-x+a$ is irreducible over $\mathbb{Z}$ if $5 \nmid a$.

If $2$ is a solution (root) of $x^3+hx+10=0$, then $h$ equals: $ \textbf{(A) }10\qquad\textbf{(B) }9 \qquad\textbf{(C) }2\qquad\textbf{(D) }-2\qquad\textbf{(E) }-9 $

For a prime $p$, let $\mathbb{F}_p$ denote the integers modulo $p$, and let $\mathbb{F}_p[x]$ be the set of polynomials with coefficients in $\mathbb{F}_p$. Find all $p$ for which there exists a quartic polynomial $P(x) \in \mathbb{F}_p[x]$ such that for all integers $k$, there exists some integer $\ell$ such that $P(\ell) \equiv k \pmod p$. (Note that there are $p^4(p-1)$ quartic polynomials in $\mathbb{F}_p[x]$ in total.) [i]Aprameya Tripathy[/i]

Show that there are infinitely many pairs of prime numbers $(p,q)$ such that $p\mid 2^{q-1}-1$ and $q\mid 2^{p-1}-1$.

The following figure shows a [i]walk[/i] of length 6: [asy] unitsize(20); for (int x = -5; x <= 5; ++x) for (int y = 0; y <= 5; ++y) dot((x, y)); label("$O$", (0, 0), S); draw((0, 0) -- (1, 0) -- (1, 1) -- (0, 1) -- (-1, 1) -- (-1, 2) -- (-1, 3)); [/asy] This walk has three interesting properties: [list] [*] It starts at the origin, labelled $O$. [*] Each step is 1 unit north, east, or west. There are no south steps. [*] The walk never comes back to a point it has been to.[/list] Let's call a walk with these three properties a [i]northern walk[/i]. There are 3 northern walks of length 1 and 7 northern walks of length 2. How many northern walks of length 6 are there?

Let $ f(x)$and $ g(y)$ be two monic polynomials of degree=$ n$ having complex coefficients. We know that there exist complex numbers $ a_i,b_i,c_i \forall 1\le i \le n$, such that $ f(x)\minus{}g(y)\equal{}\prod_{i\equal{}1}^n{(a_ix\plus{}b_iy\plus{}c_i)}$. Prove that there exists $ a,b,c\in\mathbb{C}$ such that $ f(x)\equal{}(x\plus{}a)^n\plus{}c\text{ and }g(y)\equal{}(y\plus{}b)^n\plus{}c$.