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

For each positive integer $ n$, let $ c(n)$ be the largest real number such that \[ c(n) \le \left| \frac {f(a) \minus{} f(b)}{a \minus{} b}\right|\] for all triples $ (f, a, b)$ such that --$ f$ is a polynomial of degree $ n$ taking integers to integers, and --$ a, b$ are integers with $ f(a) \neq f(b)$. Find $ c(n)$. [i]Shaunak Kishore.[/i]
Let $f(x)$ be a cubic polynomial with roots $x_1 , x_2$ and $x_3.$ Assume that $f(2x)$ is divisible by $f'(x)$ and compute the ratio $x_1 : x_2: x_3 .$
Let $a$, $b$, and $c$ be the $3$ roots of $x^3-x+1=0$. Find $\frac{1}{a+1}+\frac{1}{b+1}+\frac{1}{c+1}.$
For two real numbers $ a$, $ b$, with $ ab\neq 1$, define the $ \ast$ operation by \[ a\ast b=\frac{a+b-2ab}{1-ab}.\] Start with a list of $ n\geq 2$ real numbers whose entries $ x$ all satisfy $ 0<x<1$. Select any two numbers $ a$ and $ b$ in the list; remove them and put the number $ a\ast b$ at the end of the list, thereby reducing its length by one. Repeat this procedure until a single number remains. $ a.$ Prove that this single number is the same regardless of the choice of pair at each stage. $ b.$ Suppose that the condition on the numbers $ x$ is weakened to $ 0<x\leq 1$. What happens if the list contains exactly one $ 1$?
A real number $a$ is chosen randomly and uniformly from the interval $[-20, 18]$. The probability that the roots of the polynomial \[x^4 + 2ax^3 + (2a-2)x^2 + (-4a+3)x - 2\] are all real can be written in the form $\tfrac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$.
Find all polynomials $f$ with non-negative integer coefficients such that for all primes $p$ and positive integers $n$ there exist a prime $q$ and a positive integer $m$ such that $f(p^n)=q^m$.
Let $ t \ge 3$ be a given real number and assume that the polynomial $ f(x)$ satisfies $|f(k)\minus{}t^k|<1$, for $ k\equal{}0,1,2,\ldots ,n$. Prove that the degree of $f(x)$ is at least $n$.
Evaluate $\sum_{n=1}^{1994}{\left((-1)^{n}\cdot\left(\frac{n^2 + n + 1}{n!}\right)\right)}$ .
A polynomial $c_dx^d+c_{d-1}x^{d-1}+\dots+c_1x+c_0$ with degree $d$ is [i]reflexive[/i] if there is an integer $n\ge d$ such that $c_i=c_{n-i}$ for every $0\le i\le n$, where $c_i=0$ for $i>d$. Let $\ell\ge 2$ be an integer and $p(x)$ be a polynomial with integer coefficients. Prove that there exist reflexive polynomials $q(x)$, $r(x)$ with integer coefficients such that \[(1+x+x^2+\dots+x^{\ell-1})p(x)=q(x)+x^\ell r(x)\]
The $ n$ roots of a complex coefficient polynomial $ f(z) \equal{} z^n \plus{} a_1z^{n \minus{} 1} \plus{} \cdots \plus{} a_{n \minus{} 1}z \plus{} a_n$ are $ z_1, z_2, \cdots, z_n$. If $ \sum_{k \equal{} 1}^n |a_k|^2 \leq 1$, then prove that $ \sum_{k \equal{} 1}^n |z_k|^2 \leq n$.
Given real numbers $b \geq a>0$, find all solutions of the system \begin{align*} &x_1^2+2ax_1+b^2=x_2,\\ &x_2^2+2ax_2+b^2=x_3,\\ &\qquad\cdots\cdots\cdots\\ &x_n^2+2ax_n+b^2=x_1. \end{align*}
Let $ x$, $ y$ and $ z$ be integers such that $ S = x^{4}+y^{4}+z^{4}$ is divisible by 29. Show that $ S$ is divisible by $ 29^{4}$.
Determine all polynomials $f$ with integer coefficients such that $f(p)$ is a divisor of $2^p-2$ for every odd prime $p$. [I]Proposed by Italy[/i]
Let $f$ be a polynomial such that, for all real number $x$, $f(-x^2-x-1) = x^4 + 2x^3 + 2022x^2 + 2021x + 2019$. Compute $f(2018)$.
Polynomial $P$ with non-negative real coefficients and function $f:\mathbb{R}^+\to \mathbb{R}^+$ are given such that for all $x, y\in \mathbb{R}^+$ we have $$f(x+P(x)f(y)) = (y+1)f(x)$$ (a) Prove that $P$ has degree at most 1. (b) Find all function $f$ and non-constant polynomials $P$ satisfying the equality.
Given a polynomial $f(x)$ with rational coefficients, of degree $d \ge 2$, we define the sequence of sets $f^0(\mathbb{Q}), f^1(\mathbb{Q}), \ldots$ as $f^0(\mathbb{Q})=\mathbb{Q}$, $f^{n+1}(\mathbb{Q})=f(f^{n}(\mathbb{Q}))$ for $n\ge 0$. (Given a set $S$, we write $f(S)$ for the set $\{f(x)\mid x\in S\})$. Let $f^{\omega}(\mathbb{Q})=\bigcap_{n=0}^{\infty} f^n(\mathbb{Q})$ be the set of numbers that are in all of the sets $f^n(\mathbb{Q})$, $n\geq 0$. Prove that $f^{\omega}(\mathbb{Q})$ is a finite set. [i]Dan Schwarz, Romania[/i]
Find all $f: R \longrightarrow R$ such that \[f(xy+f(x))=xf(y)+f(x)\] for every pair of real numbers $x,y$.
A polynomial of degree four with leading coefficient 1 and integer coefficients has two zeros, both of which are integers. Which of the following can also be a zero of the polynomial? $ \textbf{(A)} \ \frac {1 \plus{} i \sqrt {11}}{2} \qquad \textbf{(B)} \ \frac {1 \plus{} i}{2} \qquad \textbf{(C)} \ \frac {1}{2} \plus{} i \qquad \textbf{(D)} \ 1 \plus{} \frac {i}{2} \qquad \textbf{(E)} \ \frac {1 \plus{} i \sqrt {13}}{2}$
Sum of the roots in the range $\left(-\frac{\pi}{2},\frac{\pi}{2} \right)$ of the equation $\sin x\tan x=x^2$ is [list=1] [*] $\frac{\pi}{2}$ [*] 0 [*] 1 [*] None of these [/list]
Let $f(x),g(x)$ be two polynomials with integer coefficients. It is known that for infinitely many prime $p$, there exist integer $m_p$ such that $$f(a) \equiv g(a+m_p) \pmod p$$ holds for all $a \in \mathbb{Z}.$ Prove that there exists a rational number $r$ such that $$f(x)=g(x+r).$$
Find all polynomials $P(x)$ with real coefficients such that \[(x-2010)P(x+67)=xP(x) \] for every integer $x$.
Determine the number of $ 8$-tuples of nonnegative integers $ (a_1,a_2,a_3,a_4,b_1,b_2,b_3,b_4)$ satisfying $ 0\le a_k\le k$, for each $ k \equal{} 1,2,3,4$, and $ a_1 \plus{} a_2 \plus{} a_3 \plus{} a_4 \plus{} 2b_1 \plus{} 3b_2 \plus{} 4b_3 \plus{} 5b_4 \equal{} 19$.
Prove that for positive real numbers $x$, $y$, $z$, \[ x^3(y^2+z^2)^2 + y^3(z^2+x^2)^2+z^3(x^2+y^2)^2 \geq xyz\left[xy(x+y)^2 + yz(y+z)^2 + zx(z+x)^2\right].\] [i]Zarathustra (Zeb) Brady.[/i]
For which positive integers $n$ do there exist two polynomials $f$ and $g$ with integer coefficients of $n$ variables $x_1, x_2, \ldots , x_n$ such that the following equality is satisfied: \[\sum_{i=1}^n x_i f(x_1, x_2, \ldots , x_n) = g(x_1^2, x_2^2, \ldots , x_n^2) \ ? \]
$f(x)$ is polynomial with integer coefficients, with module not exceeded $5*10^6$. $f(x)=nx$ has integer root for $n=1,2,...,20$. Prove that $f(0)=0$