A natural number $k$ is such that $k^2 < 2014 < (k +1)^2$. What is the largest prime factor of $k$?

Define in the plane the sequence of vectors $v_1, v_2, \ldots$ with initial values $v_1 = (1, 0)$, $v_2 = (-1/\sqrt{2}, 1/\sqrt{2})$ and satisfying the relationship $$v_n=\frac{v_{n-1}+v_{n-2}}{\lVert v_{n-1}+v_{n-2}\rVert},$$ for $n \geq 3$. Show that the sequence is convergent and determine its limit. [b]Note:[/b] The expression $\lVert v \rVert$ denotes the length of the vector $v$.

We say a finite set $S$ of points in the plane is [i]very[/i] if for every point $X$ in $S$, there exists an inversion with center $X$ mapping every point in $S$ other than $X$ to another point in $S$ (possibly the same point). (a) Fix an integer $n$. Prove that if $n \ge 2$, then any line segment $\overline{AB}$ contains a unique very set $S$ of size $n$ such that $A, B \in S$. (b) Find the largest possible size of a very set not contained in any line. (Here, an [i]inversion[/i] with center $O$ and radius $r$ sends every point $P$ other than $O$ to the point $P'$ along ray $OP$ such that $OP\cdot OP' = r^2$.) [i]Proposed by Sammy Luo[/i]

The MathMatters competition consists of 10 players $P_1$, $P_2$, $\dots$, $P_{10}$ competing in a ladder-style tournament. Player $P_{10}$ plays a game with $P_9$: the loser is ranked 10th, while the winner plays $P_8$. The loser of that game is ranked 9th, while the winner plays $P_7$. They keep repeating this process until someone plays $P_1$: the loser of that final game is ranked 2nd, while the winner is ranked 1st. How many different rankings of the players are possible?

Given circle $\Omega_1$ and $\Omega_2$ interesting at $P$ and $Q$. $X$ and $Y$ on line $PQ$ such that $X, P, Q, Y$ in that order. Point $A$ and $B$ on $\Omega_1$ and $\Omega_2$ respectively such that the intersections of $\Omega_1$ with $AX$ and $AY$, intersections of $\Omega_2$ with $BX$ and $BY$ are all in one line. $l$. Prove that $AB, l$ and perpendicular bisector of $PQ$ are concurrent.

Let $n \ge 3$ be a positive integer. Find all nonconstant real polynomials $f_1(x), f_2(x), ..., f_n(x)$ such that $f_k(x)f_{k+1}(x) = f_{k+1}(f_{k+2}(x))$, $1 \le k \le n$ for all real x. [All suffixes are taken modulo $n$.]

Find all ordered pairs $ (m,n)$ where $ m$ and $ n$ are positive integers such that $ \frac {n^3 \plus{} 1}{mn \minus{} 1}$ is an integer.

A right triangle has perimeter $ 32$ and area $ 20$. What is the length of its hypotenuse? $ \textbf{(A)}\ \frac{57}{4} \qquad \textbf{(B)}\ \frac{59}{4} \qquad \textbf{(C)}\ \frac{61}{4} \qquad \textbf{(D)}\ \frac{63}{4} \qquad \textbf{(E)}\ \frac{65}{4}$

Let $ a_1, a_2, ..., a_k $ be distinct positive integers such that the $2^k$ sums $\displaystyle\sum\limits_{i=1}^{k}{\epsilon_i a_i}$, $\epsilon_i\in\left\{0,1\right\}$ are distinct. a) Show that $ \dfrac{1}{a_1}+\dfrac{1}{a_2}+...+\dfrac{1}{a_k}\le2(1-2^{-k}) $; b) Find the sequences $(a_1,a_2,...,a_k)$ for which the equality holds. [i]Șerban Buzețeanu[/i]

Determine all functions $f : \mathbb{R} \to \mathbb{R}$ satisfying \[ f(a^2) - f(b^2) \leq (f(a)+b)(a-f(b)) \] for all $a,b \in \mathbb{R}$.

