A two-player game is played on a chessboard with $ m$ columns and $ n$ rows. Each player has only one piece. At the beginning of the game, the piece of the first player is on the upper left corner, and the piece of the second player is on the lower right corner. If two squares have a common edge, we call them adjacent squares. The player having the turn moves his piece to one of the adjacent squares. The player wins if the opponent's piece is on that square, or if he manages to move his piece to the opponent's initial row. If the first move is made by the first player, for which of the below pairs of $ \left(m,n\right)$ there is a strategy that guarantees the second player win. $\textbf{(A)}\ (1998, 1997) \qquad\textbf{(B)}\ (1998, 1998) \qquad\textbf{(C)}\ (997, 1998) \qquad\textbf{(D)}\ (998, 1998) \qquad\textbf{(E)}\ \text{None }$

Do positive reals $a, b, c, x$ such that $a^2+ b^2 = c^2$ and $(a + x)^2+ (b +x)^2 = (c + x)^2$ exist?

Find the last two digits of each of the numbers $3^{1974}$ and $7^{1974}$.

Equilateral triangles $ABF$ and $BCG$ are constructed outside regular pentagon $ABCDE.$ Compute $\angle{FEG}.$

In the acute-angled triangle $ABC$, let $AP$ and $BQ$ be the altitudes, $CM$ be the median . Point $R$ is the midpoint of $CM$. Line $PQ$ intersects line $AB$ at $T$. Prove that $OR \perp TC$, where $O$ is the center of the circumscribed circle of triangle $ABC$.

Prove the following inequality. \[n^ne^{-n+1}\leq n!\leq \frac 14(n+1)^{n+1}e^{-n+1}.\]

Suppose $f(x, y)$ is a function that takes in two integers and outputs a real number, such that it satisfies $$f(x, y) = \frac{f(x, y + 1) + f(x, y - 1)}{2}$$ $$f(x, y) = \frac{f(x + 1, y) + f(x - 1, y)}{2}$$ What is the minimum number of pairs $(x, y)$ we need to evaluate to be able to uniquely determine $f$?

