Find all prime numbers $p$ such that there exists a positive integer $n$ where $2^n p^2 + 1$ is a square number.

We say a natural number $n$ is perfect if the sum of all the positive divisors of $n$ is equal to $2n$. For example, $6$ is perfect since its positive divisors $1,2,3,6$ add up to $12=2\times 6$. Show that an odd perfect number has at least $3$ distinct prime divisors. [i]Note: It is still not known whether odd perfect numbers exist. So assume such a number is there and prove the result.[/i]

Let $n$ be a positive integer. Determine, in terms of $n$, the greatest integer which divides every number of the form $p + 1$, where $p \equiv 2$ mod $3$ is a prime number which does not divide $n$.

In a certain game, Auntie Hall has four boxes $B_1$, $B_2$, $B_3$, $B_4$, exactly one of which contains a valuable gemstone; the other three contain cups of yogurt. You are told the probability the gemstone lies in box $B_n$ is $\frac{n}{10}$ for $n=1,2,3,4$. Initially you may select any of the four boxes; Auntie Hall then opens one of the other three boxes at random (which may contain the gemstone) and reveals its contents. Afterwards, you may change your selection to any of the four boxes, and you win if and only if your final selection contains the gemstone. Let the probability of winning assuming optimal play be $\tfrac mn$, where $m$ and $n$ are relatively prime integers. Compute $100m+n$. [i]Proposed by Evan Chen[/i]

Let $\{f_n\}_{n\ge 1}$ be the Fibonacci sequence, defined by $f_1 = f_2 = 1$, and for all positive integers $n$, $f_{n+2} = f_{n+1} + f_n$. Prove that the following inequality takes place for all positive integers $n$: $${n \choose 1}f_1 +{n \choose 2}f_2+... +{n \choose n}f_n < \frac{(2n + 2)^n}{n!}$$ .

Let $n$ and $k$ be two positive integers such that $1\leq n \leq k$. Prove that, if $d^k+k$ is a prime number for each positive divisor $d$ of $n$, then $n+k$ is a prime number.

Prove that if positive numbers $ x, y, z $ satisfy the inequality $$ \frac{x^2+y^2-z^2}{2xy} + \frac{y^2+z^2-x^2}{2yz} + \frac{z^2+x^2-y ^2}{2xz} > 1,$$ then they are the lengths of the sides of a certain triangle.

Let $M$ be the set of palindromic integers of the form $5n+4$ where $n\ge 0$ is an integer. [list=a] [*]If we write the elements of $M$ in increasing order, what is the $50^{\text{th}}$ number? [*]Among all numbers in $M$ with nonzero digits which sum up to $2014$ which is the largest and smallest one?[/list]

Determine all continuous functions $f: \mathbb R \to \mathbb R$ such that \[f(x + y)f(x - y) = (f(x)f(y))^2, \quad \forall(x, y) \in\mathbb{R}^2.\]

In triangle $ABC$, $D$ is the midpoint of side $AB$. $E$ and $F$ are points arbitrarily chosen on segments $AC$ and $BC$, respectively. Show that $[DEF] < [ADE] + [BDF]$.

For a given positive real parameter $p$, solve the equation $\sqrt{p+x}+\sqrt{p-x }= x$.

Find all functions $ f : R \to R$ that satisfies $$xf(y) - yf(x)= f\left(\frac{y}{x}\right)$$ for all $x, y \in R$.

Let $A$ be a finite set, and $A_1,A_2,\cdots, A_n$ are subsets of $A$ with the following conditions: (1) $|A_1|=|A_2|=\cdots=|A_n|=k$, and $k>\frac{|A|}{2}$; (2) for any $a,b\in A$, there exist $A_r,A_s,A_t\,(1\leq r<s<t\leq n)$ such that $a,b\in A_r\cap A_s\cap A_t$; (3) for any integer $i,j\, (1\leq i<j\leq n)$, $|A_i\cap A_j|\leq 3$. Find all possible value(s) of $n$ when $k$ attains maximum among all possible systems $(A_1,A_2,\cdots, A_n,A)$.

Determine all integers $ k\ge 2$ such that for all pairs $ (m$, $ n)$ of different positive integers not greater than $ k$, the number $ n^{n\minus{}1}\minus{}m^{m\minus{}1}$ is not divisible by $ k$.

When $171$ is written as the sum of $19$ consecutive integers, the median of those numbers is $M$. When $171$ is written as the sum of $18$ consecutive integers, the median of those numbers is $N$. Find $|M - N|$. $\textbf{(A) }{-}1\qquad\textbf{(B) }{-}0.5\qquad\textbf{(C) }0\qquad\textbf{(D) }0.5\qquad\textbf{(E) }1$

Prove that for any $n$ ($n \geq 2$) pairwise distinct fractions in the interval $(0,1)$, the sum of their denominators is no less than $\frac{1}{3} n^{\frac{3}{2}}$.

Let $ABC$ be a triangle, and let $r$ denote its inradius. Let $R_A$ denote the radius of the circle internally tangent at $A$ to the circle $ABC$ and tangent to the line $BC$; the radii $R_B$ and $R_C$ are defined similarly. Show that $\frac{1}{R_A} + \frac{1}{R_B} + \frac{1}{R_C}\leq\frac{2}{r}$.

Find all pairs of cubic equations $x^3+ax^2+bx+c=0$ and $x^3+bx^2+ax+c=0$ where $a, b$ are positive integers, $c\neq 0$ is an integer, such that each equation has three integer roots and exactly one of these three roots is common to both the equations.

Solve the system of equations $$\begin{cases} \sin x = y \\ \sin y = x \end{cases}$$

* Let $A, B, C$ be three nodes of a graph paper. Prove that if $\vartriangle ABC$ is an acute one, then there is at least one more node either inside $\vartriangle ABC$ or on one of its sides.

Anna and Berta play a game in which they take turns in removing marbles from a table. Anna takes the first turn. At the beginning of a turn there are n ≥ 1 marbles on the table, then the player whose turn is removes k marbles, where k ≥ 1 either is an even number with $k \le \frac{n}{2}$ or an odd number with $ \frac{n}{2}\le k \le n$. A player wins the game if she removes the last marble from the table. Determine the smallest number $N\ge100000$ which Berta has wining strategy. [i]proposed by Gerhard Woeginger[/i]

Let $I$ be the incenter of triangle $ABC$ with $AB < AC$. Point $X$ is chosen on the external bisector of $\angle ABC$ such that $IC = IX$. Let the tangent to the circumscribed circle of $\triangle BXC$ at point $X$ intersect the line $AB$ at point $Y$. Prove that $AC = AY$. [i]Proposed by Oleksiy Masalitin[/i]

For every pair $(m, n)$ of positive integers, a positive real number $a_{m, n}$ is given. Assume that \[a_{m+1, n+1} = \frac{a_{m, n+1} a_{m+1, n} + 1}{a_{m, n}}\] for all positive integers $m$ and $n$. Suppose further that $a_{m, n}$ is an integer whenever $\min(m, n) \le 2$. Prove that $a_{m, n}$ is an integer for all positive integers $m$ and $n$.

Compute: $ \frac{777^2 \minus{} 66^2}{777\plus{}66}$

Let $a$, $b$, $c$ be positive real numbers such that $\dfrac{1}{a} + \dfrac{1}{b} + \dfrac{1}{c} = a+b+c$. Prove that: \[\frac{1}{(2a+b+c)^2}+\frac{1}{(a+2b+c)^2}+\frac{1}{(a+b+2c)^2}\leq \frac{3}{16}.\] [i]Proposed by Juhan Aru, Estonia[/i]