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

2014 Contests, 3

Prove that: there exists only one function $f:\mathbb{N^*}\to\mathbb{N^*}$ satisfying: i) $f(1)=f(2)=1$; ii)$f(n)=f(f(n-1))+f(n-f(n-1))$ for $n\ge 3$. For each integer $m\ge 2$, find the value of $f(2^m)$.

1990 IMO Longlists, 72

Let $n \geq 5$ be a positive integer. $a_1, b_1, a_2, b_2, \ldots, a_n, b_n$ are integers. $( a_i, b_i)$ are pairwisely distinct for $i = 1, 2, \ldots, n$, and $|a_1b_2 - a_2b_1| = |a_2b_3 -a_3b_2| = \cdots = |a_{n-1}b_n -a_nb_{n-1}| = 1$. Prove that there exists a pair of indexes $i, j$ satisfying $2 \leq |i - j| \leq n - 2$ and $|a_ib_j -a_jb_i| = 1.$

2012 Indonesia TST, 1

The sequence $a_i$ is defined as $a_1 = 2, a_2 = 3$, and $a_{n+1} = 2a_{n-1}$ or $a_{n+1} = 3a_n - 2a_{n-1}$ for all integers $n \ge 2$. Prove that no term in $a_i$ is in the range $[1612, 2012]$.

2007 All-Russian Olympiad, 4

An infinite sequence $(x_{n})$ is defined by its first term $x_{1}>1$, which is a rational number, and the relation $x_{n+1}=x_{n}+\frac{1}{\lfloor x_{n}\rfloor}$ for all positive integers $n$. Prove that this sequence contains an integer. [i]A. Golovanov[/i]

2010 Contests, 2

Find all non-decreasing functions $f:\mathbb R^+\cup\{0\}\rightarrow\mathbb R^+\cup\{0\}$ such that for each $x,y\in \mathbb R^+\cup\{0\}$ \[f\left(\frac{x+f(x)}2+y\right)=2x-f(x)+f(f(y)).\]

1999 Brazil National Olympiad, 2

Show that, if $\sqrt{2}$ is written in decimal notation, there is at least one nonzero digit at the interval of 1,000,000-th and 3,000,000-th digits.

2005 China Northern MO, 3

Let positive numbers $a_1, a_2, ..., a_{3n}$ $(n \geq 2)$ constitute an arithmetic progression with common difference $d > 0$. Prove that among any $n + 2$ terms in this progression, there exist two terms $a_i, a_j$ $(i \neq j)$ satisfying $1 < \frac{|a_i - a_j|}{nd} < 2$.

2004 China Western Mathematical Olympiad, 1

The sequence $\{a_n\}_{n}$ satisfies the relations $a_1=a_2=1$ and for all positive integers $n$, \[ a_{n+2} = \frac 1{a_{n+1}} + a_n . \] Find $a_{2004}$.

2004 Italy TST, 3

Find all functions $f:\mathbb{N}\rightarrow \mathbb{N}$ such that for all $m,n\in\mathbb{N}$, \[(2^m+1)f(n)f(2^mn)=2^mf(n)^2+f(2^mn)^2+(2^m-1)^2n. \]

2010 Contests, 3

Find all functions $ f :\mathbb{Z}\mapsto\mathbb{Z} $ such that following conditions holds: $a)$ $f(n) \cdot f(-n)=f(n^2)$ for all $n\in\mathbb{Z}$ $b)$ $f(m+n)=f(m)+f(n)+2mn$ for all $m,n\in\mathbb{Z}$

2013 Balkan MO, 3

Let $S$ be the set of positive real numbers. Find all functions $f\colon S^3 \to S$ such that, for all positive real numbers $x$, $y$, $z$ and $k$, the following three conditions are satisfied: (a) $xf(x,y,z) = zf(z,y,x)$, (b) $f(x, ky, k^2z) = kf(x,y,z)$, (c) $f(1, k, k+1) = k+1$. ([i]United Kingdom[/i])

2018 Bulgaria EGMO TST, 3

Find all one-to-one mappings $f:\mathbb{N}\to\mathbb{N}$ such that for all positive integers $n$ the following relation holds: \[ f(f(n)) \leq \frac {n+f(n)} 2 . \]

1996 Baltic Way, 14

The graph of the function $f(x)=x^n+a_{n-1}x_{n-1}+\ldots +a_1x+a_0$ (where $n>1$) intersects the line $y=b$ at the points $B_1,B_2,\ldots ,B_n$ (from left to right), and the line $y=c\ (c\not= b)$ at the points $C_1,C_2,\ldots ,C_n$ (from left to right). Let $P$ be a point on the line $y=c$, to the right to the point $C_n$. Find the sum \[\cot (\angle B_1C_1P)+\ldots +\cot (\angle B_nC_nP) \]

