Found problems: 15925
2002 AMC 10, 25
When $ 15$ is appended to a list of integers, the mean is increased by $ 2$. When $ 1$ is appended to the enlarged list, the mean of the enlarged list is decreased by $ 1$. How many integers were in the original list?
$ \textbf{(A)}\ 4 \qquad
\textbf{(B)}\ 5 \qquad
\textbf{(C)}\ 6 \qquad
\textbf{(D)}\ 7 \qquad
\textbf{(E)}\ 8$
Russian TST 2014, P1
Let $x,y,z$ be positive real numbers. Prove that \[\frac{x}{y}+\frac{y}{z}+\frac{z}{x}\geqslant\frac{z(x+y)}{y(y+z)}+\frac{x(y+z)}{z(z+x)}+\frac{y(z+x)}{x(x+y)}.\]
2021 BMT, 12
Let $a$, $b$, and $c$ be the solutions of the equation $$x^3 - 3 \cdot 2021^2x = 2 \cdot 20213.$$ Compute $\frac{1}{a}+\frac{1}{b}+\frac{1}{c}.$
2004 India IMO Training Camp, 2
Define a function $g: \mathbb{N} \mapsto \mathbb{N}$ by the following rule:
(a) $g$ is nondecrasing
(b) for each $n$, $g(n)$ i sthe number of times $n$ appears in the range of $g$,
Prove that $g(1) = 1$ and $g(n+1) = 1 + g( n +1 - g(g(n)))$ for all $n \in \mathbb{N}$
1977 Vietnam National Olympiad, 5
The real numbers $a_0, a_1, ... , a_{n+1}$ satisfy $a_0 = a_{n+1} = 0$ and $|a_{k-1} - 2a_k + a_{k+1}| \le 1$ for $k = 1, 2, ... , n$. Show that $|a_k| \le \frac{ k(n + 1 - k)}{2}$ for all $k$.
2014 Chile TST IMO, 4
Let \( f(n) \) be a polynomial with integer coefficients. Prove that if \( f(-1) \), \( f(0) \), and \( f(1) \) are not divisible by 3, then \( f(n) \neq 0 \) for all integers \( n \).
2012 Baltic Way, 5
Find all functions $f : \mathbb{R} \rightarrow \mathbb{R}$ for which
\[f(x + y) = f(x - y) + f(f(1 - xy))\]
holds for all real numbers $x$ and $y$.
1994 Swedish Mathematical Competition, 5
The polynomial $x^k + a_1x^{k-1} + a_2x^{k-2} +... + a_k$ has $k$ distinct real roots. Show that $a_1^2 > \frac{2ka_2}{k-1}$.
2014 Federal Competition For Advanced Students, 1
Determine all real numbers $x$ and $y$ such that
$x^2 + x = y^3 - y$,
$y^2 + y = x^3 - x$
KoMaL A Problems 2023/2024, A. 872
For every positive integer $k$ let $a_{k,1},a_{k,2},\ldots$ be a sequence of positive integers. For every positive integer $k$ let sequence $\{a_{k+1,i}\}$ be the difference sequence of $\{a_{k,i}\}$, i.e. for all positive integers $k$ and $i$ the following holds: $a_{k,i+1}-a_{k,i}=a_{k+1,i}$. Is it possible that every positive integer appears exactly once among numbers $a_{k,i}$?
[i]Proposed by Dávid Matolcsi, Berkeley[/i]
2022 CMIMC, 1.5
Grant is standing at the beginning of a hallway with infinitely many lockers, numbered, $1, 2, 3, \ldots$ All of the lockers are initially closed. Initially, he has some set $S = \{1, 2, 3, \ldots\}$.
Every step, for each element $s$ of $S$, Grant goes through the hallway and opens each locker divisible by $s$ that is closed, and closes each locker divisible by $s$ that is open. Once he does this for all $s$, he then replaces $S$ with the set of labels of the currently open lockers, and then closes every door again.
After $2022$ steps, $S$ has $n$ integers that divide ${10}^{2022}$. Find $n$.
[i]Proposed by Oliver Hayman[/i]
2010 Indonesia TST, 1
find all pairs of relatively prime natural numbers $ (m,n) $ in such a way that there exists non constant polynomial f satisfying \[ gcd(a+b+1, mf(a)+nf(b) > 1 \]
for every natural numbers $ a $ and $ b $
LMT Team Rounds 2021+, B16
Bob plants two saplings. Each day, each sapling has a $1/3$ chance of instantly turning into a tree. Given that the expected number of days it takes both trees to grow is $m/n$ , where $m$ and $n$ are relatively prime positive integers, find $m +n$.
[i]Proposed by Powell Zhang[/i]
2011 Mexico National Olympiad, 3
Let $n$ be a positive integer. Find all real solutions $(a_1, a_2, \dots, a_n)$ to the system:
\[a_1^2 + a_1 - 1 = a_2\]
\[ a_2^2 + a_2 - 1 = a_3\]
\[\hspace*{3.3em} \vdots \]
\[a_{n}^2 + a_n - 1 = a_1\]
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$.
2005 Slovenia National Olympiad, Problem 1
Find all positive numbers $x$ such that $20\{x\}+0.5\lfloor x\rfloor = 2005$.
1962 Czech and Slovak Olympiad III A, 1
Determine all integers $x$ such that $2x^2-x-36$ is a perfect square of a prime.
2014 ELMO Shortlist, 11
Let $p$ be a prime satisfying $p^2\mid 2^{p-1}-1$, and let $n$ be a positive integer. Define
\[ f(x) = \frac{(x-1)^{p^n}-(x^{p^n}-1)}{p(x-1)}. \]
Find the largest positive integer $N$ such that there exist polynomials $g(x)$, $h(x)$ with integer coefficients and an integer $r$ satisfying $f(x) = (x-r)^N g(x) + p \cdot h(x)$.
[i]Proposed by Victor Wang[/i]
2016 Bangladesh Mathematical Olympiad, 4
Consider the set of integers $ \left \{ 1, 2, \dots , 100 \right \} $. Let $ \left \{ x_1, x_2, \dots , x_{100} \right \}$ be some arbitrary arrangement of the integers $ \left \{ 1, 2, \dots , 100 \right \}$, where all of the $x_i$ are different. Find the smallest possible value of the sum
$$S = \left | x_2 - x_1 \right | + \left | x_3 - x_2 \right | + \cdots+ \left |x_{100} - x_{99} \right | + \left |x_1 - x_{100} \right | .$$
2007 Putnam, 4
Let $ n$ be a positive integer. Find the number of pairs $ P,Q$ of polynomials with real coefficients such that
\[ (P(X))^2\plus{}(Q(X))^2\equal{}X^{2n}\plus{}1\]
and $ \text{deg}P<\text{deg}{Q}.$
2014 All-Russian Olympiad, 3
In a country, mathematicians chose an $\alpha> 2$ and issued coins in denominations of 1 ruble, as well as $\alpha ^k$ rubles for each positive integer k. $\alpha$ was chosen so that the value of each coins, except the smallest, was irrational. Is it possible that any natural number of rubles can be formed with at most 6 of each denomination of coins?
2014 Brazil Team Selection Test, 2
Prove that in any set of $2000$ distinct real numbers there exist two pairs $a>b$ and $c>d$ with $a \neq c$ or $b \neq d $, such that \[ \left| \frac{a-b}{c-d} - 1 \right|< \frac{1}{100000}. \]
2021 Iran RMM TST, 2
Let $f : \mathbb{R}^+\to\mathbb{R}$ satisfying $f(x)=f(x+2)+2f(x^2+2x)$. Prove that if for all $x>1400^{2021}$, $xf(x) \le 2021$, then $xf(x) \le 2021$ for all $x \in \mathbb {R}^+$
Proposed by [i]Navid Safaei[/i]
2008 China Team Selection Test, 2
The sequence $ \{x_{n}\}$ is defined by $ x_{1} \equal{} 2,x_{2} \equal{} 12$, and $ x_{n \plus{} 2} \equal{} 6x_{n \plus{} 1} \minus{} x_{n}$, $ (n \equal{} 1,2,\ldots)$. Let $ p$ be an odd prime number, let $ q$ be a prime divisor of $ x_{p}$. Prove that if $ q\neq2,3,$ then $ q\geq 2p \minus{} 1$.
2025 Chile TST IMO-Cono, 3
Let \( a, b, c, d \) be real numbers such that \( abcd = 1 \), and
\[
a + \frac{1}{a} + b + \frac{1}{b} + c + \frac{1}{c} + d + \frac{1}{d} = 0.
\]
Prove that one of the numbers \( ab, ac \) or \( ad \) is equal to \( -1 \).