Find all positive integers $m$ and $n$ such that $1 + 5 \cdot 2^m = n^2$.

Let $m$ be a fixed positive integer. The infinite sequence $\{a_n\}_{n\geq 1}$ is defined in the following way: $a_1$ is a positive integer, and for every integer $n\geq 1$ we have $$a_{n+1} = \begin{cases}a_n^2+2^m & \text{if } a_n< 2^m \\ a_n/2 &\text{if } a_n\geq 2^m\end{cases}$$ For each $m$, determine all possible values of $a_1$ such that every term in the sequence is an integer.

Determine with proof all triples $(a, b, c)$ of positive integers satisfying $\frac{1}{a}+ \frac{2}{b} +\frac{3}{c} = 1$, where $a$ is a prime number and $a \le b \le c$.

For positive integers $n,d$, define $n \% d$ to be the unique value of the positive integer $r < d$ such that $n = qd + r$, for some positive integer $q$. What is the smallest value of $n$ not divisible by $5,7,11,13$ for which $n^2 \% 5 < n^2 \% 7 < n^2 \% 11 < n^2 \% 13$?

Find all prime numbers $p$ such that $(x + y)^{19} - x^{19} - y^{19}$ is a multiple of $p$ for any positive integers $x$, $y$.

Find the least possible number of elements which can be deleted from the set $\{1,2,...,20\}$ so that the sum of no two different remaining numbers is not a perfect square. N. Sedrakian , I.Voronovich

Consider the equation $$FORTY + TEN + TEN = SIXTY$$ , where each of the ten letters represents a distinct digit from $0$ to $9$. Find all possible values of $SIXTY$ .

Mr. Jones has eight children of different ages. On a family trip his oldest child, who is 9, spots a license plate with a 4-digit number in which each of two digits appears two times. "Look, daddy!" she exclaims. "That number is evenly divisible by the age of each of us kids!" "That's right," replies Mr. Jones, "and the last two digits just happen to be my age." Which of the following is not the age of one of Mr. Jones's children? $ \textbf{(A) } 4 \qquad \textbf{(B) } 5 \qquad \textbf{(C) } 6 \qquad \textbf{(D) } 7 \qquad \textbf{(E) } 8$

For positive integers $n$ and $k \geq 2$, define $E_k(n)$ as the greatest exponent $r$ such that $k^r$ divides $n!$. Prove that there are infinitely many $n$ such that $E_{10}(n) > E_9(n)$ and infinitely many $m$ such that $E_{10}(m) < E_9(m)$.

Let $(a_n)$ be the Lucas sequence: $a_0=2,a_1=1, a_{n+1}=a_n+a_{n-1}$ for $n\geq 1$. Show that $a_{59}$ divides $(a_{30})^{59}-1$.

Find a number that increases by a factor of $1996$ if the digits in the first and fifth places after the decimal place are swapped in its decimal notation.

Suppose $ \,G\,$ is a connected graph with $ \,k\,$ edges. Prove that it is possible to label the edges $ 1,2,\ldots ,k\,$ in such a way that at each vertex which belongs to two or more edges, the greatest common divisor of the integers labeling those edges is equal to 1. [b]Note: Graph-Definition[/b]. A [b]graph[/b] consists of a set of points, called vertices, together with a set of edges joining certain pairs of distinct vertices. Each pair of vertices $ \,u,v\,$ belongs to at most one edge. The graph $ G$ is connected if for each pair of distinct vertices $ \,x,y\,$ there is some sequence of vertices $ \,x \equal{} v_{0},v_{1},v_{2},\cdots ,v_{m} \equal{} y\,$ such that each pair $ \,v_{i},v_{i \plus{} 1}\;(0\leq i < m)\,$ is joined by an edge of $ \,G$.

For any positive integer $n$, we have the set $P_n = \{ n^k \mid k=0,1,2, \ldots \}$. For positive integers $a,b,c$, we define the group of $(a,b,c)$ as lucky if there is a positive integer $m$ such that $a-1$, $ab-12$, $abc-2015$ (the three numbers need not be different from each other) belong to the set $P_m$. Find the number of lucky groups.

How many pairs of integers $x, y$ are there between $1$ and $1000$ such that $x^2 + y^2$ is divisible by $7$?

Let $A, B$, and $C$ be three points on the edge of a circular chord such that $B$ is due west of $C$ and $ABC$ is an equilateral triangle whose side is $86$ meters long. A boy swam from $A$ directly toward $B$. After covering a distance of $x$ meters, he turned and swam westward, reaching the shore after covering a distance of $y$ meters. If $x$ and $y$ are both positive integers, determine $y.$

We call a positive integer $n$ is $good$ , if there exist integers $a,b,c,x,y$ such that $n=ax^2+bxy+cy^2$ and $b^2-4ac=-20$. Prove that the product of any two good numbers is also a good number.

Prove that number $1$ can be represented as a sum of a finite number $n$ of real numbers, less than $1,$ not necessarily distinct, which contain in their decimal representation only the digits $0$ and/or $7.$ Which is the least possible number $n$?

Let $f$ be a real-valued function defined on the positive integers satisfying the following condition: For all $n>1$ there exists a prime divisor $p$ of $n$ such that $f(n)=f\left(\frac{n}{p}\right)-f(p)$. Given that $f(2001)=1$, what is the value of $f(2002)$?

A non-negative integer $n$ is called [I]redundant[/I] if the sum of all his proper divisors is bigger than $n$. Prove that for each non-negative integer $N$ there are $N$ consecutive redundant non-negative integers. [I]Proposed by V. Bragin[/I]

Let $ p,q,r$ be 3 prime numbers such that $ 5\leq p <q<r$. Knowing that $ 2p^2\minus{}r^2 \geq 49$ and $ 2q^2\minus{}r^2\leq 193$, find $ p,q,r$.

Consider the factorials of the first $100$ positive integers, namely, $1!, 2!$, $...$, $100!$. Is it possible to delete one of them so that the product of the remaining ones is a perfect square? (S Tokarev)

Find all numbers between $100$ and $999$ which equal the sum of the cubes of their digits.

A positive integer is called [i]superprime[/i] if the difference between any two of its consecutive positive divisors is a prime number. Determine all superprime integers. [i]Authored by Nikola Velov[/i]

Find all nonnegative integers $m$ such that \[a_m=(2^{2m+1})^2+1 \] is divisible by at most two different primes.

Suppose that $A=1,2,$ or $3$. Let $a$ and $b$ be relatively prime integers such that $a^{2}+Ab^2 =s^3$ for some integer $s$. Then, there are integers $u$ and $v$ such that $s=u^2 +Av^2$, $a =u^3 - 3Avu^2$, and $b=3u^{2}v -Av^3$.