Found problems: 3597
2004 Unirea, 3
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\]
2012 Stanford Mathematics Tournament, 5
The quartic (4th-degree) polynomial P(x) satisfies $P(1)=0$ and attains its maximum value of $3$ at both $x=2$ and $x=3$. Compute $P(5)$.
2014 Contests, 3
Let $p,q\in \mathbb{R}[x]$ such that $p(z)q(\overline{z})$ is always a real number for every complex number $z$. Prove that $p(x)=kq(x)$ for some constant $k \in \mathbb{R}$ or $q(x)=0$.
[i]Proposed by Mohammad Ahmadi[/i]
1999 Junior Balkan Team Selection Tests - Romania, 1
Let be a natural number $ n. $ Prove that there is a polynomial $ P\in\mathbb{Z} [X,Y] $ such that $ a+b+c=0 $ implies
$$ a^{2n+1}+b^{2n+1}+c^{2n+1}=abc\left( P(a,b)+P(b,c)+P(c,a)\right) $$
[i]Dan Brânzei[/i]
1983 Putnam, B2
For positive integers $n$, let $C(n)$ be the number of representation of $n$ as a sum of nonincreasing powers of $2$, where no power can be used more than three times. For example, $C(8)=5$ since the representations of $8$ are:
$$8,4+4,4+2+2,4+2+1+1,\text{ and }2+2+2+1+1.$$Prove or disprove that there is a polynomial $P(x)$ such that $C(n)=\lfloor P(n)\rfloor$ for all positive integers $n$.
1984 IMO, 2
Find one pair of positive integers $a,b$ such that $ab(a+b)$ is not divisible by $7$, but $(a+b)^7-a^7-b^7$ is divisible by $7^7$.
1980 Yugoslav Team Selection Test, Problem 2
Let $a,b,c,m$ be integers, where $m>1$. Prove that if
$$a^n+bn+c\equiv0\pmod m$$for each natural number $n$, then $b^2\equiv0\pmod m$. Must $b\equiv0\pmod m$ also hold?
1934 Eotvos Mathematical Competition, 2
Which polygon inscribed in a given circle has the property that the sum of the squares of the lengths of its sides is maximum?
1959 Poland - Second Round, 1
What necessary and sufficient condition should the coefficients $ a $, $ b $, $ c $, $ d $ satisfy so that the equation
$$ax^3 + bx^2 + cx + d = 0$$
has two opposite roots?
2012 Philippine MO, 2
Let $f$ be a polynomial function with integer coefficients and $p$ be a prime number. Suppose there are at least four distinct integers satisfying $f(x) = p$. Show that $f$ does not have integer zeros.
2001 All-Russian Olympiad, 1
The polynomial $ P(x)\equal{}x^3\plus{}ax^2\plus{}bx\plus{}d$ has three distinct real roots. The polynomial $ P(Q(x))$, where $ Q(x)\equal{}x^2\plus{}x\plus{}2001$, has no real roots. Prove that $ P(2001)>\frac{1}{64}$.
2006 All-Russian Olympiad, 7
Assume that the polynomial $\left(x+1\right)^n-1$ is divisible by some polynomial $P\left(x\right)=x^k+c_{k-1}x^{k-1}+c_{k-2}x^{k-2}+...+c_1x+c_0$, whose degree $k$ is even and whose coefficients $c_{k-1}$, $c_{k-2}$, ..., $c_1$, $c_0$ all are odd integers. Show that $k+1\mid n$.
2018 CMIMC Algebra, 8
Suppose $P$ is a cubic polynomial satisfying $P(0) = 3$ and \[(x^3 - 2x + 1 - P(x))(2x^3 - 5x^2 + 4 - P(x))\leq 0\] for all $x\in\mathbb R$. Determine all possible values of $P(-1)$.
2010 Brazil National Olympiad, 2
Let $P(x)$ be a polynomial with real coefficients. Prove that there exist positive integers $n$ and $k$ such that $k$ has $n$ digits and more than $P(n)$ positive divisors.
1998 Denmark MO - Mohr Contest, 2
For any real number$m$, the equation $$x^2+(m-2)x- (m+3)=0$$ has two solutions, denoted $x_1 $and $ x_2$. Determine $m$ such that $x_1^2+x_2^2$ is the minimum possible.
2007 Stanford Mathematics Tournament, 5
The polynomial $-400x^5+2660x^4-3602x^3+1510x^2+18x-90$ has five rational roots. Suppose you guess a rational number which could possibly be a root (according to the rational root theorem). What is the probability that it actually is a root?
2020 New Zealand MO, 1
Let $P(x) = x^3 - 2x + 1$ and let $Q(x) = x^3 - 4x^2 + 4x - 1$. Show that if $P(r) = 0$ then $Q(r^2) = 0$.
2013 Iran MO (3rd Round), 4
Prime $p=n^2 +1$ is given. Find the sets of solutions to the below equation:
\[x^2 - (n^2 +1)y^2 = n^2.\]
(25 points)
2009 IMC, 4
Let $p$ be a prime number and $\mathbf{W}\subseteq \mathbb{F}_p[x]$ be the smallest set satisfying the following :
[list]
(a) $x+1\in \mathbf{W}$ and $x^{p-2}+x^{p-3}+\cdots +x^2+2x+1\in \mathbf{W}$
(b) For $\gamma_1,\gamma_2$ in $\mathbf{W}$, we also have $\gamma(x)\in \mathbf{W}$, where $\gamma(x)$ is the remainder $(\gamma_1\circ \gamma_2)(x)\pmod {x^p-x}$.[/list]
How many polynomials are in $\mathbf{W}?$
2011 Postal Coaching, 1
Prove that, for any positive integer $n$, there exists a polynomial $p(x)$ of degree at most $n$ whose coefficients are all integers such that, $p(k)$ is divisible by $2^n$ for every even integer $k$, and $p(k) -1$ is divisible by $2^n$ for every odd integer $k$.
VI Soros Olympiad 1999 - 2000 (Russia), 11.6
Let $P(x)$ be a polynomial with integer coefficients. It is known that the number $\sqrt2+\sqrt3$ is its root. Prove that the number $\sqrt2-\sqrt3$ is also its root.
2006 Polish MO Finals, 3
Find all pairs of integers $a,b$ for which there exists a polynomial $P(x) \in \mathbb{Z}[X]$ such that product $(x^2+ax+b)\cdot P(x)$ is a polynomial of a form \[ x^n+c_{n-1}x^{n-1}+\cdots+c_1x+c_0 \] where each of $c_0,c_1,\ldots,c_{n-1}$ is equal to $1$ or $-1$.
1978 Putnam, B5
Find the largest $a$ for which there exists a polynomial
$$P(x) =a x^4 +bx^3 +cx^2 +dx +e$$
with real coefficients which satisfies $0\leq P(x) \leq 1$ for $-1 \leq x \leq 1.$
1993 Romania Team Selection Test, 2
For coprime integers $m > n > 1$ consider the polynomials $f(x) = x^{m+n} -x^{m+1} -x+1$ and $g(x) = x^{m+n} +x^{n+1} -x+1$. If $f$ and $g$ have a common divisor of degree greater than $1$, find this divisor.
2018 Brazil Team Selection Test, 5
Prove: there are polynomials $S_1, S_2, \ldots$ in the variables $x_1, x_2, \ldots,y_1, y_2,\ldots$ with integer coefficients satisfying, for every integer $n \ge 1$, $$\sum_{d \mid n} d \cdot S_d ^{n/d}=\sum_{d \mid n} d \cdot (x_d ^{n/d}+y_d ^{n/d}) \quad (*)$$
Here, the sums run through the positive divisors $d$ of $n$.
For example, the first two polynomials are $S_1 = x_1 + y_1$ and $S_2 = x_2 + y_2 - x_1y_1$, which verify identity
$(*)$ for $n = 2$: $S_1^2 + 2S_2 = (x_1^2 + y_1^2) + 2 \cdot(x_2 + y_2)$.