Found problems: 1782
A strictly increasing sequence $\{x_i\}_{i=1}^{\infty}$ of positive integers is said to be [i]large[/i] if, for every real number $L$, there exists an integer $n$ such that $\frac{1}{x_1} + \frac{1}{x_2} + \cdots + \frac{1}{x_n} > L$. Do there exist large sequences $\{a_i\}_{i=1}^\infty$ and $\{b_i\}_{i=1}^{\infty}$ such that the sequence $\{a_i+b_i\}_{i=1}^{\infty}$ is not large?
[i]Proposed by Lewis Chen[/i]
For every natural number $n$ we define $f(n)$ by the following rule: $f(1) = 1$ and for $n>1$ then $f(n) = 1 + a_1 \cdot p_1 + \ldots + a_k \cdot p_k$, where $n = p_1^{a_1} \cdots p_k^{a_k}$ is the canonical prime factorisation of $n$ ($p_1, \ldots, p_k$ are distinct primes and $a_1, \ldots, a_k$ are positive integers). For every positive integer $s$, let $f_s(n) = f(f(\ldots f(n))\ldots)$, where on the right hand side there are exactly $s$ symbols $f$. Show that for every given natural number $a$, there is a natural number $s_0$ such that for all $s > s_0$, the sum $f_s(a) + f_{s-1}(a)$ does not depend on $s$.
Prove that for any positive integer $ n$, there exists only $ n$ degree polynomial $ f(x),$ satisfying $ f(0) \equal{} 1$ and $ (x \plus{} 1)[f(x)]^2 \minus{} 1$ is an odd function.
Let $a$ be a positive real number and $\{x_n\}_{n\geq 1}$ a sequence of real numbers such that $x_1=a$ and
\[ x_{n+1} \geq (n+2)x_n - \sum^{n-1}_{k=1}kx_k, \ \forall \ n\geq 1. \]
Prove that there exists a positive integer $n$ such that $x_n > 1999!$.
[i]Ciprian Manolescu[/i]
Squares of an $n \times n$ table ($n \ge 3$) are painted black and white as in a chessboard. A move allows one to choose any $2 \times 2$ square and change all of its squares to the opposite color. Find all such n that there is a finite number of the moves described after which all squares are the same color.
Let $ 0 < x_{1}\leq\frac {x_{2}}{2}\leq\cdots\leq\frac {x_{n}}{n}, 0 < y_{n}\leq y_{n \minus{} 1}\leq\cdots\leq y_{1},$ Prove that $ (\sum_{k \equal{} 1}^{n}x_{k}y_{k})^2\leq(\sum_{k \equal{} 1}^{n}y_{k})(\sum_{k \equal{} 1}^{n}(x_{k}^2 \minus{} \frac {1}{4}x_{k}x_{k \minus{} 1})y_{k}).$ where $ x_{0} \equal{} 0.$
Given real numbers $ x_1 < x_2 < \ldots < x_n$ such that every real number occurs at most two times among the differences $ x_j \minus{} x_i$, $ 1\leq i < j \leq n$, prove that there exists at least $ \lfloor n/2\rfloor$ real numbers that occurs exactly one time among such differences.
Let $m$ and $n$ be positive integers integers such that $2m + 1 < n$, and let $S$ be the set of the $2^n$ subsets of $\{1,2,\ldots,n\}$. Prove that we can place the elements of $S$ on a circle, so that for any two adjacent elements $A$ and $B$, the set $A \Delta B$ has exactly $2m + 1$ elements.
[b]Note[/b]: $A \Delta B = (A \cup B) - (A \cap B)$ is the set of elements that are exclusively in $A$ or exclusively in $B$.
Let $ n, k \in \mathbb{N}$ with $ 1 \leq k \leq \frac {n}{2} - 1.$ There are $ n$ points given on a circle. Arbitrarily we select $ nk + 1$ chords among the points on the circle. Prove that of these chords there are at least $ k + 1$ chords which pairwise do not have a point in common.
%%% [i]This problem intentionally left blank.[/i] %%%
Prove that the set of integers of the form $2^{k}-3$ ($k=2,3,\cdots$) contains an infinite subset in which every two members are relatively prime.
Let $A$ be a ring with $2^n+1$ elements, where $n$ is a positive integer and let
\[ M = \{ k \in\mathbb{Z} \mid k \geq 2, \ x^k =x , \ \forall \ x\in A \} . \]
Prove that the following statements are equivalent:
a) $A$ is a field;
b) $M$ is not empty and the smallest element in $M$ is $2^n+1$.
[i]Marian Andronache[/i]
Find the largest integer $n$ such that $n$ is divisible by all positive integers less than $\sqrt[3]{n}$.
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]
Let $\{a_n\}_{n\geq 1}$ be a sequence of real numbers which satisfies the following relation:
\[a_{n+1}=10^n a_n^2\]
(a) Prove that if $a_1$ is small enough, then $\displaystyle\lim_{n\to\infty} a_n =0$.
(b) Find all possible values of $a_1\in \mathbb{R}$, $a_1\geq 0$, such that $\displaystyle\lim_{n\to\infty} a_n =0$.
If $ x_{k\plus{}1} \equal{} x_k \plus{} \frac12$ for $ k\equal{}1, 2, \dots, n\minus{}1$ and $ x_1\equal{}1,$ find $ x_1 \plus{} x_2 \plus{} \dots \plus{} x_n.$
$ \textbf{(A)}\ \frac{n\plus{}1}{2} \qquad
\textbf{(B)}\ \frac{n\plus{}3}{2} \qquad
\textbf{(C)}\ \frac{n^2\minus{}1}{2} \qquad
\textbf{(D)}\ \frac{n^2\plus{}n}{4} \qquad
\textbf{(E)}\ \frac{n^2\plus{}3n}{4}$
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]
Find all positive integers $m$ such that there exist positive integers $a_1,a_2,\ldots,a_{1378}$ such that:
\[ m=\sum_{k=1}^{1378}{\frac{k}{a_k}}. \]
Find all functions $f:\mathbb{Q}\to \mathbb{Q}$ such that
\[ f(x+3f(y))=f(x)+f(y)+2y \quad \forall x,y\in \mathbb{Q}\]
For each positive integer $n$, let $s_n$ be the number of permutations $(a_1, a_2, \cdots, a_n)$ of $(1, 2, \cdots, n)$ such that $\dfrac{a_1}{1} + \dfrac{a_2}{2} + \cdots + \dfrac{a_n}{n}$ is a positive integer. Prove that $s_{2n} \ge n$ for all positive integer $n$.
Let $k$ be a given positive integer. The sequence $x_n$ is defined as follows: $x_1 =1$ and $x_{n+1}$ is the least positive integer which is not in $\{x_{1}, x_{2},..., x_{n}, x_{1}+k, x_{2}+2k,..., x_{n}+nk \}$. Show that there exist real number $a$ such that $x_n = \lfloor an\rfloor$ for all positive integer $n$.
The sequence $a_1, a_2, a_3, ...$ is defined by $a_1 = a_2 = a_3 = 1$, $a_{n+3} = a_{n+2}a_{n+1} + a_n$. Show that for any positive integer $r$ we can find $s$ such that $a_s$ is a multiple of $r$.
A square board is dissected into $n^2$ rectangular cells by $n-1$ horizontal and $n-1$ vertical lines. The cells are painted alternately black and white in a chessboard pattern. One diagonal consists of $n$ black cells which are squares. Prove that the total area of all black cells is not less than the total area of all white cells.
If $x$ is a real number such that $x^2 -x$ is an integer, and for some $n \ge 3$, $x^n -x$ is also an integer, prove that $x$ is an integer.
Let $p(x)=x^n+a_{n-1}x^{n-1}+\cdots+a_1x+a_0$ be a monic polynomial of degree $n>2$, with real coefficients and all its roots real and different from zero. Prove that for all $k=0,1,2,\cdots,n-2$, at least one of the coefficients $a_k,a_{k+1}$ is different from zero.