Let $M$, $N$ be the midpoints of diagonals $AC$, $BD$ of a right-angled trapezoid $ABCD$ ($\measuredangle A=\measuredangle D = 90^\circ$). The circumcircles of triangles $ABN$, $CDM$ meet the line $BC$ in the points $Q$, $R$. Prove that the distances from $Q$, $R$ to the midpoint of $MN$ are equal.

[i]25 problems for 30 minutes[/i] [b]p1.[/b] Alisha has $6$ cupcakes and Tyrone has $10$ brownies. Tyrone gives some of his brownies to Alisha so that she has three times as many desserts as Tyrone. How many desserts did Tyrone give to Alisha? [b]p2.[/b] Bisky adds one to her favorite number. She then divides the result by $2$, and gets $56$. What is her favorite number? [b]p3.[/b] What is the maximum number of points at which a circle and a square can intersect? [b]p4.[/b] An integer $N$ leaves a remainder of 66 when divided by $120$. Find the remainder when $N$ is divided by $24$. [b]p5.[/b] $7$ people are chosen to run for student council. How many ways are there to pick $1$ president, $1$ vice president, and $1$ secretary? [b]p6.[/b] Anya, Beth, Chloe, and Dmitri are all close friends, and like to make group chats to talk. How many group chats can be made if Dmitri, the gossip, must always be in the group chat and Anya is never included in them? Group chats must have more than one person. [b]p7.[/b] There exists a telephone pole of height $24$ feet. From the top of this pole, there are two wires reaching the ground in opposite directions, with one wire $25$ feet, and the other wire 40 feet. What is the distance (in feet) between the places where the wires hit the ground? [b]p8.[/b] Tarik is dressing up for a job-interview. He can wear a chill, business, or casual outfit. If he wears a chill oufit, he must wear a t-shirt, shorts, and flip-flops. He has eight of the first, seven of the second, and three of the third. If he wears a business outfit, he must wear a blazer, a tie, and khakis; he has two of the first, six of the second, and five of the third; finally, he can also choose the casual style, for which he has three hoodies, nine jeans, and two pairs of sneakers. How many different combinations are there for his interview? [b]p9.[/b] If a non-degenerate triangle has sides $11$ and $13$, what is the sum of all possibilities for the third side length, given that the third side has integral length? [b]p10.[/b] An unknown disease is spreading fast. For every person who has the this illness, it is spread on to $3$ new people each day. If Mary is the only person with this illness at the start of Monday, how many people will have contracted the illness at the end of Thursday? [b]p11.[/b] Gob the giant takes a walk around the equator on Mars, completing one lap around Mars. If Gob’s head is $\frac{13}{\pi}$ meters above his feet, how much farther (in meters) did his head travel than his feet? [b]p12.[/b] $2022$ leaves a remainder of $2$, $6$, $9$, and $7$ when divided by $4$, $7$, $11$, and $13$ respectively. What is the next positive integer which has the same remainders to these divisors? [b]p13.[/b] In triangle $ABC$, $AB = 20$, $BC = 21$, and $AC = 29$. Let D be a point on $AC$ such that $\angle ABD = 45^o$. If the length of $AD$ can be represented as $\frac{a}{b}$ , what is $a + b$? [b]p14.[/b] Find the number of primes less than $100$ such that when $1$ is added to the prime, the resulting number has $3$ divisors. [b]p15.[/b] What is the coefficient of the term $a^4z^3$ in the expanded form of $(z - 2a)^7$? [b]p16.[/b] Let $\ell$ and $m$ be lines with slopes $-2$, $1$ respectively. Compute $|s_1 \cdot s_2|$ if $s_1$, $s_2$ represent the slopes of the two distinct angle bisectors of $\ell$ and $m$. [b]p17.[/b] R1D2, Lord Byron, and Ryon are creatures from various planets. They are collecting monkeys for King Avanish, who only understands octal (base $8$). R1D2 only understands binary (base $2$), Lord Byron only understands quarternary (base $4$), and Ryon only understands decimal (base $10$). R1D2 says he has $101010101$ monkeys and adds his monkey to the pile. Lord Byron says he has $3231$ monkeys and adds them to the pile. Ryon says he has $576$ monkeys and adds them to the pile. If King Avanish says he has $x$ monkeys, what is the value of $x$? [b]p18.[/b] A quadrilateral is defined by the origin, $(3, 0)$, $(0, 10)$, and the vertex of the graph of $y = x^2 -8x+22$. What is the area of this quadrilateral? [b]p19.[/b] There is a sphere-container, filled to the brim with fruit punch, of diameter $6$. The contents of this container are poured into a rectangular prism container, again filled to the brim, of dimensions $2\pi$ by $4$ by $3$. However, there is an excess amount in the original container. If all the excess drink is poured into conical containers with diameter $4$ and height $3$, how many containers will be used? [b]p20.[/b] Brian is shooting arrows at a target, made of concurrent circles of radius $1$, $2$, $3$, and $4$. He gets $10$ points for hitting the innermost circle, $8$ for hitting between the smallest and second smallest circles, $5$ for between the second and third smallest circles, $2$ points for between the third smallest and outermost circle, and no points for missing the target. Assume for each shot he takes, there is a $20\%$ chance Brian will miss the target, but otherwise the chances of hitting each target are proportional to the area of the region. The chance that after three shots, Brian will have scored $15$ points can be expressed as $\frac{m}{n}$ for relatively prime positive integers $m, n$. Find $m + n$. [b]p21.[/b] What is the largest possible integer value of $n$ such that $\frac{2n^3+n^2+7n-15}{2n+1}$ is an integer? [b]p22.[/b] Let $f(x, y) = x^3 + x^2y + xy^2 + y^3$. Compute $f(0, 2) + f(1, 3) +... f(9, 11).$ [b]p23.[/b] Let $\vartriangle ABC$ be a triangle. Let $AM$ be a median from $A$. Let the perpendicular bisector of segment $\overline{AM}$ meet $AB$ and $AC$ at $D$, $E$ respectively. Given that $AE = 7$, $ME = MC$, and $BDEC$ is cyclic, then compute $AM^2$. [b]p24.[/b] Compute the number of ordered triples of positive integers $(a, b, c)$ such that $a \le 10$, $b \le 11$, $c \le 12$ and $a > b - 1$ and $b > c - 1$. [b]p25.[/b] For a positive integer $n$, denote by $\sigma (n)$ the the sum of the positive integer divisors of $n$. Given that $n + \sigma (n)$ is odd, how many possible values of $n$ are there from $1$ to $2022$, inclusive? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Peter wants to make an unusual die having different positive integers on each of its faces. For neighbouring faces the corresponding numbers should differ by at least two. Find the minimal sum of the six numbers. (Folklore)

