Found problems: 1782
Prove the following identity for every $ n\in N$:
$ \sum_{j\plus{}h\equal{}n,j\geq h}\frac{(\minus{}1)^h2^{j\minus{}h}\binom{j}{h}}{j}\equal{}\frac{2}{n}$
Find all functions $ f: \mathbb Q\longrightarrow\mathbb Q$ such that:
$ f(x)+f(\frac1x)=1$
$ 2f(f(x))=f(2x)$
The sequences $(a_n), (b_n),$ and $(c_n)$ are de fined by $a_0 = 1, b_0 = 0, c_0 = 0,$ and
\[a_n = a_{n-1} +
\frac{c_{n-1}}{n}, b_n = b_{n-1} +\frac{a_{n-1}}{n}, c_n = c_{n-1} +\frac{b_{n-1}}{n}\]
for all $n \geq1$. Prove that
\[\left|a_n -\frac{n + 1}{3}\right|<\frac{2}{\sqrt{3n}}\]
for all $n \geq 1$.
A convex 2011-gon is drawn on the board. Peter keeps drawing its diagonals in such a way, that each newly drawn diagonal intersected no more than one of the already drawn diagonals. What is the greatest number of diagonals that Peter can draw?
Let $M$ be the set of all integers from $1$ to $2013$. Each subset of $M$ is given one of $k$ available colors, with the only condition that if the union of two different subsets $A$ and $B$ is $M$, then $A$ and $B$ are given different colors. What is the least possible value of $k$?
(I'll skip over the whole "dressing" of the graph in cities and flights [color=#FF0000][Mod edit: Shu has posted the "dressed-up" version below][/color])
For an ordinary directed graph, show that there is a subset A of vertices such that:
$1.$ There are no edges between the vertices of A.
$2.$ For any vertex $v$, there is either a direct way from $v$ to a vertex in A, or a way passing through only one vertex and ending in A (like $v$ ->$v'$-> $a$, where $a$ is a vertex in A)
We call a positive integer [i]alternating[/i] if every two consecutive digits in its decimal representation are of different parity.
Find all positive integers $n$ such that $n$ has a multiple which is alternating.
Consider a function $f: \mathbb Z \to \mathbb Z$ such that for every integer $n \ge 0$, there are at most $0.001n^2$ pairs of integers $(x,y)$ for which $f(x+y) \neq f(x)+f(y)$ and $\max\{ \lvert x \rvert, \lvert y \rvert \} \le n$. Is it possible that for some integer $n \ge 0$, there are more than $n$ integers $a$ such that $f(a) \neq a \cdot f(1)$ and $\lvert a \rvert \le n$?
[i]Proposed by David Yang[/i]
If $x_{1},x_{2},...,x_{n}(n>2)$ are positive real numbers with $x_{1}+x_{2}+...+x_{n}=1$. Prove that $x_{1}^{2}x_{2}+x_{2}^{2}x_{3}+...+x_{n}^{2}x_{1}\leq\frac{4}{27}$.
Let $a_0,a_1,\dots,a_n$ be positive real numbers such that $a_{k+1}-a_k \geq 1$ for all $k=0,1,\dots,n-1.$ Prove that
\[1+\frac{1}{a_0} \left( 1+\frac1{a_1-a_0}\right)\cdots\left(1+\frac1{a_n-a_0}\right)\leq \left(1+\frac1{a_0}\right) \left(1+\frac1{a_1}\right)\cdots \left(1+\frac1{a_n}\right).\]
Find all functions $f:\mathbb{N} \to \mathbb{N}$ such that for all $m,n\in \mathbb{N}$: [list][*] $f(2)=2$, [*] $f(mn)=f(m)f(n)$, [*] $f(n+1)>f(n)$. [/list]
$n$ red and $n$ blue points on a plane are given so that no three of the $2n$ points are collinear. Prove that it is always possible to split up the points into $n$ pairs, with one red and one blue point in each pair, so that no two of the $n$ line segments which connect the two members of a pair intersect.
The $ 5\times 5$ grid shown contains a collection of squares with sizes from $ 1\times 1$ to $ 5\times 5$. How many of these squares contain the black center square?
[asy]unitsize(6mm);
defaultpen(linewidth(.8pt));
for(int i=0; i<=5; ++i)
{
draw((0,i)--(5,i));
draw((i,0)--(i,5));
}
fill((2,2)--(2,3)--(3,3)--(3,2)--cycle);[/asy]$ \textbf{(A)}\ 12\qquad
\textbf{(B)}\ 15\qquad
\textbf{(C)}\ 17\qquad
\textbf{(D)}\ 19\qquad
\textbf{(E)}\ 20$
Let $F_r=x^r\sin{rA}+y^r\sin{rB}+z^r\sin{rC}$, where $x,y,z,A,B,C$ are real and $A+B+C$ is an integral multiple of $\pi$. Prove that if $F_1=F_2=0$, then $F_r=0$ for all positive integral $r$.
Let $P$ be a polynomial with integer coefficients such that $P(0)=0$ and
\[\gcd(P(0), P(1), P(2), \ldots ) = 1.\]
Show there are infinitely many $n$ such that
\[\gcd(P(n)- P(0), P(n+1)-P(1), P(n+2)-P(2), \ldots) = n.\]
We write in order of increasing number of 1 and all positive integers,which the sum of digits is divisible by $5$. Obtain a sequence of $1, 5, 14, 19. . .$
Prove that the n-th term of the sequence is less than $5n$.
Show that, for any fixed integer $\,n \geq 1,\,$ the sequence \[ 2, \; 2^2, \; 2^{2^2}, \; 2^{2^{2^2}}, \ldots (\mbox{mod} \; n) \] is eventually constant.
[The tower of exponents is defined by $a_1 = 2, \; a_{i+1} = 2^{a_i}$. Also $a_i \; (\mbox{mod} \; n)$ means the remainder which results from dividing $a_i$ by $n$.]
In an infinite increasing sequence of positive integers, every term from the $2002^{\text{th}}$ term divides the sum of all preceding terms. Prove that every term starting from some term is equal to the sum of all preceding terms.
Let $a_{1}=1$, $a_{2}=2$, $a_{3}$, $a_{4}$, $\cdots$ be the sequence of positive integers of the form $2^{\alpha}3^{\beta}$, where $\alpha$ and $\beta$ are nonnegative integers. Prove that every positive integer is expressible in the form \[a_{i_{1}}+a_{i_{2}}+\cdots+a_{i_{n}},\] where no summand is a multiple of any other.
Let $(x_{n}) \ n\geq 1$ be a sequence of real numbers with $x_{1}=1$ satisfying $2x_{n+1}=3x_{n}+\sqrt{5x_{n}^{2}-4}$
a) Prove that the sequence consists only of natural numbers.
b) Check if there are terms of the sequence divisible by $2011$.
An $ n \times n$ matrix whose entries come from the set $ S \equal{} \{1, 2, \ldots , 2n \minus{} 1\}$ is called a [i]silver matrix[/i] if, for each $ i \equal{} 1, 2, \ldots , n$, the $ i$-th row and the $ i$-th column together contain all elements of $ S$. Show that:
(a) there is no silver matrix for $ n \equal{} 1997$;
(b) silver matrices exist for infinitely many values of $ n$.
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 $x_1, x_2, \ldots , x_n \ (n \geq 1)$ be real numbers such that $0 \leq x_j \leq \pi, \ j = 1, 2,\ldots, n.$ Prove that if $\sum_{j=1}^n (\cos x_j +1) $ is an odd integer, then $\sum_{j=1}^n \sin x_j \geq 1.$
Let $\mathbb N = B_1\cup\cdots \cup B_q$ be a partition of the set $\mathbb N$ of all positive integers and let an integer $l \in \mathbb N$ be given. Prove that there exist a set $X \subset \mathbb N$ of cardinality $l$, an infinite set $T \subset \mathbb N$, and an integer $k$ with $1 \leq k \leq q$ such that for any $t \in T$ and any finite set $Y \subset X$, the sum $t+ \sum_{y \in Y} y$ belongs to $B_k.$
Given is a function $f:\mathbb{R}\rightarrow \mathbb{R}$ such that $|f(x+y)-f(x)-f(y)|\leq 1$.
Prove the existence of an additive function $g:\mathbb{R}\rightarrow \mathbb{R}$ (that is $g(x+y)=g(x)+g(y)$) such that $|f(x)-g(x)|\leq 1$ for any $x \in \mathbb{R}$