Problem 1. Let ω be the incircle of triangle ABC which is tangent to BC,CA,AB at points D,E,F, respectively. The altitudes of triangle DEF with respect to E,F meet AB,AC at points X,Y, respectively. Prove that the second intersection of the circumcircles of triangles AEX,AFY lies on the circle ω.

Let $p>3$ be a prime and let $1+\frac 12 +\frac 13 +\cdots+\frac 1p=\frac ab$.Prove that $p^4$ divides $ap-b$.

On the side \(AC\) of an acute-angled triangle \(ABC\), arbitrary points \(D\) and \(E\) are chosen. The circumcircles of triangles \(BDC\) and \(BEA\) intersect the sides \(BA\) and \(BC\) respectively for the second time at points \(F\) and \(G\). Point \(O\) is the circumcenter of \(\triangle BFG\). Prove that \(OD = OE\). [i]Proposed by Anton Trygub[/i]

Lines $HK$ and $BC$ lie in a plane. $M$ is the midpoint of line segment $BC$, and $BH$ and $CK$ are perpendicular to $HK$. Then we $\textbf{(A) }\text{always have }MH=MK\qquad\textbf{(B) }\text{always have }MH>BK\qquad$ $\textbf{(C) }\text{sometimes have }MH=MK\text{ but not always}\qquad$ $\textbf{(D) }\text{always have }MH>MB\qquad \textbf{(E) }\text{always have }BH<BC$

Find all positive integers $a$ for which the equation $7an -3n! = 2020$ has a positive integer solution $n$. (Richard Henner)

Ada and Emily are playing a game that ends when either player wins, after some number of rounds. Each round, either nobody wins, Ada wins, or Emily wins. The probability that neither player wins each round is $\frac{1}{5}$ and the probability that Emily wins the game as a whole is $\frac{3}{4}.$ If the probability that in a given round Emily wins is $\frac{m}{n}$ such that $m$ and $n$ are relatively prime integers, then find $m+n.$ [i]Proposed by Ada Tsui[/i]

Solve: $x^2(2-x)^2=1+2(1-x)^2$ Where $x$ is real number.

A hedgehog has $4$ friends on Day $1$. If the number of friends he has increases by $5$ every day, how many friends will he have on Day $6$?

Peter plays a solitaire game with a deck of cards, some of which are face-up while the others are face-down. Peter loses if all the cards are face-down. As long as at least one card is face up, Peter must choose a stack of consecutive cards from the deck, so that the top and the bottom cards of the stack are face-up. They may be the same card. Then Peter turns the whole stack over and puts it back into the deck in exactly the same place as before. Prove that Peter always loses. (A Shapovalov)

If $n>2$ is a positive integer, compute \[\max_{1\leqslant k\leqslant n}\max_{n_1+...+n_k=n} \binom{n_1}{2}\binom{n_2}{2}\ldots\binom{n_k}{2}.\] [i]Ioan Tomescu[/i]

What is the value of the following expression? $$\frac{100^2-7^2}{70^2-11^2} \cdot \frac{(70-11)(70+11)}{(100-7)(100+7)}$$ $\textbf{(A) } 1 \qquad \textbf{(B) } \frac{9951}{9950} \qquad \textbf{(C) } \frac{4780}{4779} \qquad \textbf{(D) } \frac{108}{107} \qquad \textbf{(E) } \frac{81}{80} $

Let $f(n)$ be the integer closest to $\sqrt{n}$. Compute the largest $N$ less than or equal to $2018$ such that $\sum_{i=1}^N\frac{1}{f(i)}$ is integral.

Find the least integer $k$ such that for any $2011 \times 2011$ table filled with integers Kain chooses, Abel be able to change at most $k$ cells to achieve a new table in which $4022$ sums of rows and columns are pairwise different.

Let $f(x)$ be a polynomial with real coefficients such that $f(0) = 1,$ $f(2)+f(3)=125,$ and for all $x$, $f(x)f(2x^{2})=f(2x^{3}+x).$ Find $f(5).$

