For an $n$-tuple of integers, define a transformation to be: $$(a_1,a_2,\cdots,a_{n-1},a_n)\rightarrow (a_1+a_2, a_2+a_3, \cdots, a_{n-1}+a_n, a_n+a_1)$$ Find all ordered pairs of integers $(n,k)$ with $n,k\geq 2$, such that for any $n$-tuple of integers $(a_1,a_2,\cdots,a_{n-1},a_n)$, after a finite number of transformations, every element in the of the $n$-tuple is a multiple of $k$.

Prove that for every positive integer $n,$ the set $\{2,3,4,\ldots,3n+1\}$ can be partitioned into $n$ triples in such a way that the numbers from each triple are the lengths of the sides of some obtuse triangle. [i]Proposed by Canada[/i]

Let $Q_0(x)=1$, $Q_1(x)=x,$ and \[Q_n(x)=\frac{(Q_{n-1}(x))^2-1}{Q_{n-2}(x)}\] for all $n\ge 2.$ Show that, whenever $n$ is a positive integer, $Q_n(x)$ is equal to a polynomial with integer coefficients.

Let $x_1,x_2,\ldots,x_n$ be arbitrary real numbers. Prove the inequality \[ \frac{x_1}{1+x_1^2} + \frac{x_2}{1+x_1^2 + x_2^2} + \cdots + \frac{x_n}{1 + x_1^2 + \cdots + x_n^2} < \sqrt{n}. \]

Given an integer $h > 1$. Let's call a positive common fraction (not necessarily irreducible) [i]good[/i] if the sum of its numerator and denominator is equal to $h$. Let's say that a number $h$ is [i]remarkable[/i] if every positive common fraction whose denominator is less than $h$ can be expressed in terms of good fractions (not necessarily various) using the operations of addition and subtraction. Prove that $h$ is remarkable if and only if it is prime. (Recall that an common fraction has an integer numerator and a natural denominator.)

Denote $S$ as the subset of $\{1,2,3,\dots,1000\}$ with the property that none of the sums of two different elements in $S$ is in $S$. Find the maximum number of elements in $S$.

Determine all positive integers $n$ such that the following statement holds: If a convex polygon with with $2n$ sides $A_1 A_2 \ldots A_{2n}$ is inscribed in a circle and $n-1$ of its $n$ pairs of opposite sides are parallel, which means if the pairs of opposite sides \[(A_1 A_2, A_{n+1} A_{n+2}), (A_2 A_3, A_{n+2} A_{n+3}), \ldots , (A_{n-1} A_n, A_{2n-1} A_{2n})\] are parallel, then the sides \[ A_n A_{n+1}, A_{2n} A_1\] are parallel as well.

Determine all functions $f: \mathbb{Z}\to\mathbb{Z}$ satisfying \[f\big(f(m)+n\big)+f(m)=f(n)+f(3m)+2014\] for all integers $m$ and $n$. [i]Proposed by Netherlands[/i]

Find all functions $f: \mathbb{R} \to \mathbb{R}$ that have a continuous second derivative and for which the equality $f(7x+1)=49f(x)$ holds for all $x \in \mathbb{R}$.

A diabolical combination lock has $n$ dials (each with $c$ possible states), where $n,c>1$. The dials are initially set to states $d_1, d_2, \ldots, d_n$, where $0\le d_i\le c-1$ for each $1\le i\le n$. Unfortunately, the actual states of the dials (the $d_i$'s) are concealed, and the initial settings of the dials are also unknown. On a given turn, one may advance each dial by an integer amount $c_i$ ($0\le c_i\le c-1$), so that every dial is now in a state $d_i '\equiv d_i+c_i \pmod{c}$ with $0\le d_i ' \le c-1$. After each turn, the lock opens if and only if all of the dials are set to the zero state; otherwise, the lock selects a random integer $k$ and cyclically shifts the $d_i$'s by $k$ (so that for every $i$, $d_i$ is replaced by $d_{i-k}$, where indices are taken modulo $n$). Show that the lock can always be opened, regardless of the choices of the initial configuration and the choices of $k$ (which may vary from turn to turn), if and only if $n$ and $c$ are powers of the same prime. [i]Bobby Shen.[/i]

Let $n$ be a positive integer number and let $a_1, a_2, \ldots, a_n$ be $n$ positive real numbers. Prove that $f : [0, \infty) \rightarrow \mathbb{R}$, defined by \[f(x) = \dfrac{a_1 + x}{a_2 + x} + \dfrac{a_2 + x}{a_3 + x} + \cdots + \dfrac{a_{n-1} + x}{a_n + x} + \dfrac{a_n + x}{a_1 + x}, \] is a decreasing function. [i]Dan Marinescu et al.[/i]

For $ a_i \in \mathbb{Z}^ \plus{}$, $ i \equal{} 1, \ldots, k$, and $ n \equal{} \sum^k_{i \equal{} 1} a_i$, let $ d \equal{} \gcd(a_1, \ldots, a_k)$ denote the greatest common divisor of $ a_1, \ldots, a_k$. Prove that $ \frac {d} {n} \cdot \frac {n!}{\prod\limits^k_{i \equal{} 1} (a_i!)}$ is an integer. [i]Dan Schwarz, Romania[/i]

Given a finite sequence of complex numbers $c_1, c_2, \ldots , c_n$, show that there exists an integer $k$ ($1 \leq k \leq n$) such that for every finite sequence $a_1, a_2, \ldots, a_n$ of real numbers with $1 \geq a_1 \geq a_2 \geq \cdots \geq a_n \geq 0$, the following inequality holds: \[\left| \sum_{m=1}^n a_mc_m \right| \leq \left| \sum_{m=1}^k c_m \right|.\]

Let $\mathbb{R}$ be the set of real numbers. Determine all functions $f: \mathbb{R} \to \mathbb{R}$ such that \[ f(x^2 - y^2) = x f(x) - y f(y) \] for all pairs of real numbers $x$ and $y$.