Found problems: 1782
Let $n$ be a positive integer, and $x$ be a positive real number. Prove that $$\sum_{k=1}^{n} \left( x \left[\frac{k}{x}\right] - (x+1)\left[\frac{k}{x+1}\right]\right) \leq n,$$ where $[x]$ denotes the largest integer not exceeding $x$.
Prove that for every positive integer $n$ there exists an $n$-digit number divisible by $5^n$ all of whose digits are odd.
A pile of cards, numbered with $1$, $2$, ..., $n$, is being shuffled. Afterwards, the following operation is repeatedly performed: If the uppermost card of the pile has the number $k$, then we reverse the order of the $k$ uppermost cards.
Prove that, after finitely many executions of this operation, the card with the number $1$ will become the uppermost card of the pile.
Find all functions $f : \mathbb N \to \mathbb N$ such that:
i) $f^{2000}(m)=f(m)$ for all $m \in \mathbb N$,
ii) $f(mn)=\dfrac{f(m)f(n)}{f(\gcd(m,n))}$, for all $m,n\in \mathbb N$, and
iii) $f(m)=1$ if and only if $m=1$.
Let $f(x) = x-\tfrac1{x}$, and defi ne $f^1(x) = f(x)$ and $f^n(x) = f(f^{n-1}(x))$ for $n\ge2$. For each $n$, there is a minimal degree $d_n$ such that there exist polynomials $p$ and $q$ with $f^n(x) = \tfrac{p(x)}{q(x)}$ and the degree of $q$ is equal to $d_n$. Find $d_n$.
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).\]
Let $ k$ be an integer, $ k \geq 2$, and let $ p_{1},\ p_{2},\ \ldots,\ p_{k}$ be positive reals with $ p_{1} \plus{} p_{2} \plus{} \ldots \plus{} p_{k} \equal{} 1$. Suppose we have a collection $ \left(A_{1,1},\ A_{1,2},\ \ldots,\ A_{1,k}\right)$, $ \left(A_{2,1},\ A_{2,2},\ \ldots,\ A_{2,k}\right)$, $ \ldots$, $ \left(A_{m,1},\ A_{1,2},\ \ldots,\ A_{m,k}\right)$ of $ k$-tuples of finite sets satisfying the following two properties:
(i) for every $ i$ and every $ j \neq j^{\prime}$, $ A_{i,j}\cap A_{i,j^{\prime}} \equal{} \emptyset$, and
(ii) for every $ i\neq i^{\prime}$ there exist $ j\neq j^{\prime}$ for which $ A_{i,j} \cap A_{i^{\prime},j^{\prime}}\neq\emptyset$. Prove that
\[ \sum_{b \equal{} 1}^{m}{\prod_{a \equal{} 1}^{k}{p_{a}^{|A_{b,a}|}}} \leq 1.
\]
Suppose a $m \times n$ table. We write an integer in each cell of the table. In each move, we chose a column, a row, or a diagonal (diagonal is the set of cells which the difference between their row number and their column number is constant) and add either $+1$ or $-1$ to all of its cells. Prove that if for all arbitrary $3 \times 3$ table we can change all numbers to zero, then we can change all numbers of $m \times n$ table to zero.
([i]Hint[/i]: First of all think about it how we can change number of $ 3 \times 3$ table to zero.)
Find the least positive integer $n$ such that \[ \frac 1{\sin 45^\circ\sin 46^\circ}+\frac 1{\sin 47^\circ\sin 48^\circ}+\cdots+\frac 1{\sin 133^\circ\sin 134^\circ}=\frac 1{\sin n^\circ}. \]
Find the number of strictly increasing sequences of nonnegative integers with the following properties:
• The first term is $0$ and the last term is $12$. In particular, the sequence has at least two terms.
• Among any two consecutive terms, exactly one of them is even.
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$
Let $\{x_{n}\}_{n\ge0}$ and $\{y_{n}\}_{n\ge0}$ be two sequences defined recursively as follows \[x_{0}=1, \; x_{1}=4, \; x_{n+2}=3 x_{n+1}-x_{n},\] \[y_{0}=1, \; y_{1}=2, \; y_{n+2}=3 y_{n+1}-y_{n}.\] [list=a][*] Prove that ${x_{n}}^{2}-5{y_{n}}^{2}+4=0$ for all non-negative integers. [*] Suppose that $a$, $b$ are two positive integers such that $a^{2}-5b^{2}+4=0$. Prove that there exists a non-negative integer $k$ such that $a=x_{k}$ and $b=y_{k}$.[/list]
Let $n$ be a positive integer and let $a_k = \dfrac{1}{\binom{n}{k}}, b_k = 2^{k-n},\ (k=1..n)$.
Show that $\sum_{k=1}^n \dfrac{a_k-b_k}{k} = 0$.
$F_n$ is the Fibonacci sequence $F_0 = F_1 = 1$, $F_{n+2} = F_{n+1} + F_n$. Find all pairs $m > k \geq 0$ such that the sequence $x_0, x_1, x_2, ...$ defined by $x_0 = \frac{F_k}{F_m}$ and $x_{n+1} = \frac{2x_n - 1}{1 - x_n}$ for $x_n \not = 1$, or $1$ if $x_n = 1$, contains the number $1$
For a set $S$, let $|S|$ denote the number of elements in $S$. Let $A$ be a set of positive integers with $|A| = 2001$. Prove that there exists a set $B$ such that
(i) $B \subseteq A$;
(ii) $|B| \ge 668$;
(iii) for any $u, v \in B$ (not necessarily distinct), $u+v \not\in B$.
Prove that for every positive integer $ n$,
$ n^n \le (n!)^2 \le \left( \frac{(n\plus{}1)(n\plus{}2)}{6} \right) ^n.$
Let $A$ be a set of positive integers such that
a) if $a\in A$, the all the positive divisors of $a$ are also in $A$;
b) if $a,b\in A$, with $1<a<b$, then $1+ab \in A$.
Prove that if $A$ has at least 3 elements, then $A$ is the set of all positive integers.
Let $p$ be an odd prime. Prove that for every integer $k$, there exist integers $a, b$ such that $p|a^2 + b^2 - k$.
Find the number of integers $ c$ such that $ \minus{}2007 \leq c \leq 2007$ and there exists an integer $ x$ such that $ x^2 \plus{} c$ is a multiple of $ 2^{2007}$.
Determine if there are positive integers $a, b$ such that all terms of the sequence defined by
\[ x_{1}= 2010,x_{2}= 2011\\ x_{n+2}= x_{n}+ x_{n+1}+a\sqrt{x_{n}x_{n+1}+b}\quad (n\ge 1) \] are integers.
Let $f$ and $g$ be two continuous, distinct functions from $[0,1] \rightarrow (0,+\infty)$ such that
$\int_{0}^{1}f(x)dx = \int_{0}^{1}g(x)dx$
Let
$y_n=\int_{0}^{1}{\frac{f^{n+1}(x)}{g^{n}(x)}dx}$, for $n\geq 0$, natural.
Prove that $(y_n)$ is an increasing and divergent sequence.
Let $n$ be a positive integer and let $a_1 \le a_2 \le \dots \le a_n$ and $b_1 \le b_2 \le \dots \le b_n$ be two nondecreasing sequences of real numbers such that
\[ a_1 + \dots + a_i \le b_1 + \dots + b_i \text{ for every } i = 1, \dots, n \]
and
\[ a_1 + \dots + a_n = b_1 + \dots + b_n. \]
Suppose that for every real number $m$, the number of pairs $(i,j)$ with $a_i-a_j=m$ equals the numbers of pairs $(k,\ell)$ with $b_k-b_\ell = m$. Prove that $a_i = b_i$ for $i=1,\dots,n$.
$5000$ movie fans gathered at a convention. Each participant had watched at least one movie. The participants should be split into discussion groups of two kinds. In each group of the fi rst kind, the members would discuss a movie they all watched. In each group of the second kind, each member would tell about the movie that no one else in this group had watched. Prove that the chairman can always split the participants into exactly 100 groups. (A group consisting of one person is allowed; in this case this person submits a report).
The sequence $(a_n)_{n>=1}$ satisfies that : $a_1=a_2=1$ $a_n=7a_{n-1}-a_{n-2}$ ($n>=3$) , prove that : for all positive integer n , number $a_n+2+a_{n+1}$ is a perfect square .
Let $ c$ be a positive integer. The sequence $ a_1,a_2,\ldots$ is defined as follows $ a_1\equal{}c$, $ a_{n\plus{}1}\equal{}a_n^2\plus{}a_n\plus{}c^3$ for all positive integers $ n$. Find all $ c$ so that there are integers $ k\ge1$ and $ m\ge2$ so that $ a_k^2\plus{}c^3$ is the $ m$th power of some integer.