Given positive integer $ n \ge 5 $ and a convex polygon $P$, namely $ A_1A_2...A_n $. No diagonals of $P$ are concurrent. Proof that it is possible to choose a point inside every quadrilateral $ A_iA_jA_kA_l (1\le i<j<k<l\le n) $ not on diagonals of $P$, such that the $ \tbinom{n}{4} $ points chosen are distinct, and any segment connecting these points intersect with some diagonal of P.

How many ordered integer pairs $ \left(x,y\right)$ are there satisfying following equation: \[ y \equal{} \sqrt{x\plus{}1998\plus{}\sqrt{x\plus{}1998\plus{}\sqrt{x\plus{}1997\plus{}\sqrt{x\plus{}1997\plus{}\ldots \plus{}\sqrt{x\plus{}1\plus{}\sqrt{x\plus{}1\plus{}\sqrt{x\plus{}\sqrt{x} } } } } } } }.\] $\textbf{(A)}\ 0 \qquad\textbf{(B)}\ 1 \qquad\textbf{(C)}\ 1998 \qquad\textbf{(D)}\ 3996 \qquad\textbf{(E)}\ \text{Infinitely many}$

Let $a_1,a_2,\cdots,a_{22}\in [1,2],$ find the maximum value of $$\dfrac{\sum\limits_{i=1}^{22}a_ia_{i+1}}{\left( \sum\limits_{i=1}^{22}a_i\right) ^2}$$where $a_{23}=a_1.$

What is the minimum possible value of \[\left|x\right|-\left|x-1\right|+\left|x+2\right|-\left|x-3\right|+\left|x+4\right|-\cdots-\left|x-2019\right|\] over all real $x$? [i]2019 CCA Math Bonanza Individual Round #10[/i]

A $10$ digit positive integer is called a $\emph{cute}$ number if its digits are from the set $\{1,2,3\}$ and every two consecutive digits differ by $1$. [list=a] [*]Prove that exactly $5$ digits of a cute number are equal to $2$. [*]Find the total number of cute numbers. [*]Prove that the sum of all cute numbers is divisible by $1408$.[/list]

$AD$ is the angle bisector of the right triangle $ABC$ with $\angle ABC = 60^o$ and $\angle BCA = 90^o$. $E$ is chosen on $\overline{AB}$ so that the line parallel to $\overline{DE}$ through $C$ bisects $\overline{AE}$. Find $\angle EDB$ in degrees.

Find all sets of positive integers $\{x_1, x_2, \dots, x_{20}\}$ such that $$x_{i+2}^2=lcm(x_{i+1}, x_{i})+lcm(x_{i}, x_{i-1})$$ for $i=1, 2, \dots, 20$ where $x_0=x_{20}, x_{21}=x_1, x_{22}=x_2$.

A given rectangle $ R$ is divided into $mn$ small rectangles by straight lines parallel to its sides. (The distances between the parallel lines may not be equal.) What is the minimum number of appropriately selected rectangles’ areas that should be known in order to determine the area of $ R$?

Prove that if $ x,y$ are nonnegative real numbers with $ x\plus{}y\equal{}2$, then: $ x^2 y^2 (x^2\plus{}y^2) \le 2$.

In an acute-angled triangle $\triangle ABC$, construct $\triangle ACD$ and $\triangle BCE$ externally on sides $CA$ and $CB$ respectively, such that $AD=CD$. Let $M$ be the midpoint of $AB$, and connect $DM$ and $EM$. Given that $DM$ is perpendicular to $EM$, set $\frac{AC}{BC} =u$ and $\frac{DM}{EM}=v$. Express $\frac{DC}{EC}$ in terms of $u$ and $v$.

Let $n>3$ be a positive integer satisfying $2^n+1=3p$, where $p$ is a prime. Let $s_0=\frac{2^{n-2}+1}{3}$ and $s_i=s_{i-1}^2-2$ for $i>0$. Show that $p \mid 2s_{n-2}-3$.

We have a grid of $k^2-k+1$ rows and $k^2-k+1$ columns, where $k=p+1$ and $p$ is prime. For each prime $p$, give a method to put the numbers 0 and 1, one number for each square in the grid, such that on each row there are exactly $k$ 0's, on each column there are exactly $k$ 0's, and there is no rectangle with sides parallel to the sides of the grid with 0s on each four vertices.

The numbers $1, 2, \ldots, 2012$ are written on a blackboard. Each minute, a student goes up to the board, chooses two numbers $x$ and $y$, erases them, and writes the number $2x+2y$ on the board. This continues until only one number $N$ remains. Find the remainder when the maximum possible value of $N$ is divided by 1000. [i]Victor Wang.[/i]

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$.