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 China Team Selection Test, 2

For any two rational numbers $ p$ and $ q$ in the interval $ (0,1)$ and function $ f$, there is always $ \displaystyle f \left( \frac{p\plus{}q}{2} \right) \leq \frac{f(p) \plus{} f(q)}{2}$. Then prove that for any rational numbers $ \lambda, x_1, x_2 \in (0,1)$, there is always: \[ f( \lambda x_1 \plus{} (1\minus{}\lambda) x_2 ) \leq \lambda f(x_i) \plus{} (1\minus{}\lambda) f(x_2)\]

2013 Canada National Olympiad, 4

Let $n$ be a positive integer. For any positive integer $j$ and positive real number $r$, define $f_j(r)$ and $g_j(r)$ by \[f_j(r) = \min (jr, n) + \min\left(\frac{j}{r}, n\right), \text{ and } g_j(r) = \min (\lceil jr\rceil, n) + \min \left(\left\lceil\frac{j}{r}\right\rceil, n\right),\] where $\lceil x\rceil$ denotes the smallest integer greater than or equal to $x$. Prove that \[\sum_{j=1}^n f_j(r)\leq n^2+n\leq \sum_{j=1}^n g_j(r)\] for all positive real numbers $r$.

2002 Bulgaria National Olympiad, 1

Let $a_1, a_2... $ be an infinite sequence of real numbers such that $a_{n+1}=\sqrt{{a_n}^2+a_n-1}$. Prove that $a_1 \notin (-2,1)$ [i]Proposed by Oleg Mushkarov and Nikolai Nikolov [/i]

1994 Dutch Mathematical Olympiad, 2

A sequence of integers $ a_1,a_2,a_3,...$ is such that $ a_1\equal{}2, a_2\equal{}3$, and $ a_{n\plus{}1}\equal{}2a_{n\minus{}1}$ or $ 3a_n\minus{}2a_{n\minus{}1}$ for all $ n \ge 2$. Prove that no number between $ 1600$ and $ 2000$ can be an element of the sequence.

2010 Kyrgyzstan National Olympiad, 5

Let $k$ be a constant number larger than $1$. Find all polynomials $P(x)$ such that $P({x^k}) = {\left( {P(x)} \right)^k}$ for all real $x$.

2005 France Team Selection Test, 6

Let $P$ be a polynom of degree $n \geq 5$ with integer coefficients given by $P(x)=a_{n}x^n+a_{n-1}x^{n-1}+\cdots+a_0 \quad$ with $a_i \in \mathbb{Z}$, $a_n \neq 0$. Suppose that $P$ has $n$ different integer roots (elements of $\mathbb{Z}$) : $0,\alpha_2,\ldots,\alpha_n$. Find all integers $k \in \mathbb{Z}$ such that $P(P(k))=0$.

2006 Italy TST, 3

Let $P(x)$ be a polynomial with complex coefficients such that $P(0)\neq 0$. Prove that there exists a multiple of $P(x)$ with real positive coefficients if and only if $P(x)$ has no real positive root.

2006 China Team Selection Test, 3

$k$ and $n$ are positive integers that are greater than $1$. $N$ is the set of positive integers. $A_1, A_2, \cdots A_k$ are pairwise not-intersecting subsets of $N$ and $A_1 \cup A_2 \cup \cdots \cup A_k = N$. Prove that for some $i \in \{ 1,2,\cdots,k \}$, there exsits infinity many non-factorable n-th degree polynomials so that coefficients of one polynomial are pairwise distinct and all the coeficients are in $A_i$.

1994 IberoAmerican, 3

Show that every natural number $n\leq2^{1\;000\;000}$ can be obtained first with 1 doing less than $1\;100\;000$ sums; more precisely, there is a finite sequence of natural numbers $x_0,\ x_1,\dots,\ x_k\mbox{ with }k\leq1\;100\;000,\ x_0=1,\ x_k=n$ such that for all $i=1,\ 2,\dots,\ k$ there exist $r,\ s$ with $0\leq{r}\leq{s}<i$ such that $x_i=x_r+x_s$.

2000 China National Olympiad, 2

A sequence $(a_n)$ is defined recursively by $a_1=0, a_2=1$ and for $n\ge 3$, \[a_n=\frac12na_{n-1}+\frac12n(n-1)a_{n-2}+(-1)^n\left(1-\frac{n}{2}\right).\] Find a closed-form expression for $f_n=a_n+2\binom{n}{1}a_{n-1}+3\binom{n}{2}a_{n-2}+\ldots +(n-1)\binom{n}{n-2}a_2+n\binom{n}{n-1}a_1$.

2006 South East Mathematical Olympiad, 4

