Olympiad problems

2012 Today's Calculation Of Integral, 799

Tags: calculus , integration , limit , induction , strong induction , calculus computations , logarithm

Let $n$ be positive integer. Define a sequence $\{a_k\}$ by \[a_1=\frac{1}{n(n+1)},\ a_{k+1}=-\frac{1}{k+n+1}+\frac{n}{k}\sum_{i=1}^k a_i\ \ (k=1,\ 2,\ 3,\ \cdots).\] (1) Find $a_2$ and $a_3$. (2) Find the general term $a_k$. (3) Let $b_n=\sum_{k=1}^n \sqrt{a_k}$. Prove that $\lim_{n\to\infty} b_n=\ln 2$. 50 points

2011 IberoAmerican, 2

Tags: inequalities , induction , strong induction , algebra

Let $x_1,\ldots ,x_n$ be positive real numbers. Show that there exist $a_1,\ldots ,a_n\in\{-1,1\}$ such that: \[a_1x_1^2+a_2x_2^2+\ldots +a_nx_n^2\ge (a_1x_1+a_2x_2+\ldots + a_n x_n)^2\]

2010 IMC, 3

Tags: group theory , abstract algebra , induction , strong induction , superior algebra

Denote by $S_n$ the group of permutations of the sequence $(1,2,\dots,n).$ Suppose that $G$ is a subgroup of $S_n,$ such that for every $\pi\in G\setminus\{e\}$ there exists a unique $k\in \{1,2,\dots,n\}$ for which $\pi(k)=k.$ (Here $e$ is the unit element of the group $S_n.$) Show that this $k$ is the same for all $\pi \in G\setminus \{e\}.$

2012 USA Team Selection Test, 3

Tags: induction , arithmetic sequence , strong induction , combinatorics

Determine all positive integers $n$, $n\ge2$, such that the following statement is true: If $(a_1,a_2,...,a_n)$ is a sequence of positive integers with $a_1+a_2+\cdots+a_n=2n-1$, then there is block of (at least two) consecutive terms in the sequence with their (arithmetic) mean being an integer.

1989 Bundeswettbewerb Mathematik, 4

Tags: induction , strong induction , combinatorics

Positive integers $x_1, x_2, \dots, x_n$ ($n \ge 4$) are arranged in a circle such that each $x_i$ divides the sum of the neighbors; that is \[ \frac{x_{i-1}+x_{i+1}}{x_i} = k_i \] is an integer for each $i$, where $x_0 = x_n$, $x_{n+1} = x_1$. Prove that \[ 2n \le k_1 + k_2 + \dots + k_n < 3n. \]

2010 Contests, 3

Tags: induction , strong induction , combinatorics , intuitive

Let $n$ be a positive integer. $n$ people take part in a certain party. For any pair of the participants, either the two are acquainted with each other or they are not. What is the maximum possible number of the pairs for which the two are not acquainted but have a common acquaintance among the participants?