Found problems: 1782
Let $ \mathbb{Z}$ be the set of all integers. Define the set $ \mathbb{H}$ as follows:
(1). $ \dfrac{1}{2} \in \mathbb{H}$,
(2). if $ x \in \mathbb{H}$, then $ \dfrac{1}{1\plus{}x} \in \mathbb{H}$ and also $ \dfrac{x}{1\plus{}x} \in \mathbb{H}$.
Prove that there exists a bijective function $ f: \mathbb{Z} \rightarrow \mathbb{H}$.
Find all positive integers $n$ such that $n$ is equal to $100$ times the number of positive divisors of $n$.
Let $n_1,\ldots,n_k$ be positive integers, and define $d_1=1$ and $d_i=\frac{(n_1,\ldots,n_{i-1})}{(n_1,\ldots,n_{i})}$, for $i\in \{2,\ldots,k\}$, where $(m_1,\ldots,m_{\ell})$ denotes the greatest common divisor of the integers $m_1,\ldots,m_{\ell}$. Prove that the sums \[\sum_{i=1}^k a_in_i\] with $a_i\in\{1,\ldots,d_i\}$ for $i\in\{1,\ldots,k\}$ are mutually distinct $\mod n_1$.
Sequence $x_1 , x_2 , ..., $ with $x_1=20$ ; $x_2=12$ for all $n\geq 1$ such that $x_{n+2}=x_n+x_{n+1}+2\sqrt{x_{n}*x_{n+1}+121} $then prove that $x_{2013}$ is an integer number.
Let $(a_n)_{n\ge 1}$ be a sequence of positive numbers. If there is a constant $M > 0$ such that $a_2^2 + a_2^2 +\ldots + a_n^2 < Ma_{n+1}^2$ for all $n$, then prove that there is a constant $M ' > 0$ such that $a_1 + a_2 +\ldots + a_n < M ' a_{n+1}$ .
By a partition $\pi$ of an integer $n\ge 1$, we mean here a representation of $n$ as a sum of one or more positive integers where the summands must be put in nondecreasing order. (E.g., if $n=4$, then the partitions $\pi$ are $1+1+1+1$, $1+1+2$, $1+3, 2+2$, and $4$).
For any partition $\pi$, define $A(\pi)$ to be the number of $1$'s which appear in $\pi$, and define $B(\pi)$ to be the number of distinct integers which appear in $\pi$. (E.g., if $n=13$ and $\pi$ is the partition $1+1+2+2+2+5$, then $A(\pi)=2$ and $B(\pi) = 3$).
Prove that, for any fixed $n$, the sum of $A(\pi)$ over all partitions of $\pi$ of $n$ is equal to the sum of $B(\pi)$ over all partitions of $\pi$ of $n$.
Let $m$ be equal to $1$ or $2$ and $n<10799$ be a positive integer. Determine all such $n$ for which $\sum_{k=1}^{n}\frac{1}{\sin{k}\sin{(k+1)}}=m\frac{\sin{n}}{\sin^{2}{1}}$.
Given an integer $ m$, define the sequence $ \left\{a_{n}\right\}$ as follows:
\[ a_{1}\equal{}\frac{m}{2},\ a_{n\plus{}1}\equal{}a_{n}\left\lceil a_{n}\right\rceil,\textnormal{ if }n\geq 1\]
Find all values of $ m$ for which $ a_{2007}$ is the first integer appearing in the sequence.
Note: For a real number $ x$, $ \left\lceil x\right\rceil$ is defined as the smallest integer greater or equal to $ x$. For example, $ \left\lceil\pi\right\rceil\equal{}4$, $ \left\lceil 2007\right\rceil\equal{}2007$.
Let $n$ be a positive integer, and let $A$ be a subset of $\{ 1,\cdots ,n\}$. An $A$-partition of $n$ into $k$ parts is a representation of n as a sum $n = a_1 + \cdots + a_k$, where the parts $a_1 , \cdots , a_k $ belong to $A$ and are not necessarily distinct. The number of different parts in such a partition is the number of (distinct) elements in the set $\{ a_1 , a_2 , \cdots , a_k \} $.
We say that an $A$-partition of $n$ into $k$ parts is optimal if there is no $A$-partition of $n$ into $r$ parts with $r<k$. Prove that any optimal $A$-partition of $n$ contains at most $\sqrt[3]{6n}$ different parts.
Let $\alpha=0.d_{1}d_{2}d_{3} \cdots$ be a decimal representation of a real number between $0$ and $1$. Let $r$ be a real number with $\vert r \vert<1$. [list=a][*] If $\alpha$ and $r$ are rational, must $\sum_{i=1}^{\infty} d_{i}r^{i}$ be rational? [*] If $\sum_{i=1}^{\infty} d_{i}r^{i}$ and $r$ are rational, $\alpha$ must be rational? [/list]
In every $1\times1$ cell of a rectangle board a natural number is written. In one step it is allowed the numbers written in every cell of arbitrary chosen row, to be doubled, or the numbers written in the cells of the arbitrary chosen column to be decreased by 1. Will after final number of steps all the numbers on the board be $0$?
Let $ G$ be finite group and $ \mathcal{K}$ a conjugacy class of $ G$ that generates $ G$. Prove that the following two statements are equivalent:
(1) There exists a positive integer $ m$ such that every element of $ G$ can be written as a product of $ m$ (not necessarily distinct) elements of $ \mathcal{K}$.
(2) $ G$ is equal to its own commutator subgroup.
[i]J. Denes[/i]
Prove that $2^{2^{n}}+2^{2^{{n-1}}}+1$ has at least $n$ distinct prime divisors.
Alexander and Louise are a pair of burglars. Every morning, Louise steals one third of Alexander's money, but feels remorse later in the afternoon and gives him half of all the money she has. If Louise has no money at the beginning and starts stealing on the first day, what is the least positive integer amount of money Alexander must have so that at the end of the 2012th day they both have an integer amount of money?
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$.
Let $({{x}_{n}}),({{y}_{n}})$ be two positive sequences defined by ${{x}_{1}}=1,{{y}_{1}}=\sqrt{3}$ and
\[ \begin{cases} {{x}_{n+1}}{{y}_{n+1}}-{{x}_{n}}=0 \\ x_{n+1}^{2}+{{y}_{n}}=2 \end{cases} \] for all $n=1,2,3,\ldots$.
Prove that they are converges and find their limits.
Let $n$ be a positive integer and let $a_1, a_2, \ldots, a_n$ be positive reals. Show that $$\sum_{i=1}^{n} \frac{1}{2^i}(\frac{2}{1+a_i})^{2^i} \geq \frac{2}{1+a_1a_2\ldots a_n}-\frac{1}{2^n}.$$
An $n\times n$ chessboard is given, where $n$ is an even positive integer. On every line, the unit squares are to be permuted, subject to the condition that the resulting table has to be symmetric with respect to its main diagonal (the diagonal from the top-left corner to the bottom-right corner). We say that a board is [i]alternative[/i] if it has at least one pair of complementary lines (two lines are complementary if the unit squares on them which lie on the same column have distinct colours). Otherwise, we call the board [i]nonalternative[/i]. For what values of $n$ do we always get from the $n\times n$ chessboard an alternative board?\\ \\
[i](Alexandru Petrescu and Andra Elena Mircea)[/i]
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]
Solve the equation $3^x=2^xy+1$ in positive integers.
Determine all sequences $ a_1,a_2,a_3,...$ of $ 1$ and $ \minus{}1$ such that $ a_{mn}\equal{}a_ma_n$ for all $ m,n$ and among any three successive terms $ a_n,a_{n\plus{}1},a_{n\plus{}2}$ both $ 1$ and $ \minus{}1$ occur.
A $k\times \ell$ 'parallelogram' is drawn on a paper with hexagonal cells (it consists of $k$ horizontal rows of $\ell$ cells each). In this parallelogram a set of non-intersecting sides of hexagons is chosen; it divides all the vertices into pairs.
Juniors) How many vertical sides can there be in this set?
Seniors) How many ways are there to do that?
[asy]
size(120);
defaultpen(linewidth(0.8));
path hex = dir(30)--dir(90)--dir(150)--dir(210)--dir(270)--dir(330)--cycle;
for(int i=0;i<=3;i=i+1)
{
for(int j=0;j<=2;j=j+1)
{
real shiftx=j*sqrt(3)/2+i*sqrt(3),shifty=j*3/2;
draw(shift(shiftx,shifty)*hex);
}
}
[/asy]
[i](T. Doslic)[/i]
Let $ \left( a_n \right) ,\left( b_n \right) $ be two sequences of real numbers from the interval $ (-1,1) $ having the property that
$$ \max\left( \left| a_{n+1} -a_n \right| ,\left| b_{n+1} -b_n \right| \right) \le\frac{1}{(n+4)(n+5)} , $$
for any natural number.
Prove that $ \left| a_nb_n -a_1b_1 \right|\le 1/2, $ for any natural number $ n. $
[i]Cristinel Mortici[/i]
Let $ G=(V,E)$ be a simple graph.
a) Let $ A,B$ be a subsets of $ E$, and spanning subgraphs of $ G$ with edges $ A,B,A\cup B$ and $ A\cap B$ have $ a,b,c$ and $ d$ connected components respectively. Prove that $ a+b\leq c+d$.
We say that subsets $ A_1,A_2,\dots,A_m$ of $ E$ have $ (R)$ property if and only if for each $ I\subset\{1,2,\dots,m\}$ the spanning subgraph of $ G$ with edges $ \cup_{i\in I}A_i$ has at most $ n-|I|$ connected components.
b) Prove that when $ A_1,\dots,A_m,B$ have $ (R)$ property, and $ |B|\geq2$, there exists an $ x\in B$ such that $ A_1,A_2,\dots,A_m,B\backslash\{x\}$ also have property $ (R)$.
Suppose that edges of $ G$ are colored arbitrarily. A spanning subtree in $ G$ is called colorful if and only if it does not have any two edges with the same color.
c) Prove that $ G$ has a colorful subtree if and only if for each partition of $ V$ to $ k$ non-empty subsets such as $ V_1,\dots,V_k$, there are at least $ k\minus{}1$ edges with distinct colors that each of these edges has its two ends in two different $ V_i$s.
d) Assume that edges of $ K_n$ has been colored such that each color is repeated $ \left[\frac n2\right]$ times. Prove that there exists a colorful subtree.
e) Prove that in part d) if $ n\geq5$ there is a colorful subtree that is non-isomorphic to $ K_{1,n-1}$.
f) Prove that in part e) there are at least two non-intersecting colorful subtrees.
Ben has a big blackboard, initially empty, and Francisco has a fair coin. Francisco flips the coin $2013$ times. On the $n^{\text{th}}$ flip (where $n=1,2,\dots,2013$), Ben does the following if the coin flips heads:
(i) If the blackboard is empty, Ben writes $n$ on the blackboard.
(ii) If the blackboard is not empty, let $m$ denote the largest number on the blackboard. If $m^2+2n^2$ is divisible by $3$, Ben erases $m$ from the blackboard; otherwise, he writes the number $n$.
No action is taken when the coin flips tails. If probability that the blackboard is empty after all $2013$ flips is $\frac{2u+1}{2^k(2v+1)}$, where $u$, $v$, and $k$ are nonnegative integers, compute $k$.
[i]Proposed by Evan Chen[/i]