[b]p1.[/b] In rectangle $ABMC$, $AB= 5$ and $BM= 8$. If point $X$ is the midpoint of side $AC$, what is the area of triangle $XCM$? [b]p2.[/b] Find the sum of all possible values of $a+b+c+d$ such that $(a, b, c, d)$ are quadruplets of (not necessarily distinct) prime numbers satisfying $a \cdot b \cdot c \cdot d = 4792$. [b]p3.[/b] How many integers from $1$ to $2022$ inclusive are divisible by $6$ or $24$, but not by both? [b]p4.[/b] Jerry begins his English homework at $07:39$ a.m. At $07:44$ a.m., he has finished $2.5\%$ of his homework. Subsequently, for every five minutes that pass, he completes three times as much homework as he did in the previous five minute interval. If Jerry finishes his homework at $AB : CD$ a.m., what is $A + B + C + D$? For example, if he finishes at $03:14$ a.m., $A + B + C + D = 0 + 3 + 1 + 4$. [b]p5.[/b] Advay the frog jumps $10$ times on Mondays, Wednesdays and Fridays. He jumps $7$ times on Tuesdays and Saturdays. He jumps $5$ times on Thursdays and Sundays. How many times in total did Advay jump in November if November $17$th falls on a Thursday? (There are $30$ days in November). [b]p6.[/b] In the following diagram, $\angle BAD\cong \angle DAC$, $\overline{CD} = 2\overline{BD}$, and $ \angle AEC$ and $\angle ACE$ are complementary. Given that $\overline{BA} = 210$ and $\overline{EC} = 525$, find $\overline{AE}$. [img]https://cdn.artofproblemsolving.com/attachments/5/3/8e11caf2d7dbb143a296573f265e696b4ab27e.png[/img] [b]p7.[/b] How many trailing zeros are there when $2021!$ is expressed in base $2021$? [b]p8.[/b] When two circular rings of diameter $12$ on the Olympic Games Logo intersect, they meet at two points, creating a $60^o$ arc on each circle. If four such intersections exist on the logo, and no region is in $3$ circles, the area of the regions of the logo that exist in exactly two circles is $a\pi - b\sqrt{c}$ where $a$, $b$, $c$ are positive integers and $\sqrt{c}$ is fully simplified find $a + b + c$. [b]p9.[/b] If $x^2 + ax - 3$ is a factor of $x^4 - x^3 + bx^2 - 5x - 3$, then what is $|a + b|$? [b]p10.[/b] Let $(x, y, z)$ be the point on the graph of $x^4 +2x^2y^2 +y^4 -2x^2 -2y^2 +z^2 +1 = 0$ such that $x+y +z$ is maximized. Find $a+b$ if $xy +xz +yz$ can be expressed as $\frac{a}{b}$ where $a$, $b$ are relatively prime positive integers. [b]p11.[/b] Andy starts driving from Pittsburgh to Columbus and back at a random time from $12$ pm to $3$ pm. Brendan starts driving from Pittsburgh to Columbus and back at a random time from $1$ pm to $4$ pm. Both Andy and Brendan take $3$ hours for the round trip, and they travel at constant speeds. The probability that they pass each other closer to Pittsburgh than Columbus is$ m/n$, for relatively prime positive integers $m$ and $n$. What is $m + n$? [b]p12.[/b] Consider trapezoid $ABCD$ with $AB$ parallel to $CD$ and $AB < CD$. Let $AD \cap BC = O$, $BO = 5$, and $BC = 11$. Drop perpendicular $AH$ and $BI$ onto $CD$. Given that $AH : AD = \frac23$ and $BI : BC = \frac56$ , calculate $a + b + c + d - e$ if $AB + CD$ can be expressed as $\frac{a\sqrt{b} + c\sqrt{d}}{e}$ where $a$, $b$, $c$, $d$, $e$ are integers with $gcd(a, c, e) = 1$ and $\sqrt{b}$, $\sqrt{d}$ are fully simplified. [b]p13.[/b] The polynomials $p(x)$ and $q(x)$ are of the same degree and have the same set of integer coefficients but the order of the coefficients is different. What is the smallest possible positive difference between $p(2021)$ and $q(2021)$? [b]p14.[/b] Let $ABCD$ be a square with side length $12$, and $P$ be a point inside $ABCD$. Let line $AP$ intersect $DC$ at $E$. Let line $DE$ intersect the circumcircle of $ADP$ at $F \ne D$. Given that line $EB$ is tangent to the circumcircle of $ABP$ at $B$, and $FD = 8$, find $m + n$ if $AP$ can be expressed as $\frac{m}{n}$ for relatively prime positive integers $m$, $n$. [b]p15.[/b] A three digit number $m$ is chosen such that its hundreds digit is the sum of the tens and units digits. What is the smallest positive integer $n$ such that $n$ cannot divide $m$? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Triangle $ABC$ has positive integer side lengths with $AB=AC$. Let $I$ be the intersection of the bisectors of $\angle B$ and $\angle C$. Suppose $BI=8$. Find the smallest possible perimeter of $\triangle ABC$.

find all function $f:\mathbb{R} \to \mathbb{R}$ such that \[f(x^3-xf(y)^2)=xf(x+y)f(x-y)\] holds for all real number $x$, $y$. [i]Proposed by chengbilly[/i]

Circle with center $I$, inscribed in a triangle $ABC$ , touches the sides $BC$ and $AC$ at points $A_1$ and $B_1$ respectively. On rays $A_1I$ and $B_1I$, respectively, let be the points $A_2$ and $B_2$ such that $IA_2=IB_2=R$, where $R$is the radius of the circumscribed circle of the triangle $ABC$. Prove that: a) $AA_2 = BB_2 = OI$ where $O$ is the center of the circumscribed circle of the triangle $ABC$, b) lines $AA_2$ and $BB_2$ intersect on the circumcircle of the triangle $ABC$.

For all $n \in \mathbb{N}$, show that the number of integral solutions $(x, y)$ of \[x^{2}+xy+y^{2}=n\] is finite and a multiple of $6$.

