Found problems: 1782
1. The transformation $ n \to 2n \minus{} 1$ or $ n \to 3n \minus{} 1$, where $ n$ is a positive integer, is called the 'change' of $ n$. Numbers $ a$ and $ b$ are called 'similar', if there exists such positive integer, that can be got by finite number of 'changes' from both $ a$ and $ b$. Find all positive integers 'similar' to $ 2005$ and less than $ 2005$.
Determine all natural numbers $n$ for which there is a partition of $\{1,2,...,3n\}$ in $n$ pairwise disjoint subsets of the form $\{a,b,c\}$, such that numbers $b-a$ and $c-b$ are different numbers from the set $\{n-1, n, n+1\}$.
Let $A$ be a set of $N$ residues $\pmod{N^2}$. Prove that there exists a set $B$ of $N$ residues $\pmod{N^2}$ such that the set $A+B=\{a+b \vert a \in A, b \in B \}$ contains at least half of all the residues $\pmod{N^2}$.
Let $ n\geqslant 3$ and $ P$ a convex $ n$-gon. Show that $ P$ can be, by $ n \minus{} 3$ non-intersecting diagonals, partitioned in triangles such that the circumcircle of each triangle contains the whole area of $ P$. Under which conditions is there exactly one such triangulation?
Let two bijective and continuous functions$f,g: \mathbb{R}\to\mathbb{R}$ such that : $\left(f\circ g^{-1}\right)(x)+\left(g\circ f^{-1}\right)(x)=2x$ for any real $x$. Show that If we have a value $x_{0}\in\mathbb{R}$ such that $f(x_{0})=g(x_{0})$, then $f=g$.
Suppose $n$ is a natural number. In how many ways can we place numbers $1,2,....,n$ around a circle such that each number is a divisor of the sum of it's two adjacent numbers?
Let $a_0,b_0$ be positive integers, and define $a_{i+1}=a_i+\lfloor\sqrt{b_i}\rfloor$ and $b_{i+1}=b_i+\lfloor\sqrt{a_i}\rfloor$ for all $i\ge0$. Show that there exists a positive integer $n$ such that $a_n=b_n$.
[i]David Yang.[/i]
Prove that for any positive integer $n$, \[\left\lfloor \frac{n+1}{2}\right\rfloor+\left\lfloor \frac{n+2}{4}\right\rfloor+\left\lfloor \frac{n+4}{8}\right\rfloor+\left\lfloor \frac{n+8}{16}\right\rfloor+\cdots = n.\]
Let $ n,k$ be given positive integers satisfying $ k\le 2n \minus{} 1$. On a table tennis tournament $ 2n$ players take part, they play a total of $ k$ rounds match, each round is divided into $ n$ groups, each group two players match. The two players in different rounds can match on many occasions. Find the greatest positive integer $ m \equal{} f(n,k)$ such that no matter how the tournament processes, we always find $ m$ players each of pair of which didn't match each other.
Find all positive integers $n$ such that there exist a permutation $\sigma$ on the set $\{1,2,3, \ldots, n\}$ for which
\[\sqrt{\sigma(1)+\sqrt{\sigma(2)+\sqrt{\ldots+\sqrt{\sigma(n-1)+\sqrt{\sigma(n)}}}}}\]
is a rational number.
You are given a set of $n$ blocks, each weighing at least $1$; their total weight is $2n$. Prove that for every real number $r$ with $0 \leq r \leq 2n-2$ you can choose a subset of the blocks whose total weight is at least $r$ but at most $r + 2$.
In a mathematical competition, some competitors are friends; friendship is mutual, that is, when $A$ is a friend of $B$, then $B$ is also a friend of $A$.
We say that $n \geq 3$ different competitors $A_1, A_2, \ldots, A_n$ form a [i]weakly-friendly cycle [/i]if $A_i$ is not a friend of $A_{i+1}$ for $1 \leq i \leq n$ (where $A_{n+1} = A_1$), and there are no other pairs of non-friends among the components of the cycle.
The following property is satisfied:
"for every competitor $C$ and every weakly-friendly cycle $\mathcal{S}$ of competitors not including $C$, the set of competitors $D$ in $\mathcal{S}$ which are not friends of $C$ has at most one element"
Prove that all competitors of this mathematical competition can be arranged into three rooms, such that every two competitors in the same room are friends.
([i]Serbia[/i])
Find all increasing sequences $a_1,a_2,a_3,...$ of natural numbers such that for each $i,j\in \mathbb N$, number of the divisors of $i+j$ and $a_i+a_j$ is equal. (an increasing sequence is a sequence that if $i\le j$, then $a_i\le a_j$.)
Let $ n > 1$ be an integer. Find all sequences $ a_1, a_2, \ldots a_{n^2 \plus{} n}$ satisfying the following conditions:
\[ \text{ (a) } a_i \in \left\{0,1\right\} \text{ for all } 1 \leq i \leq n^2 \plus{} n;
\]
\[ \text{ (b) } a_{i \plus{} 1} \plus{} a_{i \plus{} 2} \plus{} \ldots \plus{} a_{i \plus{} n} < a_{i \plus{} n \plus{} 1} \plus{} a_{i \plus{} n \plus{} 2} \plus{} \ldots \plus{} a_{i \plus{} 2n} \text{ for all } 0 \leq i \leq n^2 \minus{} n.
\]
[i]Author: Dusan Dukic, Serbia[/i]
Find all $ f:\mathbb{Z}\rightarrow\mathbb{Z} $ such that
\[ f(2m+f(m)+f(m)f(n))=nf(m)+m \] $ \forall m,n\in\mathbb{Z} $
Consider a sequence $\{a_n\}_{n\geq 0}$ such that $a_{n+1}=a_n-\lfloor{\sqrt{a_n}}\rfloor\ (n\geq 0),\ a_0\geq 0$.
(1) If $a_0=24$, then find the smallest $n$ such that $a_n=0$.
(2) If $a_0=m^2\ (m=2,\ 3,\ \cdots)$, then for $j$ with $1\leq j\leq m$, express $a_{2j-1},\ a_{2j}$ in terms of $j,\ m$.
(3) Let $m\geq 2$ be integer and for integer $p$ with $1\leq p\leq m-1$, let $a\0=m^2-p$. Find $k$ such that $a_k=(m-p)^2$, then
find the smallest $n$ such that $a_n=0$.
Determine the largest odd positive integer $n$ such that every odd integer $k$ with $1<k<n$ and $\gcd(k, n)=1$ is a prime.
Consider a regular $n$-gon with $n$ odd. Given two adjacent vertices $A_{1}$ and $A_{2},$ define the sequence $(A_{k})$ of vertices of the $n$-gon as follows: For $k\ge 3,\, A_{k}$ is the vertex lying on the perpendicular bisector of $A_{k-2}A_{k-1}.$ Find all $n$ for which each vertex of the $n$-gon occurs in this sequence.
The function $f:\mathbb R^{\ge 0} \longrightarrow \mathbb R^{\ge 0}$ satisfies the following properties for all $a,b\in \mathbb R^{\ge 0}$:
[b]a)[/b] $f(a)=0 \Leftrightarrow a=0$
[b]b)[/b] $f(ab)=f(a)f(b)$
[b]c)[/b] $f(a+b)\le 2 \max \{f(a),f(b)\}$.
Prove that for all $a,b\in \mathbb R^{\ge 0}$ we have $f(a+b)\le f(a)+f(b)$.
[i]Proposed by Masoud Shafaei[/i]
Let $ a_1,a_2,\dots$ be sequence of real numbers such that $ a_1\equal{}1$, $ a_2\equal{}\dfrac{4}{3}$, and \[ a_{n\plus{}1}\equal{}\sqrt{1\plus{}a_na_{n\minus{}1}}, \quad \forall n \ge 2.\] Prove that for all $ n \ge 2$, \[ a_n^2>a_{n\minus{}1}^2\plus{}\dfrac{1}{2}\] and \[ 1\plus{}\dfrac{1}{a_1}\plus{}\dfrac{1}{a_2}\plus{}\dots\plus{}\dfrac{1}{a_n}>2a_n.\]
[i]Fajar Yuliawan, Bandung[/i]
Find all polynomials $W$ with real coefficients possessing the following property: if $x+y$ is a rational number, then $W(x)+W(y)$ is rational.
Prove that $(2+\sqrt{3})^{2n}+(2-\sqrt{3})^{2n}$ is an even integer and that $(2+\sqrt{3})^{2n}-(2-\sqrt{3})^{2n}=w\sqrt{3}$ for some positive integer $w$, for all integers $n \geq 1$.
Determine all composite positive integers $n$ for which it is possible to arrange all divisors of $n$ that are greater than 1 in a circle so that no two adjacent divisors are relatively prime.
$n$ being a given integer, find all functions $f\colon \mathbb{Z} \to \mathbb{Z}$, such that for all integers $x,y$ we have $f\left( {x + y + f(y)} \right) = f(x) + ny$.
Let $G=G(V,E)$ be a simple graph with vertex set $V$ and edge set $E$. Suppose $|V|=n$. A map $f:\,V\rightarrow\mathbb{Z}$ is called good, if $f$ satisfies the followings:
(1) $\sum_{v\in V} f(v)=|E|$;
(2) color arbitarily some vertices into red, one can always find a red vertex $v$ such that $f(v)$ is no more than the number of uncolored vertices adjacent to $v$.
Let $m(G)$ be the number of good maps. Prove that if every vertex in $G$ is adjacent to at least one another vertex, then $n\leq m(G)\leq n!$.