Let $AL$ and $BK$ be angle bisectors in the non-isosceles triangle $ABC$ ($L$ lies on the side $BC$, $K$ lies on the side $AC$). The perpendicular bisector of $BK$ intersects the line $AL$ at point $M$. Point $N$ lies on the line $BK$ such that $LN$ is parallel to $MK$. Prove that $LN = NA$.

Let $AC$ be a diameter of a circle $ \omega $ of radius $1$, and let $D$ be a point on $AC$ such that $CD=\frac{1}{5}$. Let $B$ be the point on $\omega$ such that $DB$ is perpendicular to $AC$, and $E$ is the midpoint of $DB$. The line tangent to $\omega$ at $B$ intersects line $CE$ at the point $X$. Compute $AX$.

Prove that for all positive, entirely rational numbers $a$ and $b$ always holds $$\frac{a + b}{2} \ge \sqrt[a+b]{a^b \cdot b^a}.$$ When does the equal sign hold?

Let $ABCD$ be a cyclic quadrilateral, let the angle bisectors at $A$ and $B$ meet at $E$, and let the line through $E$ parallel to side $CD$ intersect $AD$ at $L$ and $BC$ at $M$. Prove that $LA + MB = LM$.

[b]p1.[/b] Let $D(n)$ denote the number of positive factors of the integer $n$. For example, $D(6) = 4$ , since the factors of $6$ are $1, 2, 3$ , and $6$ . Note that $D(n) = 2$ if and only if $n$ is a prime number. (a) Describe the set of all solutions to the equation $D(n) = 5$ . (b) Describe the set of all solutions to the equation $D(n) = 6$ . (c) Find the smallest $n$ such that $D(n) = 21$ . [b]p2.[/b] At a party with $n$ married couples present (and no one else), various people shook hands with various other people. Assume that no one shook hands with his or her spouse, and no one shook hands with the same person more than once. At the end of the evening Mr. Jones asked everyone else, including his wife, how many hands he or she had shaken. To his surprise, he got a different answer from each person. Determine the number of hands that Mr. Jones shook that evening, (a) if $n = 2$ . (b) if $n = 3$ . (c) if $n$ is an arbitrary positive integer (the answer may depend on $n$). [b]p3.[/b] Let $n$ be a positive integer. A square is divided into triangles in the following way. A line is drawn from one corner of the square to each of $n$ points along each of the opposite two sides, forming $2n + 2$ nonoverlapping triangles, one of which has a vertex at the opposite corner and the other $2n + 1$ of which have a vertex at the original corner. The figure shows the situation for $n = 2$ . Assume that each of the $2n + 1$ triangles with a vertex in the original corner has area $1$. Determine the area of the square, (a) if $n = 1$ . (b) if $n$ is an arbitrary positive integer (the answer may depend on $n$). [img]https://cdn.artofproblemsolving.com/attachments/1/1/62a54011163cc76cc8d74c73ac9f74420e1b37.png[/img] [b]p4.[/b] Arthur and Betty play a game with the following rules. Initially there are one or more piles of stones, each pile containing one or more stones. A legal move consists either of removing one or more stones from one of the piles, or, if there are at least two piles, combining two piles into one (but not removing any stones). Arthur goes first, and play alternates until a player cannot make a legal move; the player who cannot move loses. (a) Determine who will win the game if initially there are two piles, each with one stone, assuming that both players play optimally. (b) Determine who will win the game if initially there are two piles, each with $n$ stones, assuming that both players play optimally; $n$ is a positive integer, and the answer may depend on $n$ . (c) Determine who will win the game if initially there are $n$ piles, each with one stone, assuming that both players play optimally; $n$ is a positive integer, and the answer may depend on $n$ . [b]p5.[/b] Suppose $x$ and $y$ are real numbers such that $0 < x < y$. Define a sequence$ A_0 , A_1 , A_2, A_3, ...$ by-setting $A_0 = x$ , $A_1 = y$ , and then $A_n= |A_{n-1}| - A_{n-2}$ for each $n \ge 2$ (recall that $|A_{n-1}|$ means the absolute value of $A_{n-1}$ ). (a) Find all possible values for $A_6$ in terms of $x$ and $y$ . (b) Find values of $x$ and $y$ so that $A_{1987} = 1987$ and $A_{1988} = -1988$ (simultaneously). PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Find all positive integers $a, b, c, d,$ and $n$ satisfying $n^a + n^b + n^c = n^d$ and prove that these are the only such solutions.

