This website contains problems from math contests. Problems and corresponding tags were obtained from the Art of Problem Solving website.

Tags were heavily modified to better represent problems.

AND
OR
NO

Found problems: 3597

Let be a twice-differentiable function $ f:(0,\infty )\longrightarrow\mathbb{R} $ that admits a polynomial function of degree $ 1 $ or $ 2, $ namely, $ \alpha :(0,\infty )\longrightarrow\mathbb{R} $ as its asymptote. Prove the following propositions: [b]a)[/b] $ f''>0\implies f-\alpha >0 $ [b]b)[/b] $ \text{supp} f''=(0,\infty )\wedge f-\alpha >0\implies f''=0 $
Scientist have succeeded to find new numbers between real numbers with strong microscopes. Now real numbers are extended in a new larger system we have an order on it (which if induces normal order on $ \mathbb R$), and also 4 operations addition, multiplication,... and these operation have all properties the same as $ \mathbb R$. [img]http://i14.tinypic.com/4tk6mnr.png[/img] a) Prove that in this larger system there is a number which is smaller than each positive integer and is larger than zero. b) Prove that none of these numbers are root of a polynomial in $ \mathbb R[x]$.
For any polynomial $P(x)=a_0+a_1x+\ldots+a_kx^k$ with integer coefficients, the number of odd coefficients is denoted by $o(P)$. For $i-0,1,2,\ldots$ let $Q_i(x)=(1+x)^i$. Prove that if $i_1,i_2,\ldots,i_n$ are integers satisfying $0\le i_1<i_2<\ldots<i_n$, then: \[ o(Q_{i_{1}}+Q_{i_{2}}+\ldots+Q_{i_{n}})\ge o(Q_{i_{1}}). \]
Let $ f(x) \equal{} c_m x^m \plus{} c_{m\minus{}1} x^{m\minus{}1} \plus{}...\plus{} c_1 x \plus{} c_0$, where each $ c_i$ is a non-zero integer. Define a sequence $ \{ a_n \}$ by $ a_1 \equal{} 0$ and $ a_{n\plus{}1} \equal{} f(a_n)$ for all positive integers $ n$. (a) Let $ i$ and $ j$ be positive integers with $ i<j$. Show that $ a_{j\plus{}1} \minus{} a_j$ is a multiple of $ a_{i\plus{}1} \minus{} a_i$. (b) Show that $ a_{2008} \neq 0$
Let $m=\frac{-1+\sqrt{17}}{2}$. Let the polynomial $P(x)=a_nx^n+a_{n-1}x^{n-1}+...+a_1x+a_0$ is given, where $n$ is a positive integer, the coefficients $a_0,a_1,a_2,...,a_n$ are positive integers and $P(m) =2018$ . Prove that the sum $a_0+a_1+a_2+...+a_n$ is divisible by $2$ .
The polynomial $P(X)$ is defined by $P(X)=(X+2X^{2}+\ldots +nX^{n})^{2}=a_{0}+a_{1}X+\ldots +a_{2n}X^{2n}$. Prove that $a_{n+1}+a_{n+2}+\ldots +a_{2n}=\frac{n(n+1)(5n^{2}+5n+2)}{24}$.
Let $m$ be the largest real solution to the equation \[\frac{3}{x-3}+\frac{5}{x-5}+\frac{17}{x-17}+\frac{19}{x-19}= x^2-11x-4.\] There are positive integers $a,b,c$ such that $m = a + \sqrt{b+\sqrt{c}}$. Find $a+b+c$.
Consider the polynomial $P(x)=X^{2n}-X^{2n-1}+\dots-x+1$, where $n\in{N^*}$. Find the remainder of the division of polynomial $P(x^{2n+1})$ by $P(x)$.
Let $\mathbb{Z}$ denote the set of all integers. Find all polynomials $P(x)$ with integer coefficients that satisfy the following property: For any infinite sequence $a_1$, $a_2$, $\dotsc$ of integers in which each integer in $\mathbb{Z}$ appears exactly once, there exist indices $i < j$ and an integer $k$ such that $a_i +a_{i+1} +\dotsb +a_j = P(k)$.
Let $ f(x) \equal{} 1 \plus{} x \plus{} x^2 \plus{} \cdots \plus{} x^{100}$. Find $ f'(1)$.
Prove that these polynomials are irreducible in $\mathbb{Q}[x]:$ a) $\frac{{{x^p}}}{{p!}} + \frac{{{x^{p - 1}}}}{{(p - 1)!}} + ... + \frac{{{x^2}}}{2} + x + 1,$ with $p$ is a prime number. b) $x^{2^n}+1,$ with $n$ is a positive integer.
Let \( P(x), Q(x) \) be non-constant real polynomials, such that for all positive integer \( m \), there exists a positive integer \( n \) satisfy \( P(m) = Q(n) \). Prove that (1) If \(\deg Q \mid \deg P\), then there exists real polynomial \( h(x) \) \( x \), satisfy \( P(x) = Q(h(x)) \) holds for all real number $x.$ (2) \(\deg Q \mid \deg P\).
Let $P(x)$ be a polynomial with integer coefficients for which there exists a positive integer n such that the real parts of all roots of $P(x)$ are less than $n- \frac{1}{2}$ , polynomial $x-n+1$ does not divide $P(x)$, and $P(n)$ is a prime number. Prove that the polynomial $P(x)$ is irreducible (over $Z[x]$).
Let $P(z)$ and $Q(z)$ be complex-variable polynomials, with degree not less than $1$. Let \[P_k = \{z \in \mathbb C | P(z) = k \}, Q_k = \{ z \in \mathbb C | Q(z) = k \}.\] Let also $P_0 = Q_0$ and $P_1 = Q_1$. Prove that $P(z) \equiv Q(z).$
Find all monic polynomials $P(x),Q(x)$ with integer coefficients such that $Q(0) =0$ and $P(Q(x)) = (x-1)(x-2)...(x-15)$.
Let $a,b, c, d,e$ be the roots of $p(x) = 2x^5 - 3x^3 + 2x -7$. Find the value of $$(a^3 - 1)(b^3 - 1)(c^3 - 1)(d^3 - 1)(e^3 - 1).$$
Find all polynomials $P(x)$ of the smallest possible degree with the following properties: (i) The leading coefficient is $200$; (ii) The coefficient at the smallest non-vanishing power is $2$; (iii) The sum of all the coefficients is $4$; (iv) $P(-1) = 0, P(2) = 6, P(3) = 8$.
Find all pairs of polynomials $p(x)$ and $q(x)$ with real coefficients for which \[p(x)q(x+1)-p(x+1)q(x)=1.\]
Show that the equation \[x(x+1)(x+2)\dots (x+2020)-1=0\] has exactly one positive solution $x_0$, and prove that this solution $x_0$ satisfies \[\frac{1}{2020!+10}<x_0<\frac{1}{2020!+6}.\]
Let $ f(x) $ and $ g(x) $ be polynomials with integer coefficients. Prove that if for every integer value $ n $ the number $ g(n) $ is divisible by the number $ f(n) $, then $ g(x) = f(x)\cdot h(x) $, where $ h(x) $ is a polynomial,. Show with an example that the coefficients of the polynomial $ h(x) $ do not have to be integer.
Let $u, v, w$ be the roots of $x^3 -5x^2 + 4x-3 = 0$. Find a cubic polynomial having $u^3, v^3, w^3$ as roots.
Find all polynomials $f(x)$ with integer coefficients and leading coefficient equal to 1, for which $f(0)=2010$ and for each irrational $x$, $f(x)$ is also irrational.
Find the number of quadruples $(a,b,c,d)$ of integers which satisfy both \begin{align*}\frac{1}{a} + \frac{1}{b} + \frac{1}{c} + \frac{1}{d} &= \frac{1}{2}\qquad\text{and}\\\\2(a+b+c+d) &= ab + cd + (a+b)(c+d) + 1.\end{align*}
Find the number of second-degree polynomials $ f(x)$ with integer coefficients and integer zeros for which $ f(0)\equal{}2010$.
(a) Let $n \geq 1$ be an integer. Prove that $X^n+Y^n+Z^n$ can be written as a polynomial with integer coefficients in the variables $\alpha=X+Y+Z$, $\beta= XY+YZ+ZX$ and $\gamma = XYZ$. (b) Let $G_n=x^n \sin(nA)+y^n \sin(nB)+z^n \sin(nC)$, where $x,y,z, A,B,C$ are real numbers such that $A+B+C$ is an integral multiple of $\pi$. Using (a) or otherwise show that if $G_1=G_2=0$, then $G_n=0$ for all positive integers $n$.