An acute triangle $\triangle ABC$ and its incenter $I$, circumcenter $O$ is given. The line that is perpendicular to $AI$ and passes $I$ intersects with $AB$, $AC$ in $D$,$E$. The line that is parallel to $BI$ and passes $D$ and the line that is parallel to $CI$ and passes $E$ intersects in $F$. Denote the circumcircle of $DEF$ as $\omega$, and its center as $K$. $\omega$ and $FI$ intersect in $P$($\neq F$). Prove that $O,K,P$ is collinear.

[b]p1.[/b] Is there an integer such that the product of all whose digits equals $99$ ? [b]p2.[/b] An elevator in a $100$ store building has only two buttons: UP and DOWN. The UP button makes the elevator go $13$ floors up, and the DOWN button makes it go $8$ floors down. Is it possible to go from the $13$th floor to the $8$th floor? [b]p3.[/b] Cut the triangle shown in the picture into three pieces and rearrange them into a rectangle. (Pieces can not overlap.) [img]https://cdn.artofproblemsolving.com/attachments/9/f/359d3b987012de1f3318c3f06710daabe66f28.png[/img] [b]p4.[/b] Two players Tom and Sid play the following game. There are two piles of rocks, $5$ rocks in the first pile and $6$ 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] In the next long multiplication example each letter encodes its own digit. Find these digits. $\begin{tabular}{ccccc} & & & a & b \\ * & & & c & d \\ \hline & & c & e & f \\ + & & a & b & \\ \hline & c & f & d & f \\ \end{tabular}$ PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $k>1$ be a positive integer. A set $S{}$ is called [i]good[/i] if there exists a colouring of the positive integers with $k{}$ colours, such that no element from $S{}$ can be written as the sum of two distinct positive integers having the same colour. Find the greatest positive integer $t{}$ (in terms of $k{}$) for which the set \[S=\{a+1,a+2,\ldots,a+t\}\]is good, for any positive integer $a{}$.

We have $10$ identical tiles as shown. The tiles can be rotated, but not flipper over. A $7 \times 7$ board should be covered with these tiles so that exactly one unit square is covered by two tiles and all other fields by one tile. Designate all unit sqaures that can be covered with two tiles. [img]https://cdn.artofproblemsolving.com/attachments/d/5/6602a5c9e99126bd656f997dee3657348d98b5.png[/img]

Let $ABC$ be an acute triangle with orthocenter $H$. Let $G$ be the point such that the quadrilateral $ABGH$ is a parallelogram. Let $I$ be the point on the line $GH$ such that $AC$ bisects $HI$. Suppose that the line $AC$ intersects the circumcircle of the triangle $GCI$ at $C$ and $J$. Prove that $IJ = AH$.

