There is an integer in each cell of a $2m\times 2n$ table. We define the following operation: choose three cells forming an L-tromino (namely, a cell $C$ and two other cells sharing a side with $C$, one being horizontal and the other being vertical) and sum $1$ to each integer in the three chosen cells. Find a necessary and sufficient condition, in terms of $m$, $n$ and the initial numbers on the table, for which there exists a sequence of operations that makes all the numbers on the table equal.

Given $k > 0$, the sequence $a_n$ is defined by its first two members and \[ a_{n+2} = a_{n+1} + \frac{k}{n}a_n \] a)For which $k$ can we write $a_n$ as a polynomial in $n$? b) For which $k$ can we write $\frac{a_{n+1}}{a_n} = \frac{p(n)}{q(n)}$? ($p,q$ are polynomials in $\mathbb R[X]$).

Grid the plane forming an infinite board. In each cell of this board, there is a lamp, initially turned off. A permitted operation consists of selecting a square of \(3\times 3\), \(4\times 4\), or \(5\times 5\) cells and changing the state of all lamps in that square (those that are off become on, and those that are on become off). (a) Prove that for any finite set of lamps, it is possible to achieve, through a finite sequence of permitted operations, that those are the only lamps turned on on the board. (b) Prove that if in a sequence of permitted operations only two out of the three square sizes are used, then it is impossible to achieve that at the end the only lamps turned on on the board are those in a \(2\times 2\) square.

The sequence $a_i$ is defined as $a_1 = 2, a_2 = 3$, and $a_{n+1} = 2a_{n-1}$ or $a_{n+1} = 3a_n - 2a_{n-1}$ for all integers $n \ge 2$. Prove that no term in $a_i$ is in the range $[1612, 2012]$.

Let $(x_n)_{n \in \mathbb{N}}$ be the sequence defined as $x_n = \sin(2 \pi n! e)$ for all $n \in \mathbb{N}$. Compute $\lim_{n \to \infty} x_n$.

All perfect squares, and all perfect squares multiplied by two, are written in a row in increasing order. let $f(n)$ be the $n$-th number in this sequence. (For instance, $f(1)=1,f(2)=2,f(3)=4,f(4)=8$.) Is there an integer $n$ such that all the numbers \[f(n),f(2n),f(3n),\dots,f(10n^2)\] are perfect squares?

Let $d$ be a positive integer. Show that for every integer $S$, there exist a positive integer $n$ and a sequence $a_1, ..., a_n \in \{-1, 1\}$ such that $S = a_1(1 + d)^2 + a_2(1 + 2d)^2 + ... + a_n(1 + nd)^2$.

Let $a_{1},a_{2},\ldots$ be an infinite arithmetic progression. It's known that there exist positive integers $p,q,t$ such that $a_{p}+tp=a_{q}+tq$. If $a_{t}=t$ and the sum of the first $t$ numbers in the sequence is $18$, determine $a_{2008}$.

Given a sequence $a_0, a_1, a_2, ... , a_n$, let its [i]arithmetic approximant[/i] be the arithmetic sequence $b_0, b_1, ... , b_n$ that minimizes the quantity $\sum_{i=0}^{n}(b_i -a_i)^2$, and denote this quantity the sequence’s anti-arithmeticity. Denote the number of integer sequences whose arithmetic approximant is the sequence $4$, $8$, $12$, $16$ and whose anti-arithmeticity is at most $20$.

Let $a_0$, $a_1$, $a_2$, ... be an infinite sequence of real numbers satisfying the equation $a_n=\left|a_{n+1}-a_{n+2}\right|$ for all $n\geq 0$, where $a_0$ and $a_1$ are two different positive reals. Can this sequence $a_0$, $a_1$, $a_2$, ... be bounded? [i]Proposed by Mihai Bălună, Romania[/i]

Two infinite arithmetic sequences with positive integers are given:$$a_1<a_2<a_3<\cdots ; b_1<b_2<b_3<\cdots$$ It is known that there are infinitely many pairs of positive integers $(i,j)$ for which $i\leq j\leq i+2021$ and $a_i$ divides $b_j$. Prove that for every positive integer $i$ there exists a positive integer $j$ such that $a_i$ divides $b_j$.

Let $\{ a_n \}_{n=0}^{11}$ and $\{ b_n \}_{n=0}^{11}$ be sequences of real numbers. Suppose $a_0 = b_0 = -1$, $a_1 = b_1$, and for all integers $n \in \{2, 3, \ldots, 11\}$, \begin{align*} a_n & = a_{n-1} - (11 - n)^2(1 - (11 - (n - 1))^2)a_{n-2} \quad \text{and} \\ b_n & = b_{n-1} - (12 - n)^2(1 - (12 - (n - 1))^2)b_{n-2}. \end{align*} If $b_{11} = 2a_{11}$, then determine the value of $a_1$.

[b]p1.[/b] How many ways can we arrange the elements $\{1, 2, ..., n\}$ to a sequence $a_1, a_2, ..., a_n$ such that there is only exactly one $a_i$, $a_{i+1}$ such that $a_i > a_{i+1}$? [b]p2. [/b]How many distinct (non-congruent) triangles are there with integer side-lengths and perimeter $2012$? [b]p3.[/b] Let $\phi$ be the Euler totient function, and let $S = \{x| \frac{x}{\phi (x)} = 3\}$. What is $\sum_{x\in S} \frac{1}{x}$? [b]p4.[/b] Denote $f(N)$ as the largest odd divisor of $N$. Compute $f(1) + f(2) + f(3) +... + f(29) + f(30)$. [b]p5.[/b] Triangle $ABC$ has base $AC$ equal to $218$ and altitude $100$. Squares $s_1, s_2, s_3, ...$ are drawn such that $s_1$ has a side on $AC$ and has one point each touching $AB$ and $BC$, and square $s_k$ has a side on square $s_{k-}1$ and also touches $AB$ and $BC$ exactly once each. What is the sum of the area of these squares? [b]p6.[/b] Let $P$ be a parabola $6x^2 - 28x + 10$, and $F$ be the focus. A line $\ell$ passes through $F$ and intersects the parabola twice at points $P_1 = (2,-22)$, $P_2$. Tangents to the parabola with points at $P_1, P_2$ are then drawn, and intersect at a point $Q$. What is $m\angle P_1QP_2$? PS. You had better use hide for answers.

Let $a_1, a_2, ..., a_n$ be a sequence of perfect squares such that $a_{i + 1}$ can be obtained by concatenating a digit to the right of $a_i$. Determine all such sequences that are of maximum length. [i]Proposed by Ilija Jovčeski[/i]

$a_n$ sequence is a arithmetic sequence with all terms be positive integers. (for $a_n$ non-constant sequence) Let $p_n$ is greatest prime divisor of $a_n$. Prove that $$(\frac{a_n}{p_n})$$ sequence is infinity. [hide]Note: If we find a $M>0$ constant such that $x_n \leq M$ for all $n \in {\mathbb N}$'s, $(x_n)$ sequence is non-infinite, but we can't find $M$, $(x_n)$ sequence is infinity [/hide]

Let $m\ge2$ be an integer. The sequence $(a_n)_{n\in\mathbb N}$ is defined by $a_0=0$ and $a_n=\left\lfloor\frac nm\right\rfloor+a_{\left\lfloor\frac nm\right\rfloor}$ for all $n$. Determine $\lim_{n\to\infty}\frac{a_n}n$.