Hello, I've been trying to solve this for a while now, but no success! I mean, I have an expression for this but not a closed one. I derived something in terms of Tchebychev Polynomials : cos(nx) = P_n(cos(x)). Any help is appreciated. Compute the following primitive: \[ \int \frac{x\sin\left(2004 x\right)}{\tan x}\ dx\]

Let $f : \left[ 0,1 \right] \to \mathbb R$ be an integrable function such that \[ \int_0^1 f(x) \, dx = \int_0^1 x f(x) \, dx = 1 . \] Prove that \[ \int_0^1 f^2 (x) \, dx \geq 4 . \] [i]Ion Rasa[/i]

Let $n \ge 3$ be an integer. Let $\mathcal{P}$ denote the set of vertices of a regular $n$-gon on the plane. A polynomial $f(x, y)$ of two variables with real coefficients is called $\textit{regular}$ if $$\mathcal{P} = \{(u, v) \in \mathbb{R}^2 \, | \, f(u, v) = 0 \}.$$ Find the smallest possible value of the degree of a regular polynomial. [i]Proposed by Navid Safaei[/i]

(a) Show that, for each positive integer $n$, the number of monic polynomials of degree $n$ with integer coefficients having all its roots on the unit circle is finite. (b) Let $P(x)$ be a monic polynomial with integer coefficients having all its roots on the unit circle. Show that there exists a positive integer $m$ such that $y^m=1$ for each root $y$ of $P(x)$.

Let $p$ be a prime satisfying $p^2\mid 2^{p-1}-1$, and let $n$ be a positive integer. Define \[ f(x) = \frac{(x-1)^{p^n}-(x^{p^n}-1)}{p(x-1)}. \] Find the largest positive integer $N$ such that there exist polynomials $g(x)$, $h(x)$ with integer coefficients and an integer $r$ satisfying $f(x) = (x-r)^N g(x) + p \cdot h(x)$. [i]Proposed by Victor Wang[/i]

If $a$ and $b$ are integers such that $x^2 - x - 1$ is a factor of $ax^3 + bx^2 + 1$, then $b$ is $ \textbf{(A)}\ -2\qquad\textbf{(B)}\ -1\qquad\textbf{(C)}\ 0\qquad\textbf{(D)}\ 1\qquad\textbf{(E)}\ 2 $

Given a polynomial $P(x)=x^4+3x^2-9x+1$. Calculate $P(\alpha^2+\alpha+1)$ where\[ \alpha=\sqrt[3]{\frac{1+\sqrt{5}}{2}}+\sqrt[3]{\frac{1-\sqrt{5}}{2}} \]

If $a, b, c, d$ are the solutions of the equation $x^4-kx-15=0$, find the equation whose solutions are $\frac{a+b+c}{d^2}, \frac{a+b+d}{c^2}, \frac{a+c+d}{b^2}, \frac{b+c+d}{a^2}$.

The cubic equation $x^3 + ax^2 + bx + c = 0$ has three real roots. Show that $a^2-3b\geq 0$, and that $\sqrt{a^2-3b}$ is less than or equal to the difference between the largest and smallest roots.

Steve says to Jon, "I am thinking of a polynomial whose roots are all positive integers. The polynomial has the form $P(x)=2x^3-2ax^2+(a^2-81)x-c$ for some positive integers $a$ and $c$. Can you tell me the values of $a$ and $c$?" After some calculations, Jon says, "There is more than one such polynomial." Steve says, "You’re right. Here is the value of $a$." He writes down a positive integer and asks, "Can you tell me the value of $c$?" Jon says, "There are still two possible values of $c$." Find the sum of the two possible values of $c$.

Prove $ \ \ \ \frac{22}{7}\minus{}\pi \equal{}\int_0^1 \frac{x^4(1\minus{}x)^4}{1\plus{}x^2}\ dx$.

Let $ f(x)\equal{}x^n\plus{}a_{n\minus{}1} x^{n\minus{}1}\plus{}...\plus{}a_0$ $ (n \ge 1)$ be a polynomial with real coefficients such that $ |f(0)|\equal{}f(1)$ and each root $ \alpha$ of $ f$ is real and lies in the interval $ [0,1]$. Prove that the product of the roots does not exceed $ \frac{1}{2^n}$.

$P(x)$ is a nonconstant polynomial with real coefficients and its all roots are real numbers. If there exist a $Q(x)$ polynomial with real coefficients that holds the equality for all $x$ real numbers $(P(x))^{2}=P(Q(x))$, then prove that all the roots of $P(x)$ are same.

Let $f(x)=x^{2021}+15x^{2020}+8x+9$ have roots $a_i$ where $i=1,2,\cdots , 2021$. Let $p(x)$ be a polynomial of the sam degree such that $p \left(a_i + \frac{1}{a_i}+1 \right)=0$ for every $1\leq i \leq 2021$. If $\frac{3p(0)}{4p(1)}=\frac{m}{n}$ where $m,n \in \mathbb{Z}$, $n>0$ and $\gcd(m,n)=1$. Then find $m+n$.

