In $\triangle{ABC}$ with an obtuse angle at $A$, let $D$ be the foot of the $A$ altitude and $E$ be the foot of the $B$ altitude. If $AC+CD=DB$ and $BC-AE=EC$, compute $\angle{A}$ in degrees. [i]2020 CCA Math Bonanza Team Round #10[/i]

[b]p1.[/b] Suppose that Yunseo wants to order a pizza that is cut into $4$ identical slices. For each slice, there are $2$ toppings to choose from: pineapples and apples. Each slice must have exactly one topping. How many distinct pizzas can Yunseo order? Pizzas that can be obtained by rotating one pizza are considered the same. [b]p2.[/b] How many triples of distinct positive integers $(E, M, C)$ are there such that $E = MC^2$ and $E \le 50$? [b]p3.[/b] Given that the cubic polynomial $p(x)$ has leading coefficient $1$ and satisfies $p(0) = 0$, $p(1) = 1$, and $p(2) = 2$. Find $p(3)$. [b]p4.[/b] Olaf asks Anna to guess a two-digit number and tells her that it’s a multiple of $7$ with two distinct digits. Anna makes her first guess. Olaf says one digit is right but in the wrong place. Anna adjusts her guess based on Olaf’s comment, but Olaf answers with the same comment again. Anna now knows what the number is. What is the sum of all the numbers that Olaf could have picked? [b]p5.[/b] Vincent the Bug draws all the diagonals of a regular hexagon with area $720$, splitting it into many pieces. Compute the area of the smallest piece. [b]p6.[/b] Given that $y - \frac{1}{y} = 7 + \frac{1}{7}$, compute the least integer greater than $y^4 + \frac{1}{y^4}$. [b]p7.[/b] At $9:00$ A.M., Joe sees three clouds in the sky. Each hour afterwards, a new cloud appears in the sky, while each old cloud has a $40\%$ chance of disappearing. Given that the expected number of clouds that Joe will see right after $1:00$ P.M. can be written in the form $p/q$ , where $p$ and $q$ are relatively prime positive integers, what is $p + q$? [b]p8.[/b] Compute the unique three-digit integer with the largest number of divisors. [b]p9.[/b] Jo has a collection of $101$ books, which she reads one each evening for $101$ evenings in a predetermined order. In the morning of each day that Jo reads a book, Amy chooses a random book from Jo’s collection and burns one page in it. What is the expected number of pages that Jo misses? [b]p10.[/b] Given that $x, y, z$ are positive real numbers satisfying $2x + y = 14 - xy$, $3y + 2z = 30 - yz$, and $z + 3x = 69 - zx$, the expression $x + y + z$ can be written as $p\sqrt{q} - r$, where $p, q, r$ are positive integers and $q$ is not divisible by the square of any prime. Compute $p + q + r$. [b]p11.[/b] In rectangle $TRIG$, points $A$ and $L$ lie on sides $TG$ and $TR$ respectively such that $TA = AG$ and $TL = 2LR$. Diagonal $GR$ intersects segments $IL$ and $IA$ at $B$ and $E$ respectively. Suppose that the area of the convex pentagon with vertices $TABLE$ is equal to $21$. What is the area of $TRIG$? [b]p12.[/b] Call a number nice if it can be written in the form $2^m \cdot 3^n$, where $m$ and $n$ are nonnegative integers. Vincent the Bug fills in a $3$ by $3$ grid with distinct nice numbers, such that the product of the numbers in each row and each column are the same. What is the smallest possible value of the largest number Vincent wrote? [b]p13.[/b] Let $s(n)$ denote the sum of digits of positive integer $n$ and define $f(n) = s(202n) - s(22n)$. Given that $M$ is the greatest possible value of $f(n)$ for $0 < n < 350$ and $N$ is the least value such that $f(N) = M$, compute $M + N$. [b]p14.[/b] In triangle $ABC$, let M be the midpoint of $BC$ and let $E, F$ be points on $AB, AC$, respectively, such that $\angle MEF = 30^o$ and $\angle MFE = 60^o$. Given that $\angle A = 60^o$, $AE = 10$, and $EB = 6$,compute $AB + AC$. [b]p15.[/b] A unit cube moves on top of a $6 \times 6$ checkerboard whose squares are unit squares. Beginning in the bottom left corner, the cube is allowed to roll up or right, rolling about its bottom edges to travel from square to square, until it reaches the top right corner. Given that the side of the cube facing upwards in the beginning is also facing upwards after the cube reaches the top right corner, how many total paths are possible? PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $a,b,c$ be positive real numbers. Prove that \[\frac{a}b+\frac{b}c+\frac{c}a \geq \frac{c+a}{c+b}+\frac{a+b}{a+c}+\frac{b+c}{b+a}\]

