There are relatively prime positive integers $m$ and $n$ so that \[\dfrac{\dfrac{1}{2}}{\dfrac{\dfrac{1}{3}}{\dfrac{1}{4}+\dfrac{1}{4}+\dfrac{1}{4}}+\dfrac{\dfrac{1}{3}}{\dfrac{1}{4}+\dfrac{1}{4}+\dfrac{1}{4}}}=\dfrac{m}{n}.\]Find $m+2n$.

Show that $n!=a^{n-1}+b^{n-1}+c^{n-1}$ has only finitely many solutions in positive integers. [i]Proposed by Dorlir Ahmeti, Albania[/i]

There are three bags of marbles. Bag two has twice as many marbles as bag one. Bag three has three times as many marbles as bag one. Half the marbles in bag one, one third the marbles in bag two, and one fourth the marbles in bag three are green. If all three bags of marbles are dumped into a single pile, $\frac{m}{n}$ of the marbles in the pile would be green where $m$ and $n$ are relatively prime positive integers. Find $m + n.$

$ABCD$ is a tetrahedron such that we can find a sphere $k(A,B,C)$ through $A, B, C$ which meets the plane $BCD$ in the circle diameter $BC$, meets the plane $ACD$ in the circle diameter $AC$, and meets the plane $ABD$ in the circle diameter $AB$. Show that there exist spheres $k(A,B,D)$, $k(B,C,D)$ and $k(C,A,D)$ with analogous properties.

Find the pairs of integers $(a, b)$ such that $a^2 + 2b^2 + 2a +1$ is a divisor of $2ab$.

Infinitely many equidistant parallel lines are drawn in the plane. A positive integer $n \geqslant 3$ is called frameable if it is possible to draw a regular polygon with $n$ sides all whose vertices lie on these lines, and no line contains more than one vertex of the polygon. (a) Show that $3, 4, 6$ are frameable. (b) Show that any integer $n \geqslant 7$ is not frameable. (c) Determine whether $5$ is frameable. [i]Proposed by Muralidharan[/i]

Consider the sequences $(a_n), (b_n)$ defined by \[a_1=3, \quad b_1=100 , \quad a_{n+1}=3^{a_n} , \quad b_{n+1}=100^{b_n} \] Find the smallest integer $m$ for which $b_m > a_{100}.$

There are $2019$ coins on a table. Some are placed with head up and others tail up. A group of $2019$ persons perform the following operations: the first person chooses any one coin and then turns it over, the second person choses any two coins and turns them over and so on and the $2019$-th person turns over all the coins. Prove that no matter which sides the coins are up initially, the $2019$ persons can come up with a procedure for turning the coins such that all the coins have smae side up at the end of the operations.

Let $ABCD$ be a convex quadrilateral with the line $CD$ being tangent to the circle on diameter $AB$. Prove that the line $AB$ is tangent to the circle on diameter $CD$ if and only if the lines $BC$ and $AD$ are parallel.

Let $a\geq b\geq c\geq 0$ are real numbers such that $a+b+c=3$. Prove that $ab^{2}+bc^{2}+ca^{2}\leq\frac{27}{8}$ and find cases of equality.

Let $N_3$ be the answer to problem 3. Compute the sum of all real solutions $x$ to the equation \[ 50^x+72^x+(N_3)^x=800^x. \]

In a triangle $ABC$, let $D$ be the point on the segment $BC$ such that $AB+BD=AC+CD$. Suppose that the points $B$, $C$ and the centroids of triangles $ABD$ and $ACD$ lie on a circle. Prove that $AB=AC$.

Find $\lim_{n\to\infty} \int_0^{\pi} e^{x}|\sin nx|dx.$

On a $5\times 5$ chessboard, two players play the following game: The first player places a knight on some square. Then the players alternately move the knight according to the rules of chess, starting with the second player. It is not allowed to move the knight to a square that was visited previously. The player who cannot move loses. Which of the two players has a winning strategy?

Let $ABC$ be an acute triangle, which is not equilateral. Denote by $O$ and $H$ its circumcenter and orthocenter, respectively. The circle $k$ passes through $B$ and touches the line $AC$ at $A$. The circle $l$ with center on the ray $BH$ touhes the line $AB$ at $A$. The circles $k$ and $l$ meet in $X$ ($X\ne A$). Show that $\angle HXO=180^\circ-\angle BAC$. [i]Proposed by Josef Tkadlec[/i]