Given any positive integer $n$, let $a_n$ be the real root of equation $x^3+\dfrac{x}{n}=1$. Prove that (1) $a_{n+1}>a_n$; (2) $\sum_{i=1}^{n}\frac{1}{(i+1)^2a_i} <a_n$.

1998 Brazil National Olympiad, 2

Find all functions $f : \mathbb N \to \mathbb N$ satisfying, for all $x \in \mathbb N$, \[ f(2f(x)) = x + 1998 . \]

2010 Postal Coaching, 7

Does there exist a function $f : \mathbb{N} \rightarrow \mathbb{N}$ such that for every $n \ge 2$, \[f (f (n - 1)) = f (n + 1) - f (n)?\]

2003 Brazil National Olympiad, 2

Let $f(x)$ be a real-valued function defined on the positive reals such that (1) if $x < y$, then $f(x) < f(y)$, (2) $f\left(2xy\over x+y\right) \geq {f(x) + f(y)\over2}$ for all $x$. Show that $f(x) < 0$ for some value of $x$.

2006 Czech and Slovak Olympiad III A, 2

Let $m,n$ be positive integers such that the equation (in respect of $x$) \[(x+m)(x+n)=x+m+n\] has at least one integer root. Prove that $\frac{1}{2}n<m<2n$.

1969 Canada National Olympiad, 8

Let $f$ be a function with the following properties: 1) $f(n)$ is defined for every positive integer $n$; 2) $f(n)$ is an integer; 3) $f(2)=2$; 4) $f(mn)=f(m)f(n)$ for all $m$ and $n$; 5) $f(m)>f(n)$ whenever $m>n$. Prove that $f(n)=n$.

1987 IMO Longlists, 17

Consider the number $\alpha$ obtained by writing one after another the decimal representations of $1, 1987, 1987^2, \dots$ to the right the decimal point. Show that $\alpha$ is irrational.

2004 India IMO Training Camp, 2

Define a function $g: \mathbb{N} \mapsto \mathbb{N}$ by the following rule: (a) $g$ is nondecrasing (b) for each $n$, $g(n)$ i sthe number of times $n$ appears in the range of $g$, Prove that $g(1) = 1$ and $g(n+1) = 1 + g( n +1 - g(g(n)))$ for all $n \in \mathbb{N}$

2007 Finnish National High School Mathematics Competition, 2

Determine the number of real roots of the equation \[x^8 - x^7 + 2x^6 - 2x^5 + 3x^4 - 3x^3 + 4x^2 - 4x +\frac{5}{2}= 0.\]

2012 IFYM, Sozopol, 6

Determine all functions $f:\Bbb{R}\to\Bbb{R}$ such that \[ f(x^2 + f(y)) = (f(x) + y^2)^ 2 \] , for all $x,y\in \Bbb{R}.$

2007 Germany Team Selection Test, 2

Determine the sum of absolute values for the complex roots of $ 20 x^8 \plus{} 7i x^7 \minus{}7ix \plus{} 20.$

1990 USAMO, 2

A sequence of functions $\, \{f_n(x) \} \,$ is defined recursively as follows: \begin{align*}f_1(x) &= \sqrt{x^2 + 48}, \quad \mbox{and} \\ f_{n+1}(x) &= \sqrt{x^2 + 6f_n(x)} \quad \mbox{for } n \geq 1.\end{align*} (Recall that $\sqrt{\makebox[5mm]{}}$ is understood to represent the positive square root.) For each positive integer $n$, find all real solutions of the equation $\, f_n(x) = 2x \,$.

1988 IMO Longlists, 9

If $a_0$ is a positive real number, consider the sequence $\{a_n\}$ defined by: \[ a_{n+1} = \frac{a^2_n - 1}{n+1}, n \geq 0. \] Show that there exist a real number $a > 0$ such that: [b]i.)[/b] for all $a_0 \geq a,$ the sequence $\{a_n\} \rightarrow \infty,$ [b]ii.)[/b] for all $a_0 < a,$ the sequence $\{a_n\} \rightarrow 0.$

1989 China Team Selection Test, 1

Let $\mathbb{N} = \{1,2, \ldots\}.$ Does there exists a function $f: \mathbb{N} \mapsto \mathbb{N}$ such that $\forall n \in \mathbb{N},$ $f^{1989}(n) = 2 \cdot n$ ?

1977 Polish MO Finals, 1

A function $h : \mathbb{R} \rightarrow \mathbb{R}$ is differentiable and satisfies $h(ax) = bh(x)$ for all $x$, where $a$ and $b$ are given positive numbers and $0 \not = |a| \not = 1$. Suppose that $h'(0) \not = 0$ and the function $h'$ is continuous at $x = 0$. Prove that $a = b$ and that there is a real number $c$ such that $h(x) = cx$ for all $x$.