Let $I$ be the incenter and let $\Gamma$ be the incircle of $\vartriangle ABC$, and let $P = \Gamma \cap BC$. Let $Q$ denote the intersection of $\Gamma$ and the line passing through $P$ parallel to $AI$. Let $\ell$ be the tangent line to $\Gamma$ at $Q$ and let $\ell \cap AB = S$, $\ell \cap AC = R$. If $AB = 7$, $BC = 6$, $AC = 5$, what is $RS$?

In a country consisting of $2015$ cities, between any two cities there is exactly one direct round flight operated by some air company. Find the minimal possible number of air companies if direct flights between any three cities are operated by three different air companies.

Find all primes $p,q$ such that $p ^3-q^7=p-q$.

Find the largest $2$-digit number $N$ which is divisible by $4$, such that all integral powers of $N$ end with $N$.

There are $n$ guests at a gathering. Any two guests are either friends or not friends. Every guest is friends with exactly four of the other guests. Whenever a guest is not friends with two other guests, those two other guests cannot be friends with each other either. Determine all possible values of $n$.

[b]p1.[/b] A tennis net is made of strings tied up together which make a grid consisting of small squares as shown below. [img]https://cdn.artofproblemsolving.com/attachments/9/4/72077777d57408d9fff0ea5e79be5ecb6fe8c3.png[/img] The size of the net is $100\times 10$ small squares. What is the maximal number of sides of small squares which can be cut without breaking the net into two separate pieces? (The side is cut only in the middle, not at the ends). [b]p2.[/b] What number is bigger $2^{300}$ or $3^{200}$ ? [b]p3.[/b] All noble knights participating in a medieval tournament in Camelot used nicknames. In the tournament each knight had combats with all other knights. In each combat one knight won and the second one lost. At the end of tournament the losers reported their real names to the winners and to the winners of their winners. Was there a person who knew the real names of all knights? [b]p4.[/b] Two players Tom and Sid play the following game. There are two piles of rocks, $10$ rocks in the first pile and $12$ rocks in the second pile. Each of the players in his turn can take either any amount of rocks from one pile or the same amount of rocks from both piles. The winner is the player who takes the last rock. Who does win in this game if Tom starts the game? [b]p5.[/b] There is an interesting $5$-digit integer. With a $1$ after it, it is three times as large as with a $1$ before it. What is the number? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $ABCD$ be a cyclic quadrilateral. Let $E$ and $F$ be variable points on the sides $AB$ and $CD$, respectively, such that $AE:EB=CF:FD$. Let $P$ be the point on the segment $EF$ such that $PE:PF=AB:CD$. Prove that the ratio between the areas of triangles $APD$ and $BPC$ does not depend on the choice of $E$ and $F$.

Let $ABCD$ be a convex quadrilateral with $\angle{BAD} = 2\angle{BCD}$ and $AB = AD$. Let $P$ be a point such that $ABCP$ is a parallelogram. Prove that $CP = DP$.

There are $100$ members in a ladies' club.Each lady has had tea (in private) with exactly $56$ of her lady friends.The Board,consisting of the $50$ most distinguished ladies,have all had tea with one another.Prove that the entire club may be split into two groups in such a way that,with in each group,any lady has had tea with any other.

Let $a \in \mathbb{R}$ be a parameter. (1) Prove that the curves of $y = x^2 + (a + 2)x - 2a + 1$ pass through a fixed point; also, the vertices of these parabolas all lie on the curve of a certain parabola. (2) If the function $x^2 + (a + 2)x - 2a + 1 = 0$ has two distinct real roots, find the value range of the larger root.

Let $P$ be a point inside isosceles trapezoid $ABCD$ with $AB \parallel CD$ such that $$\angle{PAD}=\angle{PDA}=90^\circ-\angle{BPC}.$$ If $PA=14, AB=18,$ and $CD=28,$ compute the area of $ABCD.$

Consider a cube with a fly standing at each of its vertices. When a whistle blows, each fly moves to a vertex in the same face as the previous one but diagonally opposite to it. After the whistle blows, in how many ways can the flies change position so that there is no vertex with 2 or more flies?

