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

2013 Kazakhstan National Olympiad, 2

a)Does there exist for any rational number $\frac{a}{b}$ some rational numbers $x_1,x_2,....x_n$ such that $x_1*x_2*....*x_n=1$ and $x_1+x_2+....+x_n=\frac{a}{b}$ a)Does there exist for any rational number $\frac{a}{b}$ some rational numbers $x_1,x_2,....x_n$ such that $x_1*x_2*....*x_n=\frac{a}{b}$ and $x_1+x_2+....+x_n=1$

2003 India National Olympiad, 3

Show that $8x^4 - 16x^3 + 16x^2 - 8x + k = 0$ has at least one real root for all real $k$. Find the sum of the non-real roots.

2010 Greece Team Selection Test, 1

Solve in positive reals the system: $x+y+z+w=4$ $\frac{1}{x}+\frac{1}{y}+\frac{1}{z}+\frac{1}{w}=5-\frac{1}{xyzw}$

2021 Romania EGMO TST, P1

Let $x>1$ be a real number which is not an integer. For each $n\in\mathbb{N}$, let $a_n=\lfloor x^{n+1}\rfloor - x\lfloor x^n\rfloor$. Prove that the sequence $(a_n)$ is not periodic.

2007 Finnish National High School Mathematics Competition, 5

Show that there exists a polynomial $P(x)$ with integer coefficients, such that the equation $P(x) = 0$ has no integer solutions, but for each positive integer $n$ there is an $x \in \Bbb{Z}$ such that $n \mid P(x).$

1986 IMO Longlists, 68

Consider the equation $x^4 + ax^3 + bx^2 + ax + 1 = 0$ with real coefficients $a, b$. Determine the number of distinct real roots and their multiplicities for various values of $a$ and $b$. Display your result graphically in the $(a, b)$ plane.

1988 IMO Longlists, 92

Let $p \geq 2$ be a natural number. Prove that there exist an integer $n_0$ such that \[ \sum^{n_0}_{i=1} \frac{1}{i \cdot \sqrt[p]{i + 1}} > p. \]

2010 Contests, 3

Christian Reiher and Reid Barton want to open a security box, they already managed to discover the algorithm to generate the key codes and they obtained the following information: $i)$ In the screen of the box will appear a sequence of $n+1$ numbers, $C_0 = (a_{0,1},a_{0,2},...,a_{0,n+1})$ $ii)$ If the code $K = (k_1,k_2,...,k_n)$ opens the security box then the following must happen: a) A sequence $C_i = (a_{i,1},a_{i,2},...,a_{i,n+1})$ will be asigned to each $k_i$ defined as follows: $a_{i,1} = 1$ and $a_{i,j} = a_{i-1,j}-k_ia_{i,j-1}$, for $i,j \ge 1$ b) The sequence $(C_n)$ asigned to $k_n$ satisfies that $S_n = \sum_{i=1}^{n+1}|a_i|$ has its least possible value, considering all possible sequences $K$. The sequence $C_0$ that appears in the screen is the following: $a_{0,1} = 1$ and $a_0,i$ is the sum of the products of the elements of each of the subsets with $i-1$ elements of the set $A =$ {$1,2,3,...,n$}, $i\ge 2$, such that $a_{0, n+1} = n!$ Find a sequence $K = (k_1,k_2,...,k_n)$ that satisfies the conditions of the problem and show that there exists at least $n!$ of them.

2012 Indonesia TST, 1

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

2011 USA Team Selection Test, 9

Determine whether or not there exist two different sets $A,B$, each consisting of at most $2011^2$ positive integers, such that every $x$ with $0 < x < 1$ satisfies the following inequality: \[\left| \sum_{a \in A} x^a - \sum_{b \in B} x^b \right| < (1-x)^{2011}.\]

2011 Uzbekistan National Olympiad, 4

Does existes a function $f:N->N$ and for all positeve integer n $f(f(n)+2011)=f(n)+f(f(n))$

2008 India National Olympiad, 6

Let $ P(x)$ be a polynomial with integer coefficients. Prove that there exist two polynomials $ Q(x)$ and $ R(x)$, again with integer coefficients, such that [b](i)[/b] $ P(x) \cdot Q(x)$ is a polynomial in $ x^2$ , and [b](ii)[/b] $ P(x) \cdot R(x)$ is a polynomial in $ x^3$.

2006 China Team Selection Test, 1

Two positive valued sequences $\{ a_{n}\}$ and $\{ b_{n}\}$ satisfy: (a): $a_{0}=1 \geq a_{1}$, $a_{n}(b_{n+1}+b_{n-1})=a_{n-1}b_{n-1}+a_{n+1}b_{n+1}$, $n \geq 1$. (b): $\sum_{i=1}^{n}b_{i}\leq n^{\frac{3}{2}}$, $n \geq 1$. Find the general term of $\{ a_{n}\}$.

2001 Turkey MO (2nd round), 2

$(x_{n})_{-\infty<n<\infty}$ is a sequence of real numbers which satisfies $x_{n+1}=\frac{x_{n}^2+10}{7}$ for every $n \in \mathbb{Z}$. If there exist a real upperbound for this sequence, find all the values $x_{0}$ can take.

1977 IMO Longlists, 60