[b]p1.[/b] Fleming has a list of 8 mutually distinct integers between $90$ to $99$, inclusive. Suppose that the list has median $94$, and that it contains an even number of odd integers. If Fleming reads the numbers in the list from smallest to largest, then determine the sixth number he reads. [b]p2.[/b] Find the number of ordered pairs $(x,y)$ of three digit base-$10$ positive integers such that $x-y$ is a positive integer, and there are no borrows in the subtraction $x-y$. For example, the subtraction on the left has a borrow at the tens digit but not at the units digit, whereas the subtraction on the right has no borrows. $$\begin{tabular}{ccccc} & 4 & 7 & 2 \\ - & 1 & 9 & 1\\ \hline & 2 & 8 & 1 \\ \end{tabular}\,\,\, \,\,\, \begin{tabular}{ccccc} & 3 & 7 & 9 \\ - & 2 & 6 & 3\\ \hline & 1 & 1 & 6 \\ \end{tabular}$$ [b]p3.[/b] Evaluate $$1 \cdot 2 \cdot 3-2 \cdot 3 \cdot 4+3 \cdot 4 \cdot 5- 4 \cdot 5 \cdot 6+ ... +2017 \cdot 2018 \cdot 2019 -2018 \cdot 2019 \cdot 2020+1010 \cdot 2019 \cdot 2021$$ [b]p4.[/b] Find the number of ordered pairs of integers $(a,b)$ such that $$\frac{ab+a+b}{a^2+b^2+1}$$ is an integer. [b]p5.[/b] Lin Lin has a $4\times 4$ chessboard in which every square is initially empty. Every minute, she chooses a random square $C$ on the chessboard, and places a pawn in $C$ if it is empty. Then, regardless of whether $C$ was previously empty or not, she then immediately places pawns in all empty squares a king’s move away from $C$. The expected number of minutes before the entire chessboard is occupied with pawns equals $\frac{m}{n}$ for relatively prime positive integers $m$,$n$. Find $m+n$. A king’s move, in chess, is one square in any direction on the chessboard: horizontally, vertically, or diagonally. [b]p6.[/b] Let $P(x) = x^5-3x^4+2x^3-6x^2+7x+3$ and $a_1,...,a_5$ be the roots of$ P(x)$. Compute $$\sum^5_{k=1}(a^3_k -4a^2_k +a_k +6).$$ [b]p7.[/b] Rectangle $AXCY$ with a longer length of $11$ and square $ABCD$ share the same diagonal $\overline{AC}$. Assume $B$,$X$ lie on the same side of $\overline{AC}$ such that triangle$ BXC$ and square $ABCD$ are non-overlapping. The maximum area of $BXC$ across all such configurations equals $\frac{m}{n}$ for relatively prime positive integers $m$,$n$. Compute $m+n$. [b]p8.[/b] Earl the electron is currently at $(0,0)$ on the Cartesian plane and trying to reach his house at point $(4,4)$. Each second, he can do one of three actions: move one unit to the right, move one unit up, or teleport to the point that is the reflection of its current position across the line $y=x$. Earl cannot teleport in two consecutive seconds, and he stops taking actions once he reaches his house. Earl visits a chronologically ordered sequence of distinct points $(0,0)$, $...$, $(4,4)$ due to his choice of actions. This is called an [i]Earl-path[/i]. How many possible such [i]Earl-paths[/i] are there? [b]p9.[/b] Let $P(x)$ be a degree-$2022$ polynomial with leading coefficient $1$ and roots $\cos \left( \frac{2\pi k}{2023} \right)$ for $k = 1$ , $...$,$2022$ (note $P(x)$ may have repeated roots). If $P(1) =\frac{m}{n}$ where $m$ and $n$ are relatively prime positive integers, then find the remainder when $m+n$ is divided by $100$. [b]p10.[/b] A randomly shuffled standard deck of cards has $52$ cards, $13$ of each of the four suits. There are $4$ Aces and $4$ Kings, one of each of the four suits. One repeatedly draws cards from the deck until one draws an Ace. Given that the first King appears before the first Ace, the expected number of cards one draws after the first King and before the first Ace is $\frac{m}{n}$ where $m$ and $n$ are relatively prime positive integers. Find $m+n$. [b]p11.[/b] The following picture shows a beam of light (dashed line) reflecting off a mirror (solid line). The [i]angle of incidence[/i] is marked by the shaded angle; the[i] angle of reflection[/i] is marked by the unshaded angle. [img]https://cdn.artofproblemsolving.com/attachments/9/d/d58086e5cdef12fbc27d0053532bea76cc50fd.png[/img] The sides of a unit square $ABCD$ are magically distorted mirrors such that whenever a light beam hits any of the mirrors, the measure of the angle of incidence between the light beam and the mirror is a positive real constant $q$ degrees greater than the measure of the angle of reflection between the light beam and the mirror. A light beam emanating from $A$ strikes $\overline{CD}$ at $W_1$ such that $2DW_1 =CW_1$, reflects off of $\overline{CD}$ and then strikes $\overline{BC}$ at $W_2$ such that $2CW_2 = BW_2$, reflects off of $\overline{BC}$, etc. To this end, denote $W_i$ the $i$-th point at which the light beam strikes $ABCD$. As $i$ grows large, the area of $W_iW_{i+1}W_{i+2}W_{i+3}$ approaches $\frac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Compute $m+n$. [b]p12.[/b] For any positive integer $m$, define $\phi (m)$ the number of positive integers $k \le m$ such that $k$ and $m$ are relatively prime. Find the smallest positive integer $N$ such that $\sqrt{ \phi (n) }\ge 22$ for any integer $n \ge N$. [b]p13.[/b] Let $n$ be a fixed positive integer, and let $\{a_k\}$ and $\{b_k\}$ be sequences defined recursively by $$a_1 = b_1 = n^{-1}$$ $$a_j = j(n- j+1)a_{j-1}\,\,\, , \,\,\, j > 1$$ $$b_j = nj^2b_{j-1}+a_j\,\,\, , \,\,\, j > 1$$ When $n = 2021$, then $a_{2021} +b_{2021} = m \cdot 2017^2$ for some positive integer $m$. Find the remainder when $m$ is divided by $2017$. [b]p14.[/b] Consider the quadratic polynomial $g(x) = x^2 +x+1020100$. A positive odd integer $n$ is called $g$-[i]friendly[/i] if and only if there exists an integer $m$ such that $n$ divides $2 \cdot g(m)+2021$. Find the number of $g$-[i]friendly[/i] positive odd integers less than $100$. [b]p15.[/b] Let $ABC$ be a triangle with $AB < AC$, inscribed in a circle with radius $1$ and center $O$. Let $H$ be the intersection of the altitudes of $ABC$. Let lines $\overline{OH}$, $\overline{BC}$ intersect at $T$. Suppose there is a circle passing through $B$, $H$, $O$, $C$. Given $\cos (\angle ABC-\angle BCA) = \frac{11}{32}$ , then $TO = \frac{m\sqrt{p}}{n}$ for relatively prime positive integers $m$,$n$ and squarefree positive integer $p$. Find $m+n+ p$. PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