Do there exist real numbers $a,b,c$ such that the system of equations \begin{align*} x+y+z&=a\\ x^2+y^2+z^2&=b\\ x^4+y^4+z^4&=c \end{align*} has infinitely many real solutions $(x,y,z)$?

$ABCD$ is a square side $1$. $P$ and $Q$ lie on the side $AB$ and $R$ lies on the side $CD$. What are the possible values for the circumradius of $PQR$?

Let $x_1, \ldots , x_{100}$ be nonnegative real numbers such that $x_i + x_{i+1} + x_{i+2} \leq 1$ for all $i = 1, \ldots , 100$ (we put $x_{101 } = x_1, x_{102} = x_2).$ Find the maximal possible value of the sum $S = \sum^{100}_{i=1} x_i x_{i+2}.$ [i]Proposed by Sergei Berlov, Ilya Bogdanov, Russia[/i]

Anna took a number \(N\), which is written in base 10 and has fewer than 9 digits, and duplicated it by writing another \(N\) to its left, creating a new number with twice as many digits. Bob computed the sum of all integers from 1 to \(N\). It turned out that Anna's new number is 7 times as large as the sum computed by Bob. Determine \(N\). [i]Proposed by Bachana Kutsia, Georgia [/i]

An integer $n>1$ , whose positive divisors are $1=d_1<d_2< \cdots <d_k=n$, is called $\textit{southern}$ if all the numbers $d_2-d_1, d_3- d_2 , \cdots, d_k-d_{k-1}$ are divisors of $n$. a) Find a positive integer that is $\textit{not southern}$ and has exactly $2022$ positive divisors that are $\textit{southern}$. b) Show that there are infinitely many positive integers that are $\textit{not southern}$ and have exactly $2022$ positive divisors that are $\textit{southern}$.

For a positive integer $n$, two payers $A$ and $B$ play the following game: Given a pile of $s$ stones, the players take turn alternatively with $A$ going first. On each turn the player is allowed to take either one stone, or a prime number of stones, or a positive multiple of $n$ stones. The winner is the one who takes the last stone. Assuming both $A$ and $B$ play perfectly, for how many values of $s$ the player $A$ cannot win?

Given is a rhombus $ABCD$ of side 1. On the sides $BC$ and $CD$ we are given the points $M$ and $N$ respectively, such that $MC+CN+MN=2$ and $2\angle MAN = \angle BAD$. Find the measures of the angles of the rhombus. [i]Cristinel Mortici[/i]

On a table, cards numbered $1, 2, \ldots , 200$ are laid out in a row in some order, and a line is drawn on the table between some two of them. It is allowed to swap two adjacent cards if the number on the left is greater than the number on the right. After a few such moves, the cards were arranged in ascending order. Prove we have swapped pairs of cards separated by the line no more than 1884 times.

Let $f$ be the cubic polynomial \[ f(x) = x^3 + bx^2 + cx + d, \] where $b$, $c$, and $d$ are real numbers. Let $x_1$, $x_2$, $\ldots\,$, $x_n$ be nonnegative numbers, and let $m$ be their average. Suppose that $m \ge - \dfrac{b}{2}\,$. Prove that \[ \sum_{i = 1}^n f(x_i) \ge n f(m). \]

In the figure of [url]http://www.artofproblemsolving.com/Forum/download/file.php?id=50643&mode=view[/url] $\odot O_1$ and $\odot O_2$ intersect at two points $A$, $B$. The extension of $O_1A$ meets $\odot O_2$ at $C$, and the extension of $O_2A$ meets $\odot O_1$ at $D$, and through $B$ draw $BE \parallel O_2A$ intersecting $\odot O_1$ again at $E$. If $DE \parallel O_1A$, prove that $DC \perp CO_2$.