Prove that there exists a nonzero complex number $c$ and a real number $d$ such that \[\left|\left|\dfrac1{1+z+z^2}\right|-\left|\dfrac1{1+z+z^2}-c\right|\right|=d\] for all $z$ with $|z|=1$ and $1+z+z^2\neq 0$. (Here, $|z|$ denotes the absolute value of the complex number $z$, so that $|a+bi|=\sqrt{a^2+b^2}$ for real numbers $a,b$.)

We are given $64$ cubes, each with five white faces and one black face. One cube is placed on each square of a chessboard, with its edges parallel to the sides of the board. We are allowed to rotate a complete row of cubes about the axis of symmetry running through the cubes or to rotate a complete column of cubes about the axis of symmetry running through the cubes. Show that by a sequence of such rotations we can always arrange that each cube has its black face uppermost

Let $S$ be the circle of center $O$ and radius $R$, and let $A, A'$ be two diametrically opposite points in $S$. Let $P$ be the midpoint of $OA'$ and $\ell$ a line passing through $P$, different from $AA '$ and from the perpendicular on $AA '$. Let $B$ and $C$ be the intersection points of $\ell$ with $S$ and let $M$ be the midpoint of $BC$. a) Let $H$ be the foot of the altitude from $A$ in the triangle $ABC$. Let $D$ be the intersection point of the line $A'M$ with $AH$. Determine the locus of point $D$ while $\ell$ varies . b) Line $AM$ intersects $OD$ at $I$. Prove that $2 OI = ID$ and determine the locus of point $I$ while $\ell$ varies .