There is an integer in each cell of a $2m\times 2n$ table. We define the following operation: choose three cells forming an L-tromino (namely, a cell $C$ and two other cells sharing a side with $C$, one being horizontal and the other being vertical) and sum $1$ to each integer in the three chosen cells. Find a necessary and sufficient condition, in terms of $m$, $n$ and the initial numbers on the table, for which there exists a sequence of operations that makes all the numbers on the table equal.

On the plane a square is given, and $1993$ equilateral triangles are inscribed in this square. All vertices of any of these triangles lie on the border of the square. Prove that one can find a point on the plane belonging to the borders of no less than $499$ of these triangles. (N Sendrakyan)

Prove for positive reals $a,b,c$ that $(ab+bc+ca+1)(a+b)(b+c)(c+a) \ge 2abc(a+b+c+1)^2$

Andrea flips a fair coin repeatedly, continuing until she either flips two heads in a row (the sequence HH) or flips tails followed by heads (the sequence TH). What is the probability that she will stop after flipping HH?

$ ABC$ is a triangle, the bisector of angle $ A$ meets the circumcircle of triangle $ ABC$ in $ A_1$, points $ B_1$ and $ C_1$ are defined similarly. Let $ AA_1$ meet the lines that bisect the two external angles at $ B$ and $ C$ in $ A_0$. Define $ B_0$ and $ C_0$ similarly. Prove that the area of triangle $ A_0B_0C_0 \equal{} 2 \cdot$ area of hexagon $ AC_1BA_1CB_1 \geq 4 \cdot$ area of triangle $ ABC$.

In triangle $ABC$ with centroid $G$ and circumcircle $\omega$, line $\overline{AG}$ intersects $BC$ at $D$ and $\omega$ at $P$. Given that $GD =DP = 3$, and $GC = 4$, find $AB^2$. [i]Proposed by Muztaba Syed[/i]

In the plane we have points $P,Q,A,B,C$ such triangles $APQ,QBP$ and $PQC$ are similar accordantly (same direction). Then let $A'$ ($B',C'$ respectively) be the intersection of lines $BP$ and $CQ$ ($CP$ and $AQ;$ $AP$ and $BQ,$ respectively.) Show that the points $A,B,C,A',B',C'$ lie on a circle.

Determine the smallest positive integer $n \ge 3$ for which \[ A \equiv 2^{10n} \pmod{2^{170}} \] where $A$ denotes the result when the numbers $2^{10}$, $2^{20}$, $\dots$, $2^{10n}$ are written in decimal notation and concatenated (for example, if $n=2$ we have $A = 10241048576$).

Let $ ABC$ be a triangle. Squares $ AB_{c}B_{a}C$, $ CA_{b}A_{c}B$ and $ BC_{a}C_{b}A$ are outside the triangle. Square $ B_{c}B_{c}'B_{a}'B_{a}$ with center $ P$ is outside square $ AB_{c}B_{a}C$. Prove that $ BP,C_{a}B_{a}$ and $ A_{c}B_{c}$ are concurrent.

Let $A$ and $B$ be points on the circle $k$ with center $O$, so that $AB> AO$. Let $C$ be the intersection of the bisectors of $\angle OAB$ and $k$, different from $A$. Let $D$ be the intersection of the straight line $AB$ with the circumcircle of the triangle $OBC$, different from $B$. Show that $AD = AO$ .

For each positive integer $n$, let $s_n$ be the number of permutations $(a_1, a_2, \cdots, a_n)$ of $(1, 2, \cdots, n)$ such that $\dfrac{a_1}{1} + \dfrac{a_2}{2} + \cdots + \dfrac{a_n}{n}$ is a positive integer. Prove that $s_{2n} \ge n$ for all positive integer $n$.

Find all functions $f:\mathbb{R}\to\mathbb{R}$ such that $f(x)f(y)=f(x+y)+xy$ for all $x,y\in \mathbb{R}$.

In fencing, you win a round if you are the first to reach $15$ points. Suppose that when $A$ plays against $B$, at any point during the round, $A$ scores the next point with probability $p$ and $B$ scores the next point with probability $q=1-p$. (However, they never can both score a point at the same time.) Suppose that in this round, $A$ already has $14-k$ points, and $B$ has $14-\ell$ (where $0\le k,\ell\le 14$). By how much will the probability that $A$ wins the round increase if $A$ scores the next point?