On $\triangle ABC$, let $M$ the midpoint of $AB$ and $N$ the midpoint of $CM$. Let $X$ a point such that $\angle XMC=\angle MBC$ and $\angle XCM=\angle MCB$ with $X,B$ in opposite sides of line $CM$. Let $\Omega$ the circumcircle of triangle $\triangle AMX$ [b]a)[/b] Show that $CM$ is tangent to $\Omega$ [b]b)[/b] Show that the lines $NX$ and $AC$ meet at $\Omega$

Find all pairs of integers $ (x,y)$ satisfying $ 1\plus{}1996x\plus{}1998y\equal{}xy.$

$ 100\times 19.98\times 1.998\times 1000\equal{} $ $ \text{(A)}\ (1.998)^{2}\qquad\text{(B)}\ (19.98)^{2}\qquad\text{(C)}\ (199.8)^{2}\qquad\text{(D)}\ (1998)^{2}\qquad\text{(E)}\ (19980)^{2} $

Consider a regular 2n-gon $ P$,$A_1,A_2,\cdots ,A_{2n}$ in the plane ,where $n$ is a positive integer . We say that a point $S$ on one of the sides of $P$ can be seen from a point $E$ that is external to $P$ , if the line segment $SE$ contains no other points that lie on the sides of $P$ except $S$ .We color the sides of $P$ in 3 different colors (ignore the vertices of $P$,we consider them colorless), such that every side is colored in exactly one color, and each color is used at least once . Moreover ,from every point in the plane external to $P$ , points of most 2 different colors on $P$ can be seen .Find the number of distinct such colorings of $P$ (two colorings are considered distinct if at least one of sides is colored differently). [i]Proposed by Viktor Simjanoski, Macedonia[/i] JBMO 2017, Q4

The kingdom of Anisotropy consists of $n$ cities. For every two cities there exists exactly one direct one-way road between them. We say that a [i]path from $X$ to $Y$[/i] is a sequence of roads such that one can move from $X$ to $Y$ along this sequence without returning to an already visited city. A collection of paths is called [i]diverse[/i] if no road belongs to two or more paths in the collection. Let $A$ and $B$ be two distinct cities in Anisotropy. Let $N_{AB}$ denote the maximal number of paths in a diverse collection of paths from $A$ to $B$. Similarly, let $N_{BA}$ denote the maximal number of paths in a diverse collection of paths from $B$ to $A$. Prove that the equality $N_{AB} = N_{BA}$ holds if and only if the number of roads going out from $A$ is the same as the number of roads going out from $B$. [i]Proposed by Warut Suksompong, Thailand[/i]

Let $ ABC $ be a triangle and let $ AD, BE, CF $ be cevians of the triangle which are concurrent at $ G $. Prove that if $ CF \cdot BE \ge AF \cdot EC + AE \cdot BF + BC \cdot FE $ then $ AG \le GD $.

Let $a,b\in\mathbb{R},~a>1,~b>0.$ Find the least possible value for $\alpha$ such that :$$(a+b)^x\geq a^x+b,~(\forall)x\geq\alpha.$$

Let $ ABCD$ be a unit square (that is, the labels $ A, B, C, D$ appear in that order around the square). Let $ X$ be a point outside of the square such that the distance from $ X$ to $ AC$ is equal to the distance from $ X$ to $ BD$, and also that $ AX \equal{} \frac {\sqrt {2}}{2}$. Determine the value of $ CX^2$.

Let $a, b_1, b_2, \dots, b_n, c_1, c_2, \dots, c_n$ be real numbers such that \[x^{2n} + ax^{2n - 1} + ax^{2n - 2} + \dots + ax + 1 = \prod_{i = 1}^{n}{(x^2 + b_ix + c_i)}\] Prove that $c_1 = c_2 = \dots = c_n = 1$. As a consequence, all complex zeroes of this polynomial must lie on the unit circle.

A regular hexagon is inscribed in a circle of radius $1$, and all diagonals between vertices that have exactly one vertex between them are drawn. Compute the area of the hexagon enclosed by all of the diagonals.

Let $a$ be a real number. Suppose the function $f(x) = \frac{a}{x-1} + \frac{1}{x-2} + \frac{1}{x-6}$ defined in the interval $3 < x < 5$ attains its maximum at $x=4$. Find the value of $a.$

Sonia has $10$, $15$ and $20$ cent stamps with total face value of $\$5$. She has $30$ stamps altogether. Prove that she has more $20$ cent stamps than $10$ cent stamps.

Let n be a positive integer. Find all complex numbers $x_{1}$, $x_{2}$, ..., $x_{n}$ satisfying the following system of equations: $x_{1}+2x_{2}+...+nx_{n}=0$, $x_{1}^{2}+2x_{2}^{2}+...+nx_{n}^{2}=0$, ... $x_{1}^{n}+2x_{2}^{n}+...+nx_{n}^{n}=0$.

Find all functions $f:\mathbb{N} \rightarrow \mathbb{N}$, such that $f(a)+f(b)+ab \mid a^2f(a)+b^2f(b)+f(a)f(b)$ for all positive integers $a,b$.

A quadruple $(p, a, b, c)$ of positive integers is called a Leiden quadruple if - $p$ is an odd prime number, - $a, b$, and $c$ are distinct and - $ab + 1, bc + 1$ and $ca + 1$ are divisible by $p$. a) Prove that for every Leiden quadruple $(p, a, b, c)$ we have $p + 2 \le \frac{a+b+c}{3}$ . b) Determine all numbers $p$ for which a Leiden quadruple $(p, a, b, c)$ exists with $p + 2 = \frac{a+b+c}{3} $

A $2 \times 2$ square was cut out of a sheet of grid paper. Using only a ruler without divisions and without going beyond the square, divide the diagonal of the square into $6$ equal parts.

$ABCD$ is a parallelogram. $K$ is the circumcircle of $ABD$. The lines $BC$ and $CD$ meet $K$ again at $E$ and $F$. Show that the circumcenter of $CEF$ lies on $K$.

Find the formula for the general term of the sequence an, for which $a_1 = 1$, $a_2 = 3$, $a_{n+1} = 3a_n-2a_{n-1}$ (you need to express an in terms of $n$).

A disk with radius $10$ and a disk with radius $8$ are drawn so that the distance between their centers is $3$. Two congruent small circles lie in the intersection of the two disks so that they are tangent to each other and to each of the larger circles as shown. The radii of the smaller circles are both $\tfrac{m}{n}$ where $m$ and $n$ are relatively prime positive integers. Find $m + n$. [asy] size(150); defaultpen(linewidth(1)); draw(circle(origin,10)^^circle((3,0),8)^^circle((5,15/4),15/4)^^circle((5,-15/4),15/4)); [/asy]

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.