Which is the least positive integer $n$ for which it is possible to find a (non-degenerate) $n$-gon with sidelengths $1, 2,. . . , n$, and where all vertices have integer coordinates?

Let $\triangle ABC$ be a scalene triangle, and let $D$ and $E$ be points on sides $AB$ and $AC$ respectively such that the circumcircles of triangles $\triangle ACD$ and $\triangle ABE$ are tangent to $BC$. Let $F$ be the intersection point of $BC$ and $DE$. Prove that $AF$ is perpendicular to the Euler line of $\triangle ABC$.

Find the remainder upon division by $x^2-1$ of the determinant  $$\begin{vmatrix} x^3+3x & 2 & 1 & 0 \\ x^2+5x & 3 & 0 & 2 \\x^4 +x^2+1 & 2 & 1 & 3 \\x^5 +1 & 1 & 2 & 3 \\ \end{vmatrix}$$

Let $a$ and $b$ be positive integers such that $a! + b!$ divides $a!b!$. Prove that $3a \ge 2b + 2$.

Let $ x$, $ y$ be two integers with $ 2\le x, y\le 100$. Prove that $ x^{2^n} \plus{} y^{2^n}$ is not a prime for some positive integer $ n$.

[b]Problem Section #4 b) Let $A$ be a unit square. What is the largest area of a triangle whose vertices lie on the perimeter of $A$? Justify your answer.

If $x,y,z,p,q,r$ are real numbers such that \[\frac{1}{x+p}+\frac{1}{y+p}+\frac{1}{z+p}=\frac{1}{p}\]\[\frac{1}{x+q}+\frac{1}{y+q}+\frac{1}{z+q}=\frac{1}{q}\]\[\frac{1}{x+r}+\frac{1}{y+r}+\frac{1}{z+r}=\frac{1}{r}.\]Find the numerical value of $\frac{1}{p}+\frac{1}{q}+\frac{1}{r}$.

\[\lim_{n\to\infty} n^2 \int_0^1 x^n e^{-x}\log(x)\,\mathrm dx\] [i]Proposed by Connor Gordon and Vlad Oleksenko[/i]

A traveler arrived to an island where 50 natives lived. All the natives stood in a circle and each announced firstly the age of his left neighbour, then the age of his right neighbour. Each native is either a knight who told both numbers correctly or a knave who increased one of the numbers by 1 and decreased the other by 1 (on his choice). Is it always possible after that to establish which of the natives are knights and which are knaves? [i]Alexandr Gribalko[/i]

Given that $x_1+x_2+x_3=y_1+y_2+y_3=x_1y_1+x_2y_2+x_3y_3=0,$ prove that: \[ \frac{x_1^2}{x_1^2+x_2^2+x_3^2}+\frac{y_1^2}{y_1^2+y_2^2+y_3^2}=\frac{2}{3}\]

Determine all pairs $(x, y)$ of integers such that \[1+2^{x}+2^{2x+1}= y^{2}.\]

Let $ABC$ a triangle with circumcircle $\Gamma$ and $R$ a point inside $ABC$ such that $\angle ABR=\angle RBC$. Let $\Gamma_1$ and $\Gamma_2$ the circumcircles of triangles $ARB$ and $CRB$ respectly. The parallel to $AC$ that pass through $R$, intersect $\Gamma$ in $D$ and $E$, with $D$ on the same side of $BR$ that $A$ and $E$ on the same side of $BR$ that $C$. $AD$ intersect $\Gamma_1$ in $P$ and $CE$ intersect $\Gamma_2$ in $Q$. Prove that $APQC$ is cyclic if and only if $AB=BC$

Let $ABC$ be a triangle and $A_1, B_1, C_1$ points on $BC, CA, AB$, respectively, such that the lines $AA_1, BB_1, CC_1$ meet at a single point. It is known that $A, B_1, A_1, B$ are concyclic and $B, C_1, B_1, C$ are concyclic. Prove that a) $C, A_1, C_1, A$ are concyclic, b) $AA_1,, BB_1, CC_1$ are the heights of $ABC$.

Find the 2000th positive integer that is not the difference between any two integer squares.

