Found problems: 1782
Given is an integer sequence $\{a_n\}_{n \ge 0}$ such that $a_{0}=2$, $a_{1}=3$ and, for all positive integers $n \ge 1$, $a_{n+1}=2a_{n-1}$ or $a_{n+1}= 3a_{n} - 2a_{n-1}$. Does there exist a positive integer $k$ such that $1600 < a_{k} < 2000$?
Two players play a game involving an $n \times n$ grid of chocolate. Each turn, a player may either eat a piece of chocolate (of any size), or split an existing piece of chocolate into two rectangles along a grid-line. The player who moves last loses. For how many positive integers $n$ less than $1000$ does the second player win?
(Splitting a piece of chocolate refers to taking an $a \times b$ piece, and breaking it into an $(a-c) \times b$ and a $c \times b$ piece, or an $a \times (b-d)$ and an $a \times d$ piece.)
[i]Proposed by Lewis Chen[/i]
Let $m,n$ be positive integers with $m \geq n$, and let $S$ be the set of all $n$-term sequences of positive integers $(a_1, a_2, \ldots a_n)$ such that $a_1 + a_2 + \cdots + a_n = m$. Show that
\[\sum_S 1^{a_1} 2^{a_2} \cdots n^{a_n} =
{n \choose n} n^m - {n \choose n-1} (n-1)^m + \cdots +
(-1)^{n-2} {n \choose 2} 2^m + (-1)^{n-1} {n \choose 1}.\]
Suppose $\{ x_n \}_{n\geq 1}$ is a sequence of positive real numbers such that $x_1 \geq x_2 \geq x_3 \ldots \geq x_n \ldots$, and for all $n$ \[ \frac{x_1}{1} + \frac{x_4}{2} + \frac{x_9}{3} + \ldots + \frac{x_{n^2}}{n} \leq 1 . \] Show that for all $k$ \[ \frac{x_1}{1} + \frac{x_2}{2} +\ldots + \frac{x_k}{k} \leq 3. \]
Let $n = 2188 = 3^7+1$ and let $A_0^{(0)}, A_1^{(0)}, ..., A_{n-1}^{(0)}$ be the vertices of a regular $n$-gon (in that order) with center $O$ . For $i = 1, 2, \dots, 7$ and $j=0,1,\dots,n-1$, let $A_j^{(i)}$ denote the centroid of the triangle \[ \triangle A_j^{(i-1)} A_{j+3^{7-i}}^{(i-1)} A_{j+2 \cdot 3^{7-i}}^{(i-1)}. \] Here the subscripts are taken modulo $n$. If \[ \frac{|OA_{2014}^{(7)}|}{|OA_{2014}^{(0)}|} = \frac{p}{q} \] for relatively prime positive integers $p$ and $q$, find $p+q$.
[i]Proposed by Yang Liu[/i]
Let $ S$ be the smallest subset of the integers with the property that $ 0\in S$ and for any $ x\in S$, we have $ 3x\in S$ and $ 3x \plus{} 1\in S$. Determine the number of non-negative integers in $ S$ less than $ 2008$.
Denote by $ S$ the set of all positive integers. Find all functions $ f: S \rightarrow S$ such that
\[ f (f^2(m) \plus{} 2f^2(n)) \equal{} m^2 \plus{} 2 n^2\]
for all $ m,n \in S$.
[i]Bulgaria[/i]
Given a (fixed) positive integer $N$, solve the functional equation
\[f \colon \mathbb{Z} \to \mathbb{R}, \ f(2k) = 2f(k) \textrm{ and } f(N-k) = f(k), \ \textrm{for all } k \in \mathbb{Z}.\]
[i](Dan Schwarz)[/i]
Let $k$ be a fixed positive integer. The sequence $\{a_{n}\}_{n\ge1}$ is defined by \[a_{1}=k+1, a_{n+1}=a_{n}^{2}-ka_{n}+k.\] Show that if $m \neq n$, then the numbers $a_{m}$ and $a_{n}$ are relatively prime.
$ n\geq 2$ cars are participating in a rally. The cars leave the start line at different times and arrive at the finish line at different times. During the entire rally each car takes over any other car at most once , the number of cars taken over by each car is different and each car is taken over by the same number of cars. Find all possible values of $ n$
Prove that for all natural $ m$, $ n$ polynomial $ \sum_{i \equal{} 0}^{m}\binom{n\plus{}i}{n}\cdot x^i$ has at most one real root.
Determine all strictly increasing functions $f: \mathbb{N}\to\mathbb{N}$ satisfying $nf(f(n))=f(n)^2$ for all positive integers $n$.
[i]Carl Lian and Brian Hamrick.[/i]
In an infinite increasing sequence of positive integers, every term from the $2002^{\text{th}}$ term divides the sum of all preceding terms. Prove that every term starting from some term is equal to the sum of all preceding terms.
On each day of their tour of the West Indies, Sourav and Srinath have either an apple or an orange for breakfast. Sourav has oranges for the first $m$ days, apples for the next $m$ days, followed by oranges for the next $m$ days, and so on. Srinath has oranges for the first $n$ days, apples for the next $n$ days, followed by oranges for the next $n$ days, and so on.
If $\gcd(m,n)=1$, and if the tour lasted for $mn$ days, on how many days did they eat the same kind of fruit?
Suppose $S= \{1,2,\dots,n\}$ and $n \geq 3$. There is $f:S^k \longmapsto S$ that if $a,b \in S^k$ and $a$ and $b$ differ in all of elements then $f(a) \neq f(b)$. Prove that $f$ is a function of one of its elements.
For each positive integer $ n$, define $ f(n)$ as the exponent of the $ 2$ in the decomposition in prime factors of the number $ n!$. Prove that the equation $ n\minus{}f(n)\equal{}a$ has infinitely many solutions for any positive integer $ a$.
Let $a$ and $b$ be positive integers greater than $2$. Prove that there exists a positive integer $k$ and a finite sequence $n_1$, $\cdots$, $n_k$ of positive integers such that $n_1 =a$, $n_k =b$, and $n_i n_{i+1}$ is divisible by $n_{i}+n_{i+1}$ for each $i$ $(1 \le i \le k)$.
Does there exist a pair $(g,h)$ of functions $g,h:\mathbb{R}\rightarrow\mathbb{R}$ such that the only function $f:\mathbb{R}\rightarrow\mathbb{R}$ satisfying $f(g(x))=g(f(x))$ and $f(h(x))=h(f(x))$ for all $x\in\mathbb{R}$ is identity function $f(x)\equiv x$?
For a nonempty set $\, S \,$ of integers, let $\, \sigma(S) \,$ be the sum of the elements of $\, S$. Suppose that $\, A = \{a_1, a_2, \ldots, a_{11} \} \,$ is a set of positive integers with $\, a_1 < a_2 < \cdots < a_{11} \,$ and that, for each positive integer $\, n\leq 1500, \,$ there is a subset $\, S \,$ of $\, A \,$ for which $\, \sigma(S) = n$. What is the smallest possible value of $\, a_{10}$?
Let $\leftarrow$ denote the left arrow key on a standard keyboard. If one opens a text editor and types the keys "ab$\leftarrow$ cd $\leftarrow \leftarrow$ e $\leftarrow \leftarrow$ f", the result is "faecdb". We say that a string $B$ is [i]reachable[/i] from a string $A$ if it is possible to insert some amount of $\leftarrow$'s in $A$, such that typing the resulting characters produces $B$. So, our example shows that "faecdb" is reachable from "abcdef".
Prove that for any two strings $A$ and $B$, $A$ is reachable from $B$ if and only if $B$ is reachable from $A$.
Prove that any uncountable subset of the Euclidean $ n$-space contains an countable subset with the property that the distances between different pairs of points are different (that is, for any points $ P_1 \not\equal{} P_2$ and $ Q_1\not\equal{} Q_2$ of this subset, $ \overline{P_1P_2}\equal{}\overline{Q_1Q_2}$ implies either $ P_1\equal{}Q_1$ and $ P_2\equal{}Q_2$, or $ P_1\equal{}Q_2$ and $ P_2\equal{}Q_1$). Show that a similar statement is not valid if the Euclidean $ n$-space is replaced with a (separable) Hilbert space.
Let $\mathbb{N}_0$ and $\mathbb{Z}$ be the set of all non-negative integers and the set of all integers, respectively. Let $f:\mathbb{N}_0\rightarrow\mathbb{Z}$ be a function defined as
\[f(n)=-f\left(\left\lfloor\frac{n}{3}\right\rfloor \right)-3\left\{\frac{n}{3}\right\} \]
where $\lfloor x \rfloor$ is the greatest integer smaller than or equal to $x$ and $\{ x\}=x-\lfloor x \rfloor$. Find the smallest integer $n$ such that $f(n)=2010$.
Find the set of all $ a \in \mathbb{R}$ for which there is no infinite sequene $ (x_n)_{n \geq 0} \subset \mathbb{R}$ satisfying $ x_0 \equal{} a,$ and for $ n \equal{} 0,1, \ldots$ we have \[ x_{n\plus{}1} \equal{} \frac{x_n \plus{} \alpha}{\beta x_n \plus{} 1}\] where $ \alpha \beta > 0.$
$5$ points are given in the plane, any three non-collinear and any four non-concyclic. If three points determine a circle that has one of the remaining points inside it and the other one outside it, then the circle is said to be [i]good[/i]. Let the number of good circles be $n$; find all possible values of $n$.
Consider a tree with $n$ vertices, labeled with $1,\ldots,n$ in a way that no label is used twice. We change the labeling in the following way - each time we pick an edge that hasn't been picked before and swap the labels of its endpoints. After performing this action $n-1$ times, we get another tree with its labeling a permutation of the first graph's labeling.
Prove that this permutation contains exactly one cycle.