Found problems: 1782
In a word formed with the letters $a,b$ we can change some blocks: $aba$ in $b$ and back, $bba$ in $a$ and backwards. If the initial word is $aaa\ldots ab$ where $a$ appears 2003 times can we reach the word $baaa\ldots a$, where $a$ appears 2003 times.
A collection of 8 cubes consists of one cube with edge-length $k$ for each integer $k,\thinspace 1 \le k \le 8.$ A tower is to be built using all 8 cubes according to the rules:
$\bullet$ Any cube may be the bottom cube in the tower.
$\bullet$ The cube immediately on top of a cube with edge-length $k$ must have edge-length at most $k+2.$
Let $T$ be the number of different towers than can be constructed. What is the remainder when $T$ is divided by 1000?
The sequence $ \{a_n\}$ is defined by
\[ a_0 \equal{} 1,a_1 \equal{} 1, \text{ and } a_n \equal{} a_{n \minus{} 1} \plus{} \frac {a_{n \minus{} 1}^2}{a_{n \minus{} 2}}\text{ for }n\ge2.
\]The sequence $ \{b_n\}$ is defined by
\[ b_0 \equal{} 1,b_1 \equal{} 3, \text{ and } b_n \equal{} b_{n \minus{} 1} \plus{} \frac {b_{n \minus{} 1}^2}{b_{n \minus{} 2}}\text{ for }n\ge2.
\]Find $ \frac {b_{32}}{a_{32}}$.
Function ${{f\colon \mathbb[0, +\infty)}\to\mathbb[0, +\infty)}$ satisfies the condition $f(x)+f(y){\ge}2f(x+y)$ for all $x,y{\ge}0$.
Prove that $f(x)+f(y)+f(z){\ge}3f(x+y+z)$ for all $x,y,z{\ge}0$.
Mathematical induction?
__________________________________
Azerbaijan Land of the Fire :lol:
Let $f:\mathbb{N}\to\mathbb{N}$ be a function satisfying the following conditions:
(a) $f(1)=1$.
(b) $f(a)\leq f(b)$ whenever $a$ and $b$ are positive integers with $a\leq b$.
(c) $f(2a)=f(a)+1$ for all positive integers $a$.
How many possible values can the $2014$-tuple $(f(1),f(2),\ldots,f(2014))$ take?
In any cell of an $n \times n$ table a number is written such that all the rows are distinct. Prove that we can remove a column such that the rows in the new table are still distinct.
Find the maximal number of points, such that there exist a configuration of $2023$ lines on the plane, with each lines pass at least $2$ points.
Let $n \ge 2$ be an integer, and let $A_n$ be the set \[A_n = \{2^n - 2^k\mid k \in \mathbb{Z},\, 0 \le k < n\}.\] Determine the largest positive integer that cannot be written as the sum of one or more (not necessarily distinct) elements of $A_n$ .
[i]Proposed by Serbia[/i]
Find all functions $f: \mathbb{N}\to \mathbb{N}$ such that for all $m,n\in \mathbb{N}$: \[f(f(m)+f(n))=m+n.\]
The sequences $(a_n),(b_n)$ are defined by $a_0=1,b_0=4$ and for $n\ge 0$
\[a_{n+1}=a_n^{2001}+b_n,\ \ b_{n+1}=b_n^{2001}+a_n\]
Show that $2003$ is not divisor of any of the terms in these two sequences.
If $m\geq 2$ show that there does not exist positive integers $x_1, x_2, ..., x_m,$ such that \[x_1< x_2<...< x_m \ \ \text{and} \ \ \frac{1}{x_1^3}+\frac{1}{x_2^3}+...+\frac{1}{x_m^3}=1.\]
Determine the least integer $k$ for which the following story could hold true:
In a chess tournament with $24$ players, every pair of players plays at least $2$ and at most $k$ games against each other. At the end of the tournament, it turns out that every player has played a different number of games.
Let $S$ be a finite set. $f$ is a function defined on the subset-group $2^S$ of set $S$. $f$ is called $\textsl{monotonic decreasing}$ if when $X \subseteq Y\subseteq S$, then $f(X) \geq f(Y)$ holds. Prove that: $f(X \cup Y)+f(X \cap Y ) \leq f(X)+ f(Y)$ for $X, Y \subseteq S$ if and only if $g(X)=f(X \cup \{ a \}) - f(X)$ is a $\textsl{monotonic decreasing}$ funnction on the subset-group $2^{S \setminus \{a\}}$ of set $S \setminus \{a\}$ for any $a \in S$.
Given a sequence $<a_1,a_2,a_3,\cdots >$ of real numbers, we define $m_n$ as the arithmetic mean of the numbers $a_1$ to $a_n$ for $n\in\mathbb{Z}^+$.
If there is a real number $C$, such that
\[ (i-j)m_k+(j-k)m_i+(k-i)m_j=C\]
for every triple $(i,j,k)$ of distinct positive integers, prove that the sequence $<a_1,a_2,a_3,\cdots >$ is an arithmetic progression.
Assume that the set of all positive integers is decomposed into $r$ disjoint subsets $A_{1}, A_{2}, \cdots, A_{r}$ $A_{1} \cup A_{2} \cup \cdots \cup A_{r}= \mathbb{N}$. Prove that one of them, say $A_{i}$, has the following property: There exist a positive integer $m$ such that for any $k$ one can find numbers $a_{1}, \cdots, a_{k}$ in $A_{i}$ with $0 < a_{j+1}-a_{j} \le m \; (1\le j \le k-1)$.
Let $a_0,a_1,a_2,\dots$ be a sequence of nonnegative integers such that $a_2=5$, $a_{2014}=2015$, and $a_n=a_{a_{n-1}}$ for all positive integers $n$. Find all possible values of $a_{2015}$.
Let $n$ be a positive integer. A $corner$ is a finite set $S$ of ordered $n$-tuples of positive integers such that if $a_1, a_2, \ldots, a_n, b_1, b_2, \ldots, b_n$ are positive integers with $a_k \geq b_k$ for $k = 1, 2, \ldots, n$ and $(a_1, a_2, \ldots, a_n) \in S$, then $(b_1, b_2, \ldots, b_n) \in S$. Prove that among any infinite collection of corners, there exist two corners, one of which is a subset of the other one.
Each rational point on a real line is assigned an integer. Prove that there is a segment such that the sum of the numbers at its endpoints does not exceed twice the number at its midpoint.
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 functions $f$ from positive integers to themselves such that:
1)$f(mn)=f(m)f(n)$ for all positive integers $m, n$
2)$\{1, 2, ..., n\}=\{f(1), f(2), ... f(n)\}$ is true for infinitely many positive integers $n$.
We are given a lattice and two pebbles $A$ and $B$ that are placed at two lattice points. At each step we are allowed to relocate one of the pebbles to another lattice point with the condition that the distance between pebbles is preserved. Is it possible after finite number of steps to switch positions of the pebbles?
Find all sequences of positive integers $\{a_n\}_{n=1}^{\infty}$, for which $a_4=4$ and
\[\frac{1}{a_1a_2a_3}+\frac{1}{a_2a_3a_4}+\cdots+\frac{1}{a_na_{n+1}a_{n+2}}=\frac{(n+3)a_n}{4a_{n+1}a_{n+2}}\]
for all natural $n \geq 2$.
[i]Peter Boyvalenkov[/i]
Find all integers $n$, $n \ge 1$, such that $n \cdot 2^{n+1}+1$ is a perfect square.
Let $n$ be an even positive integer, and let $G$ be an $n$-vertex graph with exactly $\tfrac{n^2}{4}$ edges, where there are no loops or multiple edges (each unordered pair of distinct vertices is joined by either 0 or 1 edge). An unordered pair of distinct vertices $\{x,y\}$ is said to be [i]amicable[/i] if they have a common neighbor (there is a vertex $z$ such that $xz$ and $yz$ are both edges). Prove that $G$ has at least $2\textstyle\binom{n/2}{2}$ pairs of vertices which are amicable.
[i]Zoltán Füredi (suggested by Po-Shen Loh)[/i]
Find all real polynomials $ f(x)$ satisfying $ f(x^2)\equal{}f(x)f(x\minus{}1)$ for all $ x$.