is there any polynomial of $deg=2007$ with integer coefficients,such that for any integer $n$,$f(n),f(f(n)),f(f(f(n))),...$ is coprime to each other?

Let $$P(X)=a_{0}X^{n}+a_{1}X^{n-1}+\cdots+a_{n}$$ be a polynomial with real coefficients such that $a_{0}>0$ and $$a_{n}\geq a_{i}\geq 0,$$ for all $i=0,1,2,\ldots,n-1.$ Prove that if $$P^{2}(X)=b_{0}X^{2n}+b_{1}X^{2n-1}+\cdots+b_{n-1}X^{n+1}+\cdots+b_{2n},$$ then $P^2(1)\geq 2b_{n-1}.$

Express $\sum_{k=1}^\infty\frac{6^k}{(3^{k+1}-2^{k+1})(3^k-2^k)}$ as a rational number.

Let $f:\mathbb{R}\longrightarrow \mathbb{R}$ be a function such that $f(x+y+xy)=f(x)+f(y)+f(xy)$ for all $x, y\in\mathbb{R}$. Prove that $f$ satisfies $f(x+y)=f(x)+f(y)$ for all $x, y\in\mathbb{R}$.

Let $A$ be the set $\{2,7,11,13\}$. A polynomial $f$ with integer coefficients possesses the following property: for each integer $n$ there exists $p \in A$ such that $p|f(n)$. Prove that there exists $p \in A$ such that $p|f(n)$ for all integers $n$.

We are given a real number $a$, not equal to $0$ or $1$. Sacho and Deni play the following game. First is Sasho and then Deni and so on (they take turns). On each turn, a player changes one of the “*” symbols in the equation: \[*x^4+*x^3+*x^2+*x^1+*=0\] with a number of the type $a^n$, where $n$ is a whole number. Sasho wins if at the end the equation has no real roots, Deni wins otherwise. Determine (in term of $a$) who has a winning strategy

Find all funtions $f:\mathbb R\to\mathbb R$ such that: $$f(xy-1)+f(x)f(y)=2xy-1$$ for all $x,y\in \mathbb{R}$.

$f$ is a one-to-one function from the set of positive integers to itself such that $$f(xy) = f(x) × f(y)$$ Find the minimum possible value of $f(2020)$.

Find all $\mathbb Q$-linear maps $\Phi:\mathbb Q[x]\to\mathbb Q[x]$ such that for any irreducible polynomial $p\in\mathbb Q[x]$ the polynomial $\Phi(p)$ is also irreducible.

$p(x)\in \mathbb{C}[x]$ is a polynomial such that: $\forall z\in \mathbb{C}, |z|=1\Longrightarrow p(z)\in \mathbb{R}$ Prove that $p(x)$ is constant.

[u]Set 4[/u] [b]p10.[/b] Eve has nine letter tiles: three $C$’s, three $M$’s, and three $W$’s. If she arranges them in a random order, what is the probability that the string “$CMWMC$” appears somewhere in the arrangement? [b]p11.[/b] Bethany’s Batteries sells two kinds of batteries: $C$ batteries for $\$4$ per package, and $D$ batteries for $\$7$ per package. After a busy day, Bethany looks at her ledger and sees that every customer that day spent exactly $\$2021$, and no two of them purchased the same quantities of both types of battery. Bethany also notes that if any other customer had come, at least one of these two conditions would’ve had to fail. How many packages of batteries did Bethany sell? [b]p12.[/b] A deck of cards consists of $30$ cards labeled with the integers $1$ to $30$, inclusive. The cards numbered $1$ through $15$ are purple, and the cards numbered $16$ through $30$ are green. Lilith has an expansion pack to the deck that contains six indistinguishable copies of a green card labeled with the number $32$. Lilith wants to pick from the expanded deck a hand of two cards such that at least one card is green. Find the number of distinguishable hands Lilith can make with this deck. PS. You should use hide for answers.

An infinite sequence $ \,x_{0},x_{1},x_{2},\ldots \,$ of real numbers is said to be [b]bounded[/b] if there is a constant $ \,C\,$ such that $ \, \vert x_{i} \vert \leq C\,$ for every $ \,i\geq 0$. Given any real number $ \,a > 1,\,$ construct a bounded infinite sequence $ x_{0},x_{1},x_{2},\ldots \,$ such that \[ \vert x_{i} \minus{} x_{j} \vert \vert i \minus{} j \vert^{a}\geq 1 \] for every pair of distinct nonnegative integers $ i, j$.