A rectangle $ABCD$ with $AB>AD$ is given. The circle with center $B$ and radius $AB$ intersects the line $CD$ at $E$ and $F$. (a) Prove that the circumcircle of triangle $EBF$ is tangent to the circle with diameter $AD$. Denote the tangency point by $G$. (b) Prove that the points $D,G,$ and $B$ are collinear.

Let $p$ be a positive prime integer, $S(p)$ be the number of triples $(x,y,z)$ such that $x,y,z\in\{0,1,..., p-1\}$ and $x^2+y^2+z^2$ is divided by $p$. Prove that $S(p) \ge 2p- 1$. (I. Bliznets)

Suppose that$ f : N \to N$ is an increasing function such that $f(f(n)) = 3n$ for all $n$. Find $f(1992)$.

A triangular piece of paper of area $1$ is folded along a line parallel to one of the sides and pressed flat. What is the minimum possible area of the resulting figure?

The real numbers $x,y,z, m, n$ are positive, such that $m + n \ge 2$. Prove that $x\sqrt{yz(x + my)(x + nz)} + y\sqrt{xz(y + mx)(y + nz)} + z\sqrt{xy(z + mx)(x + ny) }\le \frac{3(m + n)}{8} (x + y)(y + z)(z + x)$

Find all polynomials $P(x)$ with real coefficients such that \[xP\bigg(\frac{y}{x}\bigg)+yP\bigg(\frac{x}{y}\bigg)=x+y\] for all nonzero real numbers $x$ and $y$.

Find all functions $f : \mathbb{Z}\rightarrow \mathbb{Z}$ satisfying \[f^{a^{2} + b^{2}}(a+b) = af(a) +bf(b)\] for all integers $a$ and $b$

How many positive integer $n$ are there satisfying the inequality $1+\sqrt{n^2-9n+20} > \sqrt{n^2-7n+12}$ ? $\textbf{(A)}\ 1 \qquad\textbf{(B)}\ 2 \qquad\textbf{(C)}\ 3 \qquad\textbf{(D)}\ 4 \qquad\textbf{(E)}\ \text{None}$

A robot moves in the plane in a straight line, but every one meter it turns $90^{\circ}$ to the right or to the left. At some point it reaches its starting point without having visited any other point more than once, and stops immediately. What are the possible path lengths of the robot?

