Find all positive integers $n$ such that $27^n- 2^n$ is a perfect square.

Find all triples of natural $ (x,y,n)$ satisfying the condition: \[ \frac {x! \plus{} y!}{n!} \equal{} 3^n \] Define $ 0! \equal{} 1$

Find all positive integers $n$ such that $(n + 1)!$ is divisible by $1! + 2! + ... + n!$.

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$.

Prove that there exist infinitely many positive integers $n$ such that $\sqrt{n}$ is not an integer and $n$ is divisible by $[\sqrt{n}] $.

Call a natural number $n{}$ [i]interesting[/i] if any natural number not exceeding $n{}$ can be represented as the sum of several (possibly one) pairwise distinct positive divisors of $n{}$. [list=a] [*]Find the largest three-digit interesting number. [*]Prove that there are arbitrarily large interesting numbers other than the powers of two. [/list] [i]Proposed by N. Agakhanov[/i]

What is remainder when $2014^{2015}$ is divided by $121$? $ \textbf{(A)}\ 45 \qquad\textbf{(B)}\ 34 \qquad\textbf{(C)}\ 23 \qquad\textbf{(D)}\ 12 \qquad\textbf{(E)}\ 1 $

Let $\varphi(k)$ denote the numbers of positive integers less than or equal to $k$ and relatively prime to $k$. Prove that for some positive integer $n$, \[ \varphi(2n-1) + \varphi(2n+1) < \frac{1}{1000} \varphi(2n). \][i]Proposed by Evan Chen[/i]

Find all pairs of integers $ x $, $ y $ satisfying the equation $$ (xy-1)^2 = (x +1)^2 + (y +1)^2.$$

Denote by $d(n)$ the number of divisors of the positive integer $n$. A positive integer $n$ is called highly divisible if $d(n) > d(m)$ for all positive integers $m < n$. Two highly divisible integers $m$ and $n$ with $m < n$ are called consecutive if there exists no highly divisible integer $s$ satisfying $m < s < n$. (a) Show that there are only finitely many pairs of consecutive highly divisible integers of the form $(a, b)$ with $a\mid b$. (b) Show that for every prime number $p$ there exist infinitely many positive highly divisible integers $r$ such that $pr$ is also highly divisible.

Let $p{}$ be a fixed prime number. Determine the number of ordered $k$-tuples $(a_1,\ldots,a_k)$ of non-negative integers smaller than $p{}$ for which $p\mid a_1^2+\cdots+a_k^2$ where a) $k=3$ and b) $k$ is an arbitrary odd positive integer.

Find all positive integers $n$ such that $-5^4 + 5^5 + 5^n$ is a perfect square. Do the same for $2^4 + 2^7 + 2^n.$

Find all nonnegative integers $(x,y,z,u)$ with satisfy the following equation: $2^x + 3^y + 5^z = 7^u.$

A positive integer $n\geqslant 3$ is [i]almost squarefree[/i] if there exists a prime number $p\equiv 1\bmod 3$ such that $p^2\mid n$ and $n/p$ is squarefree. Prove that for any almost squarefree positive integer $n$ the ratio $2\sigma(n)/d(n)$ is an integer.

Product of two integers is $1$ less than three times of their sum. Find those integers.

During his excursion to the historical park, Pepito set out to collect stones whose weight in kilograms is a power of two. Once the first stone has been collected, Pepito only collects stones strictly heavier than the first. At the end of the excursion, her partner Ana chooses a positive integer $K \ge 2$ and challenges Pepito to divide the stones into $K$ groups of equal weight. a) Can Pepito meet the challenge if all the stones he collected have different weights? b) Can Pepito meet the challenge if some collected stones are allowed to have equal weight?

Let p be a prime and $a_1 , a_2 , ..., a_k$ pairwise incongruent modulo p . Prove that $[\sqrt {k-1}]$ of the elements can be selected from $a_i$'s such that adding any numbers different from the selected ones will never give a number divisible by p .

The largest one of numbers $ p_1^{\alpha_1}, p_2^{\alpha_2}, \cdots, p_t^{\alpha_t}$ is called a $ \textbf{Good Number}$ of positive integer $ n$, if $ \displaystyle n\equal{} p_1^{\alpha_1} \cdot p_2^{\alpha_2} \cdots p_t^{\alpha_t}$, where $ p_1$, $ p_2$, $ \cdots$, $ p_t$ are pairwisely different primes and $ \alpha_1, \alpha_2, \cdots, \alpha_t$ are positive integers. Let $ n_1, n_2, \cdots, n_{10000}$ be $ 10000$ distinct positive integers such that the $ \textbf{Good Numbers}$ of $ n_1, n_2, \cdots, n_{10000}$ are all equal. Prove that there exist integers $ a_1, a_2, \cdots, a_{10000}$ such that any two of the following $ 10000$ arithmetical progressions $ \{ a_i, a_i \plus{} n_i, a_i \plus{} 2n_i, a_i \plus{} 3n_i, \cdots \}$($ i\equal{}1,2, \cdots 10000$) have no common terms.

