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 Hungary-Israel Binational, 3

Let $p(x)$ be a polynomial with rational coefficients, of degree at least $2$. Suppose that a sequence $(r_{n})$ of rational numbers satisfies $r_{n}= p(r_{n+1})$ for every $n\geq 1$. Prove that the sequence $(r_{n})$ is periodic.

2007 District Olympiad, 1

We say that a function $f: \mathbb{N}\rightarrow\mathbb{N}$ has the $(\mathcal{P})$ property if, for any $y\in\mathbb{N}$, the equation $f(x)=y$ has exactly 3 solutions. a) Prove that there exist an infinity of functions with the $(\mathcal{P})$ property ; b) Find all monotonously functions with the $(\mathcal{P})$ property ; c) Do there exist monotonously functions $f: \mathbb{Q}\rightarrow\mathbb{Q}$ satisfying the $(\mathcal{P})$ property ?

2003 Moldova National Olympiad, 10.8

Find all integers n for which number $ \log_{2n\minus{}1}(n^2\plus{}2)$ is rational.

1997 India National Olympiad, 6

Suppose $a$ and $b$ are two positive real numbers such that the roots of the cubic equation $x^3 - ax + b = 0$ are all real. If $\alpha$ is a root of this cubic with minimal absolute value, prove that \[ \dfrac{b}{a} < \alpha < \dfrac{3b}{2a}. \]

2001 Tournament Of Towns, 4

There are two matrices $A$ and $B$ of size $m\times n$ each filled only by “0”s and “1”s. It is given that along any row or column its elements do not decrease (from left to right and from top to bottom).It is also given that the numbers of “1”s in both matrices are equal and for any $k = 1, . . .$ , $m$ the sum of the elements in the top $k$ rows of the matrix $A$ is no less than that of the matrix $B$. Prove for any $l = 1, . . . $, $n$ the sum of the elements in left $l$ columns of the matrix $A$ is no greater than that of the matrix $B$.

1986 IMO Longlists, 73

Let $(a_i)_{i\in \mathbb N}$ be a strictly increasing sequence of positive real numbers such that $\lim_{i \to \infty} a_i = +\infty$ and $a_{i+1}/a_i \leq 10$ for each $i$. Prove that for every positive integer $k$ there are infinitely many pairs $(i, j)$ with $10^k \leq a_i/a_j \leq 10^{k+1}.$

2013 Moldova Team Selection Test, 2

We call a triangle $\triangle ABC$, $Q$-angled if $\tan\angle A,\tan\angle B,\tan\angle C \in \mathbb{Q}$, where $\angle A,\angle B ,\angle C$ are the interior angles of the triangle $\triangle ABC$. $a)$ Prove that $Q$-angled triangles exist; $b)$ Let triangle $\triangle ABC$ be $Q$-angled. Prove that for any non-negative integer $n$, numbers of the form $E_n=\sin^n\angle A \sin^n\angle B \sin^n\angle C + \cos^n\angle A\cos^n\angle B\cos^n\angle C$ are rational.

1999 India National Olympiad, 5

Given any four distinct positive real numbers, show that one can choose three numbers $A,B,C$ from among them, such that all three quadratic equations \begin{eqnarray*} Bx^2 + x + C &=& 0\\ Cx^2 + x + A &=& 0 \\ Ax^2 + x +B &=& 0 \end{eqnarray*} have only real roots, or all three equations have only imaginary roots.

1962 Vietnam National Olympiad, 5

Solve the equation $ \sin^6x \plus{} \cos^6x \equal{} \frac{1}{4}$.

1986 IMO Longlists, 15

Let $\mathbb N = B_1\cup\cdots \cup B_q$ be a partition of the set $\mathbb N$ of all positive integers and let an integer $l \in \mathbb N$ be given. Prove that there exist a set $X \subset \mathbb N$ of cardinality $l$, an infinite set $T \subset \mathbb N$, and an integer $k$ with $1 \leq k \leq q$ such that for any $t \in T$ and any finite set $Y \subset X$, the sum $t+ \sum_{y \in Y} y$ belongs to $B_k.$

2009 Romanian Master of 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]

1988 China Team Selection Test, 4

There is a broken computer such that only three primitive data $c$, $1$ and $-1$ are reserved. Only allowed operation may take $u$ and $v$ and output $u \cdot v + v.$ At the beginning, $u,v \in \{c, 1, -1\}.$ After then, it can also take the value of the previous step (only one step back) besides $\{c, 1, -1\}$. Prove that for any polynomial $P_{n}(x) = a_0 \cdot x^n + a_1 \cdot x^{n-1} + \ldots + a_n$ with integer coefficients, the value of $P_n(c)$ can be computed using this computer after only finite operation.

2013 Baltic Way, 3

Let $\mathbb{R}$ denote the set of real numbers. Find all functions $f:\mathbb{R}\rightarrow\mathbb{R}$ such that \[f(xf(y)+y)+f(-f(x))=f(yf(x)-y)+y\] for all $x,y\in\mathbb{R}$

2010 District Olympiad, 1

