We call an infinite set $S\subseteq\mathbb{N}$ good if for all parwise different integers $a,b,c\in S$, all positive divisors of $\frac{a^c-b^c}{a-b}$ are in $S$. for all positive integers $n>1$, prove that there exists a good set $S$ such that $n \not \in S$. Proposed by Seyed Reza Hosseini Dolatabadi

Let $a$ be a positive real number such that $\tfrac{a^2}{a^4-a^2+1}=\tfrac{4}{37}$. Then $\tfrac{a^3}{a^6-a^3+1}=\tfrac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$.

Let $a \geq b \geq 1 \geq c \geq 0$ be real numbers such that $a+b+c=3$. Show that $$3 \left( \frac{a}{b}+\frac{b}{a} \right ) \geq 4c^2+\frac{a^2}{b}+\frac{b^2}{a}$$

$x, y, z$ are positive reals less than $1$. Show that at least one of $(1 - x)y$, $(1 - y)z$ and $(1 - z)x$ does not exceed $\frac14$ .

Three sides of a tetrahedron are right-angled triangles having the right angle at their common vertex. The areas of these sides are $A, B$, and $C$. Find the total surface area of the tetrahedron.

Show that if a $6n$-digit number is divisible by $7$, then the number that results from moving the ones digit to the beginning of the number is also a multiple of $7$.

The Fibonacci numbers are defined by $ F_0 \equal{} 1, F_1 \equal{} 1, F_{n\plus{}2} \equal{} F_{n\plus{}1} \plus{} F_n$. The positive integers $ A, B$ are such that $ A^{19}$ divides $ B^{93}$ and $ B^{19}$ divides $ A^{93}$. Show that if $ h < k$ are consecutive Fibonacci numbers then $ (AB)^h$ divides $ (A^4 \plus{} B^8)^k$

How many ordered pairs of integers $(x,y)$ satisfy $xy - 6y - 4x + 20 = 0$? $\textbf{(A) }1\qquad\textbf{(B) }2\qquad\textbf{(C) }3\qquad\textbf{(D) }4\qquad\textbf{(E) }6$

In the acute angle triangle $ABC$ the point $O$ is the center of the circumscribed circle and the lines $OA,OB,OC$ intersect sides $BC,CA,AB$ respectively in points $M,N,P$ such that $\angle NMP=90^o$. [b](a)[/b] Find the ratios $\frac{\angle AMN}{\angle NMC}$,$\frac{\angle AMP}{\angle PMB}$. [b](b)[/b] If any of the angles of the triangle $ABC$ is $60^o$, find the two other angles.

Define the distance between real numbers $x$ and $y$ by $d(x,y) =\sqrt{([x]-[y])^2+(\{x\}-\{y\})^2}$ . Determine (as a union of intervals) the set of real numbers whose distance from $3/2$ is less than $202/100$ .

How many pairs of positive integers $(a,b)$ are there such that $a < b$ and $a,b$ can be the legs of a right triangle with hypotenuse $340$?

Compute the sum of all positive real numbers $x \le 5$ satisfying $$x =\frac{ \lceil x^2 \rceil + \lceil x \rceil \cdot \lfloor x \rfloor}{ \lceil x\rceil + \lfloor x \rfloor}$$

Let $P$ be an interior point of triangle $ABC$ such that $\angle BPC = \angle CPA =\angle APB = 120^o$. Prove that the Euler lines of triangles $APB,BPC,CPA$ are concurrent.

In a $ 19\times 19$ board, a piece called [i]dragon[/i] moves as follows: It travels by four squares (either horizontally or vertically) and then it moves one square more in a direction perpendicular to its previous direction. It is known that, moving so, a dragon can reach every square of the board. The [i]draconian distance[/i] between two squares is defined as the least number of moves a dragon needs to move from one square to the other. Let $ C$ be a corner square, and $ V$ the square neighbor of $ C$ that has only a point in common with $ C$. Show that there exists a square $ X$ of the board, such that the draconian distance between $ C$ and $ X$ is greater than the draconian distance between $ C$ and $ V$.

Let $a_1, a_2, \ldots, a_n$ be $n$ positive integers that are not divisible by each other, i.e. for any $i \neq j$, $a_i$ is not divisible by $a_j$. Show that \[ a_1+a_2+\cdots+a_n \ge 1.1n^2-2n. \] [i]Note:[/i] A proof of the inequality when $n$ is sufficient large will be awarded points depending on your results.

Prove that there doesn't exist any function $f:\mathbb{N}\rightarrow \mathbb{N}$ such that : $f(f(n-1)=f(n+1)-f(n)$, for every natural $n\geq2$

Let $p$ be a prime number. Find all triples $(a, b, c)$ of integers (not necessarily positive) such that $a^bb^cc^a = p$.

Let $n$ be a positive integer. Let $\mathcal{F}$ be a family of sets that contains more than half of all subsets of an $n$-element set $X$. Prove that from $\mathcal{F}$ we can select $\lceil \log_2 n \rceil + 1$ sets that form a separating family on $X$, i.e., for any two distinct elements of $X$ there is a selected set containing exactly one of the two elements. Moderator says: http://www.artofproblemsolving.com/Forum/viewtopic.php?f=41&t=614827&hilit=Schweitzer+2014+separating

Prove that there are infinitely natural numbers $n$ such that $n$ can't be written as a sum of two positive integers with prime factors less than $1394$.

Points $A, B$ and $C$ lie on the same line so that $CA = AB$. Square $ABDE$ and the equilateral triangle $CFA$, are constructed on the same side of line $CB$. Find the acute angle between straight lines $CE$ and $BF$.

A utility company is building a network to send electricity to fifty houses, with addresses $0, 1, 2, \ldots , 49. $ The power center only connects directly to house $0$, so electricity reaches all other houses through a system of wires that connects specific pairs of houses. To save money, the company only lays wires between as few pairs of distinct houses as possible; additionally, two houses with addresses $a$ and $b$ can only have a wire between them if at least one of the following three conditions is met: [list] [*]$10$ divides both $a$ and $b.$ [*]$\lfloor \tfrac{a}{10} \rfloor \equiv \lfloor \tfrac{b}{10}\rfloor \pmod{5}.$ [*]$\lceil \tfrac{a}{10} \rceil\equiv \lceil \tfrac{b}{10}\rceil\pmod{5}.$ [/list] Letting $N$ be the number of distinct ways such a wire system can be configured so that every house receives electricity , find the remainder when $N$ is divided by $1000.$

A white ball has finitely many disk-shaped black region (closed) painted on its surface. Each black region has area less than half of the surface area of the sphere. No two black regions touch or overlap. Determine, with proof, whether there is always a diameter of the ball with two white endpoints.

How many integers belong to ($a,2008a$), where $a$ ($a > 0$) is given.

Dan the dog spots Cate the cat 50m away. At that instant, Cate begins running away from Dan at 6 m/s, and Dan begins running toward Cate at 8 m/s. Both of them accelerate instantaneously and run in straight lines. Compute the number of seconds it takes for Dan to reach Cate. [i]Proposed by Eugene Chen[/i]

Find all pairs ($x,y$) of integers such that $x^2-2xy+126y^2=2009$.