Found problems: 1782
Let $f: \mathbb{N} \rightarrow \mathbb{N}$ be a function, and let $f^m$ be $f$ applied $m$ times. Suppose that for every $n \in \mathbb{N}$ there exists a $k \in \mathbb{N}$ such that $f^{2k}(n)=n+k$, and let $k_n$ be the smallest such $k$. Prove that the sequence $k_1,k_2,\ldots $ is unbounded.
[i]Proposed by Palmer Mebane, United States[/i]
The vertices of a connected graph cannot be coloured with less than $n+1$ colours (so that adjacent vertices have different colours).
Prove that $\dfrac{n(n-1)}{2}$ edges can be removed from the graph so that it remains connected.
[i]V. Dolnikov[/i]
[b]EDIT.[/b] It is confirmed by the official solution that the graph is tacitly assumed to be [b]finite[/b].
$N$ coins are placed on a table, $N - 1$ are genuine and have the same weight, and one is fake, with a different weight. Using a two pan balance, the goal is to determine with certainty the fake coin, and whether it is lighter or heavier than a genuine coin. Whenever one can deduce that one or more coins are genuine, they will be inmediately discarded and may no longer be used in subsequent weighings. Determine all $N$ for which the goal is achievable. (There are no limits regarding how many times one may use the balance).
Note: the only difference between genuine and fake coins is their weight; otherwise, they are identical.
a) For each $n \ge 2$, find the maximum constant $c_{n}$ such that
$\frac 1{a_{1}+1}+\frac 1{a_{2}+1}+\ldots+\frac 1{a_{n}+1}\ge c_{n}$
for all positive reals $a_{1},a_{2},\ldots,a_{n}$ such that $a_{1}a_{2}\cdots a_{n}= 1$.
b) For each $n \ge 2$, find the maximum constant $d_{n}$ such that
$\frac 1{2a_{1}+1}+\frac 1{2a_{2}+1}+\ldots+\frac 1{2a_{n}+1}\ge d_{n}$
for all positive reals $a_{1},a_{2},\ldots,a_{n}$ such that $a_{1}a_{2}\cdots a_{n}= 1$.
We define a sequence $a_n$ so that $a_0=1$ and
\[a_{n+1} = \begin{cases} \displaystyle \frac{a_n}2 & \textrm { if } a_n \equiv 0 \pmod 2, \\ a_n + d & \textrm{ otherwise. } \end{cases} \]
for all postive integers $n$.
Find all positive integers $d$ such that there is some positive integer $i$ for which $a_i=1$.
Some of the vertices of a convex $n$-gon are connected by segments, such that any two of them have no common interior point. Prove that, for any $n$ points in general position, there exists a one-to-one correspondence between the points and the vertices of the $n$ gon, such that any two segments between the points, corresponding to the respective segments from the $n$ gon, have no common interior point.
Between any two cities of a country there is only one one-way road. Show that there is a city from that every other city can be reached directly or by going over only one intermediate city.
[hide]
I'm sure it was posted before but couldn't find it.
[/hide]
Find $f_n(x)$ such that $f_1(x)=x,\ f_n(x)=\int_0^x tf_{n-1}(x-t)dt\ (n=2,\ 3,\ \cdots).$
Let $ k\equal{}2008^2\plus{}2^{2008}$. What is the units digit of $ k^2\plus{}2^k$?
$ \textbf{(A)}\ 0 \qquad
\textbf{(B)}\ 2 \qquad
\textbf{(C)}\ 4 \qquad
\textbf{(D)}\ 6 \qquad
\textbf{(E)}\ 8$
Given integer $n\geq 2$ and real numbers $x_1,x_2,\cdots, x_n$ in the interval $[0,1]$. Prove that there exist real numbers $a_0,a_1,\cdots,a_n$ satisfying the following conditions:
(1) $a_0+a_n=0$;
(2) $|a_i|\leq 1$, for $i=0,1,\cdots,n$;
(3) $|a_i-a_{i-1}|=x_i$, for $i=1,2,\cdots,n$.
We denote $N_{2010}=\{1,2,\cdots,2010\}$
[b](a)[/b]How many non empty subsets does this set have?
[b](b)[/b]For every non empty subset of the set $N_{2010}$ we take the product of the elements of the subset. What is the sum of these products?
[b](c)[/b]Same question as the [b](b)[/b] part for the set $-N_{2010}=\{-1,-2,\cdots,-2010\}$.
Albanian National Mathematical Olympiad 2010---12 GRADE Question 2.
Let $ \, a_{0}, a_{1}, a_{2},\ldots\,$ be a sequence of positive real numbers satisfying $ \, a_{i\minus{}1}a_{i\plus{}1}\leq a_{i}^{2}\,$ for $ i \equal{} 1,2,3,\ldots\; .$ (Such a sequence is said to be [i]log concave[/i].) Show that for each $ \, n > 1,$
\[ \frac{a_{0}\plus{}\cdots\plus{}a_{n}}{n\plus{}1}\cdot\frac{a_{1}\plus{}\cdots\plus{}a_{n\minus{}1}}{n\minus{}1}\geq\frac{a_{0}\plus{}\cdots\plus{}a_{n\minus{}1}}{n}\cdot\frac{a_{1}\plus{}\cdots\plus{}a_{n}}{n}.\]
Let $ A$ be the subset of the set of positive integers, having the following $ 2$ properties:
1) If $ a$ belong to $ A$,than all of the divisors of $ a$ also belong to $ A$;
2) If $ a$ and $ b$, $ 1 < a < b$, belong to $ A$, than $ 1 \plus{} ab$ is also in $ A$;
Prove that if $ A$ contains at least $ 3$ positive integers, than $ A$ contains all positive integers.
Let $N$ be an integer greater than $1$ and let $T_n$ be the number of non empty subsets $S$ of $\{1,2,.....,n\}$ with the property that the average of the elements of $S$ is an integer.Prove that $T_n - n$ is always even.
Let $Z$ denote the set of points in $\mathbb{R}^{n}$ whose coordinates are $0$ or $1.$ (Thus $Z$ has $2^{n}$ elements, which are the vertices of a unit hypercube in $\mathbb{R}^{n}$.) Given a vector subspace $V$ of $\mathbb{R}^{n},$ let $Z(V)$ denote the number of members of $Z$ that lie in $V.$ Let $k$ be given, $0\le k\le n.$ Find the maximum, over all vector subspaces $V\subseteq\mathbb{R}^{n}$ of dimension $k,$ of the number of points in $V\cap Z.$
Find the number of positive and negative squares in the canonical form of the quadratic form $\sum_{i<j}(x_i-x_j)^2$ in $n$ variables. The same for the form $\sum_{i<j}x_i x_j$.
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}$
The sequence of real numbers $a_1,a_2,\dots$ is defined as follows: $a_1=56$ and $a_{n+1}=a_n-\frac{1}{a_n}$ for $n\ge 1$. Show that there is an integer $1\leq{k}\leq2002$ such that $a_k<0$.
Prove that for every nonnegative integer $n$, the number $7^{7^{n}}+1$ is the product of at least $2n+3$ (not necessarily distinct) primes.
Let $k$ and $l$ be two given positive integers and $a_{ij}(1 \leq i \leq k, 1 \leq j \leq l)$ be $kl$ positive integers. Show that if $q \geq p > 0$, then \[(\sum_{j=1}^{l}(\sum_{i=1}^{k}a_{ij}^{p})^{q/p})^{1/q}\leq (\sum_{i=1}^{k}(\sum_{j=1}^{l}a_{ij}^{q})^{p/q})^{1/p}.\]
For every positive integer $n$ we denote by $d(n)$ the sum of its digits in the decimal representation. Prove that for each positive integer $k$ there exists a positive integer $m$ such that the equation $x+d(x)=m$ has exactly $k$ solutions in the set of positive integers.
Find all pairs of positive integers $ (x,y)$ such that
\[ x^y \equal{} y^{x \minus{} y}.
\]
[i]Albania[/i]
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]
For any positive integer $b\ge2$, we write the base-$b$ numbers as follows:
\[(d_kd_{k-1}\dots d_0)_b=d_kb^k+d_{k-1}b^{k-1}+\dots+d_1b^1+d_0b^0,\]where each digit $d_i$ is a member of the set $S=\{0,1,2,\dots,b-1\}$ and either $d_k\not=0$ or $k=0$. There is a unique way to write any nonnegative integer in the above form. If we select the digits from a di fferent set $S$ instead, we may obtain new representations of all positive integers or, in some cases, all integers. For example, if $b=3$ and the digits are selected from $S=\{-1,0,1\}$, we obtain a way to uniquely represent all integers, known as a $\emph{balanced ternary}$ representation. As further examples, the balanced ternary representation of numbers $5$, $-3$, and $25$ are:
\[5=(1\ {-1}\ {-1})_3,\qquad{-3}=({-1}\ 0)_3,\qquad25=(1\ 0\ {-1}\ 1)_3.\]However, not all digit sets can represent all integers. If $b=3$ and $S=\{-2,0,2\}$, then no odd number can be represented. Also, if $b=3$ and $S=\{0,1,2\}$ as in the usual base-$3$ representation, then no negative number can be represented.
Given a set $S$ of four integers, one of which is $0$, call $S$ a $\emph{4-basis}$ if every integer $n$ has at least one representation in the form
\[n=(d_kd_{k-1}\dots d_0)_4=d_k4^k+d_{k-1}4^{k-1}+\dots+d_14^1+d_04^0,\]where $d_k,d_{k-1},\dots,d_0$ are all elements of $S$ and either $d_k\not=0$ or $k=0$.
[list=a]
[*]Show that there are infinitely many integers $a$ such that $\{-1,0,1,4a+2\}$ is not a $4$-basis.
[*]Show that there are infinitely many integers $a$ such that $\{-1,0,1,4a+2\}$ is a $4$-basis.[/list]
Let $f_{n}(x)=\sum_{k=1}^{n}\frac{\sin kx}{\sqrt{k(k+1)}}.$
Find $\lim_{n\to\infty}\int_{0}^{2\pi}\{f_{n}(x)\}^{2}dx.$