2005 Vietnam Team Selection Test, 3

$n$ is called [i]diamond 2005[/i] if $n=\overline{...ab999...99999cd...}$, e.g. $2005 \times 9$. Let $\{a_n\}:a_n< C\cdot n,\{a_n\}$ is increasing. Prove that $\{a_n\}$ contain infinite [i]diamond 2005[/i]. Compare with [url=http://www.mathlinks.ro/Forum/topic-15091.html]this problem.[/url]

2010 All-Russian Olympiad, 3

Polynomial $P(x)$ with degree $n \geq 3$ has $n$ real roots $x_1 < x_2 < x_3 <...< x_n$, such that $x_2-x_1<x_3-x_2<....<x_n-x_{n-1}$. Prove that the maximum of the function $y=|P(x)|$ where $x$ is on the interval $[ x_1, x_n ]$, is in the interval $[x_n-1, x_n]$.

2016 Korea Winter Program Practice Test, 3

Determine all the functions $f : \mathbb{R}\rightarrow\mathbb{R}$ that satisfies the following. $f(xf(y)+yf(z)+zf(x))=yf(x)+zf(y)+xf(z)$

2014 Tajikistan Team Selection Test, 1

Given the polynomial $p(x) = x^2 + x - 70$, do there exist integers $0<m<n$, so that $p(m)$ is divisible by $n$ and $p(m+1)$ is divisible by $n+1$? [i]Proposed by Nairy Sedrakyan[/i]

2014 China Western Mathematical Olympiad, 8

Given a real number $q$, $1 < q < 2$ define a sequence $ \{x_n\}$ as follows: for any positive integer $n$, let \[x_n=a_0+a_1 \cdot 2+ a_2 \cdot 2^2 + \cdots + a_k \cdot 2^k \qquad (a_i \in \{0,1\}, i = 0,1, \cdots m k)\] be its binary representation, define \[x_k= a_0 +a_1 \cdot q + a_2 \cdot q^2 + \cdots +a_k \cdot q^k.\] Prove that for any positive integer $n$, there exists a positive integer $m$ such that $x_n < x_m \leq x_n+1$.

2006 Romania Team Selection Test, 2

Let $p$ a prime number, $p\geq 5$. Find the number of polynomials of the form \[ x^p + px^k + p x^l + 1, \quad k > l, \quad k, l \in \left\{1,2,\dots,p-1\right\}, \] which are irreducible in $\mathbb{Z}[X]$. [i]Valentin Vornicu[/i]

2000 Korea - Final Round, 2

Determine all function $f$ from the set of real numbers to itself such that for every $x$ and $y$, \[f(x^2-y^2)=(x-y)(f(x)+f(y))\]

2012 Bulgaria National Olympiad, 2

Let $Q(x)$ be a quadratic trinomial. Given that the function $P(x)=x^{2}Q(x)$ is increasing in the interval $(0,\infty )$, prove that: \[P(x) + P(y) + P(z) > 0\] for all real numbers $x,y,z$ such that $x+y+z>0$ and $xyz>0$.

2009 Hong kong National Olympiad, 1

let ${a_{n}}$ be a sequence of integers,$a_{1}$ is odd,and for any positive integer $n$,we have $n(a_{n+1}-a_{n}+3)=a_{n+1}+a_{n}+3$,in addition,we have $2010$ divides $a_{2009}$ find the smallest $n\ge\ 2$,so that $2010$ divides $a_{n}$

2012 Iran MO (3rd Round), 2

Suppose $N\in \mathbb N$ is not a perfect square, hence we know that the continued fraction of $\sqrt{N}$ is of the form $\sqrt{N}=[a_0,\overline{a_1,a_2,...,a_n}]$. If $a_1\neq 1$ prove that $a_i\le 2a_0$.

2009 Balkan MO, 4

Denote by $ S$ the set of all positive integers. Find all functions $ f: S \rightarrow S$ such that \[ f (f^2(m) \plus{} 2f^2(n)) \equal{} m^2 \plus{} 2 n^2\] for all $ m,n \in S$. [i]Bulgaria[/i]

2007 China Team Selection Test, 1

Find all functions $ f: \mathbb{Q}^{\plus{}} \mapsto \mathbb{Q}^{\plus{}}$ such that: \[ f(x) \plus{} f(y) \plus{} 2xy f(xy) \equal{} \frac {f(xy)}{f(x\plus{}y)}.\]