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

The problem is about real polynomial functions, denoted by $f$, of degree $\deg f$. a) Prove that a polynomial function $f$ can`t be wrriten as sum of at most $\deg f$ periodic functions. b) Show that if a polynomial function of degree $1$ is written as sum of two periodic functions, then they are unbounded on every interval (thus, they are "wild"). c) Show that every polynomial function of degree $1$ can be written as sum of two periodic functions. d) Show that every polynomial function $f$ can be written as sum of $\deg f+1$ periodic functions. e) Give an example of a function that can`t be written as a finite sum of periodic functions. [i]Dan Schwarz[/i]
Let $ a,b,$ and $ c$ denote three distinct integers, and let $ P$ denote a polynomial having integer coefficients. Show that it is impossible that $ P(a) \equal{} b, P(b) \equal{} c,$ and $ P(c) \equal{} a$.
It is known that the equation $x^3 + px^2 + q = 0$ where $q$ is non-zero, has three different integer roots, the absolute values of two of which are prime numbers. Find the roots of this equation.
For how many primes $ p$, there exits unique integers $ r$ and $ s$ such that for every integer $ x$ $ x^{3} \minus{} x \plus{} 2\equiv \left(x \minus{} r\right)^{2} \left(x \minus{} s\right)\pmod p$? $\textbf{(A)}\ 0 \qquad\textbf{(B)}\ 1 \qquad\textbf{(C)}\ 2 \qquad\textbf{(D)}\ 3 \qquad\textbf{(E)}\ \text{None}$
Let $a$ and $b$ be natural numbers. Prove that the number of polynomials $P(x)$ with integer coefficients such that $|P(n)| \leq a^n$ for every natural number $n \geq b$ is finite.
Find all polynomials $P(X)$ of fourth degree with real coefficients that verify the properties: [b]a)[/b] $P(-x)=P(x), \forall x\in\mathbb{R};$ [b]b)[/b] $P(x)\geq0, \forall x\in\mathbb{R};$ [b]c)[/b] $P(0)=1;$ [b]d)[/b] $P(X)$ has exactly two local minimums $x_1$ and $x_2$ such that $|x_1-x_2|=2.$
Define the sequence of integers $\langle a_n\rangle$ as; \[a_0=1, \quad a_1=-1, \quad \text{ and } \quad a_n=6a_{n-1}+5a_{n-2} \quad \forall n\geq 2.\] Prove that $a_{2012}-2010$ is divisible by $2011.$
Let $R[x]$ be the whole set of real coefficient polynomials, and define the mapping $T: R[x] \to R[x]$ as follows: For $$f (x) = a_nx^{n} + a_{n-1}x^{n- 1} +...+ a_1x + a_0,$$ let $$T(f(x))=a_{n}x^{n+1} + a_{n-1}x^{n} + (a_n+a_{n-2})x^{n-1 } + (a_{n-1}+a_{n-3})x^{n-2}+...+(a_2+a_0)x+a_1.$$ Assume $P_0(x)= 1$, $P_n(x) = T(P_{n-1}(x))$ ( $n=1,2,...$), find the constant term of $P_n(x)$.
Let $f(x)$ be a nonconstant monic polynomial of degree $n$ with rational coefficents that is irreducible, meaning it cannot be factored into two nonconstant rational polynomials. Find and prove a formula for the number of monic complex polynomials that divide $f$.
Determine all polynomials $p$ with real coefficients for which $p(0)=0$ and $$f(f(n))+n=4f(n)\qquad\text{for all }n\in\mathbb N,$$where $f(n)=\lfloor p(n)\rfloor$.
Consider the equation $ x^4 \equal{} ax^3 \plus{} bx^2 \plus{} cx \plus{} 2007$, where $ a,b,c$ are real numbers. Determine the largest value of $ b$ for which this equation has exactly three distinct solutions, all of which are integers.
[list=a] [*]Is there a non-linear integer-coefficient polynomial $P(x)$ and an integer $N{}$ such that all integers greater than $N{}$ may be written as the greatest common divisor of $P(a){}$ and $P(b){}$ for positive integers $a>b$? [*]Is there a non-linear integer-coefficient polynomial $Q(x)$ and an integer $M{}$ such that all integers greater than $M{}$ may be written as $Q(a) - Q(b)$ for positive integers $a>b$? [/list][i]Proposed by Dylan Toh[/i]
Find all polynomials with real coefficients $P$ such that \[ P(x)P(2x^2-1)=P(x^2)P(2x-1)\] for every $x\in\mathbb{R}$.
How many real solution does the equation $\dfrac{x^{2000}}{2001} + 2\sqrt 3 x^2 - 2\sqrt 5 x + \sqrt 3$ have? $ \textbf{(A)}\ 0 \qquad\textbf{(B)}\ 1 \qquad\textbf{(C)}\ 11 \qquad\textbf{(D)}\ 12 \qquad\textbf{(E)}\ \text{None of the preceding} $
The number obtained from the last two nonzero digits of $ 90!$ is equal to $ n$. What is $ n$? $ \textbf{(A)}\ 12 \qquad \textbf{(B)}\ 32 \qquad \textbf{(C)}\ 48 \qquad \textbf{(D)}\ 52 \qquad \textbf{(E)}\ 68$
Let $p,q$ be two distinct odd primes. Calculate $\displaystyle \sum_{j=1}^{\frac{p-1}{2}}\left \lfloor \frac{qj}{p}\right \rfloor +\sum_{j=1}^{\frac{q-1}{2}}\left \lfloor \frac{pj}{q}\right\rfloor$.
Let $P(x)$ be given a polynomial of degree 4, having 4 positive roots. Prove that the equation \[(1-4 \cdot x) \cdot \frac{P(x)}{x^2} + (x^2 + 4 \cdot x - 1) \cdot \frac{P'(x)}{x^2} - P''(x) = 0\] has also 4 positive roots.
Prove that there is no polynomial $P(x)$ with real coefficients that satisfies $$P'(x)P''(x)>P(x)P'''(x)\qquad\text{for all }x\in\mathbb R.$$Is this statement true for all of the thrice differentiable real functions?
Let $ p(x)$ be a cubic polynomial with rational coefficients. $ q_1$, $ q_2$, $ q_3$, ... is a sequence of rationals such that $ q_n \equal{} p(q_{n \plus{} 1})$ for all positive $ n$. Show that for some $ k$, we have $ q_{n \plus{} k} \equal{} q_n$ for all positive $ n$.
There exists a polynomial $P$ of degree $5$ with the following property: if $z$ is a complex number such that $z^5+2004z=1$, then $P(z^2)=0$. Calculate the quotient $\tfrac{P(1)}{P(-1)}$.
Does there exist a two-variable polynomial $P(x, y)$ with real number coefficients such that $P(x, y)$ is positive exactly when $x$ and $y$ are both positive?
Given the equation $x^2+ax+1=0$, determine: a) The interval of possible values for $a$ where the solutions to the previous equation are not real. b) The loci of the roots of the polynomial, when $a$ is in the previous interval.
Does there exist a finite set $M$ of nonzero real numbers, such that for any natural number $n$ a polynomial of degree no less than $n$ with coeficients in $M$, all of whose roots are real and belong to $M$? [i]E. Malinnikova[/i]
Let $P(X)$ be a polynomial with real coefficients such that $\{P(n)\}\leq\frac{1}{n}, \forall n\in\mathbb{N}$, where $\{a\}$ is the fractional part of the number $a$. Show that $P(n)\in\mathbb{Z}, \forall n\in\mathbb{N}$.
Consider polynomial functions $ax^2 -bx +c$ with integer coefficients which have two distinct zeros in the open interval $(0,1).$ Exhibit with proof the least positive integer value of $a$ for which such a polynomial exists.