Prove that any continuos function $ f: \mathbb{R}\rightarrow \mathbb{R}$ with \[ f(x)\equal{}\left\{ \begin{aligned} a_1x\plus{}b_1\ ,\ \text{for } x\le 1 \\ a_2x\plus{}b_2\ ,\ \text{for } x>1 \end{aligned} \right.\] where $ a_1,a_2,b_1,b_2\in \mathbb{R}$, can be written as: \[ f(x)\equal{}m_1x\plus{}n_1\plus{}\epsilon|m_2x\plus{}n_2|\ ,\ \text{for } x\in \mathbb{R}\] where $ m_1,m_2,n_1,n_2\in \mathbb{R}$ and $ \epsilon\in \{\minus{}1,\plus{}1\}$.

2005 Regional Competition For Advanced Students, 3

For which values of $ k$ and $ d$ has the system $ x^3\plus{}y^3\equal{}2$ and $ y\equal{}kx\plus{}d$ no real solutions $ (x,y)$?

1995 IberoAmerican, 2

Let $n$ be a positive integer greater than 1. Determine all the collections of real numbers $x_1,\ x_2,\dots,\ x_n\geq1\mbox{ and }x_{n+1}\leq0$ such that the next two conditions hold: (i) $x_1^{\frac12}+x_2^{\frac32}+\cdots+x_n^{n-\frac12}= nx_{n+1}^\frac12$ (ii) $\frac{x_1+x_2+\cdots+x_n}{n}=x_{n+1}$

2005 India IMO Training Camp, 3

For real numbers $a,b,c,d$ not all equal to $0$ , define a real function $f(x) = a +b\cos{2x} + c\sin{5x} +d \cos{8x}$. Suppose $f(t) = 4a$ for some real $t$. prove that there exist a real number $s$ s.t. $f(s)<0$

2009 Czech-Polish-Slovak Match, 1

Let $\mathbb{R}^+$ denote the set of positive real numbers. Find all functions $f : \mathbb{R}^+\to\mathbb{R}^+$ that satisfy \[ \Big(1+yf(x)\Big)\Big(1-yf(x+y)\Big)=1\] for all $x,y\in\mathbb{R}^+$.

1995 China National Olympiad, 2

Let $f: \mathbb{N} \rightarrow \mathbb{N}$ be a function satisfying the following conditions: (1) $f(1)=1$; (2) $\forall n\in \mathbb{N}$, $3f(n) f(2n+1) =f(2n) ( 1+3f(n) )$; (3) $\forall n\in \mathbb{N}$, $f(2n) < 6 f(n)$. Find all solutions of equation $f(k) +f(l)=293$, where $k<l$. ($\mathbb{N}$ denotes the set of all natural numbers).

1985 Dutch Mathematical Olympiad, 1

For some $ p$, the equation $ x^3 \plus{} px^2 \plus{} 3x \minus{} 10 \equal{} 0$ has three real solutions $ a,b,c$ such that $ c \minus{} b \equal{} b \minus{} a > 0$. Determine $ a,b,c,$ and $ p$.

2004 Postal Coaching, 13

Find all functions $f,g : \mathbb{R} \times \mathbb{R} \mapsto \mathbb{R}^{+}$ such that \[ ( \sum_{j=1}^{n}a_{j}b_{j})^2 \leq (\sum_{j=1}^{n} f({a_{j},b_{j}))(\sum_{j=1}^{n} g({a_{j},b_{j})) \leq (\sum_{j=1}^{n} (a_j)^2 )(\sum_{j=1}^{n} (b_j)^2 ) }}\] for any two sets $a_j$ and $b_j$ of real numbers.

1983 Federal Competition For Advanced Students, P2, 2

Let $ x_1,x_2,x_3$ be the roots of: $ x^3\minus{}6x^2\plus{}ax\plus{}a\equal{}0$. Find all real numbers $ a$ for which $ (x_1\minus{}1)^3\plus{}(x_2\minus{}1)^3\plus{}(x_3\minus{}1)^3\equal{}0$. Also, for each such $ a$, determine the corresponding values of $ x_1,x_2,$ and $ x_3$.

2003 All-Russian Olympiad, 1

The side lengths of a triangle are the roots of a cubic polynomial with rational coefficients. Prove that the altitudes of this triangle are roots of a polynomial of sixth degree with rational coefficients.

2004 Tournament Of Towns, 3

Bucket $A$ contains 3 litres of syrup. Bucket $B$ contains $n$ litres of water. Bucket $C$ is empty. We can perform any combination of the following operations: - Pour away the entire amount in bucket $X$, - Pour the entire amount in bucket $X$ into bucket $Y$, - Pour from bucket $X$ into bucket $Y$ until buckets $Y$ and $Z$ contain the same amount. [b](a)[/b] How can we obtain 10 litres of 30% syrup if $n = 20$? [b](b)[/b] Determine all possible values of $n$ for which the task in (a) is possible.

2000 Moldova National Olympiad, Problem 5

Let $ p$ be a positive integer. Define the function $ f: \mathbb{N}\to\mathbb{N}$ by $ f(n)\equal{}a_1^p\plus{}a_2^p\plus{}\cdots\plus{}a_m^p$, where $ a_1, a_2,\ldots, a_m$ are the decimal digits of $ n$ ($ n\equal{}\overline{a_1a_2\ldots a_m}$). Prove that every sequence $ (b_k)^\infty_{k\equal{}0}$ of positive integer that satisfy $ b_{k\plus{}1}\equal{}f(b_k)$ for all $ k\in\mathbb{N}$, has a finite number of distinct terms. $ \mathbb{N}\equal{}\{1,2,3\ldots\}$