For each $m\in \mathbb N$ we define $rad\ (m)=\prod p_i$, where $m=\prod p_i^{\alpha_i}$. [b]abc Conjecture[/b] Suppose $\epsilon >0$ is an arbitrary number, then there exist $K$ depinding on $\epsilon$ that for each 3 numbers $a,b,c\in\mathbb Z$ that $gcd (a,b)=1$ and $a+b=c$ then: \[ max\{|a|,|b|,|c|\}\leq K(rad\ (abc))^{1+\epsilon} \] Now prove each of the following statements by using the $abc$ conjecture : a) Fermat's last theorem for $n>N$ where $N$ is some natural number. b) We call $n=\prod p_i^{\alpha_i}$ strong if and only $\alpha_i\geq 2$. c) Prove that there are finitely many $n$ such that $n,\ n+1,\ n+2$ are strong. d) Prove that there are finitely many rational numbers $\frac pq$ such that: \[ \Big| \sqrt[3]{2}-\frac pq \Big|<\frac{2^ {1384}}{q^3} \]

Let D be an arbitrary point inside $\Delta ABC$. Let $\Gamma$ be the circumcircle of $\Delta BCD$. The external angle bisector of $\angle ABC$ meets $\Gamma$ again at $E$. The external angle bisector of $\angle ACB$ meets $\Gamma$ again at $F$. The line $EF$ meets the extension of $AB$ and $AC$ at $P$ and $Q$ respectively. Prove that the circumcircles of $\Delta BFP$ and $\Delta CEQ$ always pass through the same fixed point regardless of the position of $D$. (Assume all the labelled points are distinct.)

Given several nonnegative integers (repetitions allowed), the allowed operation is to choose a positive integer $a$ and replace each number $b$ greater than or equal to $a$ by $b-a$ (the numbers $a$ , if any, are replaced by $0$). Initially, the integers from $1$ are written on the blackboard until $2013$ inclusive. After a few operations the numbers on the board have a sum equal to $10$. Determine what the numbers that remained on the board could be. Find all the possibilities.

The area of polygon $ ABCDEF$ is 52 with $ AB\equal{}8$, $ BC\equal{}9$ and $ FA\equal{}5$. What is $ DE\plus{}EF$? [asy]defaultpen(linewidth(0.8));pair a=(0,9), b=(8,9), c=(8,0), d=(4,0), e=(4,4), f=(0,4); draw(a--b--c--d--e--f--cycle); draw(shift(0,-.25)*a--shift(.25,-.25)*a--shift(.25,0)*a); draw(shift(-.25,0)*b--shift(-.25,-.25)*b--shift(0,-.25)*b); draw(shift(-.25,0)*c--shift(-.25,.25)*c--shift(0,.25)*c); draw(shift(.25,0)*d--shift(.25,.25)*d--shift(0,.25)*d); draw(shift(.25,0)*f--shift(.25,.25)*f--shift(0,.25)*f); label("$A$", a, NW); label("$B$", b, NE); label("$C$", c, SE); label("$D$", d, SW); label("$E$", e, SW); label("$F$", f, SW); label("5", (0,6.5), W); label("8", (4,9), N); label("9", (8, 4.5), E);[/asy] $ \textbf{(A)}\ 7\qquad\textbf{(B)}\ 8\qquad\textbf{(C)}\ 9\qquad\textbf{(D)}\ 10\qquad\textbf{(E)}\ 11 $

If $x^2-5x+6<0$ and $P=x^2+5x+6$ then $\textbf{(A)}\ P \; \text{can take any real value} \qquad \textbf{(B)}\ 20<P<30\\ \textbf{(C)}\ 0<P<20 \qquad \textbf{(D)}\ P<0 \qquad \textbf{(E)}\ P>30$

Let $\alpha,\beta,\gamma$ measures of angles of opposite to the sides of triangle with measures $a,b,c$ respectively.Prove that $$2(cos^2\alpha+cos^2\beta+cos^2\gamma)\geq \frac{a^2}{b^2+c^2}+\frac{b^2}{a^2+c^2}+\frac{c^2}{a^2+b^2}$$

Andy has $4$ coins $c_1, c_2, c_3, c_4$ such that the probability that coin $c_i$ with $1 \leq i \leq 4$ lands tails is $\frac{1}{2^i}$. Andy flips each coin exactly once. The probability that only one coin lands on heads can be expressed as $\frac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$. [i]Proposed by Anthony Yang[/i]

A figure consisting of five equal-sized squares is placed as shown in a rectangle of size $7\times 8$ units. Find the side length of the squares. [img]https://cdn.artofproblemsolving.com/attachments/e/e/cbc2b7b0693949790c1958fb1449bdd15393d8.png[/img]

The Fibonacci sequence is defined by $ F_1 \equal{} F_2 \equal{} 1$ and $ F_{n\plus{}1} \equal{} F_n \plus{}F_{n\minus{}1}$ for $ n > 1$. Let $ f(x) \equal{} 1985x^2 \plus{} 1956x \plus{} 1960$. Prove that there exist infinitely many natural numbers $ n$ for which $ f(F_n)$ is divisible by $ 1989$. Does there exist $ n$ for which $ f(F_n) \plus{} 2$ is divisible by $ 1989$?

Initially numbers from 1 to 1000000 are all colored black. A move consists of picking one number, then change the color (black to white or white to black) of itself and all other numbers NOT coprime with the chosen number. Can all numbers become white after finite numbers of moves? Edited by pbornsztein

