Found problems: 1782
Let $n$ be a positive integer and $\{A,B,C\}$ a partition of $\{1,2,\ldots,3n\}$ such that $|A|=|B|=|C|=n$. Prove that there exist $x \in A$, $y \in B$, $z \in C$ such that one of $x,y,z$ is the sum of the other two.
The sequence $\{x_{n}\}_{n \ge 1}$ is defined by \[x_{1}=x_{2}=1, \; x_{n+2}= 14x_{n+1}-x_{n}-4.\] Prove that $x_{n}$ is always a perfect square.
3. Plane is divided with horizontal and vertical lines into unit squares. Into each square we write a positive integer so that each positive integer appears exactly once. Determine whether it is possible to write numbers in such a way, that each written number is a divisor of a sum of its four neighbours.
Find the number of squares in the sequence given by $ a_0\equal{}91$ and $ a_{n\plus{}1}\equal{}10a_n\plus{}(\minus{}1)^n$ for $ n \ge 0.$
Let $n \ge 2$ be an integer. There are $n$ houses in a town. All distances between pairs of houses are different. Every house sends a visitor to the house closest to it. Find all possible values of $n$ (with full justification) for which we can design a town with $n$ houses where every house is visited.
Find all positive real numbers $r<1$ such that there exists a set $\mathcal{S}$ with the given properties:
i) For any real number $t$, exactly one of $t, t+r$ and $t+1$ belongs to $\mathcal{S}$;
ii) For any real number $t$, exactly one of $t, t-r$ and $t-1$ belongs to $\mathcal{S}$.
The sequence $ (a_n)$ is defined by: $ a_0\equal{}a_1\equal{}1$ and $ a_{n\plus{}1}\equal{}14a_n\minus{}a_{n\minus{}1}$ for all $ n\ge 1$.
Prove that $ 2a_n\minus{}1$ is a perfect square for any $ n\ge 0$.
In the plane are given a circle with center $ O$ and radius $ r$ and a point $ A$ outside the circle. For any point $ M$ on the circle, let $ N$ be the diametrically opposite point. Find the locus of the circumcenter of triangle $ AMN$ when $ M$ describes the circle.
The terms of the sequence $ (a_i)$ defined by $ a_{n \plus{} 2} \equal{} \frac {a_n \plus{} 2009} {1 \plus{} a_{n \plus{} 1}}$ for $ n \ge 1$ are positive integers. Find the minimum possible value of $ a_1 \plus{} a_2$.
Let $a_0$ be an irrational number such that $0 < a_0 < \frac 12$ . Defi ne $a_n = \min \{2a_{n-1},1 - 2a_{n-1}\}$ for $n \geq 1$.
[list][b](a)[/b] Prove that $a_n < \frac{3}{16}$ for some $n$.
[b](b)[/b] Can it happen that $a_n > \frac{7}{40}$ for all $n$?[/list]
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)$.
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$.
The sequence $a_i$ is defined as $a_1 = 2, a_2 = 3$, and
$a_{n+1} = 2a_{n-1}$ or $a_{n+1} = 3a_n - 2a_{n-1}$ for all integers $n \ge 2$.
Prove that no term in $a_i$ is in the range $[1612, 2012]$.
Determine all pairs $(a, b)$ of real numbers such that $a\lfloor bn\rfloor =b\lfloor an\rfloor$ for all positive integer $n$.
Determine all positive integers $n$ for which there exists an integer $m$ such that $2^{n}-1$ divides $m^{2}+9$.
Consider the set $\mathcal{F}$ of functions $f:\mathbb{N}\to\mathbb{N}$ (where $\mathbb{N}$ is the set of non-negative integers) having the property that
\[f(a^2-b^2)=f(a)^2-f(b)^2,\ \text{for all }a,b\in\mathbb{N},\ a\ge b.\]
a) Determine the set $\{f(1)\mid f\in\mathcal{F}\}$.
b) Prove that $\mathcal{F}$ has exactly two elements.
[i]Nelu Chichirim[/i]
Find all positive integers $(x, n)$ such that $x^{n}+2^{n}+1$ divides $x^{n+1}+2^{n+1}+1$.
We call a subset $B$ of natural numbers [i]loyal[/i] if there exists natural numbers $i\le j$ such that $B=\{i,i+1,\ldots,j\}$. Let $Q$ be the set of all [i]loyal[/i] sets. For every subset $A=\{a_1<a_2<\ldots<a_k\}$ of $\{1,2,\ldots,n\}$ we set
\[f(A)=\max_{1\le i \le k-1}{a_{i+1}-a_i}\qquad\text{and}\qquad g(A)=\max_{B\subseteq A, B\in Q} |B|.\] Furthermore, we define \[F(n)=\sum_{A\subseteq \{1,2,\ldots,n\}} f(A)\qquad\text{and}\qquad G(n)=\sum_{A\subseteq \{1,2,\ldots,n\}} g(A).\] Prove that there exists $m\in \mathbb N$ such that for each natural number $n>m$ we have $F(n)>G(n)$. (By $|A|$ we mean the number of elements of $A$, and if $|A|\le 1$, we define $f(A)$ to be zero).
[i]Proposed by Javad Abedi[/i]
Let $\mathbb{N}$ denote the set of positive integers. Find all functions $f: \mathbb{N} \to \mathbb{N}$ such that \[ f(m+n)f(m-n) = f(m^2) \] for $m,n \in \mathbb{N}$.
Let be a function $ f:\mathbb{R}\longrightarrow\mathbb{R} $ satisfying the conditions:
$$ \left\{\begin{matrix} f(x+y) &\le & f(x)+f(y) \\ f(tx+(1-t)y) &\le & t(f(x)) +(1-t)f(y) \end{matrix}\right. , $$
for all real numbers $ x,y,t $ with $ t\in [0,1] . $
Prove that:
[b]a)[/b] $ f(b)+f(c)\le f(a)+f(d) , $ for any real numbers $ a,b,c,d $ such that $ a\le b\le c\le d $ and $ d-c=b-a. $
[b]b)[/b] for any natural number $ n\ge 3 $ and any $ n $ real numbers $ x_1,x_2,\ldots ,x_n, $ the following inequality holds.
$$ f\left( \sum_{1\le i\le n} x_i \right) +(n-2)\sum_{1\le i\le n} f\left( x_i \right)\ge \sum_{1\le i<j\le n} f\left( x_i+x_j \right) $$
Given an alfabet of $n$ letters. A sequence of letters such that between any 2 identical letters there are no 2 identical letters is called a [i]word[/i].
a) Find the maximal possible length of a [i]word[/i].
b) Find the number of the [i]words[/i] of maximal length.
Two people A and B play a game in the $m \times n$ grid ($m,n \in \mathbb{N^*}$). Each person respectively (A plays first) draw a segment between two point of the grid such that this segment doesn't contain any point (except the 2 ends) and also the segment (except the 2 ends) doesn't intersect with any other segments. The last person who can't draw is the loser. Which one (of A and B) have the winning tactics?
If $a,b,c$ are nonnegative real numbers, then
\[{ 3(a^2+b^2+c^2) \geq (a+b+c)(\sqrt{ab}+\sqrt{bc}+\sqrt{ca})+(a-b)^2+(b-c)^2+(c-a)^2 \geq (a+b+c)^2.}\]
Evaluate :
\[ \sqrt[8]{2207-\frac{1}{2207-\frac{1}{2207-\cdots}}} \]
Express your expression in the form $\frac{a+b\sqrt{c}}{d}$ where $a,b,c,d\in \Bbb{Z}$.
A pair of words consisting only of the letters $a$ and $b$ (with repetitions) is [i]good[/i] if it is $(a,b)$ or of one of the forms $(uv, v)$, $(u, uv)$, where $(u,v)$ is a good pair. Prove that if $(\alpha, \beta)$ is a good pair, then there exists a palindrome $\gamma$ such that $\alpha\beta = a\gamma b$.