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

2006 India National Olympiad, 2

Prove that for every positive integer $n$ there exists a unique ordered pair $(a,b)$ of positive integers such that \[ n = \frac{1}{2}(a + b - 1)(a + b - 2) + a . \]

2000 Brazil National Olympiad, 4

An infinite road has traffic lights at intervals of 1500m. The lights are all synchronised and are alternately green for $\frac 32$ minutes and red for 1 minute. For which $v$ can a car travel at a constant speed of $v$m/s without ever going through a red light?

2024 Baltic Way, 3

Positive real numbers $a_1, a_2, \ldots, a_{2024}$ are written on the blackboard. A move consists of choosing two numbers $x$ and $y$ on the blackboard, erasing them and writing the number $\frac{x^2+6xy+y^2}{x+y}$ on the blackboard. After $2023$ moves, only one number $c$ will remain on the blackboard. Prove that \[ c<2024 (a_1+a_2+\ldots+a_{2024}).\]

1993 Baltic Way, 10

Let $a_1,a_2,\ldots,a_n$ and $b_1,b_2,\ldots,b_n$ be two finite sequences consisting of $2n$ real different numbers. Rearranging each of the sequences in increasing order we obtain $a_1',a_2',\ldots,a_n'$ and $b_1',b_2',\ldots,b_n'$. Prove that \[\max_{1\le i\le n}|a_i-b_i|\ge\max_{1\le i\le n}|a_i'-b_i'|.\]

2013 National Olympiad First Round, 15

No matter how $n$ real numbers on the interval $[1,2013]$ are selected, if it is possible to find a scalene polygon such that its sides are equal to some of the numbers selected, what is the least possible value of $n$? $ \textbf{(A)}\ 14 \qquad\textbf{(B)}\ 13 \qquad\textbf{(C)}\ 12 \qquad\textbf{(D)}\ 11 \qquad\textbf{(E)}\ 10 $

2010 Indonesia TST, 2

Find all functions $ f: \mathbb{R} \rightarrow \mathbb{R}$ satisfying \[ f(x^3\plus{}y^3)\equal{}xf(x^2)\plus{}yf(y^2)\] for all real numbers $ x$ and $ y$. [i]Hery Susanto, Malang[/i]

2014 Contests, 3

Prove that for every integer $S\ge100$ there exists an integer $P$ for which the following story could hold true: The mathematician asks the shop owner: ``How much are the table, the cabinet and the bookshelf?'' The shop owner replies: ``Each item costs a positive integer amount of Euros. The table is more expensive than the cabinet, and the cabinet is more expensive than the bookshelf. The sum of the three prices is $S$ and their product is $P$.'' The mathematician thinks and complains: ``This is not enough information to determine the three prices!'' (Proposed by Gerhard Woeginger, Austria)

2013 District Olympiad, 3

Let $A$ be an non-invertible of order $n$, $n>1$, with the elements in the set of complex numbers, with all the elements having the module equal with 1 a)Prove that, for $n=3$, two rows or two columns of the $A$ matrix are proportional b)Does the conclusion from the previous exercise remains true for $n=4$?

2009 Indonesia TST, 1

Let $ [a]$ be the integer such that $ [a]\le a<[a]\plus{}1$. Find all real numbers $ (a,b,c)$ such that \[ \{a\}\plus{}[b]\plus{}\{c\}\equal{}2.9\\\{b\}\plus{}[c]\plus{}\{a\}\equal{}5.3\\\{c\}\plus{}[a]\plus{}\{b\}\equal{}4.0.\]

2011 All-Russian Olympiad, 1

Given are two distinct monic cubics $F(x)$ and $G(x)$. All roots of the equations $F(x)=0$, $G(x)=0$ and $F(x)=G(x)$ are written down. There are eight numbers written. Prove that the greatest of them and the least of them cannot be both roots of the polynomial $F(x)$.

2013 China Northern MO, 5

Find all non-integers $x$ such that $x+\frac{13}{x}=[x]+\frac{13}{[x]} . $where$[x]$ mean the greatest integer $n$ , where $n\leq x.$

1987 IberoAmerican, 1

The sequence $(p_n)$ is defined as follows: $p_1=2$ and for all $n$ greater than or equal to $2$, $p_n$ is the largest prime divisor of the expression $p_1p_2p_3\ldots p_{n-1}+1$. Prove that every $p_n$ is different from $5$.

2010 ELMO Shortlist, 1

Determine all strictly increasing functions $f: \mathbb{N}\to\mathbb{N}$ satisfying $nf(f(n))=f(n)^2$ for all positive integers $n$. [i]Carl Lian and Brian Hamrick.[/i]

1994 Brazil National Olympiad, 4

Let $a, b > 0$ be reals such that \[ a^3=a+1\\ b^6=b+3a \] Show that $a>b$

1988 Romania Team Selection Test, 10