Suppose $x_0, x_1, \ldots , x_n$ are integers and $x_0 > x_1 > \cdots > x_n.$ Prove that at least one of the numbers $|F(x_0)|, |F(x_1)|, |F(x_2)|, \ldots, |F(x_n)|,$ where \[F(x) = x^n + a_1x^{n-1} + \cdots+ a_n, \quad a_i \in \mathbb R, \quad i = 1, \ldots , n,\] is greater than $\frac{n!}{2^n}.$

2003 China Team Selection Test, 2

Let $S$ be a finite set. $f$ is a function defined on the subset-group $2^S$ of set $S$. $f$ is called $\textsl{monotonic decreasing}$ if when $X \subseteq Y\subseteq S$, then $f(X) \geq f(Y)$ holds. Prove that: $f(X \cup Y)+f(X \cap Y ) \leq f(X)+ f(Y)$ for $X, Y \subseteq S$ if and only if $g(X)=f(X \cup \{ a \}) - f(X)$ is a $\textsl{monotonic decreasing}$ funnction on the subset-group $2^{S \setminus \{a\}}$ of set $S \setminus \{a\}$ for any $a \in S$.

2011 Puerto Rico Team Selection Test, 3

(a) Prove that (p^2)-1 is divisible by 24 if p is a prime number greater than 3. (b) Prove that (p^2)-(q^2) is divisible by 24 if p and q are prime numbers greater than 3.

2020 Moldova EGMO TST, 3

Let the sequence $a_n$, $n\geq2$, $a_n=\frac{\sqrt[3]{n^3+n^2-n-1}}{n} $. Find the greatest natural number $k$ ,such that $a_2 \cdot a_3 \cdot . . .\cdot a_k <8$

2010 China National Olympiad, 3

Given complex numbers $a,b,c$, we have that $|az^2 + bz +c| \leq 1$ holds true for any complex number $z, |z| \leq 1$. Find the maximum value of $|bc|$.

1988 IMO Longlists, 39

[b]i.)[/b] Let $g(x) = x^5 + x^4 + x^3 + x^2 + x + 1.$ What is the remainder when the polynomial $g(x^{12}$ is divided by the polynomial $g(x)$? [b]ii.)[/b] If $k$ is a positive number and $f$ is a function such that, for every positive number $x, f(x^2 + 1 )^{\sqrt{x}} = k.$ Find the value of \[ f( \frac{9 +y^2}{y^2})^{\sqrt{ \frac{12}{y} }} \] for every positive number $y.$ [b]iii.)[/b] The function $f$ satisfies the functional equation $f(x) + f(y) = f(x+y) - x \cdot y - 1$ for every pair $x,y$ of real numbers. If $f(1) = 1,$ then find the numbers of integers $n,$ for which $f(n) = n.$

2003 USA Team Selection Test, 1

For a pair of integers $a$ and $b$, with $0 < a < b < 1000$, set $S\subseteq \{ 1, 2, \dots , 2003\}$ is called a [i]skipping set[/i] for $(a, b)$ if for any pair of elements $s_1, s_2 \in S$, $|s_1 - s_2|\not\in \{ a, b\}$. Let $f(a, b)$ be the maximum size of a skipping set for $(a, b)$. Determine the maximum and minimum values of $f$.

1996 Canada National Olympiad, 2

Find all real solutions to the following system of equations. Carefully justify your answer. \[ \left\{ \begin{array}{c} \displaystyle\frac{4x^2}{1+4x^2} = y \\ \\ \displaystyle\frac{4y^2}{1+4y^2} = z \\ \\ \displaystyle\frac{4z^2}{1+4z^2} = x \end{array} \right. \]

2004 China Team Selection Test, 1

Given integer $ n$ larger than $ 5$, solve the system of equations (assuming $x_i \geq 0$, for $ i=1,2, \dots n$): \[ \begin{cases} \displaystyle x_1+ \phantom{2^2} x_2+ \phantom{3^2} x_3 + \cdots + \phantom{n^2} x_n &= n+2, \\ x_1 + 2\phantom{^2}x_2 + 3\phantom{^2}x_3 + \cdots + n\phantom{^2}x_n &= 2n+2, \\ x_1 + 2^2x_2 + 3^2 x_3 + \cdots + n^2x_n &= n^2 + n +4, \\ x_1+ 2^3x_2 + 3^3x_3+ \cdots + n^3x_n &= n^3 + n + 8. \end{cases} \]

2009 Hungary-Israel Binational, 2

Denote the three real roots of the cubic $ x^3 \minus{} 3x \minus{} 1 \equal{} 0$ by $ x_1$, $ x_2$, $ x_3$ in order of increasing magnitude. (You may assume that the equation in fact has three distinct real roots.) Prove that $ x_3^2 \minus{} x_2^2 \equal{} x_3 \minus{} x_1$.

2009 South africa National Olympiad, 6

Let $A$ denote the set of real numbers $x$ such that $0\le x<1$. A function $f:A\to \mathbb{R}$ has the properties: (i) $f(x)=2f(\frac{x}{2})$ for all $x\in A$; (ii) $f(x)=1-f(x-\frac{1}{2})$ if $\frac{1}{2}\le x<1$. Prove that (a) $f(x)+f(1-x)\ge \frac{2}{3}$ if $x$ is rational and $0<x<1$. (b) There are infinitely many odd positive integers $q$ such that equality holds in (a) when $x=\frac{1}{q}$.