If $\alpha $ is an acute angle and $a,b\geq 0$ then show that: $\left( a+\frac{b}{\sin \alpha}\right)\left(b+\frac{a}{\cos \alpha}\right)\geq a^2+b^2+3ab$

Let $p$ be a prime greater than $2$. Prove that there is a prime $q < p$ such that $q^{p-1} - 1$ is not divisible by $p^2$

Let $x$ and $y$ be distinct positive integers below $15$. For any two distinct numbers $a, b$ from the set $\{2, x,y\}$, $ab + 1$ is always a positive square. Find all possible values of the square $xy + 1$.

In triangle $ABC$, point $M$ is the midpoint of $BC$, $P$ the point of intersection of the tangents at points $B$ and $C$ of the circumscribed circle of $ABC$, $N$ is the midpoint of the segment $MP$. The segment $AN$ meets the circumcircle $ABC$ at the point $Q$. Prove that $\angle PMQ = \angle MAQ$.

A polyomino is a connected figure constructed by joining one or more unit squares edge-to-edge. Determine, with proof, the number of non-congruent polyominoes with no holes, perimeter $180,$ and area $2024.$

Ruby has a non-negative integer $n$. In each second, Ruby replaces the number she has with the product of all its digits. Prove that Ruby will eventually have a single-digit number or $0$. (e.g. $86\rightarrow 8\times 6=48 \rightarrow 4 \times 8 =32 \rightarrow 3 \times 2=6$) [i]Proposed by Wong Jer Ren[/i]

In the triangle $ABC$, $\angle A$ is biggest. On the circumcircle of $\triangle ABC$, let $D$ be the midpoint of $\widehat{ABC}$ and $E$ be the midpoint of $\widehat{ACB}$. The circle $c_1$ passes through $A,B$ and is tangent to $AC$ at $A$, the circle $c_2$ passes through $A,E$ and is tangent $AD$ at $A$. $c_1$ and $c_2$ intersect at $A$ and $P$. Prove that $AP$ bisects $\angle BAC$. [hide="Diagram"][asy] /* File unicodetex not found. */ /* Geogebra to Asymptote conversion, documentation at artofproblemsolving.com/Wiki, go to User:Azjps/geogebra */ import graph; size(14.4cm); real labelscalefactor = 0.5; /* changes label-to-point distance */ pen dps = linewidth(0.7) + fontsize(10); defaultpen(dps); /* default pen style */ pen dotstyle = black; /* point style */ real xmin = -5.23, xmax = 9.18, ymin = -2.97, ymax = 4.82; /* image dimensions */ /* draw figures */ draw(circle((-1.32,1.36), 2.98)); draw(circle((3.56,1.53), 3.18)); draw((0.92,3.31)--(-2.72,-1.27)); draw(circle((0.08,0.25), 3.18)); draw((-2.72,-1.27)--(3.13,-0.65)); draw((3.13,-0.65)--(0.92,3.31)); draw((0.92,3.31)--(2.71,-1.54)); draw((-2.41,-1.74)--(0.92,3.31)); draw((0.92,3.31)--(1.05,-0.43)); /* dots and labels */ dot((-1.32,1.36),dotstyle); dot((0.92,3.31),dotstyle); label("$A$", (0.81,3.72), NE * labelscalefactor); label("$c_1$", (-2.81,3.53), NE * labelscalefactor); dot((3.56,1.53),dotstyle); label("$c_2$", (3.43,3.98), NE * labelscalefactor); dot((1.05,-0.43),dotstyle); label("$P$", (0.5,-0.43), NE * labelscalefactor); dot((-2.72,-1.27),dotstyle); label("$B$", (-3.02,-1.57), NE * labelscalefactor); dot((2.71,-1.54),dotstyle); label("$E$", (2.71,-1.86), NE * labelscalefactor); dot((3.13,-0.65),dotstyle); label("$C$", (3.39,-0.9), NE * labelscalefactor); dot((-2.41,-1.74),dotstyle); label("$D$", (-2.78,-2.07), NE * labelscalefactor); clip((xmin,ymin)--(xmin,ymax)--(xmax,ymax)--(xmax,ymin)--cycle); /* end of picture */[/asy][/hide]

