Found problems: 1782
Let $ \left(a_n \right)_{n \in \mathbb{N}}$ defined by $ a_1 \equal{} 1,$ and $ a_{n \plus{} 1} \equal{} a^4_n \minus{} a^3_n \plus{} 2a^2_n \plus{} 1$ for $ n \geq 1.$ Show that there is an infinite number of primes $ p$ such that none of the $ a_n$ is divisible by $ p.$
Three coins lie on integer points on the number line. A move consists of choosing and moving two coins, the first one $ 1$ unit to the right and the second one $ 1$ unit to the left.
Under which initial conditions is it possible to move all coins to one single point?
In a chess tournament $ 2n\plus{}3$ players take part. Every two play exactly one match. The schedule is such that no two matches are played at the same time, and each player, after taking part in a match, is free in at least $ n$ next (consecutive) matches. Prove that one of the players who play in the opening match will also play in the closing match.
Observe that
\[\frac{1}{1}= \frac{1}{2}+\frac{1}{2};\quad \frac{1}{2}=\frac{1}{3}+\frac{1}{6};\quad \frac{1}{3}=\frac{1}{4}+\frac{1}{12};\quad \frac{1}{4}= \frac{1}{5}+\frac{1}{20}. \]
State a general law suggested by these examples, and prove it.
Prove that for any integer $n$ greater than 1 there exist positive integers $i$ and $j$ such that
\[\frac{1}{n}= \frac{1}{i(i+1)}+\frac{1}{(i+1)(i+2)}+\frac{1}{(i+2)(i+3)}+\cdots+\frac{1}{j(j+1)}. \]
[hide="Remark."]
It seems that this is a two-part problem.
[/hide]
The natural numbers are written in sequence, in increasing order, and by this we get an infinite sequence of digits. Find the least natural $k$, for which among the first $k$ digits of this sequence, any two nonzero digits have been written a different number of times.
[i]Aleksandar Ivanov, Emil Kolev [/i]
Let $n$ be a positive integer, and let $b_{1}$, $b_{2}$, ..., $b_{n}$ be $n$ positive reals. Set $a_{1}=\frac{b_{1}}{b_{1}+b_{2}+...+b_{n}}$ and $a_{k}=\frac{b_{1}+b_{2}+...+b_{k}}{b_{1}+b_{2}+...+b_{k-1}}$ for every $k>1$. Prove the inequality
$a_{1}+a_{2}+...+a_{n}\leq\frac{1}{a_{1}}+\frac{1}{a_{2}}+...+\frac{1}{a_{n}}$.
Show that every positive rational number can be written as a quotient of products of factorials of (not necessarily distinct) primes. For example, $ \frac{10}9\equal{}\frac{2!\cdot 5!}{3!\cdot 3!\cdot 3!}.$
For a positive integer $n$ let $S(n)$ be the sum of digits in the decimal representation of $n$. Any positive integer obtained by removing several (at least one) digits from the right-hand end of the decimal representation of $n$ is called a [i]stump[/i] of $n$. Let $T(n)$ be the sum of all stumps of $n$. Prove that $n=S(n)+9T(n)$.
$a)$ Solve over the positive integers $3^x=x+2.$
$b)$ Find pairs $(x,y)\in\mathbb{N}\times\mathbb{N}$ such that $(x+3^y)$ and $(y+3^x)$ are consecutive.
Find the number of $(a_1,a_2, ... ,a_{2014})$ permutations of the $(1,2, . . . ,2014)$ such that, for all $1\leq i<j\leq2014$, $i+a_i \leq j+a_j$.
There are $n$ rooms in a sauna, each has unlimited capacity. No room may be attended by a female and a male simultaneously. Moreover, males want to share a room only with males that they don't know and females want to share a room only with females that they know. Find the biggest number $k$ such that any $k$ couples can visit the sauna at the same time, given that two males know each other if and only if their wives know each other.
For positive integer $k>1$, let $f(k)$ be the number of ways of factoring $k$ into product of positive integers greater than $1$ (The order of factors are not countered, for example $f(12)=4$, as $12$ can be factored in these $4$ ways: $12,2\cdot 6,3\cdot 4, 2\cdot 2\cdot 3$.
Prove: If $n$ is a positive integer greater than $1$, $p$ is a prime factor of $n$, then $f(n)\leq \frac{n}{p}$
Let $B$ be an integer greater than 10 such that everyone of its digits belongs to the set $\{1,3,7,9\}$. Show that $B$ has a [b]prime divisor[/b] greater than or equal to 11.
Let $P$ be a nonempty collection of subsets of $\{1,\dots,n\}$ such that:
(i) if $S,S'\in P,$ then $S\cup S'\in P$ and $S\cap S'\in P,$ and
(ii) if $S\in P$ and $S\ne\emptyset,$ then there is a subset $T\subset S$ such that $T\in P$ and $T$ contains exactly one fewer element than $S.$
Suppose that $f:P\to\mathbb{R}$ is a function such that $f(\emptyset)=0$ and \[f(S\cup S')= f(S)+f(S')-f(S\cap S')\text{ for all }S,S'\in P.\] Must there exist real numbers $f_1,\dots,f_n$ such that \[f(S)=\sum_{i\in S}f_i\] for every $S\in P?$
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.
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$.
Find all pairs $(x, y)$ of positive rational numbers such that $x^{y}=y^{x}$.
Given an integer $n\ge 2$. Prove that there only exist a finite number of n-tuples of positive integers $(a_1,a_2,\ldots,a_n)$ which simultaneously satisfy the following three conditions:
[list]
[*] $a_1>a_2>\ldots>a_n$;
[*] $\gcd (a_1,a_2,\ldots,a_n)=1$;
[*] $a_1=\sum_{i=1}^{n}\gcd (a_i,a_{i+1})$,where $a_{n+1}=a_1$.[/list]
A [i]word[/i] is defined as any finite string of letters. A word is a [i]palindrome[/i] if it reads the same backwards and forwards. Let a sequence of words $W_0, W_1, W_2,...$ be defined as follows: $W_0 = a, W_1 = b$, and for $n \ge 2$, $W_n$ is the word formed by writing $W_{n-2}$ followed by $W_{n-1}$. Prove that for any $n \ge 1$, the word formed by writing $W_1, W_2, W_3,..., W_n$ in succession is a palindrome.
Define the function $f: \mathbb N \cup \{0\} \to \mathbb{Q}$ as follows: $f(0) = 0$ and \[ f(3n+k) = -\frac{3f(n)}{2} + k , \] for $k = 0, 1, 2$. Show that $f$ is one-to-one and determine the range of $f$.
Let $\{a_k\}^{2011}_{k=1}$ be the sequence of real numbers defined by $$a_1=0.201, \quad a_2=(0.2011)^{a_1},\quad a_3=(0.20101)^{a_2},\quad a_4=(0.201011)^{a_3},$$ and more generally \[ a_k = \begin{cases}(0.\underbrace{20101\cdots0101}_{k+2 \ \text{digits}})^{a_{k-1}}, &\text {if } k \text { is odd,} \\ (0.\underbrace{20101\cdots01011}_{k+2 \ \text{digits}})^{a_{k-1}}, &\text {if } k \text { is even.}\end{cases} \]
Rearranging the numbers in the sequence $\{a_k\}^{2011}_{k=1}$ in decreasing order produces a new sequence $\{b_k\}^{2011}_{k=1}$. What is the sum of all the integers $k$, $1\le k \le 2011$, such that $a_k = b_k$?
$ \textbf{(A)}\ 671\qquad\textbf{(B)}\ 1006\qquad\textbf{(C)}\ 1341\qquad\textbf{(D)}\ 2011\qquad\textbf{(E)}\ 2012 $
For a finite non empty set of primes $P$, let $m(P)$ denote the largest possible number of consecutive positive integers, each of which is divisible by at least one member of $P$.
(i) Show that $|P|\le m(P)$, with equality if and only if $\min(P)>|P|$.
(ii) Show that $m(P)<(|P|+1)(2^{|P|}-1)$.
(The number $|P|$ is the size of set $P$)
[i]Dan Schwarz, Romania[/i]
Find all polynomials $P$ with integer coefficients which satisfy the property that, for any relatively prime integers $a$ and $b$, the sequence $\{P (an + b) \}_{n \ge 1}$ contains an infinite number of terms, any two of which are relatively prime.
Farhad has made a machine. When the machine starts, it prints some special numbers. The property of this machine is that for every positive integer $n$, it prints exactly one of the numbers $n,2n,3n$. We know that the machine prints $2$. Prove that it doesn't print $13824$.
Consider a tree with $n$ vertices, labeled with $1,\ldots,n$ in a way that no label is used twice. We change the labeling in the following way - each time we pick an edge that hasn't been picked before and swap the labels of its endpoints. After performing this action $n-1$ times, we get another tree with its labeling a permutation of the first graph's labeling.
Prove that this permutation contains exactly one cycle.