Found problems: 1782
1991 China Team Selection Test, 3
$5$ points are given in the plane, any three non-collinear and any four non-concyclic. If three points determine a circle that has one of the remaining points inside it and the other one outside it, then the circle is said to be [i]good[/i]. Let the number of good circles be $n$; find all possible values of $n$.
1997 IMC, 6
Suppose $F$ is a family of finite subsets of $\mathbb{N}$ and for any 2 sets $A,B \in F$ we have $A \cap B \not= \O$.
(a) Is it true that there is a finite subset $Y$ of $\mathbb{N}$ such that for any $A,B \in F$ we have $A\cap B\cap Y \not= \O$?
(b) Is the above true if we assume that all members of $F$ have the same size?
2015 AMC 12/AHSME, 20
For every positive integer $n$, let $\operatorname{mod_5}(n)$ be the remainder obtained when $n$ is divided by $5$. Define a function $f : \{0, 1, 2, 3, \dots\} \times \{0, 1, 2, 3, 4\} \to \{0, 1, 2, 3, 4\}$ recursively as follows:
\[f(i, j) = \begin{cases}
\operatorname{mod_5}(j+1) & \text{if }i=0\text{ and }0\leq j\leq 4 \\
f(i-1, 1) & \text{if }i\geq 1\text{ and }j=0 \text{, and}\\
f(i-1, f(i, j-1)) & \text{if }i\geq 1\text{ and }1\leq j\leq 4
\end{cases}\]
What is $f(2015, 2)$?
$\textbf{(A) }0 \qquad\textbf{(B) }1 \qquad\textbf{(C) }2 \qquad\textbf{(D) }3 \qquad\textbf{(E) }4$
2009 Kyrgyzstan National Olympiad, 5
Prove for all natural $n$ that $\left. {{{40}^n} \cdot n!} \right|(5n)!$
2012 Puerto Rico Team Selection Test, 7
Let $f$ be a function with the following properties:
1) $f(n)$ is defined for every positive integer $n$;
2) $f(n)$ is an integer;
3) $f(2)=2$;
4) $f(mn)=f(m)f(n)$ for all $m$ and $n$;
5) $f(m)>f(n)$ whenever $m>n$.
Prove that $f(n)=n$.
2011 China Western Mathematical Olympiad, 2
Let $M$ be a subset of $\{1,2,3... 2011\}$ satisfying the following condition:
For any three elements in $M$, there exist two of them $a$ and $b$ such that $a|b$ or $b|a$.
Determine the maximum value of $|M|$ where $|M|$ denotes the number of elements in $M$
2008 Germany Team Selection Test, 1
A sequence $ (S_n), n \geq 1$ of sets of natural numbers with $ S_1 = \{1\}, S_2 = \{2\}$ and
\[{ S_{n + 1} = \{k \in }\mathbb{N}|k - 1 \in S_n \text{ XOR } k \in S_{n - 1}\}.
\]
Determine $ S_{1024}.$
2010 Pan African, 3
Does there exist a function $f:\mathbb{Z}\to\mathbb{Z}$ such that $f(x+f(y))=f(x)-y$ for all integers $x$ and $y$?
2005 Korea National Olympiad, 4
Find all $f: \mathbb R \to\mathbb R$ such that for all real numbers $x$, $f(x) \geq 0$ and for all real numbers $x$ and $y$, \[ f(x+y)+f(x-y)-2f(x)-2y^2=0. \]
PEN P Problems, 28
Prove that any positive integer can be represented as a sum of Fibonacci numbers, no two of which are consecutive.
2010 Germany Team Selection Test, 3
Determine all $(m,n) \in \mathbb{Z}^+ \times \mathbb{Z}^+$ which satisfy $3^m-7^n=2.$
2000 Hungary-Israel Binational, 3
Let $k$ and $l$ be two given positive integers and $a_{ij}(1 \leq i \leq k, 1 \leq j \leq l)$ be $kl$ positive integers. Show that if $q \geq p > 0$, then \[(\sum_{j=1}^{l}(\sum_{i=1}^{k}a_{ij}^{p})^{q/p})^{1/q}\leq (\sum_{i=1}^{k}(\sum_{j=1}^{l}a_{ij}^{q})^{p/q})^{1/p}.\]
2013 ELMO Shortlist, 5
There is a $2012\times 2012$ grid with rows numbered $1,2,\dots 2012$ and columns numbered $1,2,\dots, 2012$, and we place some rectangular napkins on it such that the sides of the napkins all lie on grid lines. Each napkin has a positive integer thickness. (in micrometers!)
(a) Show that there exist $2012^2$ unique integers $a_{i,j}$ where $i,j \in [1,2012]$ such that for all $x,y\in [1,2012]$, the sum \[ \sum _{i=1}^{x} \sum_{j=1}^{y} a_{i,j} \] is equal to the sum of the thicknesses of all the napkins that cover the grid square in row $x$ and column $y$.
(b) Show that if we use at most $500,000$ napkins, at least half of the $a_{i,j}$ will be $0$.
[i]Proposed by Ray Li[/i]
1981 Bundeswettbewerb Mathematik, 4
Let $X$ be a non empty subset of $\mathbb{N} = \{1,2,\ldots \}$. Suppose that for all $x \in X$, $4x \in X$ and $\lfloor \sqrt{x} \rfloor \in X$. Prove that $X=\mathbb{N}$.
1990 Turkey Team Selection Test, 6
Let $k\geq 2$ and $n_1, \dots, n_k \in \mathbf{Z}^+$. If $n_2 | (2^{n_1} -1)$, $n_3 | (2^{n_2} -1)$, $\dots$, $n_k | (2^{n_{k-1}} -1)$, $n_1 | (2^{n_k} -1)$, show that $n_1 = \dots = n_k =1$.
PEN O Problems, 31
Prove that, for any integer $a_{1}>1$, there exist an increasing sequence of positive integers $a_{1}, a_{2}, a_{3}, \cdots$ such that \[a_{1}+a_{2}+\cdots+a_{n}\; \vert \; a_{1}^{2}+a_{2}^{2}+\cdots+a_{n}^{2}\] for all $n \in \mathbb{N}$.
2013 Turkey Team Selection Test, 3
Some cities of a country consisting of $n$ cities are connected by round trip flights so that there are at least $k$ flights from any city and any city is reachable from any city. Prove that for any such flight organization these flights can be distributed among $n-k$ air companies so that one can reach any city from any city by using of at most one flight of each air company.
1992 China Team Selection Test, 2
A $(3n + 1) \times (3n + 1)$ table $(n \in \mathbb{N})$ is given. Prove that deleting any one of its squares yields a shape cuttable into pieces of the following form and its rotations: ''L" shape formed by cutting one square from a $2 \times 2$ squares.
1990 IMO Longlists, 51
Determine for which positive integers $ k$ the set \[ X \equal{} \{1990, 1990 \plus{} 1, 1990 \plus{} 2, \ldots, 1990 \plus{} k\}\] can be partitioned into two disjoint subsets $ A$ and $ B$ such that the sum of the elements of $ A$ is equal to the sum of the elements of $ B.$
PEN M Problems, 33
The sequence $ \{x_{n}\}_{n \ge 1}$ is defined by
\[ x_{1} \equal{} 2, x_{n \plus{} 1} \equal{} \frac {2 \plus{} x_{n}}{1 \minus{} 2x_{n}}\;\; (n \in \mathbb{N}).
\] Prove that
a) $ x_{n}\not \equal{} 0$ for all $ n \in \mathbb{N}$,
b) $ \{x_{n}\}_{n \ge 1}$ is not periodic.
2009 China Team Selection Test, 3
Let $ f(x)$ be a $ n \minus{}$degree polynomial all of whose coefficients are equal to $ \pm 1$, and having $ x \equal{} 1$ as its $ m$ multiple root. If $ m\ge 2^k (k\ge 2,k\in N)$, then $ n\ge 2^{k \plus{} 1} \minus{} 1.$
2012 Iran MO (3rd Round), 3
Prove that for each $n \in \mathbb N$ there exist natural numbers $a_1<a_2<...<a_n$ such that $\phi(a_1)>\phi(a_2)>...>\phi(a_n)$.
[i]Proposed by Amirhossein Gorzi[/i]
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 Indonesia TST, 3
Find all pairs of function $ f: \mathbb{N} \rightarrow \mathbb{N}$ and polynomial with integer coefficients $ p$ such that:
(i) $ p(mn) \equal{} p(m)p(n)$ for all positive integers $ m,n > 1$ with $ \gcd(m,n) \equal{} 1$, and
(ii) $ \sum_{d|n}f(d) \equal{} p(n)$ for all positive integers $ n$.
2006 Korea - Final Round, 3
A positive integer $N$ is said to be $n-$ good if
(i) $N$ has at least $n$ distinct prime divisors, and
(ii) there exist distinct positive divisors $1, x_{2}, . . . , x_{n}$ whose sum is $N$ .
Show that there exists an $n-$ good number for each $n\geq 6$.