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: 1269

2002 India IMO Training Camp, 17

Let $n$ be a positive integer and let $(1+iT)^n=f(T)+ig(T)$ where $i$ is the square root of $-1$, and $f$ and $g$ are polynomials with real coefficients. Show that for any real number $k$ the equation $f(T)+kg(T)=0$ has only real roots.

2012 Indonesia TST, 1

Suppose $P(x,y)$ is a homogenous non-constant polynomial with real coefficients such that $P(\sin t, \cos t) = 1$ for all real $t$. Prove that $P(x,y) = (x^2+y^2)^k$ for some positive integer $k$. (A polynomial $A(x,y)$ with real coefficients and having a degree of $n$ is homogenous if it is the sum of $a_ix^iy^{n-i}$ for some real number $a_i$, for all integer $0 \le i \le n$.)

2009 Romanian Masters In Mathematics, 4

For a finite set $ X$ of positive integers, let $ \Sigma(X) \equal{} \sum_{x \in X} \arctan \frac{1}{x}.$ Given a finite set $ S$ of positive integers for which $ \Sigma(S) < \frac{\pi}{2},$ show that there exists at least one finite set $ T$ of positive integers for which $ S \subset T$ and $ \Sigma(S) \equal{} \frac{\pi}{2}.$ [i]Kevin Buzzard, United Kingdom[/i]

2003 Polish MO Finals, 3

Find all polynomials $W$ with integer coefficients satisfying the following condition: For every natural number $n, 2^n - 1$ is divisible by $W(n).$

1992 Vietnam National Olympiad, 1

Let $ 9 < n_{1} < n_{2} < \ldots < n_{s} < 1992$ be positive integers and \[ P(x) \equal{} 1 \plus{} x^{2} \plus{} x^{9} \plus{} x^{n_{1}} \plus{} \cdots \plus{} x^{n_{s}} \plus{} x^{1992}.\] Prove that if $ x_{0}$ is real root of $ P(x)$ then $ x_{0}\leq\frac {1 \minus{} \sqrt {5}}{2}$.

2002 Vietnam National Olympiad, 3

For a positive integer $ n$, consider the equation $ \frac{1}{x\minus{}1}\plus{}\frac{1}{4x\minus{}1}\plus{}\cdots\plus{}\frac{1}{k^2x\minus{}1}\plus{}\cdots\plus{}\frac{1}{n^2x\minus{}1}\equal{}\frac{1}{2}$. (a) Prove that, for every $ n$, this equation has a unique root greater than $ 1$, which is denoted by $ x_n$. (b) Prove that the limit of sequence $ (x_n)$ is $ 4$ as $ n$ approaches infinity.

2009 Costa Rica - Final Round, 5

Suppose the polynomial $ x^{n} \plus{} a_{n \minus{} 1}x^{n \minus{} 1} \plus{} ... \plus{} a_{1} \plus{} a_{0}$ can be factorized as $ (x \plus{} r_{1})(x \plus{} r_{2})...(x \plus{} r_{n})$, with $ r_{1}, r_{2}, ..., r_{n}$ real numbers. Show that $ (n \minus{} 1)a_{n \minus{} 1}^{2}\geq\ 2na_{n \minus{} 2}$

2010 Indonesia MO, 7

Given 2 positive reals $a$ and $b$. There exists 2 polynomials $F(x)=x^2+ax+b$ and $G(x)=x^2+bx+a$ such that all roots of polynomials $F(G(x))$ and $G(F(x))$ are real. Show that $a$ and $b$ are more than $6$. [i]Raja Oktovin, Pekanbaru[/i]

2010 China Team Selection Test, 2

Given integer $a_1\geq 2$. For integer $n\geq 2$, define $a_n$ to be the smallest positive integer which is not coprime to $a_{n-1}$ and not equal to $a_1,a_2,\cdots, a_{n-1}$. Prove that every positive integer except 1 appears in this sequence $\{a_n\}$.

2014 Postal Coaching, 5

Let $(x_j,y_j)$, $1\le j\le 2n$, be $2n$ points on the half-circle in the upper half-plane. Suppose $\sum_{j=1}^{2n}x_j$ is an odd integer. Prove that $\displaystyle{\sum_{j=1}^{2n}y_j \ge 1}$.

2005 MOP Homework, 2

The sequence of real numbers $\{a_n\}$, $n \in \mathbb{N}$ satisfies the following condition: $a_{n+1}=a_n(a_n+2)$ for any $n \in \mathbb{N}$. Find all possible values for $a_{2004}$.

1995 Taiwan National Olympiad, 4