Consider a $N\times N$ square board where $N\geq 3$ is an odd integer. The caterpillar Carl sits at the center of the square; all other cells contain distinct positive integers. An integer $n$ weights $1\slash n$ kilograms. Carl wants to leave the board but can eat at most $2$ kilograms. Determine whether Carl can always find a way out when a) $N=2003.$ b) $N$ is an arbitrary odd integer.

Determine the smallest possible real constant $C$ such that the inequality $$|x^3 + y^3 + z^3 + 1| \leq C|x^5 + y^5 + z^5 + 1|$$ holds for all real numbers $x, y, z$ satisfying $x + y + z = -1$.

An acute-angled triangle $ABC$ has two altitudes $BE$ and $CF$. The circle with diameter $AC$ intersects the segment $BE$ at point $P$. A circle with diameter $AB$ intersects the segment $CF$ at point $Q$ and the extension of this altitude at point $Q'$. Prove that $\angle PQ'Q = \angle PQB$.

Lines $l$ and $m$ are perpendicular. Line $l$ partitions a convex polygon into two parts of equal area, and partitions the projection of the polygon onto $m$ into two line segments of length $a$ and $b$ respectively. Determine the maximum value of $\left\lfloor \frac{1000a}{b} \right\rfloor$. (The floor notation $\lfloor x \rfloor$ denotes largest integer not exceeding $x$)

$a;b\in\mathbb{R^+}$. Prove the following inequality: $$\sqrt[3]{\frac{a}{b}}+\sqrt[3]{\frac{b}{a}}\leq\sqrt[3]{2(a+b)(\frac1{a}+\frac1{b})}$$

There are 300 apples, any two of which differ in weight by no more than twice. Prove that they can be arranged in packages of two apples so that any two packages differ in weight by no more than one and a half times.

Let $c>0$ be a given positive real and $\mathbb{R}_{>0}$ be the set of all positive reals. Find all functions $f \colon \mathbb{R}_{>0} \to \mathbb{R}_{>0}$ such that \[f((c+1)x+f(y))=f(x+2y)+2cx \quad \textrm{for all } x,y \in \mathbb{R}_{>0}.\]

What is the sum of the digits of the first $2010$ positive integers? $ \textbf{(A)}\ 30516 \qquad\textbf{(B)}\ 28068 \qquad\textbf{(C)}\ 25020 \qquad\textbf{(D)}\ 20100 \qquad\textbf{(E)}\ \text{None} $