The players Alfred and Bertrand put together a polynomial $x^n + a_{n-1}x^{n- 1} +... + a_0$ with the given degree $n \ge 2$. To do this, they alternately choose the value in $n$ moves one coefficient each, whereby all coefficients must be integers and $a_0 \ne 0$ must apply. Alfred's starts first . Alfred wins if the polynomial has an integer zero at the end. (a) For which $n$ can Alfred force victory if the coefficients $a_j$ are from the right to the left, i.e. for $j = 0, 1,. . . , n - 1$, be determined? (b) For which $n$ can Alfred force victory if the coefficients $a_j$ are from the left to the right, i.e. for $j = n -1, n - 2,. . . , 0$, be determined? (Theresia Eisenkölbl, Clemens Heuberger)

Each coefficient of a polynomial is an integer with absolute value not exceeding $2015$. Prove that every positive root of this polynomial exceeds $\frac{1}{2016}$. [i]($6$ points)[/i]

Let \( A \) and \( B \) be two square matrices with complex entries such that \( A + B = AB \), \( A = A^* \), and \( A \) has all distinct eigenvalues. Prove that there exists a polynomial \( P \) with complex coefficients such that \( P(A) = B \).

There are some counters in some cells of $100\times 100$ board. Call a cell [i]nice[/i] if there are an even number of counters in adjacent cells. Can exactly one cell be [i]nice[/i]? [i]K. Knop[/i]

If $ \{a_k\}$ is a sequence of real numbers, call the sequence $ \{a'_k\}$ defined by $ a_k' \equal{} \frac {a_k \plus{} a_{k \plus{} 1}}2$ the [i]average sequence[/i] of $ \{a_k\}$. Consider the sequences $ \{a_k\}$; $ \{a_k'\}$ - [i]average sequence[/i] of $ \{a_k\}$; $ \{a_k''\}$ - average sequence of $ \{a_k'\}$ and so on. If all these sequences consist only of integers, then $ \{a_k\}$ is called [i]Good[/i]. Prove that if $ \{x_k\}$ is a [i]good[/i] sequence, then $ \{x_k^2\}$ is also [i]good[/i].

Let \[f(n)=\dfrac{5+3\sqrt{5}}{10}\left(\dfrac{1+\sqrt{5}}{2}\right)^n+\dfrac{5-3\sqrt{5}}{10}\left(\dfrac{1-\sqrt{5}}{2}\right)^n.\] Then $f(n+1)-f(n-1)$, expressed in terms of $f(n)$, equals: $\textbf{(A)}\ \dfrac{1}{2}f(n) \qquad \textbf{(B)}\ f(n)\qquad \textbf{(C)}\ 2f(n)+1 \qquad \textbf{(D)}\ f^2(n) \qquad \textbf{(E)}\ \dfrac{1}{2}(f^2(n)-1)$

Let $P(x)$ be a monic polynomial of degree $100$ with $100$ distinct noninteger real roots. Suppose that each of polynomials $P(2x^2 - 4x)$ and $P(4x - 2x^2)$ has exactly $130$ distinct real roots. Prove that there exist non constant polynomials $A(x),B(x)$ such that $A(x)B(x) = P(x)$ and $A(x) = B(x)$ has no root in $(-1.1)$

Find all positive integers $n$ for which there exists a polynomial $P(x) \in \mathbb{Z}[x]$ such that for every positive integer $m\geq 1$, the numbers $P^m(1), \ldots, P^m(n)$ leave exactly $\lceil n/2^m\rceil$ distinct remainders when divided by $n$. (Here, $P^m$ means $P$ applied $m$ times.) [i]Proposed by Carl Schildkraut, USA[/i]

A magician intends to perform the following trick. She announces a positive integer $n$, along with $2n$ real numbers $x_1 < \dots < x_{2n}$, to the audience. A member of the audience then secretly chooses a polynomial $P(x)$ of degree $n$ with real coefficients, computes the $2n$ values $P(x_1), \dots , P(x_{2n})$, and writes down these $2n$ values on the blackboard in non-decreasing order. After that the magician announces the secret polynomial to the audience. Can the magician find a strategy to perform such a trick?

Let $ a>0$, and let $ P(x)$ be a polynomial with integer coefficients such that \[ P(1)\equal{}P(3)\equal{}P(5)\equal{}P(7)\equal{}a\text{, and}\] \[ P(2)\equal{}P(4)\equal{}P(6)\equal{}P(8)\equal{}\minus{}a\text{.}\] What is the smallest possible value of $ a$? $ \textbf{(A)}\ 105 \qquad \textbf{(B)}\ 315 \qquad \textbf{(C)}\ 945 \qquad \textbf{(D)}\ 7! \qquad \textbf{(E)}\ 8!$

A polynomial $P(x) = 1 + x^2 + x^5 + x^{n_1} + ...+ x^{n_s} + x^{2008}$ with $n_1, ..., n_s$ are positive integers and $5 < n_1 < ... <n_s < 2008$ are given. Prove that if $P(x)$ has at least a real root, then the root is not greater than $\frac{1-\sqrt5}{2}$