Let $a,b,b',c,m,q$ be positive integers, where $m>1,q>1,|b-b'|\ge a$. It is given that there exist a positive integer $M$ such that $$S_q(an+b)\equiv S_q(an+b')+c\pmod{m}$$ holds for all integers $n\ge M$. Prove that the above equation is true for all positive integers $n$. (Here $S_q(x)$ is the sum of digits of $x$ taken in base $q$).

A right triangle $ABC$ is inscribed in the circular base of a cone. If two of the side lengths of $ABC$ are $3$ and $4$, and the distance from the vertex of the cone to any point on the circumference of the base is $3$, then the minimum possible volume of the cone can be written as $\frac{m\pi\sqrt{n}}{p}$, where $m$, $n$, and $p$ are positive integers, $m$ and $p$ are relatively prime, and $n$ is squarefree. Find $m + n + p$.

Given a triangle $ABC$. Let a circle $\omega$ touch the circumcircle of triangle $ABC$ at the point $A$, intersect the side $AB$ at a point $K$, and intersect the side $BC$. Let $CL$ be a tangent to the circle $\omega$, where the point $L$ lies on $\omega$ and the segment $KL$ intersects the side $BC$ at a point $T$. Show that the segment $BT$ has the same length as the tangent from the point $B$ to the circle $\omega$.

How many distinct four-digit numbers are divisible by $ 3$ and have $ 23$ as their last two digits? $ \textbf{(A)}\ 27 \qquad \textbf{(B)}\ 30 \qquad \textbf{(C)}\ 33 \qquad \textbf{(D)}\ 81 \qquad \textbf{(E)}\ 90$

The closed broken line $M$ has odd number of vertices -- $A_1,A_2,..., A_{2n+1}$ in sequence. Let us denote with $S(M)$ a new closed broken line with vertices $B_1,B_2,...,B_{2n+1}$ -- the midpoints of the first line links: $B_1$ is the midpoint of $[A_1A_2], ... , B_{2n+1}$ -- of $[A_{2n+1}A_1]$. Prove that in a sequence $M_1=S(M), ... , M_k = S(M_{k-1}), ...$ there is a broken line, homothetic to the $M$.

In a school, every pair of students are either friends or strangers. Friendship is mutual, and no student is friends with themselves. A sequence of (not necessarily distinct) students $A_1, A_2, \dots, A_{2023}$ is called [i]mischievous[/i] if $\bullet$ Total number of friends of $A_1$ is odd. $\bullet$ $A_i$ and $A_{i+1}$ are friends for $i=1, 2, \dots, 2022$. $\bullet$ Total number of friends of $A_{2023}$ is even. Prove that the total number of [i]mischievous[/i] sequences is even.

Let $S_n=1+2+\cdots+n$ for $n\in\mathbb{N}$, find the maximum value of $f(n)=\frac{S_n}{(n+32)S_{n+1}}$.

A sequence of real numbers $a_1,a_2,\ldots$ satisfies the relation $$a_n=-\max_{i+j=n}(a_i+a_j)\qquad\text{for all}\quad n>2017.$$ Prove that the sequence is bounded, i.e., there is a constant $M$ such that $|a_n|\leq M$ for all positive integers $n$.

There is a table in the shape of a $8\times 5$ rectangle with four holes on its corners. After shooting a ball from points $A, B$ and $C$ on the shown paths, will the ball fall into any of the holes after 6 reflections? (The ball reflects with the same angle after contacting the table edges.) [img]http://s5.picofile.com/file/8372960750/E01.png[/img] [i]Proposed by Hirad Alipanah[/i]

Let $n > 1$ be a positive integer. A 2-dimensional grid, infinite in all directions, is given. Each 1 by 1 square in a given $n$ by $n$ square has a counter on it. A [i]move[/i] consists of taking $n$ adjacent counters in a row or column and sliding them each by one space along that row or column. A [i]returning sequence[/i] is a finite sequence of moves such that all counters again fill the original $n$ by $n$ square at the end of the sequence. [list] [*] Assume that all counters are distinguishable except two, which are indistinguishable from each other. Prove that any distinguishable arrangement of counters in the $n$ by $n$ square can be reached by a returning sequence. [*] Assume all counters are distinguishable. Prove that there is no returning sequence that switches two counters and returns the rest to their original positions.[/list] [i]Mitchell Lee and Benjamin Gunby.[/i]

About the triangle $ABC$ it is known that $AM$ is its median, and $\angle AMC = \angle BAC$. On the ray $AM$ lies the point $K$ such that $\angle ACK = \angle BAC$. Prove that the centers of the circumcircles of the triangles $ABC, ABM$ and $KCM$ lie on the same line.

Let $N$ be the number of ordered triples $(a,b,c) \in \{1, \ldots, 2016\}^{3}$ such that $a^{2} + b^{2} + c^{2} \equiv 0 \pmod{2017}$. What are the last three digits of $N$?