Let $\mathbb{N} = \{1,2, \ldots\}.$ Does there exists a function $f: \mathbb{N} \mapsto \mathbb{N}$ such that $\forall n \in \mathbb{N},$ $f^{1989}(n) = 2 \cdot n$ ?

Let $n > 1$ and $p(x)=x^n+a_{n-1}x^{n-1} +...+a_0$ be a polynomial with $n$ real roots (counted with multiplicity). Let the polynomial $q$ be defined by $$q(x) = \prod_{j=1}^{2015} p(x + j)$$. We know that $p(2015) = 2015$. Prove that $q$ has at least $1970$ different roots $r_1, ..., r_{1970}$ such that $|r_j| < 2015$ for all $ j = 1, ..., 1970$.

Consider the polynomials \begin{align*}P(x) &= (x + \sqrt{2})(x^2 - 2x + 2)\\Q(x) &= (x - \sqrt{2})(x^2 + 2x + 2)\\R(x) &= (x^2 + 2)(x^8 + 16).\end{align*} Find the coefficient of $x^4$ in $P(x)\cdot Q(x)\cdot R(x)$.

Let $n$ be a positive integer, and consider a sequence $a_1 , a_2 , \dotsc , a_n $ of positive integers. Extend it periodically to an infinite sequence $a_1 , a_2 , \dotsc $ by defining $a_{n+i} = a_i $ for all $i \ge 1$. If \[a_1 \le a_2 \le \dots \le a_n \le a_1 +n \] and \[a_{a_i } \le n+i-1 \quad\text{for}\quad i=1,2,\dotsc, n, \] prove that \[a_1 + \dots +a_n \le n^2. \]

Find all integers $ (x,y,z)$, satisfying equality: $ x^2(y \minus{} z) \plus{} y^2(z \minus{} x) \plus{} z^2(x \minus{} y) \equal{} 2$

Let $p(x) = a_{21} x^{21} + a_{20} x^{20} + \dots + a_1 x + 1$ be a polynomial with integer coefficients and real roots such that the absolute value of all of its roots are less than $1/3$, and all the coefficients of $p(x)$ are lying in the interval $[-2019a,2019a]$ for some positive integer $a$. Prove that if this polynomial is reducible in $\mathbb{Z}[x]$, then the coefficients of one of its factors are less than $a$. [i]Submitted by Navid Safaei, Tehran, Iran[/i]

Find all functions $ f: (0, \infty) \mapsto (0, \infty)$ (so $ f$ is a function from the positive real numbers) such that \[ \frac {\left( f(w) \right)^2 \plus{} \left( f(x) \right)^2}{f(y^2) \plus{} f(z^2) } \equal{} \frac {w^2 \plus{} x^2}{y^2 \plus{} z^2} \] for all positive real numbers $ w,x,y,z,$ satisfying $ wx \equal{} yz.$ [i]Author: Hojoo Lee, South Korea[/i]

Let $\alpha$ be a fixed real number. Find all functions $f:\mathbb R \to \mathbb R$ such that $$f(f(x + y)f(x - y)) = x^2 + \alpha yf(y)$$for all $x,y \in \mathbb R$. [i]Proposed by Walther Janous[/i]

Prove that $$ (n+2)^n=\prod_{k=1}^{n+1} \sum_{l=1}^{n+1} le^{\frac{2i\pi k (n-l+1)}{n+2}} , $$ for any natural number $ n. $ [i]Mihai Piticari[/i]

Let $n$ be a positive integer greater than $2$. Solve in nonnegative real numbers the following system of equations \[x_{k}+x_{k+1}=x_{k+2}^{2}\quad , \quad k=1,2,\cdots,n\] where $x_{n+1}=x_{1}$ and $x_{n+2}=x_{2}$.

Prove that for every natural number $ n \geq 2 $ the inequality holds $$ \log_n 2 \cdot \log_n 4 \cdot \log_n 6 \ldots \log_n (2n - 2) \leq 1.$$

We say a finite set $S$ of points in the plane is [i]very[/i] if for every point $X$ in $S$, there exists an inversion with center $X$ mapping every point in $S$ other than $X$ to another point in $S$ (possibly the same point). (a) Fix an integer $n$. Prove that if $n \ge 2$, then any line segment $\overline{AB}$ contains a unique very set $S$ of size $n$ such that $A, B \in S$. (b) Find the largest possible size of a very set not contained in any line. (Here, an [i]inversion[/i] with center $O$ and radius $r$ sends every point $P$ other than $O$ to the point $P'$ along ray $OP$ such that $OP\cdot OP' = r^2$.) [i]Proposed by Sammy Luo[/i]

Indicate all the roots of the equation $x^2+1 = \cos x$.