[u]Round 9[/u] [b]p25.[/b] For how many nonempty subsets of $\{1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16\}$ is the sum of the elements divisble by $32$? [b]p26.[/b] America declared independence in $1776$. Take the sum of the cubes of the digits of $1776$ and let that equal $S_1$. Sum the cubes of the digits of $S_1$ to get $S_2$. Repeat this process $1776$ times. What is $S_{1776}$? [b]p27.[/b] Every Golden Grahams box contains a randomly colored toy car, which is one of four colors. What is the expected number of boxes you have to buy in order to obtain one car of each color? [u]Round 10[/u] [b]p28.[/b] Let $B$ be the answer to Question $29$ and $C$ be the answer to Question $30$. What is the sum of the square roots of $B$ and $C$? [b]p29.[/b] Let $A$ be the answer to Question $28$ and $C$ be the answer to Question $30$. What is the sum of the sums of the digits of $A$ and $C$? [b]p30.[/b] Let $A$ be the answer to Question $28$ and $B$ be the answer to Question $29$. What is $A + B$? [u]Round 11[/u] [b]p31.[/b] If $x + \frac{1}{x} = 4$, find $x^6 + \frac{1}{x^6}$. [b]p32.[/b] Given a positive integer $n$ and a prime $p$, there is are unique nonnegative integers $a$ and $b$ such that $n = p^b \cdot a$ and $gcd (a, p) = 1$. Let $v_p(n)$ denote this uniquely determined $a$. Let $S$ denote the set of the first 20 primes. Find $\sum_{ p \in S} v_p \left(1 + \sum^{100}_{i=0} p^i \right)$. [b]p33. [/b] Find the maximum value of n such that $n+ \sqrt{(n - 1) +\sqrt{(n - 2) + ... +\sqrt{1}}} < 49$ (Note: there would be $n - 1$ square roots and $n$ total terms). [u]Round 12[/u] [b]p34.[/b] Give two numbers $a$ and $b$ such that $2015^a < 2015! < 2015^b$. If you are incorrect you get $-5$ points; if you do not answer you get $0$ points; otherwise you get $\max \{20-0.02(|b - a| - 1), 0\}$ points, rounded down to the nearest integer. [b]p35.[/b] Twin primes are prime numbers whose difference is $2$. Let $(a, b)$ be the $91717$-th pair of twin primes, with $a < b$. Let $k = a^b$, and suppose that $j$ is the number of digits in the base $10$ representation of $k$. What is $j^5$? If the correct answer is $n$ and you say $m$, you will receive $\max \left(20 - | \log \left(| \frac{m}{n} |\right), 0 \right)$ points, rounded down to the nearest integer. [b]p36.[/b] Write down any positive integer. Let the sum of the valid submissions (i.e. positive integer submissions) for all teams be $S$. One team will be chosen randomly, according to the following distribution: if your team's submission is $n$, you will be chosen with probability $\frac{n}{S}$ . The amount of points that the chosen team will win is the greatest integer not exceeding $\min \{K, \frac{ 10000}{S} \}$. $K$ is a predetermined secret value. PS. You should use hide for answers. Rounds 1-4 have been posted [url=https://artofproblemsolving.com/community/c3h3157009p28696627]here [/url] and 5-8 [url=https://artofproblemsolving.com/community/c3h3157013p28696685]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

If the real numbers $x,y,z$ satisfies the equations $\frac{xyz}{x+y}=-1$, $\frac{xyz}{y+z}=1$, and $\frac{xyz}{z+x}=2$, what can $xyz$ be? $ \textbf{(A)}\ -\frac{8}{\sqrt {15}} \qquad\textbf{(B)}\ \frac{8}{\sqrt 5} \qquad\textbf{(C)}\ -8\sqrt{\frac{3}{5}} \qquad\textbf{(D)}\ \frac{7}{\sqrt{15}} \qquad\textbf{(E)}\ \text{None} $

Cut the $19 \times 20$ grid rectangle along the grid lines into several squares so that there are exactly four of them with odd sidelengths.

Problem: A person has seven friends and invites a different subset of three friends to dinner every night for one week (seven days). In how many ways can this be done so that all friends are invited at least once?