A board game spinner is divided into three regions labeled $A$, $B$ and $C$. The probability of the arrow stopping on region $A$ is $\frac{1}{3}$ and on region $B$ is $\frac{1}{2}$. The probability of the arrow stopping on region $C$ is: $\text{(A)}\ \frac{1}{12} \qquad \text{(B)}\ \frac{1}{6} \qquad \text{(C)}\ \frac{1}{5} \qquad \text{(D)}\ \frac{1}{3} \qquad \text{(E)}\ \frac{2}{5}$

How many different remainders can result when the $100$th power of an integer is divided by $125$? $ \textbf{(A) }1 \qquad \textbf{(B) }2 \qquad \textbf{(C) }5 \qquad \textbf{(D) }25 \qquad \textbf{(E) }125 \qquad $

Let $F_0 = 0, F_1 = 1$ and $F_{n+1} = F_n + F_{n-1}$, for all positive integer $n$, be the Fibonacci sequence. Prove that for any positive integer $m$ there exist infinitely many positive integers $n$ such that $F_n + 2 \equiv F_{n+1} + 1 \equiv F_{n+2}$ mod $m$ .

Let $C$ consist of a regular polygon and its interior. Show that for each positive integer $n$, there exists a set of points $S(n)$ in the plane such that every $n$ points can be covered by $C$, but $S(n)$ cannot be covered by $C.$

Let $D$, $E$, $F$ be the midpoints of the arcs $BC$, $CA$, $AB$ on the circumcircle of a triangle $ABC$ not containing the points $A$, $B$, $C$, respectively. Let the line $DE$ meets $BC$ and $CA$ at $G$ and $H$, and let $M$ be the midpoint of the segment $GH$. Let the line $FD$ meet $BC$ and $AB$ at $K$ and $J$, and let $N$ be the midpoint of the segment $KJ$. a) Find the angles of triangle $DMN$; b) Prove that if $P$ is the point of intersection of the lines $AD$ and $EF$, then the circumcenter of triangle $DMN$ lies on the circumcircle of triangle $PMN$.

Let $v$ and $w$ be distinct, randomly chosen roots of the equation $z^{1997}-1=0.$ Let $m/n$ be the probability that $\sqrt{2+\sqrt{3}}\le |v+w|,$ where $m$ and $n$ are relatively prime positive integers. Find $m+n.$

The incircle of triangle $ABC$ touches the sides in $X$, $Y$ and $Z$. In triangle $XYZ$ the feet of the altitude from $X$ and $Y$ are $X'$ and $Y'$, respectively. Let line $X'Y'$ intersect the circumcircle of triangle $ABC$ at $P$ and $Q$. Prove that points $X$, $Y$, $P$ and $Q$ are concyclic. Proposed by [i]László Simon[/i], Budapest

$\triangle{ABC}$ is isosceles with $AB = AC >BC$. Let $D$ be a point in its interior such that $DA = DB+DC$. Suppose that the perpendicular bisector of $AB$ meets the external angle bisector of $\angle{ADB}$ at $P$, and let $Q$ be the intersection of the perpendicular bisector of $AC$ and the external angle bisector of $\angle{ADC}$. Prove that $B,C,P,Q$ are concyclic.

Dragon selects three positive real numbers with sum $100$, uniformly at random. He asks Cat to copy them down, but Cat gets lazy and rounds them all to the nearest tenth during transcription. If the probability the three new numbers still sum to $100$ is $\tfrac{m}{n}$, where $m$ and $n$ are relatively prime positive integers, compute $100m+n$. [i]Proposed by Aaron Lin[/i]

John and James wish to divide $25$ coins, of denominations $1, 2, 3, \ldots , 25$ kopeks. In each move, one of them chooses a coin, and the other player decides who must take this coin. John makes the initial choice of a coin, and in subsequent moves, the choice is made by the player having more kopeks at the time. In the event that there is a tie, the choice is made by the same player in the preceding move. After all the coins have been taken, the player with more kokeps wins. Which player has a winning strategy? [i](6 points)[/i]

Consider the $ \mathbb {Z} / (10) $ additive group automorphism group of integers module $10$, that is, $ A = \left \{\phi: \mathbb {Z} / (10) \to \mathbb {Z} / (10) | \phi-automorphism \right \}$

Let $a, b$ and $c$ be positive integers such that $1 < a < b < c$. Suppose that $(ab-l)(bc-1 )(ca-1)$ is divisible by $abc$. Find the values of $a, b$ and $c$. Justify your answer.

Do there exist integers $x$ and $y$ such that $19^{19} = x^3 +y^4$ ? Justify your answer.