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

1993 Kurschak Competition, 3

Let $n$ be a fixed positive integer. Compute over $\mathbb{R}$ the minimum of the following polynomial: \[f(x)=\sum_{t=0}^{2n}(2n+1-t)x^t.\]

2008 Regional Competition For Advanced Students, 2

For a real number $ x$ is $ [x]$ the next smaller integer to $ x$, that is the integer $ g$ with $ g\leqq<g+1$, and $ \{x\}=x-[x]$ is the “decimal part” of $ x$. Determine all triples $ (a,b,c)$ of real numbers, which fulfil the following system of equations: \[ \{a\}+[b]+\{c\}=2,9\]\[ \{b\}+[c]+\{a\}=5,3\]\[\{c\}+[a]+\{b\}=4,0\]

2002 China Team Selection Test, 3

Let \[ f(x_1,x_2,x_3) = -2 \cdot (x_1^3+x_2^3+x_3^3) + 3 \cdot (x_1^2(x_2+x_3) + x_2^2 \cdot (x_1+x_3) + x_3^2 \cdot ( x_1+x_2 ) - 12x_1x_2x_3. \] For any reals $r,s,t$, we denote \[ g(r,s,t)=\max_{t\leq x_3\leq t+2} |f(r,r+2,x_3)+s|. \] Find the minimum value of $g(r,s,t)$.

2004 India National Olympiad, 6

Show that the number of 5-tuples ($a$, $b$, $c$, $d$, $e$) such that $abcde = 5(bcde + acde + abde + abce + abcd)$ is odd

1989 IMO Longlists, 52

Let $ f$ be a function from the real numbers to the real numbers such that $ f(1) \equal{} 1, f(a\plus{}b) \equal{} f(a)\plus{}f(b)$ for all $ a, b,$ and $ f(x)f \left( \frac{1}{x} \right) \equal{} 1$ for all $ x \neq 0.$ Prove that $ f(x) \equal{} x$ for all real numbers $ x.$

2010 Tournament Of Towns, 5

$N$ horsemen are riding in the same direction along a circular road. Their speeds are constant and pairwise distinct. There is a single point on the road where the horsemen can surpass one another. Can they ride in this fashion for arbitrarily long time? Consider the cases: $(a) N = 3;$ $(b) N = 10.$

2004 China Team Selection Test, 1

Given non-zero reals $ a$, $ b$, find all functions $ f: \mathbb{R} \longmapsto \mathbb{R}$, such that for every $ x, y \in \mathbb{R}$, $ y \neq 0$, $ f(2x) \equal{} af(x) \plus{} bx$ and $ \displaystyle f(x)f(y) \equal{} f(xy) \plus{} f \left( \frac {x}{y} \right)$.

2002 Czech-Polish-Slovak Match, 1

Let $a, b$ be distinct real numbers and $k,m$ be positive integers $k + m = n \ge 3, k \le 2m, m \le 2k$. Consider sequences $x_1,\dots , x_n$ with the following properties: (i) $k$ terms $x_i$, including $x_1$, are equal to $a$; (ii) $m$ terms $x_i$, including $x_n$, are equal to $b$; (iii) no three consecutive terms are equal. Find all possible values of $x_nx_1x_2 + x_1x_2x_3 + \cdots + x_{n-1}x_nx_1$.

2007 Vietnam National Olympiad, 1

Solve the system of equations: $\{\begin{array}{l}(1+\frac{12}{3x+y}).\sqrt{x}=2\\(1-\frac{12}{3x+y}).\sqrt{y}=6\end{array}$

2012 Mediterranean Mathematics Olympiad, 1

For a real number $\alpha>0$, consider the infinite real sequence defined by $x_1=1$ and \[ \alpha x_n = x_1+x_2+\cdots+x_{n+1} \mbox{\qquad for } n\ge1. \] Determine the smallest $\alpha$ for which all terms of this sequence are positive reals. (Proposed by Gerhard Woeginger, Austria)

2004 China Team Selection Test, 1

Given non-zero reals $ a$, $ b$, find all functions $ f: \mathbb{R} \longmapsto \mathbb{R}$, such that for every $ x, y \in \mathbb{R}$, $ y \neq 0$, $ f(2x) \equal{} af(x) \plus{} bx$ and $ \displaystyle f(x)f(y) \equal{} f(xy) \plus{} f \left( \frac {x}{y} \right)$.

1983 IMO Longlists, 24

Every $x, 0 \leq x \leq 1$, admits a unique representation $x = \sum_{j=0}^{\infty} a_j 2^{-j}$, where all the $a_j$ belong to $\{0, 1\}$ and infinitely many of them are $0$. If $b(0) = \frac{1+c}{2+c}, b(1) =\frac{1}{2+c},c > 0$, and \[f(x)=a_0 + \sum_{j=0}^{\infty}b(a_0) \cdots b(a_j) a_{j+1}\] show that $0 < f(x) -x < c$ for every $x, 0 < x < 1.$

2006 Czech and Slovak Olympiad III A, 6

Find all real solutions $(x,y,z)$ of the system of equations: \[ \begin{cases} \tan ^2x+2\cot^22y=1 \\ \tan^2y+2\cot^22z=1 \\ \tan^2z+2\cot^22x=1 \\ \end{cases} \]

2012 Morocco TST, 2

Let $\left ( a_{n} \right )_{n \geq 1}$ be an increasing sequence of positive integers such that $a_1=1$, and for all positive integers $n$, $a_{n+1}\leq 2n$. Prove that for every positive $n$; there exists positive integers $p$ and $q$ such that $n=a_{p}-a_{q}$.

1998 Finnish National High School Mathematics Competition, 3

Consider the geometric sequence $1/2, \ 1 / 4, \ 1 / 8,...$ Can one choose a subsequence, finite or infinite, for which the ratio of consecutive terms is not $1$ and whose sum is $1/5?$

2008 Moldova National Olympiad, 9.4

Let $ n$ be a positive integer. Find all $ x_1,x_2,\ldots,x_n$ that satisfy the relation: \[ \sqrt{x_1\minus{}1}\plus{}2\cdot \sqrt{x_2\minus{}4}\plus{}3\cdot \sqrt{x_3\minus{}9}\plus{}\cdots\plus{}n\cdot\sqrt{x_n\minus{}n^2}\equal{}\frac{1}{2}(x_1\plus{}x_2\plus{}x_3\plus{}\cdots\plus{}x_n).\]

2012 USA Team Selection Test, 2

Determine all functions $f:\mathbb{R}\to\mathbb{R}$ such that for every pair of real numbers $x$ and $y$, \[f(x+y^2)=f(x)+|yf(y)|.\]

2005 Hungary-Israel Binational, 2

Let $F_{n}$ be the $n-$ th Fibonacci number (where $F_{1}= F_{2}= 1$). Consider the functions $f_{n}(x)=\parallel . . . \parallel |x|-F_{n}|-F_{n-1}|-...-F_{2}|-F_{1}|, g_{n}(x)=| . . . \parallel x-1|-1|-...-1|$ ($F_{1}+...+F_{n}$ one’s). Show that $f_{n}(x) = g_{n}(x)$ for every real number $x.$

2011 Thailand Mathematical Olympiad, 2

Find all functions $f : \mathbb{N} \rightarrow \mathbb{N}$ such that $f(2m+2n)=f(m)f(n)$ for all natural numbers $m,n$.

2012 Turkmenistan National Math Olympiad, 2

If the polynomial $P(x)=ax^2+bx+c$ takes value $0$ for three different values of $x$, then prove the polynomial $P(x)$ takes value $0$ for all $x$.

1988 IMO Longlists, 2

Let $\left[\sqrt{(n+1)^2 + n^2} \right], n = 1,2, \ldots,$ where $[x]$ denotes the integer part of $x.$ Prove that [b]i.)[/b] there are infinitely many positive integers $m$ such that $a_{m+1} - a_m > 1;$ [b]ii.)[/b] there are infinitely many positive integers $m$ such that $a_{m+1} - a_m = 1.$