At an elementary school, the students in third grade, fourth grade, and fifth grade run an average of $12$, $15$, and $10$ minutes per day, respectively. There are twice as many third graders as fourth graders, and twice as many fourth graders as fifth graders. What is the average number of minutes run per day by these students? $ \textbf{(A)}\ 12 \qquad\textbf{(B)}\ \frac{37}{3} \qquad\textbf{(C)}\ \frac{88}{7} \qquad\textbf{(D)}\ 13\qquad\textbf{(E)}\ 14 $

Let $ABC$ be an acute triangle with altitudes $AD$, $BE$, $CF$ where $D$, $E$, $F$ lie on $BC$, $AC$, $AB$, respectively. Let $M$ be the midpoint of $BC$. The circumcircle of triangle $AEF$ cuts the line $AM$ at $A$ and $X$. The line $AM$ cuts the line $CF$ at $Y$. Let $Z$ be the point of intersection of $AD$ and $BX$. Show that the lines $YZ$ and $BC$ are parallel.

Let be $ a,b,c\in (0,\infty)$ such that $ 3abc\equal{}1$ . Show that : $ \frac{3a^5}{3a^5\plus{}2bc}\plus{}\frac{3b^5}{3b^5\plus{}2ca}\plus{}\frac{3c^5}{3c^5\plus{}2ab}\ge 1$

Given $k_1,k_2,...,k_n\in R^+$, find all the naturals $n$ such that $$k_1+k_2+...+k_n=2n-3$$ $$\frac{1}{k_1}+\frac{1}{k_2}+...+\frac{1}{k_n}=3$$ [i](Zhuge Liang)[/i]

a,b,c are positive & abc=1, then show that a^(b+c) .b^(c+a) .c^(a+b) ≤ 1

Initially, there are 2018 distinct boxes on a table. In the first stage, Yazan and Bozan, starting with Yazan, take turns make $2016$ moves each, such that, in each move, the person whose turn selects a pair of boxes that is not written on the board, and writes the pair on the board. In the second stage, Bozan enumerates the $4032$ pairs with numbers from $1,2,\dots,4032$, in whichever order he wants, and puts $k$ balls in each boxes written contained in the $k^{th}$ pair. Is there a strategy for Bozan that guarantees that the number of balls in each box are distinct?

In triangle $ABC$, angle $C$ is equal to $60^o$. Bisectors $AA'$ and $BB'$ intersect at point $I$. Point $K$ is symmetric to $I$ with respect to line $AB$. Prove that lines $CK$ and $A'B'$ are perpendicular. (D. Shvetsov, A. Zaslavsky)

In the trapezoid $ABCD$ with bases $AB$ and $CD$, let $M$ be the midpoint of side $DA$. If $BC=a$, $MC=b$ and $\angle MCB=150^\circ$, what is the area of trapezoid $ABCD$ as a function of $a$ and $b$?

Let A be a regular $12$-sided polygon. A new $12$-gon B is constructed by connecting the midpoints of the sides of A. The ratio of the area of B to the area of A can be written in simplest form as $(a +\sqrt{b})/c$, where $a, b, c$ are integers. Find $a + b + c$.

Two different points $A$ and $B$ and a circle $\omega$ that passes through $A$ and $B$ are given. $P$ is a variable point on $\omega$ (different from $A$ and $B$). $M$ is a point such that $MP$ is the bisector of the angle $\angle{APB}$ ($M$ lies outside of $\omega$) and $MP=AP+BP$. Find the geometrical locus of $M$.