[hide=Intro]The answers to each of the ten questions in this section are integers containing only the digits $ 1$ through $ 8$, inclusive. Each answer can be written into the grid on the answer sheet, starting from the cell with the problem number, and continuing across or down until the entire answer has been written. Answers may cross dark lines. If the answers are correctly filled in, it will be uniquely possible to write an integer from $ 1$ to $ 8$ in every cell of the grid, so that each number will appear exactly once in every row, every column, and every marked $2$ by $4$ box. You will get $7$ points for every correctly filled answer, and a $15$ point bonus for filling in every gridcell. It will help to work back and forth between the grid and the problems, although every problem is uniquely solvable on its own. Please write clearly within the boxes. No points will be given for a cell without a number, with multiple numbers, or with illegible handwriting.[/hide] [img]https://cdn.artofproblemsolving.com/attachments/9/b/f4db097a9e3c2602b8608be64f06498bd9d58c.png[/img] [b]1 ACROSS:[/b] Jack puts $ 10$ red marbles, $ 8$ green marbles and 4 blue marbles in a bag. If he takes out $11$ marbles, what is the expected number of green marbles taken out? [b]2 DOWN:[/b] What is the closest integer to $6\sqrt{35}$ ? [b]3 ACROSS: [/b]Alan writes the numbers $ 1$ to $64$ in binary on a piece of paper without leading zeroes. How many more times will he have written the digit $ 1$ than the digit $0$? [b]4 ACROSS:[/b] Integers a and b are chosen such that $-50 < a, b \le 50$. How many ordered pairs $(a, b)$ satisfy the below equation? $$(a + b + 2)(a + 2b + 1) = b$$ [b]5 DOWN: [/b]Zach writes the numbers $ 1$ through $64$ in binary on a piece of paper without leading zeroes. How many times will he have written the two-digit sequence “$10$”? [b]6 ACROSS:[/b] If you are in a car that travels at $60$ miles per hour, $\$1$ is worth $121$ yen, there are $8$ pints in a gallon, your car gets $10$ miles per gallon, a cup of coffee is worth $\$2$, there are 2 cups in a pint, a gallon of gas costs $\$1.50$, 1 mile is about $1.6$ kilometers, and you are going to a coffee shop 32 kilometers away for a gallon of coffee, how much, in yen, will it cost? [b]7 DOWN:[/b] Clive randomly orders the letters of “MIXING THE LETTERS, MAN”. If $\frac{p}{m^nq}$ is the probability that he gets “LMT IS AN EXTREME THING” where p and q are odd integers, and $m$ is a prime number, then what is $m + n$? [b]8 ACROSS:[/b] Joe is playing darts. A dartboard has scores of $10, 7$, and $4$ on it. If Joe can throw $12$ darts, how many possible scores can he end up with? [b]9 ACROSS:[/b] What is the maximum number of bounded regions that $6$ overlapping ellipses can cut the plane into? [b]10 DOWN:[/b] Let $ABC$ be an equilateral triangle, such that $A$ and $B$ both lie on a unit circle with center $O$. What is the maximum distance between $O$ and $C$? Write your answer be in the form $\frac{a\sqrt{b}}{c}$ where $b$ is not divisible by the square of any prime, and $a$ and $c$ share no common factor. What is $abc$ ? PS. You had better use hide for answers.

Let $ a $ and $ b $ be natural numbers with property $ gcd(a,b)=1 $ . Find the least natural number $ k $ such that for every natural number $ r \ge k $ , there exist natural numbers $ m,n >1 $ in such a way that the number $ m^a n^b $ has exactly $ r+1 $ positive divisors.

A ring is of the shape of a hoola-hoop of negligible thickness. A ring of radius $R$ carries a current $I$. Prove that the magnetic field at a given point in the plane of the ring at a distance $a$ from the center, due to the magnetic field of the ring, is \[ B = \dfrac {\mu_0}{2\pi} \cdot IR \cdot \displaystyle\int_{0}^{\pi} \dfrac {R - a \cos \theta}{\sqrt{\left( a^2 + R^2 - 2aR \cos \theta \right)^3}} \, \mathrm{d}\theta. \] [i]Problem proposed by Ahaan Rungta[/i]

Let $S = \left\{ 1,2, \dots, 2014 \right\}$. Suppose that \[ \sum_{T \subseteq S} i^{\left\lvert T \right\rvert} = p + qi \] where $p$ and $q$ are integers, $i = \sqrt{-1}$, and the summation runs over all $2^{2014}$ subsets of $S$. Find the remainder when $\left\lvert p\right\rvert + \left\lvert q \right\rvert$ is divided by $1000$. (Here $\left\lvert X \right\rvert$ denotes the number of elements in a set $X$.) [i]Proposed by David Altizio[/i]

Let $S_n $ be sum of squares of the coefficient of the polynomial $(1+x)^n$. Prove that $S_{2n} +1$ is not divisible by $3.$