2004 USA Team Selection Test, 6

Define the function $f: \mathbb N \cup \{0\} \to \mathbb{Q}$ as follows: $f(0) = 0$ and \[ f(3n+k) = -\frac{3f(n)}{2} + k , \] for $k = 0, 1, 2$. Show that $f$ is one-to-one and determine the range of $f$.

2007 Regional Competition For Advanced Students, 3

Let $ a$ be a positive real number and $ n$ a non-negative integer. Determine $ S\minus{}T$, where $ S\equal{} \sum_{k\equal{}\minus{}2n}^{2n\plus{}1} \frac{(k\minus{}1)^2}{a^{| \lfloor \frac{k}{2} \rfloor |}}$ and $ T\equal{} \sum_{k\equal{}\minus{}2n}^{2n\plus{}1} \frac{k^2}{a^{| \lfloor \frac{k}{2} \rfloor |}}$

2001 China Team Selection Test, 3

For a given natural number $k > 1$, find all functions $f:\mathbb{R} \to \mathbb{R}$ such that for all $x, y \in \mathbb{R}$, $f[x^k + f(y)] = y +[f(x)]^k$.

1983 IMO Longlists, 53

Let $a \in \mathbb R$ and let $z_1, z_2, \ldots, z_n$ be complex numbers of modulus $1$ satisfying the relation \[\sum_{k=1}^n z_k^3=4(a+(a-n)i)- 3 \sum_{k=1}^n \overline{z_k}\] Prove that $a \in \{0, 1,\ldots, n \}$ and $z_k \in \{1, i \}$ for all $k.$