Let $p > 3$ be a prime number and $ x$ an integer, denote by $r ( x )\in \{ 0 , 1 , ... , p - 1 \}$ to the rest of $x$ modulo $p$ . Let $x_1, x_2, ... , x_k$ ( $2 < k < p$) different integers modulo $p$ and not divisible by $p$. We say that a number $a \in \{ 1 , 2 ,..., p -1 \}$ is [i]good [/i] if $r ( a x_1) < r ( a x_2) <...< r ( a x_k)$. Show that there are at most $\frac{2 p}{k + 1}-{ 1}$ [i]good [/i] numbers.

Let $\triangle PQR$ be a triangle with $\angle P = 75^\circ$ and $\angle Q = 60^\circ$. A regular hexagon $ABCDEF$ with side length 1 is drawn inside $\triangle PQR$ so that side $\overline{AB}$ lies on $\overline{PQ}$, side $\overline{CD}$ lies on $\overline{QR}$, and one of the remaining vertices lies on $\overline{RP}$. There are positive integers $a$, $b$, $c$, and $d$ such that the area of $\triangle PQR$ can be expressed in the form $\tfrac{a+b\sqrt c}d$, where $a$ and $d$ are relatively prime and $c$ is not divisible by the square of any prime. Find $a+b+c+d$.

How many zeros are at the end of the product \[25\times 25\times 25\times 25\times 25\times 25\times 25\times 8\times 8\times 8?\] $\text{(A)}\ 3 \qquad \text{(B)}\ 6 \qquad \text{(C)}\ 9 \qquad \text{(D)}\ 10 \qquad \text{(E)}\ 12$

The sides of a triangle are equal to $\sqrt2, \sqrt3, \sqrt4$ and its angles are $\alpha, \beta, \gamma$, respectively. Prove that the equation $x\sin \alpha + y\sin \beta + z\sin \gamma = 0$ has exactly one solution in integers $x, y, z$.

For a positive integer $ n$, let $ S(n)$ denote the sum of its digits. Find the largest possible value of the expression $ \frac {S(n)}{S(16n)}$.

[b]p1.[/b] Triangle $ABC$ has side lengths $AB = 3^2$ and $BC = 4^2$. Given that $\angle ABC$ is a right angle, determine the length of $AC$. [b]p2.[/b] Suppose $m$ and $n$ are integers such that $m^2+n^2 = 65$. Find the largest possible value of $m-n$. [b]p3.[/b] Six middle school students are sitting in a circle, facing inwards, and doing math problems. There is a stack of nine math problems. A random student picks up the stack and, beginning with himself and proceeding clockwise around the circle, gives one problem to each student in order until the pile is exhausted. Aditya falls asleep and is therefore not the student who picks up the pile, although he still receives problem(s) in turn. If every other student is equally likely to have picked up the stack of problems and Vishwesh is sitting directly to Aditya’s left, what is the probability that Vishwesh receives exactly two problems? [b]p4.[/b] Paul bakes a pizza in $15$ minutes if he places it $2$ feet from the fire. The time the pizza takes to bake is directly proportional to the distance it is from the fire and the rate at which the pizza bakes is constant whenever the distance isn’t changed. Paul puts a pizza $2$ feet from the fire at $10:30$. Later, he makes another pizza, puts it $2$ feet away from the fire, and moves the first pizza to a distance of $3$ feet away from the fire instantly. If both pizzas finish baking at the same time, at what time are they both done? [b]p5.[/b] You have $n$ coins that are each worth a distinct, positive integer amount of cents. To hitch a ride with Charon, you must pay some unspecified integer amount between $10$ and $20$ cents inclusive, and Charon wants exact change paid with exactly two coins. What is the least possible value of $n$ such that you can be certain of appeasing Charon? [b]p6.[/b] Let $a, b$, and $c$ be positive integers such that $gcd(a, b)$, $gcd(b, c)$ and $gcd(c, a)$ are all greater than $1$, but $gcd(a, b, c) = 1$. Find the minimum possible value of $a + b + c$. [b]p7.[/b] Let $ABC$ be a triangle inscribed in a circle with $AB = 7$, $AC = 9$, and $BC = 8$. Suppose $D$ is the midpoint of minor arc $BC$ and that $X$ is the intersection of $\overline{AD}$ and $\overline{BC}$. Find the length of $\overline{BX}$. [b]p8.[/b] What are the last two digits of the simplified value of $1! + 3! + 5! + · · · + 2009! + 2011!$ ? [b]p9.[/b] How many terms are in the simplified expansion of $(L + M + T)^{10}$ ? [b]p10.[/b] Ben draws a circle of radius five at the origin, and draws a circle with radius $5$ centered at $(15, 0)$. What are all possible slopes for a line tangent to both of the circles? PS. You had better use hide for answers.

Positive integers $a$, $b$, $c$ are given. It is known that $\frac{c}{b}=\frac{b}{a}$, and the number $b^2-a-c+1$ is a prime. Prove that $a$ and $c$ are double of a squares of positive integers.