Alice has an integer $N > 1$ on the blackboard. Each minute, she deletes the current number $x$ on the blackboard and writes $2x+1$ if $x$ is not the cube of an integer, or the cube root of $x$ otherwise. Prove that at some point of time, she writes a number larger than $10^{100}$. [i]Proposed by Anant Mudgal and Rohan Goyal[/i]

$a,b,c$ are nonnegative integers that satisfy $a^2+b^2+c^2=3$. Find the minimum and maximum value the sum $$\frac{1}{1+a+b}+\frac{1}{1+b+c}+\frac{1}{1+c+a}$$ may achieve and find all $a,b,c$ for which equality occurs.\\ \\ [i](Andrei Bâra)[/i]

Given is a floor plan composed of $n$ unit squares. Albert and Berta want to cover this floor with tiles, with all tiles having the shape of a $1\times 2$ domino or a $T$-tetromino. Albert only has tiles from one color, while Berta has two-color dominoes and tetrominoes available in four colors. Albert can use this floor plan in $a$ ways to cover tiles, Berta in $ b$ ways. Assuming that $a \ne 0$, determine the ratio $b/a$.

The largest prime factor of $101101101101$ is a four-digit number $N.$ Compute $N.$

Using a nozzle to paint each square in a $1 \times n$ stripe, when the nozzle is aiming at the $i$-th square, the square is painted black, and simultaneously, its left and right neighboring square (if exists) each has an independent probability of $\tfrac{1}{2}$ to be painted black. In the optimal strategy (i.e. achieving least possible number of painting), the expectation of number of painting to paint all the squares black, is $T(n)$. Find the explicit formula of $T(n)$.

$ABCD$ and $A'B'C'D'$ are square maps of the same region, drawn to different scales and superimposed as shown in the figure. Prove that there is only one point $O$ on the small map that lies directly over point $O'$ of the large map such that $O$ and $O'$ each represent the same place of the country. Also, give a Euclidean construction (straight edge and compass) for $O$. [asy] size(200); defaultpen(linewidth(0.7)+fontsize(10)); real theta = -100, r = 0.3; pair D2 = (0.3,0.76); string[] lbl = {'A', 'B', 'C', 'D'}; draw(unitsquare); draw(shift(D2)*rotate(theta)*scale(r)*unitsquare); for(int i = 0; i < lbl.length; ++i) { pair Q = dir(135-90*i), P = (.5,.5)+Q/2^.5; label("$"+lbl[i]+"'$", P, Q); label("$"+lbl[i]+"$",D2+rotate(theta)*(r*P), rotate(theta)*Q); }[/asy]

Let $G$ be the permutation group of a finite set $\Omega$.Consider $S\subset G$ such that $1\in S$ and for any $x,y\in \Omega$ there exists a unique element $\sigma \in S$ such that $\sigma (x)=y$.Prove that,if the elements of $S \setminus \{1\}$ are conjugate in $G$,then $G$ is $2-$transitive on $\Omega$

Jesse and Tjeerd are playing a game. Jesse has access to $n\ge 2$ stones. There are two boxes: in the black box there is room for half of the stones (rounded down) and in the white box there is room for half of the stones (rounded up). Jesse and Tjeerd take turns, with Jesse starting. Jesse grabs in his turn, always one new stone, writes a positive real number on the stone and places put him in one of the boxes that isn't full yet. Tjeerd sees all these numbers on the stones in the boxes and on his turn may move any stone from one box to the other box if it is not yet full, but he may also choose to do nothing. The game stops when both boxes are full. If then the total value of the stones in the black box is greater than the total value of the stones in the white box, Jesse wins; otherwise win Tjeerd. For every $n \ge 2$, determine who can definitely win (and give a corresponding winning strategy).

Let $n$ be the number of pairs of values of $b$ and $c$ such that $3x+by+c=0$ and $cx-2y+12=0$ have the same graph. Then $n$ is: $ \textbf{(A)}\ 0\qquad\textbf{(B)}\ 1\qquad\textbf{(C)}\ 2\qquad\textbf{(D)}\ \text{finite but more than 2}\qquad\textbf{(E)}\ \text{greater than any finite number} $