Prove that there are no $2003$ odd positive integers whose product equals their sum. Is the previous proposition true for $2001$ odd positive integers?

The $27$ cells of a $3 \times 9$ grid are filled in using the numbers $1$ through $9$ so that each row contains $9$ different numbers, and each of the three $3 \times 3$ blocks heavily outlined in the example below contains $9$ different numbers, as in the first three rows of a Sudoku puzzle. [asy] unitsize(20); add(grid(9,3)); draw((0,0)--(9,0)--(9,3)--(0,3)--cycle, linewidth(2)); draw((3,0)--(3,3), linewidth(2)); draw((6,0)--(6,3), linewidth(2)); real a = 0.5; label("5",(a,a)); label("6",(1+a,a)); label("1",(2+a,a)); label("8",(3+a,a)); label("4",(4+a,a)); label("7",(5+a,a)); label("9",(6+a,a)); label("2",(7+a,a)); label("3",(8+a,a)); label("3",(a,1+a)); label("7",(1+a,1+a)); label("9",(2+a,1+a)); label("5",(3+a,1+a)); label("2",(4+a,1+a)); label("1",(5+a,1+a)); label("6",(6+a,1+a)); label("8",(7+a,1+a)); label("4",(8+a,1+a)); label("4",(a,2+a)); label("2",(1+a,2+a)); label("8",(2+a,2+a)); label("9",(3+a,2+a)); label("6",(4+a,2+a)); label("3",(5+a,2+a)); label("1",(6+a,2+a)); label("7",(7+a,2+a)); label("5",(8+a,2+a)); [/asy] The number of different ways to fill such a grid can be written as $p^a \cdot q^b \cdot r^c \cdot s^d$ where $p$, $q$, $r$, and $s$ are distinct prime numbers and $a$, $b$, $c$, $d$ are positive integers. Find $p \cdot a + q \cdot b + r \cdot c + s \cdot d$.

Let $x_1 \dots, x_{42}$, be real numbers such that $5x_{i+1}-x_i-3x_ix_{i+1}=1$ for each $1 \le i \le 42$, with $x_1=x_{43}$. Find all the product of all possible values for $x_1 + x_2 + \dots + x_{42}$. [i] Proposed by Michael Ma [/i]

Find all the solutions of the system $$\begin{cases} y^2 = x^3 - 3x^2 + 2x \\ x^2 = y^3 - 3y^2 + 2y \end{cases}$$

There are $2016$ costumers who entered a shop on a particular day. Every customer entered the shop exactly once. (i.e. the customer entered the shop, stayed there for some time and then left the shop without returning back.) Find the maximal $k$ such that the following holds: There are $k$ customers such that either all of them were in the shop at a specic time instance or no two of them were both in the shop at any time instance.

$$F(x)=x^{6}+15x^{5}+85x^{4}+225x^{3}+274x^{2}+120x+1$$

Let $ ABC$ be a triangle with circumradius $ R$, perimeter $ P$ and area $ K$. Determine the maximum value of: $ \frac{KP}{R^3}$.

Find a $7$-digit integer divisible by $128$, whose decimal representation contains only the digits $2$ and $3$.

If we divide number $1^{1990}+2^{1990}+3^{1990}+...+1990^{1990}$ with $10$, what remainder will we find?

Let $ ABC$ be a triangle with $ \angle ABC\equal{}\angle ACB\equal{}70^{\circ}$. Let point $ D$ on side $ BC$ such that $ AD$ is the altitude, point $ E$ on side $ AB$ such that $ \angle ACE\equal{}10^{\circ}$, and point $ F$ is the intersection of $ AD$ and $ CE$. Prove that $ CF\equal{}BC$.

Find the largest positive integer $n$ such that $n^3 + 4n^2 - 15n - 18$ is the cube of an integer.

How many primes $p$ are there such that the number of positive divisors of $p^2+23$ is equal to $14$? $ \textbf{(A)}\ 0 \qquad\textbf{(B)}\ 1 \qquad\textbf{(C)}\ 2 \qquad\textbf{(D)}\ 3 \qquad\textbf{(E)}\ \text{None of above} $

Alice and Bob take turns taking balloons from a box containing infinitely many balloons. In the first turn, Alice takes $k_1$ amount of balloons, where $\gcd(30;k_1)\neq1$. Then, on his first turn, Bob takes $k_2$ amount of ballons where $k_1<k_2<2k_1$. After first turn, Alice and Bob alternately takes as many balloons as his/her partner has. Is it possible for Bob to take $k_2$ amount of balloons at first, such that after a finite amount of turns, one of them have a number of balloons that is a multiple of $2025^{2025}$?

For each $ k\in\mathbb{N} ,k\le 2000, $ Let $ r_k $ be the remainder of the division of $ k $ by $ 4, $ and $ r'_k $ be the remainder of the division of $ k $ by $ 3. $ Prove that there is an unique $ m\in\mathbb{N} ,m\le 1999 $ such that $$ r_1+r_2+\cdots +r_m=r'_{m+1} +r'_{m+2} +\cdots r'_{2000} . $$ [i]Mircea Fianu[/i]

Find the maximum and minimum areas of the region enclosed by the curve $y=|x|e^{|x|}$ and the line $y=a\ (0\leq a\leq e)$ at $[-1,\ 1]$.