Found problems: 1782
2008 white stones and 1 black stone are in a row. An 'action' means the following: select one black stone and change the color of neighboring stone(s).
Find all possible initial position of the black stone, to make all stones black by finite actions.
Let $n, b$ and $c$ be positive integers. A group of $n$ pirates wants to fairly split their treasure. The treasure consists of $c \cdot n$ identical coins distributed over $b \cdot n$ bags, of which at least $n-1$ bags are initially empty. Captain Jack inspects the contents of each bag and then performs a sequence of moves. In one move, he can take any number of coins from a single bag and put them into one empty bag. Prove that no matter how the coins are initially distributed, Jack can perform at most $n-1$ moves and then split the bags among the pirates such that each pirate gets $b$ bags and $c$ coins.
Show that every natural number $n\leq2^{1\;000\;000}$ can be obtained first with 1 doing less than $1\;100\;000$ sums; more precisely, there is a finite sequence of natural numbers $x_0,\ x_1,\dots,\ x_k\mbox{ with }k\leq1\;100\;000,\ x_0=1,\ x_k=n$ such that for all $i=1,\ 2,\dots,\ k$ there exist $r,\ s$ with $0\leq{r}\leq{s}<i$ such that $x_i=x_r+x_s$.
Let $\mathbb{Q}^+$ be the set of all positive rational numbers. Find all functions $f:\mathbb{Q}^+\rightarrow \mathbb{Q}^+$ satisfying $f(1)=1$ and
\[ f(x+n)=f(x)+nf(\frac{1}{x}) \forall n\in\mathbb{N},x\in\mathbb{Q}^+\]
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.$
An integer $n$ will be called [i]good[/i] if we can write \[n=a_1+a_2+\cdots+a_k,\] where $a_1,a_2, \ldots, a_k$ are positive integers (not necessarily distinct) satisfying \[\frac{1}{a_1}+\frac{1}{a_2}+\cdots+\frac{1}{a_n}=1.\] Given the information that the integers 33 through 73 are good, prove that every integer $\ge 33$ is good.
Let $n$ be a positive integer. $n$ people take part in a certain party. For any pair of the participants, either the two are acquainted with each other or they are not. What is the maximum possible number of the pairs for which the two are not acquainted but have a common acquaintance among the participants?
The numbers $1,2,...,1970$ are written on a board. One is allowed to remove $2$ numbers and to write down their difference instead. When repeated often enough, only one number remains. Show that this number is odd.
Let $a_1=2013$ and $a_{n+1} = 2013^{a_n}$ for all positive integers $n$. Let $b_1=1$ and $b_{n+1}=2013^{2012b_n}$ for all positive integers $n$. Prove that $a_n>b_n$ for all positive integers $n$.
All positive divisors of a positive integer $N$ are written on a blackboard. Two players $A$ and $B$ play the following game taking alternate moves. In the firt move, the player $A$ erases $N$. If the last erased number is $d$, then the next player erases either a divisor of $d$ or a multiple of $d$. The player who cannot make a move loses. Determine all numbers $N$ for which $A$ can win independently of the moves of $B$.
[i](4th Middle European Mathematical Olympiad, Individual Competition, Problem 2)[/i]
Prove that for every natural number $n$, and for every real number $x \neq \frac{k\pi}{2^t}$ ($t=0,1, \dots, n$; $k$ any integer) \[ \frac{1}{\sin{2x}}+\frac{1}{\sin{4x}}+\dots+\frac{1}{\sin{2^nx}}=\cot{x}-\cot{2^nx} \]
Let $p$ be a prime number and let $X$ be a finite set containing at least $p$ elements. A collection of pairwise mutually disjoint $p$-element subsets of $X$ is called a $p$-family. (In particular, the empty collection is a $p$-family.) Let $A$(respectively, $B$) denote the number of $p$-families having an even (respectively, odd) number of $p$-element subsets of $X$. Prove that $A$ and $B$ differ by a multiple of $p$.
For any $h = 2^{r}$ ($r$ is a non-negative integer), find all $k \in \mathbb{N}$ which satisfy the following condition: There exists an odd natural number $m > 1$ and $n \in \mathbb{N}$, such that $k \mid m^{h} - 1, m \mid n^{\frac{m^{h}-1}{k}} + 1$.
Call a real-valued function $ f$ [i]very convex[/i] if
\[ \frac {f(x) \plus{} f(y)}{2} \ge f\left(\frac {x \plus{} y}{2}\right) \plus{} |x \minus{} y|
\]
holds for all real numbers $ x$ and $ y$. Prove that no very convex function exists.
Let $a$ be a real number. Let $(f_n(x))_{n\ge 0}$ be a sequence of polynomials such that $f_0(x)=1$ and $f_{n+1}(x)=xf_n(x)+f_n(ax)$ for all non-negative integers $n$.
a) Prove that $f_n(x)=x^nf_n\left(x^{-1}\right)$ for all non-negative integers $n$.
b) Find an explicit expression for $f_n(x)$.
Let $ a_{0},a_{1},\ldots,a_{n}$ be integers, one of which is nonzero, and all of the numbers are not less than $ \minus{} 1$. Prove that if \[ a_{0} \plus{} 2a_{1} \plus{} 2^{2}a_{2} \plus{} \cdots \plus{} 2^{n}a_{n} \equal{} 0,\] then $ a_{0} \plus{} a_{1} \plus{} \cdots \plus{} a_{n} > 0$.
We are given $2001$ balloons and a positive integer $k$. Each balloon has been blown up to a certain size (not necessarily the same for each balloon). In each step it is allowed to choose at most $k$ balloons and equalize their sizes to their arithmetic mean. Determine the smallest value of $k$ such that, whatever the initial sizes are, it is possible to make all the balloons have equal size after a finite number of steps.
Let $X \neq \varnothing$ be a finite set and let $f: X \to X$ be a function such that for every $x \in X$ and a fixed prime $p$ we have $f^p(x)=x.$ Let $Y=\{x \in X | f(x) \neq x\}.$ Prove that the number of the members of the set $Y$ is divisible by $p.$
[i]Note.[/i] ${f^p(x)=x = \underbrace{f(f(f(\cdots ((f}_{ p \text{ times}}(x) ) \cdots )))} .$
Define a function $f:\mathbb{N}\rightarrow\mathbb{N}_0$ by $f(1)=0$ and
\[f(n)=\max_j\{ f(j)+f(n-j)+j\}\quad\forall\, n\ge 2 \]
Determine $f(2000)$.
We are given $n$ intervals $[l_1,r_1],[l_2,r_2],[l_3,r_3],\dots, [l_n,r_n]$ in the number line. We can divide the intervals into two sets such that no two intervals in the same set have overlaps. Prove that there are at most $n-1$ pairs of overlapping intervals.
Let $ m,n$ be two natural nonzero numbers and sets $ A \equal{} \{ 1,2,...,n\}, B \equal{} \{1,2,...,m\}$. We say that subset $ S$ of Cartesian product $ A \times B$ has property $ (j)$ if $ (a \minus{} x)(b \minus{} y)\le 0$ for each pairs $ (a,b),(x,y) \in S$. Prove that every set $ S$ with propery $ (j)$ has at most $ m \plus{} n \minus{} 1$ elements.
[color=#FF0000]The statement was edited, in order to reflect the actual problem asked. The sign of the inequality was inadvertently reversed into $ (a \minus{} x)(b \minus{} y)\ge 0$, and that accounts for the following two posts.[/color]
The sequences $ a_0, a_1, \ldots$ and $ b_0, b_1, \ldots$ are defined for $ n \equal{} 0, 1, 2, \ldots$ by the equalities
\[ a_0 \equal{} \frac {\sqrt {2}}{2}, \quad a_{n \plus{} 1} \equal{} \frac {\sqrt {2}}{2} \cdot \sqrt {1 \minus{} \sqrt {1 \minus{} a^2_n}}
\]
and
\[ b_0 \equal{} 1, \quad b_{n \plus{} 1} \equal{} \frac {\sqrt {1 \plus{} b^2_n} \minus{} 1}{b_n}
\]
Prove the inequalities for every $ n \equal{} 0, 1, 2, \ldots$
\[ 2^{n \plus{} 2} a_n < \pi < 2^{n \plus{} 2} b_n.
\]
Determine all $(m,n) \in \mathbb{Z}^+ \times \mathbb{Z}^+$ which satisfy $3^m-7^n=2.$
Let $n$ be a positive integer. Find all positive integers $m$ for which there exists a polynomial $f(x) = a_{0} + \cdots + a_{n}x^{n} \in \mathbb{Z}[X]$ ($a_{n} \not= 0$) such that $\gcd(a_{0},a_{1},\cdots,a_{n},m)=1$ and $m|f(k)$ for each $k \in \mathbb{Z}$.
For every integer $n \ge 1$, the function $f_n : \left\{ 0, 1, \cdots, n \right\} \to \mathbb R$ is defined recursively by $f_n(0) = 0$, $f_n(1) = 1$ and \[ (n-k) f_n(k-1) + kf_n(k+1) = nf_n(k) \] for each $1 \le k < n$. Let $S_N = f_{N+1}(1) + f_{N+2}(2) + \cdots + f_{2N} (N)$. Find the remainder when $\left\lfloor S_{2013} \right\rfloor$ is divided by $2011$. (Here $\left\lfloor x \right\rfloor$ is the greatest integer not exceeding $x$.)
[i]Proposed by Lewis Chen[/i]