Found problems: 1782
Determine all $(m,n) \in \mathbb{Z}^+ \times \mathbb{Z}^+$ which satisfy $3^m-7^n=2.$
Construct a set $S$ of polynomials inductively by the rules:
(i) $x\in S$;
(ii) if $f(x)\in S$, then $xf(x)\in S$ and $x+(1-x)f(x)\in S$.
Prove that there are no two distinct polynomials in $S$ whose graphs intersect within the region $\{0 < x < 1\}$.
Some books are placed on each other. Someone first, reverses the upper book. Then he reverses the $2$ upper books. Then he reverses the $3$ upper books and continues like this. After he reversed all the books, he starts this operation from the first. Prove that after finite number of movements, the books become exactly like their initial configuration.
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}$.
Let $ S$ be the set of all positive integers whose all digits are $ 1$ or $ 2$. Denote $ T_{n}$ as the set of all integers which is divisible by $ n$, then find all positive integers $ n$ such that $ S\cap T_{n}$ is an infinite set.
Let $(a_n)_{n=1}^{\infty}$ be a real sequence such that $a_1=1, a_3=4$ and for every $n\geq 2$, $a_{n+1}+a_{n-1}=2a_n+1$. What is $a_{2011}$?
$\textbf{(A)}\ 2^{2010} \qquad\textbf{(B)}\ 2021056 \qquad\textbf{(C)}\ 1010528 \qquad\textbf{(D)}\ 3016 \qquad\textbf{(E)}\ 2011$
Let $x_1,x_2,\ldots,x_n$ be real numbers. Prove that
\[ \sum_{i,j=1}^n |x_i+x_j|\geq n\sum_{i=1}^n |x_i| \]
Let $ x,y$ be real numbers such that the numbers $ x\plus{}y, x^2\plus{}y^2, x^3\plus{}y^3$ and $ x^4\plus{}y^4$ are integers. Prove that for all positive integers $ n$, the number $ x^n \plus{} y^n$ is an integer.
Let $S$ be a set of 1980 points in the plane such that the distance between every pair of them is at least 1. Prove that $S$ has a subset of 220 points such that the distance between every pair of them is at least $\sqrt{3}.$
[b]a)[/b] Let be a nonnegative integer $ n. $ Solve in the complex numbers the equation $ z^n\cdot\Re z=\bar z^n\cdot\Im z. $
[b]b)[/b] Let be two complex numbers $ v,d $ satisfying $ v+1/v=d/\bar d +\bar d/d. $ Show that
$$ v^n+1/v^n=d^n/\bar d^n + \bar d^n/d^n, $$
for any nonnegative integer $ n. $
Find all functions $f: \mathbb{Z}^+\to \mathbb{R}$, which satisfies $f(n+1)\geq f(n)$ for all $n\geq 1$ and $f(mn)=f(m)f(n)$ for all $(m,n)=1$.
Let $n$ be a positive integer number and let $a_1, a_2, \ldots, a_n$ be $n$ positive real numbers. Prove that $f : [0, \infty) \rightarrow \mathbb{R}$, defined by
\[f(x) = \dfrac{a_1 + x}{a_2 + x} + \dfrac{a_2 + x}{a_3 + x} + \cdots + \dfrac{a_{n-1} + x}{a_n + x} + \dfrac{a_n + x}{a_1 + x}, \]
is a decreasing function.
[i]Dan Marinescu et al.[/i]
Show that there is a unique positive integer which consists of the digits $2$ and $5$, having $2005$ digits and divisible by $2^{2005}$.
Let $ \{ a_1 , a_2 , \cdots, a_{10} \} = \{ 1, 2, \cdots , 10 \} $ . Find the maximum value of
\[ \sum_{n=1}^{10}(na_n ^2 - n^2 a_n ) \]
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$?
Find all sequences $0\le a_0\le a_1\le a_2\le \ldots$ of real numbers such that
\[a_{m^2+n^2}=a_m^2+a_n^2 \]
for all integers $m,n\ge 0$.
Let $ p \ge 3$ be a prime number. The sequence $ \{a_{n}\}_{n \ge 0}$ is defined by $ a_{n}=n$ for all $ 0 \le n \le p-1$, and $ a_{n}=a_{n-1}+a_{n-p}$ for all $ n \ge p$. Compute $ a_{p^{3}}\; \pmod{p}$.
Let $c \ge 1$ be a real number. Let $G$ be an Abelian group and let $A \subset G$ be a finite set satisfying $|A+A| \le c|A|$, where $X+Y:= \{x+y| x \in X, y \in Y\}$ and $|Z|$ denotes the cardinality of $Z$. Prove that
\[|\underbrace{A+A+\dots+A}_k| \le c^k |A|\]
for every positive integer $k$.
[i]Proposed by Przemyslaw Mazur, Jagiellonian University.[/i]
Let $\phi(n)$ be the number of positive integers less than $n$ that are relatively prime to $n$, where $n$ is a positive integer. Find all pairs of positive integers $(m,n)$ such that \[2^n + (n-\phi(n)-1)! = n^m+1.\]
Ana plays a game on a $100\times 100$ chessboard. Initially, there is a white pawn on each square of the bottom row and a black pawn on each square of the top row, and no other pawns anywhere else.\\
Each white pawn moves toward the top row and each black pawn moves toward the bottom row in one of the following ways:
[list]
[*] it moves to the square directly in front of it if there is no other pawn on it;
[*] it [b]captures[/b] a pawn on one of the diagonally adjacent squares in the row immediately in front of it if there is a pawn of the opposite color on it.
[/list]
(We say a pawn $P$ [b]captures[/b] a pawn $Q$ of the opposite color if we remove $Q$ from the board and move $P$ to the square that $Q$ was previously on.)\\
\\
Ana can move any pawn (not necessarily alternating between black and white) according to those rules. What is the smallest number of pawns that can remain on the board after no more moves can be made?
[i]Proposed by José Alejandro Reyes González, Mexico[/i]
Let $A$ be the $n\times n$ matrix whose entry in the $i$-th row and $j$-th column is \[\frac1{\min(i,j)}\] for $1\le i,j\le n.$ Compute $\det(A).$
The jury of an Olympiad has $30$ members in the beginning. Each member of the jury thinks that some of his colleagues are competent, while all the others are not, and these opinions do not change. At the beginning of every session a voting takes place, and those members who are not competent in the opinion of more than one half of the voters are excluded from the jury for the rest of the olympiad. Prove that after at most $15$ sessions there will be no more exclusions. (Note that nobody votes about his own competence.)
Let $n$ and $k$ be two natural numbers such that $k$ is even and for each prime $p$ if $p|n$ then $p-1|k$. let $\{a_1,....,a_{\phi(n)}\}$ be all the numbers coprime to $n$. What's the remainder of the number $a_1^k+.....+a_{\phi(n)}^k$ when it's divided by $n$?
[i]proposed by Yahya Motevassel[/i]
Let $n$ be a positive integer. Does $n^2$ has more positive divisors of the form $4k+1$ or of the form $4k-1$?
Let $S = \{1,2,\dots,2014\}$. For each non-empty subset $T \subseteq S$, one of its members is chosen as its representative. Find the number of ways to assign representatives to all non-empty subsets of $S$ so that if a subset $D \subseteq S$ is a disjoint union of non-empty subsets $A, B, C \subseteq S$, then the representative of $D$ is also the representative of one of $A$, $B$, $C$.
[i]Warut Suksompong, Thailand[/i]