Arjun and Beth play a game in which they take turns removing one brick or two adjacent bricks from one "wall" among a set of several walls of bricks, with gaps possibly creating new walls. The walls are one brick tall. For example, a set of walls of sizes $4$ and $2$ can be changed into any of the following by one move: $(3,2),(2,1,2),(4),(4,1),(2,2),$ or $(1,1,2).$ [asy] unitsize(4mm); real[] boxes = {0,1,2,3,5,6,13,14,15,17,18,21,22,24,26,27,30,31,32,33}; for(real i:boxes){ draw(box((i,0),(i+1,3))); } draw((8,1.5)--(12,1.5),Arrow()); defaultpen(fontsize(20pt)); label(",",(20,0)); label(",",(29,0)); label(",...",(35.5,0)); [/asy] Arjun plays first, and the player who removes the last brick wins. For which starting configuration is there a strategy that guarantees a win for Beth? $\textbf{(A) }(6,1,1) \qquad \textbf{(B) }(6,2,1) \qquad \textbf{(C) }(6,2,2)\qquad \textbf{(D) }(6,3,1) \qquad \textbf{(E) }(6,3,2)$

The signs "$+$" or "$-$" are placed in all cells of a $4 \times 4$ square table. It is allowed to change a sign of any cell altogether with signs of all its adjacent cells (i.e. cells having a common side with it). Find the number of different tables that could be obtained by iterating this procedure.

Find all positive integers $ n$ such that there exists a unique integer $ a$ such that $ 0\leq a < n!$ with the following property: \[ n!\mid a^n \plus{} 1 \] [i]Proposed by Carlos Caicedo, Colombia[/i]

Let $P$ be the quadratic function such that $P(0) = 7$, $P(1) = 10$, and $P(2) = 25$. If $a$, $b$, and $c$ are integers such that every positive number $x$ less than 1 satisfies \[ \sum_{n = 0}^\infty P(n) x^n = \frac{ax^2 + bx + c}{{(1 - x)}^3}, \] compute the ordered triple $(a, b, c)$.

Let $P(x)$ be a polynomial taking integer values at integer inputs. Are there infinitely many natural numbers that are not representable in the form $P(k)-2^n$ where $n{}$ and $k{}$ are non-negative integers? [i]Proposed by F. Petrov[/i]

How many positive integers $n < 500$ exist such that its prime factors are exclusively $2$, $7$, $11$, or a combination of these?

Find all the two-digit numbers $\overline{ab}$ that squared give a result where the last two digits are $\overline{ab}$.

Let $\mathcal{P}$ be a convex polygon with $50$ vertices. A set $\mathcal{F}$ of diagonals of $\mathcal{P}$ is said to be [i]$minimally friendly$ [/i] if any diagonal $d \in \mathcal{F}$ intersects at most one other diagonal in $\mathcal{F}$ at a point interior to $\mathcal{P}.$ Find the largest possible number of elements in a $\text{minimally friendly}$ set $\mathcal{F}$.

Cut a square with three straight lines into three triangles and four quadrilaterals.

Let $n$ be a positive integer, and Megavan has a $(3n+1)\times (3n+1)$ board. All squares, except one, are tiled by non-overlapping $1\times 3$ triominoes. In each step, he can choose a triomino that is untouched in the step right before it, and then shift this triomino horizontally or vertically by one square, as long as the triominoes remain non-overlapping after this move. Show that there exist some $k$, such that after $k$ moves Megavan can no longer make any valid moves irregardless of the initial configuration, and find the smallest possible $k$ for each $n$. [i](Note: While he cannot undo a move immediately before the current step, he may still choose to move a triomino that has already been moved at least two steps before.)[/i] [i]Proposed by Ivan Chan Kai Chin[/i]

Define the sequence $a_0,a_1,a_2,\hdots$ by $a_n=2^n+2^{\lfloor n/2\rfloor}$. Prove that there are infinitely many terms of the sequence which can be expressed as a sum of (two or more) distinct terms of the sequence, as well as infinitely many of those which cannot be expressed in such a way.

Let $p \ge 2$ be a prime number and $\frac{a_p}{b_p}= 1 +\frac12+ .. +\frac{1}{p^2 -1}$, where $a_p$ and $b_p$ are two relatively prime positive integers. Compute gcd $(p, b_p)$.

A ghost leg is a game with some vertical lines and some horizontal lines. A player starts at the top of the vertical line and go downwards, and always walkthrough a horizontal line if he encounters one. We define a layer is some horizontal line with the same height and has no duplicated endpoints. Find the smallest number of layers needed to grant that you can walk from $(1, 2, \ldots , n)$ on the top to any permutation $(\sigma_1, \sigma_2, \ldots, \sigma_n)$ on the bottom.

Evaluate the sum $$\sum_{n=0}^{\infty}\frac{5n+7}{6^n}$$

Determine the number of all ordered triplets of positive integers $(a, b, c)$, which satisfy the equalities: $$[a, b] =1000, [b, c] = 2000, [c, a] =2000.$$ ([x, y]represents the least common multiple of positive integers x,y)