Found problems: 1782
2008 Romania Team Selection Test, 4
Let $ G$ be a connected graph with $ n$ vertices and $ m$ edges such that each edge is contained in at least one triangle. Find the minimum value of $ m$.
1977 Polish MO Finals, 3
Consider the polynomial $W(x) = (x - a)^kQ(x)$, where $a \neq 0$, $Q$ is a nonzero polynomial, and $k$ a natural number. Prove that $W$ has at least $k + 1$ nonzero coefficients.
PEN O Problems, 3
Prove that the set of integers of the form $2^{k}-3$ ($k=2,3,\cdots$) contains an infinite subset in which every two members are relatively prime.
2012 Iran MO (3rd Round), 3
Prove that if $n$ is large enough, among any $n$ points of plane we can find $1000$ points such that these $1000$ points have pairwise distinct distances. Can you prove the assertion for $n^{\alpha}$ where $\alpha$ is a positive real number instead of $1000$?
2004 Italy TST, 2
A positive integer $n$ is said to be a [i]perfect power[/i] if $n=a^b$ for some integers $a,b$ with $b>1$.
$(\text{a})$ Find $2004$ perfect powers in arithmetic progression.
$(\text{b})$ Prove that perfect powers cannot form an infinite arithmetic progression.
2011 AMC 12/AHSME, 23
Let $f(z)=\frac{z+a}{z+b}$ and $g(z)=f(f(z))$, where $a$ and $b$ are complex numbers. Suppose that $|a|=1$ and $g(g(z))=z$ for all $z$ for which $g(g(z))$ is defined. What is the difference between the largest and smallest possible values of $|b|$?
$\textbf{(A)}\ 0 \qquad
\textbf{(B)}\ \sqrt{2}-1 \qquad
\textbf{(C)}\ \sqrt{3}-1 \qquad
\textbf{(D)}\ 1 \qquad
\textbf{(E)}\ 2$
2010 Korea - Final Round, 3
There are $ n$ websites $ 1,2,\ldots,n$ ($ n \geq 2$). If there is a link from website $ i$ to $ j$, we can use this link so we can move website $ i$ to $ j$.
For all $ i \in \left\{1,2,\ldots,n - 1 \right\}$, there is a link from website $ i$ to $ i+1$.
Prove that we can add less or equal than $ 3(n - 1)\log_{2}(\log_{2} n)$ links so that for all integers $ 1 \leq i < j \leq n$, starting with website $ i$, and using at most three links to website $ j$. (If we use a link, website's number should increase. For example, No.7 to 4 is impossible).
Sorry for my bad English.
2004 Turkey MO (2nd round), 4
Find all functions $f:\mathbb{Z}\to \mathbb{Z}$ satisfying the condition $f(n)-f(n+f(m))=m$ for all $m,n\in \mathbb{Z}$
2012 Indonesia TST, 1
The sequence $a_i$ is defined as $a_1 = 2, a_2 = 3$, and
$a_{n+1} = 2a_{n-1}$ or $a_{n+1} = 3a_n - 2a_{n-1}$ for all integers $n \ge 2$.
Prove that no term in $a_i$ is in the range $[1612, 2012]$.
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).\]
2008 All-Russian Olympiad, 8
On the cartesian plane are drawn several rectangles with the sides parallel to the coordinate axes. Assume that any two rectangles can be cut by a vertical or a horizontal line. Show that it's possible to draw one horizontal and one vertical line such that each rectangle is cut by at least one of these two lines.
1999 Romania Team Selection Test, 8
Let $a$ be a positive real number and $\{x_n\}_{n\geq 1}$ a sequence of real numbers such that $x_1=a$ and
\[ x_{n+1} \geq (n+2)x_n - \sum^{n-1}_{k=1}kx_k, \ \forall \ n\geq 1. \]
Prove that there exists a positive integer $n$ such that $x_n > 1999!$.
[i]Ciprian Manolescu[/i]
2013 IMO Shortlist, C4
Let $n$ be a positive integer, and let $A$ be a subset of $\{ 1,\cdots ,n\}$. An $A$-partition of $n$ into $k$ parts is a representation of n as a sum $n = a_1 + \cdots + a_k$, where the parts $a_1 , \cdots , a_k $ belong to $A$ and are not necessarily distinct. The number of different parts in such a partition is the number of (distinct) elements in the set $\{ a_1 , a_2 , \cdots , a_k \} $.
We say that an $A$-partition of $n$ into $k$ parts is optimal if there is no $A$-partition of $n$ into $r$ parts with $r<k$. Prove that any optimal $A$-partition of $n$ contains at most $\sqrt[3]{6n}$ different parts.
2012 Purple Comet Problems, 25
Find the largest prime that divides $1\cdot 2\cdot 3+2\cdot 3\cdot 4+\cdots +44\cdot 45\cdot 46$
2001 Bulgaria National Olympiad, 3
Given a permutation $(a_{1}, a_{1},...,a_{n})$ of the numbers $1, 2,...,n$ one may interchange any two consecutive "blocks" - that is, one may transform
($a_{1}, a_{2},...,a_{i}$,$\underbrace {a_{i+1},... a_{i+p},}_{A} $ $ \underbrace{a_{i+p+1},...,a_{i+q},}_{B}...,a_{n}) $
into
$ (a_{1}, a_{2},...,a_{i},$ $ \underbrace {a_{i+p+1},...,a_{i+q},}_{B} $ $ \underbrace {a_{i+1},... a_{i+p}}_{A}$$,...,a_{n}) $
by interchanging the "blocks" $A$ and $B$. Find the least number of such changes which are needed to transform $(n, n-1,...,1)$ into $(1,2,...,n)$
2008 Bulgaria National Olympiad, 3
Let $M$ be the set of the integer numbers from the range $[-n, n]$. The subset $P$ of $M$ is called a [i]base subset[/i] if every number from $M$ can be expressed as a sum of some different numbers from $P$. Find the smallest natural number $k$ such that every $k$ numbers that belongs to $M$ form a base subset.
2013 AMC 12/AHSME, 15
The number $2013$ is expressed in the form \[2013=\frac{a_1!a_2!\cdots a_m!}{b_1!b_2!\cdots b_n!},\] where $a_1\ge a_2\ge\cdots\ge a_m$ and $b_1\ge b_2\ge\cdots\ge b_n$ are positive integers and $a_1+b_1$ is as small as possible. What is $|a_1-b_1|$?
${ \textbf{(A)}\ 1\qquad\textbf{(B)}\ 2\qquad\textbf{(C)}\ 3\qquad\textbf{(D}}\ 4\qquad\textbf{(E)}\ 5 $
2009 Iran MO (2nd Round), 1
We have a $ (n+2)\times n $ rectangle and we’ve divided it into $ n(n+2) \ \ 1\times1 $ squares. $ n(n+2) $ soldiers are standing on the intersection points ($ n+2 $ rows and $ n $ columns). The commander shouts and each soldier stands on its own location or gaits one step to north, west, east or south so that he stands on an adjacent intersection point. After the shout, we see that the soldiers are standing on the intersection points of a $ n\times(n+2) $ rectangle ($ n $ rows and $ n+2 $ columns) such that the first and last row are deleted and 2 columns are added to the right and left (To the left $1$ and $1$ to the right).
Prove that $ n $ is even.
1986 Balkan MO, 3
Let $a,b,c$ be real numbers such that $ab\not= 0$ and $c>0$. Let $(a_{n})_{n\geq 1}$ be the sequence of real numbers defined by: $a_{1}=a, a_{2}=b$ and
\[a_{n+1}=\frac{a_{n}^{2}+c}{a_{n-1}}\]
for all $n\geq 2$.
Show that all the terms of the sequence are integer numbers if and only if the numbers $a,b$ and $\frac{a^{2}+b^{2}+c}{ab}$ are integers.
2003 Pan African, 1
Let $N_0=\{0, 1, 2 \cdots \}$. Find all functions: $N_0 \to N_0$ such that:
(1) $f(n) < f(n+1)$, all $n \in N_0$;
(2) $f(2)=2$;
(3) $f(mn)=f(m)f(n)$, all $m, n \in N_0$.
PEN L Problems, 1
An integer sequence $\{a_{n}\}_{n \ge 1}$ is defined by \[a_{0}=0, \; a_{1}=1, \; a_{n+2}=2a_{n+1}+a_{n}\] Show that $2^{k}$ divides $a_{n}$ if and only if $2^{k}$ divides $n$.
1980 IMO, 1
Given a sequence $\{a_n\}$ of real numbers such that $|a_{k+m} - a_k - a_m| \leq 1$ for all positive integers $k$ and $m$, prove that, for all positive integers $p$ and $q$, \[|\frac{a_p}{p} - \frac{a_q}{q}| < \frac{1}{p} + \frac{1}{q}.\]
2007 IberoAmerican Olympiad For University Students, 2
Prove that for all positive integers $n$ and for all real numbers $x$ such that $0\le x\le1$, the following inequality holds:
$\left(1-x+\frac{x^2}{2}\right)^n-(1-x)^n\le\frac{x}{2}$.
2003 Romania Team Selection Test, 18
For every positive integer $n$ we denote by $d(n)$ the sum of its digits in the decimal representation. Prove that for each positive integer $k$ there exists a positive integer $m$ such that the equation $x+d(x)=m$ has exactly $k$ solutions in the set of positive integers.
2014 Contests, 1
Find the number of $(a_1,a_2, ... ,a_{2014})$ permutations of the $(1,2, . . . ,2014)$ such that, for all $1\leq i<j\leq2014$, $i+a_i \leq j+a_j$.