Let $m_{1},m_{2},...,m_{n}$ be mutually distinct integers. Prove that there exists a $f(x)\in\mathbb{Z}[x]$ of degree $n$ satisfying the following two conditions: a)$f(m_{i})=-1\forall i=1,2,...,n$. b)$f(x)$ is irreducible.

2014 Saudi Arabia BMO TST, 1

Find the minimum of $\sum\limits_{k=0}^{40} \left(x+\frac{k}{2}\right)^2$ where $x$ is a real numbers

1984 IMO Longlists, 6

Let $P,Q,R$ be the polynomials with real or complex coefficients such that at least one of them is not constant. If $P^n+Q^n+R^n = 0$, prove that $n < 3.$

2005 MOP Homework, 7

Let $n$ be a natural number and $f_1$, $f_2$, ..., $f_n$ be polynomials with integers coeffcients. Show that there exists a polynomial $g(x)$ which can be factored (with at least two terms of degree at least $1$) over the integers such that $f_i(x)+g(x)$ cannot be factored (with at least two terms of degree at least $1$ over the integers for every $i$.

2009 Rioplatense Mathematical Olympiad, Level 3, 1

Find all pairs $(a, b)$ of real numbers with the following property: [list]Given any real numbers $c$ and $d$, if both of the equations $x^2+ax+1=c$ and $x^2+bx+1=d$ have real roots, then the equation $x^2+(a+b)x+1=cd$ has real roots.[/list]

1988 IMO Longlists, 25

Find the total number of different integers the function \[ f(x) = \left[x \right] + \left[2 \cdot x \right] + \left[\frac{5 \cdot x}{3} \right] + \left[3 \cdot x \right] + \left[4 \cdot x \right] \] takes for $0 \leq x \leq 100.$

2013 Kazakhstan National Olympiad, 3

Consider the following sequence : $a_1=1 ; a_n=\frac{a_[{\frac{n}{2}]}}{2}+\frac{a_[{\frac{n}{3}]}}{3}+\ldots+\frac{a_[{\frac{n}{n}]}}{n}$. Prove that $ a_{2n}< 2*a_{n } (\forall n\in\mathbb{N})$

2008 Costa Rica - Final Round, 3

Find all polinomials $ P(x)$ with real coefficients, such that $ P(\sqrt {3}(a \minus{} b)) \plus{} P(\sqrt {3}(b \minus{} c)) \plus{} P(\sqrt {3}(c \minus{} a)) \equal{} P(2a \minus{} b \minus{} c) \plus{} P( \minus{} a \plus{} 2b \minus{} c) \plus{} P( \minus{} a \minus{} b \plus{} 2c)$ for any $ a$,$ b$ and $ c$ real numbers

1986 Federal Competition For Advanced Students, P2, 6

Given a positive integer $ n$, find all functions $ F: \mathbb{N} \rightarrow \mathbb{R}$ such that $ F(x\plus{}y)\equal{}F(xy\minus{}n)$ whenever $ x,y \in \mathbb{N}$ satisfy $ xy>n$.

1996 South africa National Olympiad, 2

Find all real numbers for which $3^x+4^x=5^x$.

2003 Italy TST, 3

Let $p(x)$ be a polynomial with integer coefficients and let $n$ be an integer. Suppose that there is a positive integer $k$ for which $f^{(k)}(n) = n$, where $f^{(k)}(x)$ is the polynomial obtained as the composition of $k$ polynomials $f$. Prove that $p(p(n)) = n$.

2015 Thailand TSTST, 1

Find all functions $f: \mathbb R \to \mathbb R$ such that for all reals $x$ and $y$, \[f(f(x)-y^{2})=f(x)^{2}-2f(x)y^{2}+f(f(y)).\]

2010 Malaysia National Olympiad, 5

Find the number of triples of nonnegative integers $(x,y,z)$ such that \[x^2+2xy+y^2-z^2=9.\]

2000 Vietnam National Olympiad, 1

For every integer $ n \ge 3$ and any given angle $ \alpha$ with $ 0 < \alpha < \pi$, let $ P_n(x) \equal{} x^n \sin\alpha \minus{} x \sin n\alpha \plus{} \sin(n \minus{} 1)\alpha$. (a) Prove that there is a unique polynomial of the form $ f(x) \equal{} x^2 \plus{} ax \plus{} b$ which divides $ P_n(x)$ for every $ n \ge 3$. (b) Prove that there is no polynomial $ g(x) \equal{} x \plus{} c$ which divides $ P_n(x)$ for every $ n \ge 3$.