[b]p1.[/b] What is the area of a triangle with side lengths $ 6$, $ 8$, and $10$? [b]p2.[/b] Let $f(n) = \sqrt{n}$. If $f(f(f(n))) = 2$, compute $n$. [b]p3.[/b] Anton is buying AguaFina water bottles. Each bottle costs $14 $dollars, and Anton buys at least one water bottle. The number of dollars that Anton spends on AguaFina water bottles is a multiple of $10$. What is the least number of water bottles he can buy? [b]p4.[/b] Alex flips $3$ fair coins in a row. The probability that the first and last flips are the same can be expressed in the form $m/n$ for relatively prime positive integers $m$ and $n$. Compute $m + n$. [b]p5.[/b] How many prime numbers $p$ satisfy the property that $p^2 - 1$ is not a multiple of $6$? [b]p6.[/b] In right triangle $\vartriangle ABC$ with $AB = 5$, $BC = 12$, and $CA = 13$, point $D$ lies on $\overline{CA}$ such that $AD = BD$. The length of $CD$ can then be expressed in the form $m/n$ for relatively prime positive integers $m$ and $n$. Compute $m + n$. [b]p7.[/b] Vivienne is deciding on what courses to take for Spring $2021$, and she must choose from four math courses, three computer science courses, and five English courses. Vivienne decides that she will take one English course and two additional courses that are either computer science or math. How many choices does Vivienne have? [b]p8.[/b] Square $ABCD$ has side length $2$. Square $ACEF$ is drawn such that $B$ lies inside square $ACEF$. Compute the area of pentagon $AFECD$. [b]p9.[/b] At the Boba Math Tournament, the Blackberry Milk Team has answered $4$ out of the first $10$ questions on the Boba Round correctly. If they answer all $p$ remaining questions correctly, they will have answered exactly $\frac{9p}{5}\%$ of the questions correctly in total. How many questions are on the Boba Round? [b]p10.[/b] The sum of two positive integers is $2021$ less than their product. If one of them is a perfect square, compute the sum of the two numbers. [b]p11.[/b] Points $E$ and $F$ lie on edges $\overline{BC}$ and $\overline{DA}$ of unit square $ABCD$, respectively, such that $BE =\frac13$ and $DF =\frac13$ . Line segments $\overline{AE}$ and $\overline{BF}$ intersect at point $G$. The area of triangle $EFG$ can be written in the form $m/n$ , where $m$ and $n$ are relatively prime positive integers. Compute $m+n$. [b]p12.[/b] Compute the number of positive integers $n \le 2020$ for which $n^{k+1}$ is a factor of $(1+2+3+· · ·+n)^k$ for some positive integer $k$. [b]p13.[/b] How many permutations of $123456$ are divisible by their last digit? For instance, $123456$ is divisible by $6$, but $561234$ is not divisible by $4$. [b]p14.[/b] Compute the sum of all possible integer values for $n$ such that $n^2 - 2n - 120$ is a positive prime number. [b]p15. [/b]Triangle $\vartriangle ABC$ has $AB =\sqrt{10}$, $BC =\sqrt{17}$, and $CA =\sqrt{41}$. The area of $\vartriangle ABC$ can be expressed in the form $m/n$ for relatively prime positive integers $m$ and $n$. Compute $m + n$. [b]p16.[/b] Let $f(x) = \frac{1 + x^3 + x^{10}}{1 + x^{10}}$ . Compute $f(-20) + f(-19) + f(-18) + ...+ f(20)$. [b]p17.[/b] Leanne and Jing Jing are walking around the $xy$-plane. In one step, Leanne can move from any point $(x, y)$ to $(x + 1, y)$ or $(x, y + 1)$ and Jing Jing can move from $(x, y)$ to $(x - 2, y + 5)$ or $(x + 3, y - 1)$. The number of ways that Leanne can move from $(0, 0)$ to $(20, 20)$ is equal to the number of ways that Jing Jing can move from $(0, 0)$ to $(a, b)$, where a and b are positive integers. Compute the minimum possible value of $a + b$. [b]p18.[/b] Compute the number positive integers $1 < k < 2021$ such that the equation $x +\sqrt{kx} = kx +\sqrt{x}$ has a positive rational solution for $x$. [b]p19.[/b] In triangle $\vartriangle ABC$, point $D$ lies on $\overline{BC}$ with $\overline{AD} \perp \overline{BC}$. If $BD = 3AD$, and the area of $\vartriangle ABC$ is $15$, then the minimum value of $AC^2$ is of the form $p\sqrt{q} - r$, where $p, q$, and $r$ are positive integers and $q$ is not divisible by the square of any prime number. Compute $p + q + r$. [b]p20. [/b]Suppose the decimal representation of $\frac{1}{n}$ is in the form $0.p_1p_2...p_j\overline{d_1d_2...d_k}$, where $p_1, ... , p_j$ , $d_1,... , d_k$ are decimal digits, and $j$ and $k$ are the smallest possible nonnegative integers (i.e. it’s possible for $j = 0$ or $k = 0$). We define the [i]preperiod [/i]of $\frac{1}{n}$ to be $j$ and the [i]period [/i]of $\frac{1}{n}$ to be $k$. For example, $\frac16 = 0.16666...$ has preperiod $1$ and period $1$, $\frac17 = 0.\overline{142857}$ has preperiod $0$ and period $6$, and $\frac14 = 0.25$ has preperiod $2$ and period $0$. What is the smallest positive integer $n$ such that the sum of the preperiod and period of $\frac{1}{n}$ is $ 8$? PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $AC$ be a fixed chord of a circle $\omega$ with center $O$. Point $B$ moves along the arc $AC$. A fixed point $P$ lies on $AC$. The line passing through $P$ and parallel to $AO$ meets $BA$ at point $A_1$, the line passing through $P$ and parallel to $CO$ meets $BC$ at point $C_1$. Prove that the circumcenter of triangle $A_1BC_1$ moves along a straight line.