Let $ p > 2$ be a prime number. Find the least positive number $ a$ which can be represented as \[ a \equal{} (X \minus{} 1)f(X) \plus{} (X^{p \minus{} 1} \plus{} X^{p \minus{} 2} \plus{} \cdots \plus{} X \plus{} 1)g(X), \] where $ f(X)$ and $ g(X)$ are integer polynomials. [i]Mircea Becheanu[/i].

2007 QEDMO 4th, 14

Let $\left(a_{1},\ a_{2},\ a_{3},\ ...\right)$ be a sequence of reals such that $a_{n}\geq\frac{\left(n-1\right)a_{n-1}+\left(n-2\right)a_{n-2}+...+2a_{2}+1a_{1}}{\left(n-1\right)+\left(n-2\right)+...+2+1}$ for every integer $n\geq 2$. Prove that $a_{n}\geq\frac{a_{n-1}+a_{n-2}+...+a_{2}+a_{1}}{n-1}$ for every integer $n\geq 2$. [i]Generalization.[/i] Let $\left(b_{1},\ b_{2},\ b_{3},\ ...\right)$ be a monotonically increasing sequence of positive reals, and let $\left(a_{1},\ a_{2},\ a_{3},\ ...\right)$ be a sequence of reals such that $a_{n}\geq\frac{b_{n-1}a_{n-1}+b_{n-2}a_{n-2}+...+b_{2}a_{2}+b_{1}a_{1}}{b_{n-1}+b_{n-2}+...+b_{2}+b_{1}}$ for every integer $n\geq 2$. Prove that $a_{n}\geq\frac{a_{n-1}+a_{n-2}+...+a_{2}+a_{1}}{n-1}$ for every integer $n\geq 2$. darij

1993 Irish Math Olympiad, 1

The following is known about the reals $ \alpha$ and $ \beta$ $ \alpha^{3}-3\alpha^{2}+5\alpha-17=0$ and $ \beta^{3}-3\beta^{2}+5\beta+11=0$ Determine $ \alpha+\beta$

1999 Italy TST, 3

(a) Find all strictly monotone functions $f:\mathbb{R}\rightarrow\mathbb{R}$ such that \[f(x+f(y))=f(x)+y\quad\text{for all real}\ x,y. \] (b) If $n>1$ is an integer, prove that there is no strictly monotone function $f:\mathbb{R}\rightarrow\mathbb{R}$ such that \[ f(x+f(y))=f(x)+y^n\quad \text{for all real}\ x, y.\]

2007 Baltic Way, 2

A sequence of integers $a_1,a_2,a_3,\ldots$ is called [i]exact[/i] if $a_n^2-a_m^2=a_{n-m}a_{n+m}$ for any $n>m$. Prove that there exists an exact sequence with $a_1=1,a_2=0$ and determine $a_{2007}$.

1996 Romania Team Selection Test, 16

Let $ n\geq 3 $ be an integer and let $ \mathcal{S} \subset \{1,2,\ldots, n^3\} $ be a set with $ 3n^2 $ elements. Prove that there exist nine distinct numbers $ a_1,a_2,\ldots,a_9 \in \mathcal{S} $ such that the following system has a solution in nonzero integers: \begin{eqnarray*} a_1x + a_2y +a_3 z &=& 0 \\ a_4x + a_5 y + a_6 z &=& 0 \\ a_7x + a_8y + a_9z &=& 0. \end{eqnarray*} [i]Marius Cavachi[/i]

1996 Baltic Way, 11

Real numbers $x_1,x_2,\ldots ,x_{1996}$ have the following property: For any polynomial $W$ of degree $2$ at least three of the numbers $W(x_1),W(x_2),\ldots ,W(x_{1996})$ are equal. Prove that at least three of the numbers $x_1,x_2,\ldots ,x_{1996}$ are equal.

2005 Croatia National Olympiad, 1

A sequence $(a_{n})$ is defined by $a_{1}= 1$ and $a_{n}= a_{1}a_{2}...a_{n-1}+1$ for $n \geq 2.$ Find the smallest real number $M$ such that $\sum_{n=1}^{m}\frac{1}{a_{n}}<M\; \forall m\in\mathbb{N}$.

2007 France Team Selection Test, 2

Find all functions $f: \mathbb{Z}\rightarrow\mathbb{Z}$ such that for all $x,y \in \mathbb{Z}$: \[f(x-y+f(y))=f(x)+f(y).\]

2012 Pan African, 2

Find all functions $ f:\mathbb{R}\rightarrow\mathbb{R} $ such that $f(x^2 - y^2) = (x+y)(f(x) - f(y))$ for all real numbers $x$ and $y$.

2007 China Northern MO, 3

Sequence $ \{a_{n}\}$ is defined by $ a_{1}= 2007,\, a_{n+1}=\frac{a_{n}^{2}}{a_{n}+1}$ for $ n \ge 1.$ Prove that $ [a_{n}] =2007-n$ for $ 0 \le n \le 1004,$ where $ [x]$ denotes the largest integer no larger than $ x.$