Circles with centers $ (2,4)$ and $ (14,9)$ have radii 4 and 9, respectively. The equation of a common external tangent to the circles can be written in the form $ y \equal{} mx \plus{} b$ with $ m > 0$. What is $ b$? [asy] size(150); defaultpen(linewidth(0.7)+fontsize(8)); draw(circle((2,4),4));draw(circle((14,9),9)); draw((0,-2)--(0,20));draw((-6,0)--(25,0)); draw((2,4)--(2,4)+4*expi(pi*4.5/11)); draw((14,9)--(14,9)+9*expi(pi*6/7)); label("4",(2,4)+2*expi(pi*4.5/11),(-1,0)); label("9",(14,9)+4.5*expi(pi*6/7),(1,1)); label("(2,4)",(2,4),(0.5,-1.5));label("(14,9)",(14,9),(1,-1)); draw((-4,120*-4/119+912/119)--(11,120*11/119+912/119)); dot((2,4)^^(14,9));[/asy] $ \textbf{(A) } \frac {908}{199}\qquad \textbf{(B) } \frac {909}{119}\qquad \textbf{(C) } \frac {130}{17}\qquad \textbf{(D) } \frac {911}{119}\qquad \textbf{(E) } \frac {912}{119}$

Let $ G$ be a simple graph with $ 2 \cdot n$ vertices and $ n^{2}+1$ edges. Show that this graph $ G$ contains a $ K_{4}-\text{one edge}$, that is, two triangles with a common edge.

Let $A$ be the set of all integers $n$ such that $1 \le n \le 2021$ and $\text{gcd}(n,2021)=1$. For every nonnegative integer $j$, let \[ S(j)=\sum_{n \in A}n^j. \] Determine all values of $j$ such that $S(j)$ is a multiple of $2021$.

Point $P$ lies inside of parallelogram $ABCD$. Perpendicular lines to $PA,PB,PC$ and $PD$ through $A,B,C$ and $D$ construct convex quadrilateral $XYZT$. Prove that $S_{XYZT}\geq 2S_{ABCD}$. [i]Proposed by Siamak Ahmadpour[/i]

Let $a=2001$. Consider the set $A$ of all pairs of integers $(m,n)$ with $n\neq0$ such that (i) $m<2a$; (ii) $2n|(2am-m^2+n^2)$; (iii) $n^2-m^2+2mn\leq2a(n-m)$. For $(m, n)\in A$, let \[f(m,n)=\frac{2am-m^2-mn}{n}.\] Determine the maximum and minimum values of $f$.

Let $M, N$ be the midpoints of sides $AB, AC$ respectively of a triangle $ABC$. The perpendicular bisector to the bisectrix $AL$ meets the bisectrixes of angles $B$ and $C$ at points $P$ and $Q$ respectively. Prove that the common point of lines $PM$ and $QN$ lies on the tangent to the circumcircle of $ABC$ at $A$.

Playing soccer with 3 goes as follows: 2 field players try to make a goal past the goalkeeper, the one who makes the goal stands goalman for next game, etc. Arne, Bart and Cauchy played this game. Later, they tell their math teacher that A stood 12 times on the field, B 21 times on the field, C 8 times in the goal. Their teacher knows who made the 6th goal. Who made it?

As shown in the figure, two circles $\Gamma_1$ and $\Gamma_2$ on the plane intersect at two points $A$ and $B$. The two rays passing through $A$, $\ell_1$ and $\ell_2$ intersect $\Gamma_1$ at points $D$ and $E$ respectively, and $\Gamma_2$ at points $F$ and $C$ respectively (where $E$ and $F$ lie on line segments $AC$ and $AD$ respectively, and neither of them coincides with the endpoints). It is known that the three lines $AB$, $CF$ and $DE$ have a common point, the circumscribed circle of $\vartriangle AEF$ intersects $AB$ at point $G$, the straight line $EG$ intersects the circle $\Gamma_1$ at point $P$, the straight line $FG$ intersects the circle $\Gamma_2$ at point $Q$. Let the symmetric points of $C$ and $D$ wrt the straight line $AB$ be $C'$ and $D'$ respectively. If $PD'$ and $QC'$ intersect at point$ J$, prove that $J$ lies on the straight line $AB$. [img]https://cdn.artofproblemsolving.com/attachments/3/7/eb3acdbad52750a6879b4b6955dfdb7de19ed3.png[/img]

Let $ S_k $ be the symmetry of the plane with respect to the line $ k $. Prove that equality holds for every lines $ a, b, c $ contained in one plane $$ S_aS_bS_cS_aS_bS_cS_bS_cS_aS_bS_cS_a = S_bS_cS_aS_bS_cS_aS_aS_bS_cS_aS_bS_c$$

Find the largest possible number of rooks that can be placed on a $3n \times 3n$ chessboard so that each rook is attacked by at most one rook.